/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/openssl/s3_clnt.blast.01.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 18:12:23,163 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 18:12:23,166 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 18:12:23,205 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 18:12:23,206 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 18:12:23,207 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 18:12:23,210 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 18:12:23,214 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 18:12:23,215 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 18:12:23,216 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 18:12:23,216 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 18:12:23,217 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 18:12:23,217 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 18:12:23,218 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 18:12:23,219 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 18:12:23,220 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 18:12:23,221 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 18:12:23,221 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 18:12:23,222 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 18:12:23,224 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 18:12:23,225 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 18:12:23,225 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 18:12:23,226 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 18:12:23,227 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 18:12:23,228 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 18:12:23,234 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 18:12:23,235 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 18:12:23,235 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 18:12:23,236 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 18:12:23,236 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 18:12:23,237 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 18:12:23,237 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 18:12:23,238 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 18:12:23,238 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 18:12:23,239 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 18:12:23,239 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 18:12:23,240 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 18:12:23,240 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 18:12:23,240 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 18:12:23,241 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 18:12:23,241 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 18:12:23,247 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 18:12:23,248 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 18:12:23,255 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 18:12:23,255 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 18:12:23,256 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 18:12:23,257 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 18:12:23,257 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 18:12:23,257 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 18:12:23,257 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 18:12:23,257 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 18:12:23,257 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 18:12:23,257 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 18:12:23,257 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 18:12:23,258 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 18:12:23,258 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 18:12:23,258 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 18:12:23,258 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 18:12:23,258 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 18:12:23,258 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 18:12:23,258 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 18:12:23,258 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 18:12:23,258 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 18:12:23,259 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 18:12:23,259 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 18:12:23,259 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-15 18:12:23,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 18:12:23,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 18:12:23,536 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 18:12:23,537 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 18:12:23,538 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 18:12:23,540 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_clnt.blast.01.i.cil-2.c [2022-04-15 18:12:23,600 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecfbcebba/8b645e0cb9ee46f795d43e2ff717488f/FLAGafd3fd063 [2022-04-15 18:12:24,161 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 18:12:24,162 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.01.i.cil-2.c [2022-04-15 18:12:24,179 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecfbcebba/8b645e0cb9ee46f795d43e2ff717488f/FLAGafd3fd063 [2022-04-15 18:12:24,578 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecfbcebba/8b645e0cb9ee46f795d43e2ff717488f [2022-04-15 18:12:24,580 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 18:12:24,582 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 18:12:24,583 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 18:12:24,583 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 18:12:24,591 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 18:12:24,592 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:12:24" (1/1) ... [2022-04-15 18:12:24,593 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@791ea691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:24, skipping insertion in model container [2022-04-15 18:12:24,593 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:12:24" (1/1) ... [2022-04-15 18:12:24,600 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 18:12:24,667 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 18:12:25,067 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.01.i.cil-2.c[65520,65533] [2022-04-15 18:12:25,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 18:12:25,113 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 18:12:25,246 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.01.i.cil-2.c[65520,65533] [2022-04-15 18:12:25,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 18:12:25,269 INFO L208 MainTranslator]: Completed translation [2022-04-15 18:12:25,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:25 WrapperNode [2022-04-15 18:12:25,269 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 18:12:25,270 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 18:12:25,270 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 18:12:25,270 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 18:12:25,279 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:25" (1/1) ... [2022-04-15 18:12:25,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:25" (1/1) ... [2022-04-15 18:12:25,312 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:25" (1/1) ... [2022-04-15 18:12:25,312 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:25" (1/1) ... [2022-04-15 18:12:25,380 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:25" (1/1) ... [2022-04-15 18:12:25,385 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:25" (1/1) ... [2022-04-15 18:12:25,401 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:25" (1/1) ... [2022-04-15 18:12:25,407 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 18:12:25,407 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 18:12:25,408 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 18:12:25,408 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 18:12:25,408 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:25" (1/1) ... [2022-04-15 18:12:25,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 18:12:25,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 18:12:25,440 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-15 18:12:25,451 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-15 18:12:25,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 18:12:25,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 18:12:25,485 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 18:12:25,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2022-04-15 18:12:25,486 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2022-04-15 18:12:25,486 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 18:12:25,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2022-04-15 18:12:25,486 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-15 18:12:25,486 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-15 18:12:25,486 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-15 18:12:25,486 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 18:12:25,487 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 18:12:25,487 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 18:12:25,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 18:12:25,488 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-15 18:12:25,489 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-15 18:12:25,489 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 18:12:25,489 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-15 18:12:25,489 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-15 18:12:25,489 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-15 18:12:25,489 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2022-04-15 18:12:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-15 18:12:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2022-04-15 18:12:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2022-04-15 18:12:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-15 18:12:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-15 18:12:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 18:12:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-15 18:12:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 18:12:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-15 18:12:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 18:12:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-15 18:12:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-15 18:12:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 18:12:25,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 18:12:25,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 18:12:25,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-15 18:12:25,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-15 18:12:25,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-15 18:12:25,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-15 18:12:25,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 18:12:25,632 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 18:12:25,633 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 18:12:27,869 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:12:28,469 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-04-15 18:12:28,470 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-04-15 18:12:28,491 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 18:12:28,498 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 18:12:28,499 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 18:12:28,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:12:28 BoogieIcfgContainer [2022-04-15 18:12:28,504 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 18:12:28,507 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 18:12:28,507 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 18:12:28,510 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 18:12:28,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:12:24" (1/3) ... [2022-04-15 18:12:28,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35a5ee57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:12:28, skipping insertion in model container [2022-04-15 18:12:28,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:25" (2/3) ... [2022-04-15 18:12:28,512 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35a5ee57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:12:28, skipping insertion in model container [2022-04-15 18:12:28,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:12:28" (3/3) ... [2022-04-15 18:12:28,518 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.01.i.cil-2.c [2022-04-15 18:12:28,522 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 18:12:28,522 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 18:12:28,568 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 18:12:28,585 INFO L340 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 [2022-04-15 18:12:28,585 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 18:12:28,618 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 132 states have (on average 1.6742424242424243) internal successors, (221), 133 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 18:12:28,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 18:12:28,628 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:12:28,629 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:12:28,629 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:12:28,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:12:28,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1896540148, now seen corresponding path program 1 times [2022-04-15 18:12:28,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:12:28,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [792392401] [2022-04-15 18:12:28,652 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:12:28,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1896540148, now seen corresponding path program 2 times [2022-04-15 18:12:28,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:12:28,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632877673] [2022-04-15 18:12:28,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:12:28,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:12:29,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:12:29,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:12:29,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:12:29,349 INFO L290 TraceCheckUtils]: 0: Hoare triple {150#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {143#true} is VALID [2022-04-15 18:12:29,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {143#true} assume true; {143#true} is VALID [2022-04-15 18:12:29,349 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {143#true} {143#true} #591#return; {143#true} is VALID [2022-04-15 18:12:29,352 INFO L272 TraceCheckUtils]: 0: Hoare triple {143#true} call ULTIMATE.init(); {150#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:12:29,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {150#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {143#true} is VALID [2022-04-15 18:12:29,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {143#true} assume true; {143#true} is VALID [2022-04-15 18:12:29,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {143#true} {143#true} #591#return; {143#true} is VALID [2022-04-15 18:12:29,353 INFO L272 TraceCheckUtils]: 4: Hoare triple {143#true} call #t~ret159 := main(); {143#true} is VALID [2022-04-15 18:12:29,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {143#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {143#true} is VALID [2022-04-15 18:12:29,358 INFO L272 TraceCheckUtils]: 6: Hoare triple {143#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {143#true} is VALID [2022-04-15 18:12:29,360 INFO L290 TraceCheckUtils]: 7: Hoare triple {143#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:12:29,362 INFO L290 TraceCheckUtils]: 8: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:12:29,364 INFO L290 TraceCheckUtils]: 9: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:12:29,365 INFO L290 TraceCheckUtils]: 10: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:12:29,365 INFO L290 TraceCheckUtils]: 11: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !false; {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:12:29,366 INFO L290 TraceCheckUtils]: 12: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:12:29,367 INFO L290 TraceCheckUtils]: 13: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:12:29,367 INFO L290 TraceCheckUtils]: 14: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:12:29,368 INFO L290 TraceCheckUtils]: 15: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:12:29,369 INFO L290 TraceCheckUtils]: 16: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:12:29,369 INFO L290 TraceCheckUtils]: 17: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:12:29,370 INFO L290 TraceCheckUtils]: 18: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:12:29,370 INFO L290 TraceCheckUtils]: 19: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:12:29,371 INFO L290 TraceCheckUtils]: 20: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:12:29,372 INFO L290 TraceCheckUtils]: 21: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:12:29,373 INFO L290 TraceCheckUtils]: 22: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:12:29,373 INFO L290 TraceCheckUtils]: 23: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:12:29,374 INFO L290 TraceCheckUtils]: 24: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:12:29,375 INFO L290 TraceCheckUtils]: 25: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {149#(not (= |ssl3_connect_#t~mem56| 4432))} is VALID [2022-04-15 18:12:29,376 INFO L290 TraceCheckUtils]: 26: Hoare triple {149#(not (= |ssl3_connect_#t~mem56| 4432))} assume 4432 == #t~mem56;havoc #t~mem56; {144#false} is VALID [2022-04-15 18:12:29,377 INFO L290 TraceCheckUtils]: 27: Hoare triple {144#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {144#false} is VALID [2022-04-15 18:12:29,377 INFO L290 TraceCheckUtils]: 28: Hoare triple {144#false} assume 5 == ~blastFlag~0; {144#false} is VALID [2022-04-15 18:12:29,377 INFO L290 TraceCheckUtils]: 29: Hoare triple {144#false} assume !false; {144#false} is VALID [2022-04-15 18:12:29,379 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-15 18:12:29,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:12:29,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632877673] [2022-04-15 18:12:29,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632877673] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:12:29,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:12:29,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:12:29,385 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:12:29,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [792392401] [2022-04-15 18:12:29,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [792392401] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:12:29,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:12:29,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:12:29,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582409650] [2022-04-15 18:12:29,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:12:29,393 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 18:12:29,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:12:29,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:29,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:12:29,443 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:12:29,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:12:29,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:12:29,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:12:29,476 INFO L87 Difference]: Start difference. First operand has 140 states, 132 states have (on average 1.6742424242424243) internal successors, (221), 133 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:31,530 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-15 18:12:33,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:12:33,363 INFO L93 Difference]: Finished difference Result 375 states and 621 transitions. [2022-04-15 18:12:33,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:12:33,366 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 18:12:33,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:12:33,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:33,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 621 transitions. [2022-04-15 18:12:33,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:33,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 621 transitions. [2022-04-15 18:12:33,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 621 transitions. [2022-04-15 18:12:34,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 621 edges. 621 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:12:34,093 INFO L225 Difference]: With dead ends: 375 [2022-04-15 18:12:34,093 INFO L226 Difference]: Without dead ends: 214 [2022-04-15 18:12:34,097 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:12:34,116 INFO L913 BasicCegarLoop]: 139 mSDtfsCounter, 141 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 47 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-15 18:12:34,117 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 405 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 457 Invalid, 1 Unknown, 0 Unchecked, 2.7s Time] [2022-04-15 18:12:34,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-04-15 18:12:34,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 144. [2022-04-15 18:12:34,163 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:12:34,165 INFO L82 GeneralOperation]: Start isEquivalent. First operand 214 states. Second operand has 144 states, 139 states have (on average 1.5467625899280575) internal successors, (215), 139 states have internal predecessors, (215), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:34,166 INFO L74 IsIncluded]: Start isIncluded. First operand 214 states. Second operand has 144 states, 139 states have (on average 1.5467625899280575) internal successors, (215), 139 states have internal predecessors, (215), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:34,167 INFO L87 Difference]: Start difference. First operand 214 states. Second operand has 144 states, 139 states have (on average 1.5467625899280575) internal successors, (215), 139 states have internal predecessors, (215), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:34,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:12:34,177 INFO L93 Difference]: Finished difference Result 214 states and 319 transitions. [2022-04-15 18:12:34,177 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 319 transitions. [2022-04-15 18:12:34,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:12:34,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:12:34,180 INFO L74 IsIncluded]: Start isIncluded. First operand has 144 states, 139 states have (on average 1.5467625899280575) internal successors, (215), 139 states have internal predecessors, (215), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 214 states. [2022-04-15 18:12:34,181 INFO L87 Difference]: Start difference. First operand has 144 states, 139 states have (on average 1.5467625899280575) internal successors, (215), 139 states have internal predecessors, (215), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 214 states. [2022-04-15 18:12:34,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:12:34,191 INFO L93 Difference]: Finished difference Result 214 states and 319 transitions. [2022-04-15 18:12:34,191 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 319 transitions. [2022-04-15 18:12:34,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:12:34,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:12:34,192 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:12:34,192 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:12:34,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 139 states have (on average 1.5467625899280575) internal successors, (215), 139 states have internal predecessors, (215), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:34,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 219 transitions. [2022-04-15 18:12:34,200 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 219 transitions. Word has length 30 [2022-04-15 18:12:34,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:12:34,200 INFO L478 AbstractCegarLoop]: Abstraction has 144 states and 219 transitions. [2022-04-15 18:12:34,200 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:34,201 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 144 states and 219 transitions. [2022-04-15 18:12:34,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 219 edges. 219 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:12:34,490 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 219 transitions. [2022-04-15 18:12:34,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 18:12:34,491 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:12:34,491 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:12:34,508 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 18:12:34,508 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:12:34,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:12:34,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1332379691, now seen corresponding path program 1 times [2022-04-15 18:12:34,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:12:34,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1946666312] [2022-04-15 18:12:34,518 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:12:34,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1332379691, now seen corresponding path program 2 times [2022-04-15 18:12:34,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:12:34,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585637486] [2022-04-15 18:12:34,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:12:34,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:12:34,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:12:34,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:12:34,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:12:34,892 INFO L290 TraceCheckUtils]: 0: Hoare triple {1628#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {1621#true} is VALID [2022-04-15 18:12:34,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {1621#true} assume true; {1621#true} is VALID [2022-04-15 18:12:34,893 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1621#true} {1621#true} #591#return; {1621#true} is VALID [2022-04-15 18:12:34,893 INFO L272 TraceCheckUtils]: 0: Hoare triple {1621#true} call ULTIMATE.init(); {1628#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:12:34,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {1628#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {1621#true} is VALID [2022-04-15 18:12:34,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {1621#true} assume true; {1621#true} is VALID [2022-04-15 18:12:34,895 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1621#true} {1621#true} #591#return; {1621#true} is VALID [2022-04-15 18:12:34,895 INFO L272 TraceCheckUtils]: 4: Hoare triple {1621#true} call #t~ret159 := main(); {1621#true} is VALID [2022-04-15 18:12:34,895 INFO L290 TraceCheckUtils]: 5: Hoare triple {1621#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {1621#true} is VALID [2022-04-15 18:12:34,896 INFO L272 TraceCheckUtils]: 6: Hoare triple {1621#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {1621#true} is VALID [2022-04-15 18:12:34,897 INFO L290 TraceCheckUtils]: 7: Hoare triple {1621#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {1626#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:12:34,898 INFO L290 TraceCheckUtils]: 8: Hoare triple {1626#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {1626#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:12:34,899 INFO L290 TraceCheckUtils]: 9: Hoare triple {1626#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {1626#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:12:34,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {1626#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {1626#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:12:34,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {1626#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !false; {1626#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-15 18:12:34,901 INFO L290 TraceCheckUtils]: 12: Hoare triple {1626#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {1627#(= 12292 |ssl3_connect_#t~mem43|)} is VALID [2022-04-15 18:12:34,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {1627#(= 12292 |ssl3_connect_#t~mem43|)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {1622#false} is VALID [2022-04-15 18:12:34,904 INFO L290 TraceCheckUtils]: 14: Hoare triple {1622#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {1622#false} is VALID [2022-04-15 18:12:34,905 INFO L290 TraceCheckUtils]: 15: Hoare triple {1622#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {1622#false} is VALID [2022-04-15 18:12:34,905 INFO L290 TraceCheckUtils]: 16: Hoare triple {1622#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {1622#false} is VALID [2022-04-15 18:12:34,905 INFO L290 TraceCheckUtils]: 17: Hoare triple {1622#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {1622#false} is VALID [2022-04-15 18:12:34,905 INFO L290 TraceCheckUtils]: 18: Hoare triple {1622#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {1622#false} is VALID [2022-04-15 18:12:34,905 INFO L290 TraceCheckUtils]: 19: Hoare triple {1622#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {1622#false} is VALID [2022-04-15 18:12:34,905 INFO L290 TraceCheckUtils]: 20: Hoare triple {1622#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {1622#false} is VALID [2022-04-15 18:12:34,905 INFO L290 TraceCheckUtils]: 21: Hoare triple {1622#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {1622#false} is VALID [2022-04-15 18:12:34,906 INFO L290 TraceCheckUtils]: 22: Hoare triple {1622#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {1622#false} is VALID [2022-04-15 18:12:34,906 INFO L290 TraceCheckUtils]: 23: Hoare triple {1622#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {1622#false} is VALID [2022-04-15 18:12:34,906 INFO L290 TraceCheckUtils]: 24: Hoare triple {1622#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {1622#false} is VALID [2022-04-15 18:12:34,906 INFO L290 TraceCheckUtils]: 25: Hoare triple {1622#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {1622#false} is VALID [2022-04-15 18:12:34,906 INFO L290 TraceCheckUtils]: 26: Hoare triple {1622#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {1622#false} is VALID [2022-04-15 18:12:34,906 INFO L290 TraceCheckUtils]: 27: Hoare triple {1622#false} assume 4433 == #t~mem57;havoc #t~mem57; {1622#false} is VALID [2022-04-15 18:12:34,906 INFO L290 TraceCheckUtils]: 28: Hoare triple {1622#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {1622#false} is VALID [2022-04-15 18:12:34,907 INFO L290 TraceCheckUtils]: 29: Hoare triple {1622#false} assume 5 == ~blastFlag~0; {1622#false} is VALID [2022-04-15 18:12:34,907 INFO L290 TraceCheckUtils]: 30: Hoare triple {1622#false} assume !false; {1622#false} is VALID [2022-04-15 18:12:34,907 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-15 18:12:34,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:12:34,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585637486] [2022-04-15 18:12:34,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585637486] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:12:34,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:12:34,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:12:34,908 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:12:34,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1946666312] [2022-04-15 18:12:34,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1946666312] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:12:34,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:12:34,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:12:34,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519321481] [2022-04-15 18:12:34,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:12:34,909 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 18:12:34,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:12:34,910 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:34,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:12:34,962 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:12:34,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:12:34,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:12:34,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:12:34,963 INFO L87 Difference]: Start difference. First operand 144 states and 219 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:37,006 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:12:38,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:12:38,026 INFO L93 Difference]: Finished difference Result 279 states and 426 transitions. [2022-04-15 18:12:38,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:12:38,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 18:12:38,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:12:38,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:38,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 342 transitions. [2022-04-15 18:12:38,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:38,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 342 transitions. [2022-04-15 18:12:38,047 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 342 transitions. [2022-04-15 18:12:38,340 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 342 edges. 342 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:12:38,343 INFO L225 Difference]: With dead ends: 279 [2022-04-15 18:12:38,343 INFO L226 Difference]: Without dead ends: 148 [2022-04-15 18:12:38,344 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:12:38,345 INFO L913 BasicCegarLoop]: 167 mSDtfsCounter, 7 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 18:12:38,346 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 423 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 268 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 18:12:38,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-04-15 18:12:38,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2022-04-15 18:12:38,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:12:38,358 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand has 147 states, 142 states have (on average 1.5352112676056338) internal successors, (218), 142 states have internal predecessors, (218), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:38,358 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand has 147 states, 142 states have (on average 1.5352112676056338) internal successors, (218), 142 states have internal predecessors, (218), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:38,359 INFO L87 Difference]: Start difference. First operand 148 states. Second operand has 147 states, 142 states have (on average 1.5352112676056338) internal successors, (218), 142 states have internal predecessors, (218), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:38,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:12:38,364 INFO L93 Difference]: Finished difference Result 148 states and 223 transitions. [2022-04-15 18:12:38,364 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 223 transitions. [2022-04-15 18:12:38,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:12:38,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:12:38,365 INFO L74 IsIncluded]: Start isIncluded. First operand has 147 states, 142 states have (on average 1.5352112676056338) internal successors, (218), 142 states have internal predecessors, (218), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 148 states. [2022-04-15 18:12:38,366 INFO L87 Difference]: Start difference. First operand has 147 states, 142 states have (on average 1.5352112676056338) internal successors, (218), 142 states have internal predecessors, (218), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 148 states. [2022-04-15 18:12:38,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:12:38,371 INFO L93 Difference]: Finished difference Result 148 states and 223 transitions. [2022-04-15 18:12:38,371 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 223 transitions. [2022-04-15 18:12:38,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:12:38,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:12:38,372 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:12:38,372 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:12:38,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 142 states have (on average 1.5352112676056338) internal successors, (218), 142 states have internal predecessors, (218), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:38,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 222 transitions. [2022-04-15 18:12:38,378 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 222 transitions. Word has length 31 [2022-04-15 18:12:38,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:12:38,378 INFO L478 AbstractCegarLoop]: Abstraction has 147 states and 222 transitions. [2022-04-15 18:12:38,378 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:38,379 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 147 states and 222 transitions. [2022-04-15 18:12:38,578 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-15 18:12:38,578 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 222 transitions. [2022-04-15 18:12:38,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-15 18:12:38,579 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:12:38,579 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:12:38,579 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 18:12:38,580 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:12:38,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:12:38,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1031742358, now seen corresponding path program 1 times [2022-04-15 18:12:38,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:12:38,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [320619233] [2022-04-15 18:12:38,581 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:12:38,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1031742358, now seen corresponding path program 2 times [2022-04-15 18:12:38,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:12:38,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181553568] [2022-04-15 18:12:38,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:12:38,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:12:38,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:12:38,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:12:38,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:12:38,853 INFO L290 TraceCheckUtils]: 0: Hoare triple {2787#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {2781#true} is VALID [2022-04-15 18:12:38,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {2781#true} assume true; {2781#true} is VALID [2022-04-15 18:12:38,854 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2781#true} {2781#true} #591#return; {2781#true} is VALID [2022-04-15 18:12:38,855 INFO L272 TraceCheckUtils]: 0: Hoare triple {2781#true} call ULTIMATE.init(); {2787#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:12:38,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {2787#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {2781#true} is VALID [2022-04-15 18:12:38,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {2781#true} assume true; {2781#true} is VALID [2022-04-15 18:12:38,856 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2781#true} {2781#true} #591#return; {2781#true} is VALID [2022-04-15 18:12:38,856 INFO L272 TraceCheckUtils]: 4: Hoare triple {2781#true} call #t~ret159 := main(); {2781#true} is VALID [2022-04-15 18:12:38,856 INFO L290 TraceCheckUtils]: 5: Hoare triple {2781#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {2781#true} is VALID [2022-04-15 18:12:38,856 INFO L272 TraceCheckUtils]: 6: Hoare triple {2781#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {2781#true} is VALID [2022-04-15 18:12:38,857 INFO L290 TraceCheckUtils]: 7: Hoare triple {2781#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:12:38,857 INFO L290 TraceCheckUtils]: 8: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:12:38,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:12:38,858 INFO L290 TraceCheckUtils]: 10: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:12:38,858 INFO L290 TraceCheckUtils]: 11: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !false; {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:12:38,859 INFO L290 TraceCheckUtils]: 12: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:12:38,859 INFO L290 TraceCheckUtils]: 13: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume 12292 == #t~mem43;havoc #t~mem43; {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:12:38,860 INFO L290 TraceCheckUtils]: 14: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:12:38,860 INFO L290 TraceCheckUtils]: 15: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} call write~int(0, ~s.base, 56 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:12:38,860 INFO L290 TraceCheckUtils]: 16: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:12:38,861 INFO L290 TraceCheckUtils]: 17: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:12:38,861 INFO L290 TraceCheckUtils]: 18: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:12:38,862 INFO L290 TraceCheckUtils]: 19: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:12:38,862 INFO L290 TraceCheckUtils]: 20: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:12:38,862 INFO L290 TraceCheckUtils]: 21: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:12:38,863 INFO L290 TraceCheckUtils]: 22: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:12:38,863 INFO L290 TraceCheckUtils]: 23: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:12:38,864 INFO L290 TraceCheckUtils]: 24: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:12:38,864 INFO L290 TraceCheckUtils]: 25: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} ~skip~0 := 0; {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:12:38,865 INFO L290 TraceCheckUtils]: 26: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !false; {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:12:38,865 INFO L290 TraceCheckUtils]: 27: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:12:38,866 INFO L290 TraceCheckUtils]: 28: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:12:38,866 INFO L290 TraceCheckUtils]: 29: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:12:38,867 INFO L290 TraceCheckUtils]: 30: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:12:38,867 INFO L290 TraceCheckUtils]: 31: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:12:38,867 INFO L290 TraceCheckUtils]: 32: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:12:38,870 INFO L290 TraceCheckUtils]: 33: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:12:38,870 INFO L290 TraceCheckUtils]: 34: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:12:38,871 INFO L290 TraceCheckUtils]: 35: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:12:38,871 INFO L290 TraceCheckUtils]: 36: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:12:38,872 INFO L290 TraceCheckUtils]: 37: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:12:38,873 INFO L290 TraceCheckUtils]: 38: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:12:38,874 INFO L290 TraceCheckUtils]: 39: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:12:38,874 INFO L290 TraceCheckUtils]: 40: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:12:38,876 INFO L290 TraceCheckUtils]: 41: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:12:38,876 INFO L290 TraceCheckUtils]: 42: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume 4433 == #t~mem57;havoc #t~mem57; {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:12:38,884 INFO L290 TraceCheckUtils]: 43: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 18:12:38,885 INFO L290 TraceCheckUtils]: 44: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume 5 == ~blastFlag~0; {2782#false} is VALID [2022-04-15 18:12:38,885 INFO L290 TraceCheckUtils]: 45: Hoare triple {2782#false} assume !false; {2782#false} is VALID [2022-04-15 18:12:38,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 18:12:38,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:12:38,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181553568] [2022-04-15 18:12:38,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181553568] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:12:38,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:12:38,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:12:38,887 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:12:38,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [320619233] [2022-04-15 18:12:38,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [320619233] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:12:38,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:12:38,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:12:38,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876197997] [2022-04-15 18:12:38,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:12:38,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-15 18:12:38,888 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:12:38,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:38,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:12:38,939 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:12:38,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:12:38,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:12:38,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:12:38,941 INFO L87 Difference]: Start difference. First operand 147 states and 222 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:40,972 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-15 18:12:41,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:12:41,713 INFO L93 Difference]: Finished difference Result 405 states and 622 transitions. [2022-04-15 18:12:41,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:12:41,713 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-15 18:12:41,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:12:41,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:41,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 493 transitions. [2022-04-15 18:12:41,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:41,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 493 transitions. [2022-04-15 18:12:41,723 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 493 transitions. [2022-04-15 18:12:42,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 493 edges. 493 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:12:42,074 INFO L225 Difference]: With dead ends: 405 [2022-04-15 18:12:42,074 INFO L226 Difference]: Without dead ends: 274 [2022-04-15 18:12:42,075 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:12:42,075 INFO L913 BasicCegarLoop]: 168 mSDtfsCounter, 124 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 18:12:42,076 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 323 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 192 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 18:12:42,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-04-15 18:12:42,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2022-04-15 18:12:42,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:12:42,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 274 states. Second operand has 274 states, 269 states have (on average 1.5241635687732342) internal successors, (410), 269 states have internal predecessors, (410), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:42,096 INFO L74 IsIncluded]: Start isIncluded. First operand 274 states. Second operand has 274 states, 269 states have (on average 1.5241635687732342) internal successors, (410), 269 states have internal predecessors, (410), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:42,097 INFO L87 Difference]: Start difference. First operand 274 states. Second operand has 274 states, 269 states have (on average 1.5241635687732342) internal successors, (410), 269 states have internal predecessors, (410), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:42,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:12:42,106 INFO L93 Difference]: Finished difference Result 274 states and 414 transitions. [2022-04-15 18:12:42,106 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 414 transitions. [2022-04-15 18:12:42,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:12:42,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:12:42,108 INFO L74 IsIncluded]: Start isIncluded. First operand has 274 states, 269 states have (on average 1.5241635687732342) internal successors, (410), 269 states have internal predecessors, (410), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 274 states. [2022-04-15 18:12:42,108 INFO L87 Difference]: Start difference. First operand has 274 states, 269 states have (on average 1.5241635687732342) internal successors, (410), 269 states have internal predecessors, (410), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 274 states. [2022-04-15 18:12:42,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:12:42,117 INFO L93 Difference]: Finished difference Result 274 states and 414 transitions. [2022-04-15 18:12:42,117 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 414 transitions. [2022-04-15 18:12:42,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:12:42,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:12:42,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:12:42,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:12:42,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 269 states have (on average 1.5241635687732342) internal successors, (410), 269 states have internal predecessors, (410), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:42,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 414 transitions. [2022-04-15 18:12:42,128 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 414 transitions. Word has length 46 [2022-04-15 18:12:42,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:12:42,129 INFO L478 AbstractCegarLoop]: Abstraction has 274 states and 414 transitions. [2022-04-15 18:12:42,129 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:42,129 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 274 states and 414 transitions. [2022-04-15 18:12:42,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 414 edges. 414 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:12:42,434 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 414 transitions. [2022-04-15 18:12:42,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-15 18:12:42,435 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:12:42,435 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:12:42,435 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 18:12:42,436 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:12:42,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:12:42,436 INFO L85 PathProgramCache]: Analyzing trace with hash -815325844, now seen corresponding path program 1 times [2022-04-15 18:12:42,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:12:42,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [823525278] [2022-04-15 18:12:42,437 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:12:42,437 INFO L85 PathProgramCache]: Analyzing trace with hash -815325844, now seen corresponding path program 2 times [2022-04-15 18:12:42,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:12:42,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088844285] [2022-04-15 18:12:42,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:12:42,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:12:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:12:42,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:12:42,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:12:42,799 INFO L290 TraceCheckUtils]: 0: Hoare triple {4703#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {4696#true} is VALID [2022-04-15 18:12:42,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {4696#true} assume true; {4696#true} is VALID [2022-04-15 18:12:42,800 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4696#true} {4696#true} #591#return; {4696#true} is VALID [2022-04-15 18:12:42,801 INFO L272 TraceCheckUtils]: 0: Hoare triple {4696#true} call ULTIMATE.init(); {4703#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:12:42,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {4703#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {4696#true} is VALID [2022-04-15 18:12:42,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {4696#true} assume true; {4696#true} is VALID [2022-04-15 18:12:42,801 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4696#true} {4696#true} #591#return; {4696#true} is VALID [2022-04-15 18:12:42,801 INFO L272 TraceCheckUtils]: 4: Hoare triple {4696#true} call #t~ret159 := main(); {4696#true} is VALID [2022-04-15 18:12:42,801 INFO L290 TraceCheckUtils]: 5: Hoare triple {4696#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {4696#true} is VALID [2022-04-15 18:12:42,802 INFO L272 TraceCheckUtils]: 6: Hoare triple {4696#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {4696#true} is VALID [2022-04-15 18:12:42,802 INFO L290 TraceCheckUtils]: 7: Hoare triple {4696#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {4696#true} is VALID [2022-04-15 18:12:42,802 INFO L290 TraceCheckUtils]: 8: Hoare triple {4696#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {4696#true} is VALID [2022-04-15 18:12:42,802 INFO L290 TraceCheckUtils]: 9: Hoare triple {4696#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {4696#true} is VALID [2022-04-15 18:12:42,802 INFO L290 TraceCheckUtils]: 10: Hoare triple {4696#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {4696#true} is VALID [2022-04-15 18:12:42,802 INFO L290 TraceCheckUtils]: 11: Hoare triple {4696#true} assume !false; {4696#true} is VALID [2022-04-15 18:12:42,802 INFO L290 TraceCheckUtils]: 12: Hoare triple {4696#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {4696#true} is VALID [2022-04-15 18:12:42,803 INFO L290 TraceCheckUtils]: 13: Hoare triple {4696#true} assume 12292 == #t~mem43;havoc #t~mem43; {4696#true} is VALID [2022-04-15 18:12:42,803 INFO L290 TraceCheckUtils]: 14: Hoare triple {4696#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {4696#true} is VALID [2022-04-15 18:12:42,803 INFO L290 TraceCheckUtils]: 15: Hoare triple {4696#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {4696#true} is VALID [2022-04-15 18:12:42,803 INFO L290 TraceCheckUtils]: 16: Hoare triple {4696#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {4696#true} is VALID [2022-04-15 18:12:42,803 INFO L290 TraceCheckUtils]: 17: Hoare triple {4696#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {4696#true} is VALID [2022-04-15 18:12:42,803 INFO L290 TraceCheckUtils]: 18: Hoare triple {4696#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {4696#true} is VALID [2022-04-15 18:12:42,803 INFO L290 TraceCheckUtils]: 19: Hoare triple {4696#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {4696#true} is VALID [2022-04-15 18:12:42,804 INFO L290 TraceCheckUtils]: 20: Hoare triple {4696#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {4696#true} is VALID [2022-04-15 18:12:42,804 INFO L290 TraceCheckUtils]: 21: Hoare triple {4696#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {4696#true} is VALID [2022-04-15 18:12:42,804 INFO L290 TraceCheckUtils]: 22: Hoare triple {4696#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {4696#true} is VALID [2022-04-15 18:12:42,804 INFO L290 TraceCheckUtils]: 23: Hoare triple {4696#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {4696#true} is VALID [2022-04-15 18:12:42,804 INFO L290 TraceCheckUtils]: 24: Hoare triple {4696#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {4696#true} is VALID [2022-04-15 18:12:42,804 INFO L290 TraceCheckUtils]: 25: Hoare triple {4696#true} ~skip~0 := 0; {4696#true} is VALID [2022-04-15 18:12:42,804 INFO L290 TraceCheckUtils]: 26: Hoare triple {4696#true} assume !false; {4696#true} is VALID [2022-04-15 18:12:42,805 INFO L290 TraceCheckUtils]: 27: Hoare triple {4696#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {4696#true} is VALID [2022-04-15 18:12:42,805 INFO L290 TraceCheckUtils]: 28: Hoare triple {4696#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {4696#true} is VALID [2022-04-15 18:12:42,805 INFO L290 TraceCheckUtils]: 29: Hoare triple {4696#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {4696#true} is VALID [2022-04-15 18:12:42,805 INFO L290 TraceCheckUtils]: 30: Hoare triple {4696#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {4696#true} is VALID [2022-04-15 18:12:42,805 INFO L290 TraceCheckUtils]: 31: Hoare triple {4696#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {4696#true} is VALID [2022-04-15 18:12:42,805 INFO L290 TraceCheckUtils]: 32: Hoare triple {4696#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {4696#true} is VALID [2022-04-15 18:12:42,805 INFO L290 TraceCheckUtils]: 33: Hoare triple {4696#true} assume 4368 == #t~mem48;havoc #t~mem48; {4696#true} is VALID [2022-04-15 18:12:42,806 INFO L290 TraceCheckUtils]: 34: Hoare triple {4696#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {4696#true} is VALID [2022-04-15 18:12:42,806 INFO L290 TraceCheckUtils]: 35: Hoare triple {4696#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {4696#true} is VALID [2022-04-15 18:12:42,807 INFO L290 TraceCheckUtils]: 36: Hoare triple {4696#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:12:42,808 INFO L290 TraceCheckUtils]: 37: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:12:42,808 INFO L290 TraceCheckUtils]: 38: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:12:42,809 INFO L290 TraceCheckUtils]: 39: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:12:42,809 INFO L290 TraceCheckUtils]: 40: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} ~skip~0 := 0; {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:12:42,809 INFO L290 TraceCheckUtils]: 41: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !false; {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:12:42,810 INFO L290 TraceCheckUtils]: 42: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:12:42,810 INFO L290 TraceCheckUtils]: 43: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:12:42,811 INFO L290 TraceCheckUtils]: 44: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:12:42,811 INFO L290 TraceCheckUtils]: 45: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:12:42,811 INFO L290 TraceCheckUtils]: 46: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:12:42,812 INFO L290 TraceCheckUtils]: 47: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:12:42,813 INFO L290 TraceCheckUtils]: 48: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:12:42,813 INFO L290 TraceCheckUtils]: 49: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:12:42,813 INFO L290 TraceCheckUtils]: 50: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:12:42,814 INFO L290 TraceCheckUtils]: 51: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:12:42,815 INFO L290 TraceCheckUtils]: 52: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:12:42,815 INFO L290 TraceCheckUtils]: 53: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:12:42,815 INFO L290 TraceCheckUtils]: 54: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:12:42,816 INFO L290 TraceCheckUtils]: 55: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-15 18:12:42,816 INFO L290 TraceCheckUtils]: 56: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {4702#(not (= |ssl3_connect_#t~mem57| 4433))} is VALID [2022-04-15 18:12:42,817 INFO L290 TraceCheckUtils]: 57: Hoare triple {4702#(not (= |ssl3_connect_#t~mem57| 4433))} assume 4433 == #t~mem57;havoc #t~mem57; {4697#false} is VALID [2022-04-15 18:12:42,817 INFO L290 TraceCheckUtils]: 58: Hoare triple {4697#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {4697#false} is VALID [2022-04-15 18:12:42,817 INFO L290 TraceCheckUtils]: 59: Hoare triple {4697#false} assume 5 == ~blastFlag~0; {4697#false} is VALID [2022-04-15 18:12:42,817 INFO L290 TraceCheckUtils]: 60: Hoare triple {4697#false} assume !false; {4697#false} is VALID [2022-04-15 18:12:42,818 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 18:12:42,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:12:42,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088844285] [2022-04-15 18:12:42,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088844285] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:12:42,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:12:42,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:12:42,818 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:12:42,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [823525278] [2022-04-15 18:12:42,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [823525278] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:12:42,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:12:42,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:12:42,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82756058] [2022-04-15 18:12:42,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:12:42,820 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2022-04-15 18:12:42,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:12:42,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:42,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:12:42,872 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:12:42,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:12:42,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:12:42,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:12:42,873 INFO L87 Difference]: Start difference. First operand 274 states and 414 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:44,904 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-15 18:12:46,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:12:46,351 INFO L93 Difference]: Finished difference Result 717 states and 1086 transitions. [2022-04-15 18:12:46,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:12:46,351 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2022-04-15 18:12:46,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:12:46,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:46,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2022-04-15 18:12:46,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:46,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2022-04-15 18:12:46,365 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 480 transitions. [2022-04-15 18:12:46,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 480 edges. 480 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:12:46,871 INFO L225 Difference]: With dead ends: 717 [2022-04-15 18:12:46,871 INFO L226 Difference]: Without dead ends: 459 [2022-04-15 18:12:46,874 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:12:46,878 INFO L913 BasicCegarLoop]: 99 mSDtfsCounter, 107 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-15 18:12:46,879 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 284 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 384 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-04-15 18:12:46,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2022-04-15 18:12:46,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 324. [2022-04-15 18:12:46,924 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:12:46,925 INFO L82 GeneralOperation]: Start isEquivalent. First operand 459 states. Second operand has 324 states, 319 states have (on average 1.561128526645768) internal successors, (498), 319 states have internal predecessors, (498), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:46,926 INFO L74 IsIncluded]: Start isIncluded. First operand 459 states. Second operand has 324 states, 319 states have (on average 1.561128526645768) internal successors, (498), 319 states have internal predecessors, (498), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:46,927 INFO L87 Difference]: Start difference. First operand 459 states. Second operand has 324 states, 319 states have (on average 1.561128526645768) internal successors, (498), 319 states have internal predecessors, (498), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:46,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:12:46,957 INFO L93 Difference]: Finished difference Result 459 states and 690 transitions. [2022-04-15 18:12:46,957 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 690 transitions. [2022-04-15 18:12:46,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:12:46,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:12:46,959 INFO L74 IsIncluded]: Start isIncluded. First operand has 324 states, 319 states have (on average 1.561128526645768) internal successors, (498), 319 states have internal predecessors, (498), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 459 states. [2022-04-15 18:12:46,960 INFO L87 Difference]: Start difference. First operand has 324 states, 319 states have (on average 1.561128526645768) internal successors, (498), 319 states have internal predecessors, (498), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 459 states. [2022-04-15 18:12:46,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:12:46,973 INFO L93 Difference]: Finished difference Result 459 states and 690 transitions. [2022-04-15 18:12:46,973 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 690 transitions. [2022-04-15 18:12:46,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:12:46,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:12:46,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:12:46,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:12:46,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 319 states have (on average 1.561128526645768) internal successors, (498), 319 states have internal predecessors, (498), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:46,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 502 transitions. [2022-04-15 18:12:46,985 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 502 transitions. Word has length 61 [2022-04-15 18:12:46,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:12:46,986 INFO L478 AbstractCegarLoop]: Abstraction has 324 states and 502 transitions. [2022-04-15 18:12:46,986 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:46,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 324 states and 502 transitions. [2022-04-15 18:12:47,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 502 edges. 502 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:12:47,379 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 502 transitions. [2022-04-15 18:12:47,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-15 18:12:47,379 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:12:47,379 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:12:47,380 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 18:12:47,380 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:12:47,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:12:47,380 INFO L85 PathProgramCache]: Analyzing trace with hash 490445606, now seen corresponding path program 1 times [2022-04-15 18:12:47,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:12:47,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2048837558] [2022-04-15 18:12:47,381 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:12:47,381 INFO L85 PathProgramCache]: Analyzing trace with hash 490445606, now seen corresponding path program 2 times [2022-04-15 18:12:47,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:12:47,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614094805] [2022-04-15 18:12:47,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:12:47,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:12:47,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:12:47,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:12:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:12:47,622 INFO L290 TraceCheckUtils]: 0: Hoare triple {7715#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {7708#true} is VALID [2022-04-15 18:12:47,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {7708#true} assume true; {7708#true} is VALID [2022-04-15 18:12:47,623 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7708#true} {7708#true} #591#return; {7708#true} is VALID [2022-04-15 18:12:47,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {7708#true} call ULTIMATE.init(); {7715#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:12:47,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {7715#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {7708#true} is VALID [2022-04-15 18:12:47,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {7708#true} assume true; {7708#true} is VALID [2022-04-15 18:12:47,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7708#true} {7708#true} #591#return; {7708#true} is VALID [2022-04-15 18:12:47,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {7708#true} call #t~ret159 := main(); {7708#true} is VALID [2022-04-15 18:12:47,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {7708#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {7708#true} is VALID [2022-04-15 18:12:47,624 INFO L272 TraceCheckUtils]: 6: Hoare triple {7708#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {7708#true} is VALID [2022-04-15 18:12:47,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {7708#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {7708#true} is VALID [2022-04-15 18:12:47,624 INFO L290 TraceCheckUtils]: 8: Hoare triple {7708#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {7708#true} is VALID [2022-04-15 18:12:47,625 INFO L290 TraceCheckUtils]: 9: Hoare triple {7708#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {7708#true} is VALID [2022-04-15 18:12:47,625 INFO L290 TraceCheckUtils]: 10: Hoare triple {7708#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {7708#true} is VALID [2022-04-15 18:12:47,625 INFO L290 TraceCheckUtils]: 11: Hoare triple {7708#true} assume !false; {7708#true} is VALID [2022-04-15 18:12:47,625 INFO L290 TraceCheckUtils]: 12: Hoare triple {7708#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {7708#true} is VALID [2022-04-15 18:12:47,625 INFO L290 TraceCheckUtils]: 13: Hoare triple {7708#true} assume 12292 == #t~mem43;havoc #t~mem43; {7708#true} is VALID [2022-04-15 18:12:47,625 INFO L290 TraceCheckUtils]: 14: Hoare triple {7708#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {7708#true} is VALID [2022-04-15 18:12:47,625 INFO L290 TraceCheckUtils]: 15: Hoare triple {7708#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {7708#true} is VALID [2022-04-15 18:12:47,625 INFO L290 TraceCheckUtils]: 16: Hoare triple {7708#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {7708#true} is VALID [2022-04-15 18:12:47,629 INFO L290 TraceCheckUtils]: 17: Hoare triple {7708#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {7708#true} is VALID [2022-04-15 18:12:47,629 INFO L290 TraceCheckUtils]: 18: Hoare triple {7708#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {7708#true} is VALID [2022-04-15 18:12:47,629 INFO L290 TraceCheckUtils]: 19: Hoare triple {7708#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {7708#true} is VALID [2022-04-15 18:12:47,629 INFO L290 TraceCheckUtils]: 20: Hoare triple {7708#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {7708#true} is VALID [2022-04-15 18:12:47,629 INFO L290 TraceCheckUtils]: 21: Hoare triple {7708#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {7708#true} is VALID [2022-04-15 18:12:47,629 INFO L290 TraceCheckUtils]: 22: Hoare triple {7708#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {7708#true} is VALID [2022-04-15 18:12:47,630 INFO L290 TraceCheckUtils]: 23: Hoare triple {7708#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {7708#true} is VALID [2022-04-15 18:12:47,630 INFO L290 TraceCheckUtils]: 24: Hoare triple {7708#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {7708#true} is VALID [2022-04-15 18:12:47,630 INFO L290 TraceCheckUtils]: 25: Hoare triple {7708#true} ~skip~0 := 0; {7708#true} is VALID [2022-04-15 18:12:47,630 INFO L290 TraceCheckUtils]: 26: Hoare triple {7708#true} assume !false; {7708#true} is VALID [2022-04-15 18:12:47,630 INFO L290 TraceCheckUtils]: 27: Hoare triple {7708#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {7708#true} is VALID [2022-04-15 18:12:47,630 INFO L290 TraceCheckUtils]: 28: Hoare triple {7708#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {7708#true} is VALID [2022-04-15 18:12:47,630 INFO L290 TraceCheckUtils]: 29: Hoare triple {7708#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {7708#true} is VALID [2022-04-15 18:12:47,630 INFO L290 TraceCheckUtils]: 30: Hoare triple {7708#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {7708#true} is VALID [2022-04-15 18:12:47,630 INFO L290 TraceCheckUtils]: 31: Hoare triple {7708#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {7708#true} is VALID [2022-04-15 18:12:47,631 INFO L290 TraceCheckUtils]: 32: Hoare triple {7708#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {7708#true} is VALID [2022-04-15 18:12:47,631 INFO L290 TraceCheckUtils]: 33: Hoare triple {7708#true} assume 4368 == #t~mem48;havoc #t~mem48; {7708#true} is VALID [2022-04-15 18:12:47,631 INFO L290 TraceCheckUtils]: 34: Hoare triple {7708#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {7708#true} is VALID [2022-04-15 18:12:47,631 INFO L290 TraceCheckUtils]: 35: Hoare triple {7708#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {7708#true} is VALID [2022-04-15 18:12:47,632 INFO L290 TraceCheckUtils]: 36: Hoare triple {7708#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-15 18:12:47,633 INFO L290 TraceCheckUtils]: 37: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-15 18:12:47,633 INFO L290 TraceCheckUtils]: 38: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-15 18:12:47,633 INFO L290 TraceCheckUtils]: 39: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-15 18:12:47,634 INFO L290 TraceCheckUtils]: 40: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} ~skip~0 := 0; {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-15 18:12:47,634 INFO L290 TraceCheckUtils]: 41: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !false; {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-15 18:12:47,634 INFO L290 TraceCheckUtils]: 42: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-15 18:12:47,635 INFO L290 TraceCheckUtils]: 43: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-15 18:12:47,636 INFO L290 TraceCheckUtils]: 44: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-15 18:12:47,636 INFO L290 TraceCheckUtils]: 45: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-15 18:12:47,636 INFO L290 TraceCheckUtils]: 46: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-15 18:12:47,637 INFO L290 TraceCheckUtils]: 47: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-15 18:12:47,637 INFO L290 TraceCheckUtils]: 48: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-15 18:12:47,637 INFO L290 TraceCheckUtils]: 49: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-15 18:12:47,638 INFO L290 TraceCheckUtils]: 50: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-15 18:12:47,638 INFO L290 TraceCheckUtils]: 51: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-15 18:12:47,638 INFO L290 TraceCheckUtils]: 52: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-15 18:12:47,643 INFO L290 TraceCheckUtils]: 53: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-15 18:12:47,644 INFO L290 TraceCheckUtils]: 54: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-15 18:12:47,645 INFO L290 TraceCheckUtils]: 55: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-15 18:12:47,646 INFO L290 TraceCheckUtils]: 56: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} is VALID [2022-04-15 18:12:47,650 INFO L290 TraceCheckUtils]: 57: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448))} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {7714#(not (= |ssl3_connect_#t~mem58| 4448))} is VALID [2022-04-15 18:12:47,651 INFO L290 TraceCheckUtils]: 58: Hoare triple {7714#(not (= |ssl3_connect_#t~mem58| 4448))} assume 4448 == #t~mem58;havoc #t~mem58; {7709#false} is VALID [2022-04-15 18:12:47,652 INFO L290 TraceCheckUtils]: 59: Hoare triple {7709#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {7709#false} is VALID [2022-04-15 18:12:47,652 INFO L290 TraceCheckUtils]: 60: Hoare triple {7709#false} assume 4 == ~blastFlag~0; {7709#false} is VALID [2022-04-15 18:12:47,652 INFO L290 TraceCheckUtils]: 61: Hoare triple {7709#false} assume !false; {7709#false} is VALID [2022-04-15 18:12:47,653 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 18:12:47,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:12:47,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614094805] [2022-04-15 18:12:47,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614094805] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:12:47,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:12:47,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:12:47,654 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:12:47,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2048837558] [2022-04-15 18:12:47,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2048837558] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:12:47,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:12:47,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:12:47,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086848549] [2022-04-15 18:12:47,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:12:47,656 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (3), 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 62 [2022-04-15 18:12:47,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:12:47,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:47,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:12:47,705 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:12:47,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:12:47,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:12:47,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:12:47,705 INFO L87 Difference]: Start difference. First operand 324 states and 502 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:49,728 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-15 18:12:50,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:12:50,975 INFO L93 Difference]: Finished difference Result 817 states and 1258 transitions. [2022-04-15 18:12:50,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:12:50,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (3), 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 62 [2022-04-15 18:12:50,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:12:50,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:50,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-15 18:12:50,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:50,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-15 18:12:50,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 479 transitions. [2022-04-15 18:12:51,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 479 edges. 479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:12:51,426 INFO L225 Difference]: With dead ends: 817 [2022-04-15 18:12:51,426 INFO L226 Difference]: Without dead ends: 509 [2022-04-15 18:12:51,427 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:12:51,427 INFO L913 BasicCegarLoop]: 99 mSDtfsCounter, 105 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-15 18:12:51,428 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 284 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 385 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-15 18:12:51,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2022-04-15 18:12:51,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 376. [2022-04-15 18:12:51,455 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:12:51,456 INFO L82 GeneralOperation]: Start isEquivalent. First operand 509 states. Second operand has 376 states, 371 states have (on average 1.5795148247978437) internal successors, (586), 371 states have internal predecessors, (586), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:51,457 INFO L74 IsIncluded]: Start isIncluded. First operand 509 states. Second operand has 376 states, 371 states have (on average 1.5795148247978437) internal successors, (586), 371 states have internal predecessors, (586), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:51,458 INFO L87 Difference]: Start difference. First operand 509 states. Second operand has 376 states, 371 states have (on average 1.5795148247978437) internal successors, (586), 371 states have internal predecessors, (586), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:51,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:12:51,474 INFO L93 Difference]: Finished difference Result 509 states and 774 transitions. [2022-04-15 18:12:51,474 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 774 transitions. [2022-04-15 18:12:51,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:12:51,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:12:51,477 INFO L74 IsIncluded]: Start isIncluded. First operand has 376 states, 371 states have (on average 1.5795148247978437) internal successors, (586), 371 states have internal predecessors, (586), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 509 states. [2022-04-15 18:12:51,478 INFO L87 Difference]: Start difference. First operand has 376 states, 371 states have (on average 1.5795148247978437) internal successors, (586), 371 states have internal predecessors, (586), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 509 states. [2022-04-15 18:12:51,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:12:51,494 INFO L93 Difference]: Finished difference Result 509 states and 774 transitions. [2022-04-15 18:12:51,494 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 774 transitions. [2022-04-15 18:12:51,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:12:51,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:12:51,495 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:12:51,496 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:12:51,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 371 states have (on average 1.5795148247978437) internal successors, (586), 371 states have internal predecessors, (586), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:51,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 590 transitions. [2022-04-15 18:12:51,516 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 590 transitions. Word has length 62 [2022-04-15 18:12:51,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:12:51,516 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 590 transitions. [2022-04-15 18:12:51,516 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:51,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 376 states and 590 transitions. [2022-04-15 18:12:52,037 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 590 edges. 590 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:12:52,037 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 590 transitions. [2022-04-15 18:12:52,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-15 18:12:52,038 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:12:52,038 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:12:52,039 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 18:12:52,039 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:12:52,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:12:52,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1980532473, now seen corresponding path program 1 times [2022-04-15 18:12:52,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:12:52,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1633116085] [2022-04-15 18:12:52,040 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:12:52,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1980532473, now seen corresponding path program 2 times [2022-04-15 18:12:52,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:12:52,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464261910] [2022-04-15 18:12:52,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:12:52,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:12:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:12:52,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:12:52,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:12:52,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {11131#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {11124#true} is VALID [2022-04-15 18:12:52,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {11124#true} assume true; {11124#true} is VALID [2022-04-15 18:12:52,294 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11124#true} {11124#true} #591#return; {11124#true} is VALID [2022-04-15 18:12:52,295 INFO L272 TraceCheckUtils]: 0: Hoare triple {11124#true} call ULTIMATE.init(); {11131#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:12:52,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {11131#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {11124#true} is VALID [2022-04-15 18:12:52,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {11124#true} assume true; {11124#true} is VALID [2022-04-15 18:12:52,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11124#true} {11124#true} #591#return; {11124#true} is VALID [2022-04-15 18:12:52,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {11124#true} call #t~ret159 := main(); {11124#true} is VALID [2022-04-15 18:12:52,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {11124#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {11124#true} is VALID [2022-04-15 18:12:52,296 INFO L272 TraceCheckUtils]: 6: Hoare triple {11124#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {11124#true} is VALID [2022-04-15 18:12:52,298 INFO L290 TraceCheckUtils]: 7: Hoare triple {11124#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {11124#true} is VALID [2022-04-15 18:12:52,299 INFO L290 TraceCheckUtils]: 8: Hoare triple {11124#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {11124#true} is VALID [2022-04-15 18:12:52,299 INFO L290 TraceCheckUtils]: 9: Hoare triple {11124#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {11124#true} is VALID [2022-04-15 18:12:52,299 INFO L290 TraceCheckUtils]: 10: Hoare triple {11124#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {11124#true} is VALID [2022-04-15 18:12:52,299 INFO L290 TraceCheckUtils]: 11: Hoare triple {11124#true} assume !false; {11124#true} is VALID [2022-04-15 18:12:52,299 INFO L290 TraceCheckUtils]: 12: Hoare triple {11124#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {11124#true} is VALID [2022-04-15 18:12:52,299 INFO L290 TraceCheckUtils]: 13: Hoare triple {11124#true} assume 12292 == #t~mem43;havoc #t~mem43; {11124#true} is VALID [2022-04-15 18:12:52,299 INFO L290 TraceCheckUtils]: 14: Hoare triple {11124#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {11124#true} is VALID [2022-04-15 18:12:52,299 INFO L290 TraceCheckUtils]: 15: Hoare triple {11124#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {11124#true} is VALID [2022-04-15 18:12:52,299 INFO L290 TraceCheckUtils]: 16: Hoare triple {11124#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {11124#true} is VALID [2022-04-15 18:12:52,299 INFO L290 TraceCheckUtils]: 17: Hoare triple {11124#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {11124#true} is VALID [2022-04-15 18:12:52,300 INFO L290 TraceCheckUtils]: 18: Hoare triple {11124#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {11124#true} is VALID [2022-04-15 18:12:52,300 INFO L290 TraceCheckUtils]: 19: Hoare triple {11124#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {11124#true} is VALID [2022-04-15 18:12:52,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {11124#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {11124#true} is VALID [2022-04-15 18:12:52,300 INFO L290 TraceCheckUtils]: 21: Hoare triple {11124#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {11124#true} is VALID [2022-04-15 18:12:52,300 INFO L290 TraceCheckUtils]: 22: Hoare triple {11124#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {11124#true} is VALID [2022-04-15 18:12:52,300 INFO L290 TraceCheckUtils]: 23: Hoare triple {11124#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {11124#true} is VALID [2022-04-15 18:12:52,300 INFO L290 TraceCheckUtils]: 24: Hoare triple {11124#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {11124#true} is VALID [2022-04-15 18:12:52,300 INFO L290 TraceCheckUtils]: 25: Hoare triple {11124#true} ~skip~0 := 0; {11124#true} is VALID [2022-04-15 18:12:52,300 INFO L290 TraceCheckUtils]: 26: Hoare triple {11124#true} assume !false; {11124#true} is VALID [2022-04-15 18:12:52,300 INFO L290 TraceCheckUtils]: 27: Hoare triple {11124#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {11124#true} is VALID [2022-04-15 18:12:52,300 INFO L290 TraceCheckUtils]: 28: Hoare triple {11124#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {11124#true} is VALID [2022-04-15 18:12:52,301 INFO L290 TraceCheckUtils]: 29: Hoare triple {11124#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {11124#true} is VALID [2022-04-15 18:12:52,301 INFO L290 TraceCheckUtils]: 30: Hoare triple {11124#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {11124#true} is VALID [2022-04-15 18:12:52,301 INFO L290 TraceCheckUtils]: 31: Hoare triple {11124#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {11124#true} is VALID [2022-04-15 18:12:52,301 INFO L290 TraceCheckUtils]: 32: Hoare triple {11124#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {11124#true} is VALID [2022-04-15 18:12:52,301 INFO L290 TraceCheckUtils]: 33: Hoare triple {11124#true} assume 4368 == #t~mem48;havoc #t~mem48; {11124#true} is VALID [2022-04-15 18:12:52,301 INFO L290 TraceCheckUtils]: 34: Hoare triple {11124#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {11124#true} is VALID [2022-04-15 18:12:52,301 INFO L290 TraceCheckUtils]: 35: Hoare triple {11124#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {11124#true} is VALID [2022-04-15 18:12:52,303 INFO L290 TraceCheckUtils]: 36: Hoare triple {11124#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:12:52,304 INFO L290 TraceCheckUtils]: 37: Hoare triple {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:12:52,304 INFO L290 TraceCheckUtils]: 38: Hoare triple {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:12:52,304 INFO L290 TraceCheckUtils]: 39: Hoare triple {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:12:52,305 INFO L290 TraceCheckUtils]: 40: Hoare triple {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} ~skip~0 := 0; {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:12:52,305 INFO L290 TraceCheckUtils]: 41: Hoare triple {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !false; {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:12:52,306 INFO L290 TraceCheckUtils]: 42: Hoare triple {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:12:52,306 INFO L290 TraceCheckUtils]: 43: Hoare triple {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:12:52,307 INFO L290 TraceCheckUtils]: 44: Hoare triple {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:12:52,307 INFO L290 TraceCheckUtils]: 45: Hoare triple {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:12:52,307 INFO L290 TraceCheckUtils]: 46: Hoare triple {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:12:52,308 INFO L290 TraceCheckUtils]: 47: Hoare triple {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:12:52,308 INFO L290 TraceCheckUtils]: 48: Hoare triple {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:12:52,309 INFO L290 TraceCheckUtils]: 49: Hoare triple {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:12:52,309 INFO L290 TraceCheckUtils]: 50: Hoare triple {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:12:52,310 INFO L290 TraceCheckUtils]: 51: Hoare triple {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:12:52,310 INFO L290 TraceCheckUtils]: 52: Hoare triple {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:12:52,310 INFO L290 TraceCheckUtils]: 53: Hoare triple {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:12:52,311 INFO L290 TraceCheckUtils]: 54: Hoare triple {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:12:52,311 INFO L290 TraceCheckUtils]: 55: Hoare triple {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:12:52,313 INFO L290 TraceCheckUtils]: 56: Hoare triple {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:12:52,313 INFO L290 TraceCheckUtils]: 57: Hoare triple {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:12:52,314 INFO L290 TraceCheckUtils]: 58: Hoare triple {11129#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4448 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {11130#(not (= 4449 |ssl3_connect_#t~mem59|))} is VALID [2022-04-15 18:12:52,314 INFO L290 TraceCheckUtils]: 59: Hoare triple {11130#(not (= 4449 |ssl3_connect_#t~mem59|))} assume 4449 == #t~mem59;havoc #t~mem59; {11125#false} is VALID [2022-04-15 18:12:52,314 INFO L290 TraceCheckUtils]: 60: Hoare triple {11125#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {11125#false} is VALID [2022-04-15 18:12:52,314 INFO L290 TraceCheckUtils]: 61: Hoare triple {11125#false} assume 4 == ~blastFlag~0; {11125#false} is VALID [2022-04-15 18:12:52,314 INFO L290 TraceCheckUtils]: 62: Hoare triple {11125#false} assume !false; {11125#false} is VALID [2022-04-15 18:12:52,316 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 18:12:52,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:12:52,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464261910] [2022-04-15 18:12:52,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464261910] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:12:52,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:12:52,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:12:52,317 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:12:52,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1633116085] [2022-04-15 18:12:52,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1633116085] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:12:52,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:12:52,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:12:52,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007070621] [2022-04-15 18:12:52,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:12:52,319 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (3), 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 63 [2022-04-15 18:12:52,319 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:12:52,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:52,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:12:52,384 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:12:52,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:12:52,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:12:52,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:12:52,385 INFO L87 Difference]: Start difference. First operand 376 states and 590 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:54,412 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-15 18:12:55,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:12:55,649 INFO L93 Difference]: Finished difference Result 871 states and 1348 transitions. [2022-04-15 18:12:55,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:12:55,649 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (3), 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 63 [2022-04-15 18:12:55,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:12:55,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:55,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-15 18:12:55,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:55,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-15 18:12:55,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 479 transitions. [2022-04-15 18:12:56,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 479 edges. 479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:12:56,095 INFO L225 Difference]: With dead ends: 871 [2022-04-15 18:12:56,095 INFO L226 Difference]: Without dead ends: 511 [2022-04-15 18:12:56,096 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:12:56,097 INFO L913 BasicCegarLoop]: 106 mSDtfsCounter, 104 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-15 18:12:56,097 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 298 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 391 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-15 18:12:56,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2022-04-15 18:12:56,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 380. [2022-04-15 18:12:56,116 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:12:56,117 INFO L82 GeneralOperation]: Start isEquivalent. First operand 511 states. Second operand has 380 states, 375 states have (on average 1.5786666666666667) internal successors, (592), 375 states have internal predecessors, (592), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:56,118 INFO L74 IsIncluded]: Start isIncluded. First operand 511 states. Second operand has 380 states, 375 states have (on average 1.5786666666666667) internal successors, (592), 375 states have internal predecessors, (592), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:56,119 INFO L87 Difference]: Start difference. First operand 511 states. Second operand has 380 states, 375 states have (on average 1.5786666666666667) internal successors, (592), 375 states have internal predecessors, (592), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:56,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:12:56,137 INFO L93 Difference]: Finished difference Result 511 states and 776 transitions. [2022-04-15 18:12:56,137 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 776 transitions. [2022-04-15 18:12:56,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:12:56,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:12:56,140 INFO L74 IsIncluded]: Start isIncluded. First operand has 380 states, 375 states have (on average 1.5786666666666667) internal successors, (592), 375 states have internal predecessors, (592), 3 states have call successors, (3), 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 511 states. [2022-04-15 18:12:56,141 INFO L87 Difference]: Start difference. First operand has 380 states, 375 states have (on average 1.5786666666666667) internal successors, (592), 375 states have internal predecessors, (592), 3 states have call successors, (3), 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 511 states. [2022-04-15 18:12:56,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:12:56,158 INFO L93 Difference]: Finished difference Result 511 states and 776 transitions. [2022-04-15 18:12:56,158 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 776 transitions. [2022-04-15 18:12:56,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:12:56,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:12:56,159 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:12:56,159 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:12:56,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 375 states have (on average 1.5786666666666667) internal successors, (592), 375 states have internal predecessors, (592), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:56,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 596 transitions. [2022-04-15 18:12:56,199 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 596 transitions. Word has length 63 [2022-04-15 18:12:56,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:12:56,199 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 596 transitions. [2022-04-15 18:12:56,200 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:56,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 380 states and 596 transitions. [2022-04-15 18:12:56,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 596 edges. 596 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:12:56,842 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 596 transitions. [2022-04-15 18:12:56,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-15 18:12:56,843 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:12:56,843 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:12:56,843 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 18:12:56,843 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:12:56,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:12:56,844 INFO L85 PathProgramCache]: Analyzing trace with hash -807453134, now seen corresponding path program 1 times [2022-04-15 18:12:56,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:12:56,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [662315931] [2022-04-15 18:12:56,844 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:12:56,845 INFO L85 PathProgramCache]: Analyzing trace with hash -807453134, now seen corresponding path program 2 times [2022-04-15 18:12:56,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:12:56,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804524785] [2022-04-15 18:12:56,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:12:56,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:12:57,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:12:57,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:12:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:12:57,149 INFO L290 TraceCheckUtils]: 0: Hoare triple {14667#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {14660#true} is VALID [2022-04-15 18:12:57,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {14660#true} assume true; {14660#true} is VALID [2022-04-15 18:12:57,149 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14660#true} {14660#true} #591#return; {14660#true} is VALID [2022-04-15 18:12:57,150 INFO L272 TraceCheckUtils]: 0: Hoare triple {14660#true} call ULTIMATE.init(); {14667#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:12:57,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {14667#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {14660#true} is VALID [2022-04-15 18:12:57,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {14660#true} assume true; {14660#true} is VALID [2022-04-15 18:12:57,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14660#true} {14660#true} #591#return; {14660#true} is VALID [2022-04-15 18:12:57,151 INFO L272 TraceCheckUtils]: 4: Hoare triple {14660#true} call #t~ret159 := main(); {14660#true} is VALID [2022-04-15 18:12:57,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {14660#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {14660#true} is VALID [2022-04-15 18:12:57,151 INFO L272 TraceCheckUtils]: 6: Hoare triple {14660#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {14660#true} is VALID [2022-04-15 18:12:57,151 INFO L290 TraceCheckUtils]: 7: Hoare triple {14660#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {14660#true} is VALID [2022-04-15 18:12:57,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {14660#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {14660#true} is VALID [2022-04-15 18:12:57,151 INFO L290 TraceCheckUtils]: 9: Hoare triple {14660#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {14660#true} is VALID [2022-04-15 18:12:57,151 INFO L290 TraceCheckUtils]: 10: Hoare triple {14660#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {14660#true} is VALID [2022-04-15 18:12:57,151 INFO L290 TraceCheckUtils]: 11: Hoare triple {14660#true} assume !false; {14660#true} is VALID [2022-04-15 18:12:57,151 INFO L290 TraceCheckUtils]: 12: Hoare triple {14660#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {14660#true} is VALID [2022-04-15 18:12:57,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {14660#true} assume 12292 == #t~mem43;havoc #t~mem43; {14660#true} is VALID [2022-04-15 18:12:57,152 INFO L290 TraceCheckUtils]: 14: Hoare triple {14660#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {14660#true} is VALID [2022-04-15 18:12:57,152 INFO L290 TraceCheckUtils]: 15: Hoare triple {14660#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {14660#true} is VALID [2022-04-15 18:12:57,152 INFO L290 TraceCheckUtils]: 16: Hoare triple {14660#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {14660#true} is VALID [2022-04-15 18:12:57,152 INFO L290 TraceCheckUtils]: 17: Hoare triple {14660#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {14660#true} is VALID [2022-04-15 18:12:57,152 INFO L290 TraceCheckUtils]: 18: Hoare triple {14660#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {14660#true} is VALID [2022-04-15 18:12:57,152 INFO L290 TraceCheckUtils]: 19: Hoare triple {14660#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {14660#true} is VALID [2022-04-15 18:12:57,152 INFO L290 TraceCheckUtils]: 20: Hoare triple {14660#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {14660#true} is VALID [2022-04-15 18:12:57,152 INFO L290 TraceCheckUtils]: 21: Hoare triple {14660#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {14660#true} is VALID [2022-04-15 18:12:57,157 INFO L290 TraceCheckUtils]: 22: Hoare triple {14660#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {14660#true} is VALID [2022-04-15 18:12:57,158 INFO L290 TraceCheckUtils]: 23: Hoare triple {14660#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {14660#true} is VALID [2022-04-15 18:12:57,158 INFO L290 TraceCheckUtils]: 24: Hoare triple {14660#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {14660#true} is VALID [2022-04-15 18:12:57,158 INFO L290 TraceCheckUtils]: 25: Hoare triple {14660#true} ~skip~0 := 0; {14660#true} is VALID [2022-04-15 18:12:57,158 INFO L290 TraceCheckUtils]: 26: Hoare triple {14660#true} assume !false; {14660#true} is VALID [2022-04-15 18:12:57,158 INFO L290 TraceCheckUtils]: 27: Hoare triple {14660#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {14660#true} is VALID [2022-04-15 18:12:57,158 INFO L290 TraceCheckUtils]: 28: Hoare triple {14660#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {14660#true} is VALID [2022-04-15 18:12:57,158 INFO L290 TraceCheckUtils]: 29: Hoare triple {14660#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {14660#true} is VALID [2022-04-15 18:12:57,158 INFO L290 TraceCheckUtils]: 30: Hoare triple {14660#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {14660#true} is VALID [2022-04-15 18:12:57,159 INFO L290 TraceCheckUtils]: 31: Hoare triple {14660#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {14660#true} is VALID [2022-04-15 18:12:57,159 INFO L290 TraceCheckUtils]: 32: Hoare triple {14660#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {14660#true} is VALID [2022-04-15 18:12:57,159 INFO L290 TraceCheckUtils]: 33: Hoare triple {14660#true} assume 4368 == #t~mem48;havoc #t~mem48; {14660#true} is VALID [2022-04-15 18:12:57,159 INFO L290 TraceCheckUtils]: 34: Hoare triple {14660#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {14660#true} is VALID [2022-04-15 18:12:57,159 INFO L290 TraceCheckUtils]: 35: Hoare triple {14660#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {14660#true} is VALID [2022-04-15 18:12:57,160 INFO L290 TraceCheckUtils]: 36: Hoare triple {14660#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-15 18:12:57,161 INFO L290 TraceCheckUtils]: 37: Hoare triple {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-15 18:12:57,161 INFO L290 TraceCheckUtils]: 38: Hoare triple {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-15 18:12:57,161 INFO L290 TraceCheckUtils]: 39: Hoare triple {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-15 18:12:57,162 INFO L290 TraceCheckUtils]: 40: Hoare triple {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} ~skip~0 := 0; {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-15 18:12:57,162 INFO L290 TraceCheckUtils]: 41: Hoare triple {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !false; {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-15 18:12:57,162 INFO L290 TraceCheckUtils]: 42: Hoare triple {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-15 18:12:57,163 INFO L290 TraceCheckUtils]: 43: Hoare triple {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-15 18:12:57,163 INFO L290 TraceCheckUtils]: 44: Hoare triple {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-15 18:12:57,163 INFO L290 TraceCheckUtils]: 45: Hoare triple {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-15 18:12:57,164 INFO L290 TraceCheckUtils]: 46: Hoare triple {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-15 18:12:57,164 INFO L290 TraceCheckUtils]: 47: Hoare triple {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-15 18:12:57,164 INFO L290 TraceCheckUtils]: 48: Hoare triple {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-15 18:12:57,165 INFO L290 TraceCheckUtils]: 49: Hoare triple {14665#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {14666#(= |ssl3_connect_#t~mem50| 4384)} is VALID [2022-04-15 18:12:57,166 INFO L290 TraceCheckUtils]: 50: Hoare triple {14666#(= |ssl3_connect_#t~mem50| 4384)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {14661#false} is VALID [2022-04-15 18:12:57,167 INFO L290 TraceCheckUtils]: 51: Hoare triple {14661#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {14661#false} is VALID [2022-04-15 18:12:57,167 INFO L290 TraceCheckUtils]: 52: Hoare triple {14661#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {14661#false} is VALID [2022-04-15 18:12:57,169 INFO L290 TraceCheckUtils]: 53: Hoare triple {14661#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {14661#false} is VALID [2022-04-15 18:12:57,170 INFO L290 TraceCheckUtils]: 54: Hoare triple {14661#false} assume 4416 == #t~mem54;havoc #t~mem54; {14661#false} is VALID [2022-04-15 18:12:57,170 INFO L290 TraceCheckUtils]: 55: Hoare triple {14661#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {14661#false} is VALID [2022-04-15 18:12:57,170 INFO L290 TraceCheckUtils]: 56: Hoare triple {14661#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {14661#false} is VALID [2022-04-15 18:12:57,171 INFO L290 TraceCheckUtils]: 57: Hoare triple {14661#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {14661#false} is VALID [2022-04-15 18:12:57,171 INFO L290 TraceCheckUtils]: 58: Hoare triple {14661#false} assume !(0 == ~tmp___6~0); {14661#false} is VALID [2022-04-15 18:12:57,171 INFO L290 TraceCheckUtils]: 59: Hoare triple {14661#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {14661#false} is VALID [2022-04-15 18:12:57,171 INFO L290 TraceCheckUtils]: 60: Hoare triple {14661#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {14661#false} is VALID [2022-04-15 18:12:57,171 INFO L290 TraceCheckUtils]: 61: Hoare triple {14661#false} ~skip~0 := 0; {14661#false} is VALID [2022-04-15 18:12:57,172 INFO L290 TraceCheckUtils]: 62: Hoare triple {14661#false} assume !false; {14661#false} is VALID [2022-04-15 18:12:57,172 INFO L290 TraceCheckUtils]: 63: Hoare triple {14661#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {14661#false} is VALID [2022-04-15 18:12:57,172 INFO L290 TraceCheckUtils]: 64: Hoare triple {14661#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {14661#false} is VALID [2022-04-15 18:12:57,172 INFO L290 TraceCheckUtils]: 65: Hoare triple {14661#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {14661#false} is VALID [2022-04-15 18:12:57,172 INFO L290 TraceCheckUtils]: 66: Hoare triple {14661#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {14661#false} is VALID [2022-04-15 18:12:57,172 INFO L290 TraceCheckUtils]: 67: Hoare triple {14661#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {14661#false} is VALID [2022-04-15 18:12:57,172 INFO L290 TraceCheckUtils]: 68: Hoare triple {14661#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {14661#false} is VALID [2022-04-15 18:12:57,172 INFO L290 TraceCheckUtils]: 69: Hoare triple {14661#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {14661#false} is VALID [2022-04-15 18:12:57,172 INFO L290 TraceCheckUtils]: 70: Hoare triple {14661#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {14661#false} is VALID [2022-04-15 18:12:57,172 INFO L290 TraceCheckUtils]: 71: Hoare triple {14661#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {14661#false} is VALID [2022-04-15 18:12:57,172 INFO L290 TraceCheckUtils]: 72: Hoare triple {14661#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {14661#false} is VALID [2022-04-15 18:12:57,173 INFO L290 TraceCheckUtils]: 73: Hoare triple {14661#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {14661#false} is VALID [2022-04-15 18:12:57,173 INFO L290 TraceCheckUtils]: 74: Hoare triple {14661#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {14661#false} is VALID [2022-04-15 18:12:57,173 INFO L290 TraceCheckUtils]: 75: Hoare triple {14661#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {14661#false} is VALID [2022-04-15 18:12:57,173 INFO L290 TraceCheckUtils]: 76: Hoare triple {14661#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {14661#false} is VALID [2022-04-15 18:12:57,173 INFO L290 TraceCheckUtils]: 77: Hoare triple {14661#false} assume 4432 == #t~mem56;havoc #t~mem56; {14661#false} is VALID [2022-04-15 18:12:57,173 INFO L290 TraceCheckUtils]: 78: Hoare triple {14661#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {14661#false} is VALID [2022-04-15 18:12:57,173 INFO L290 TraceCheckUtils]: 79: Hoare triple {14661#false} assume 5 == ~blastFlag~0; {14661#false} is VALID [2022-04-15 18:12:57,173 INFO L290 TraceCheckUtils]: 80: Hoare triple {14661#false} assume !false; {14661#false} is VALID [2022-04-15 18:12:57,173 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 18:12:57,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:12:57,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804524785] [2022-04-15 18:12:57,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804524785] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:12:57,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:12:57,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:12:57,174 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:12:57,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [662315931] [2022-04-15 18:12:57,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [662315931] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:12:57,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:12:57,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:12:57,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536690790] [2022-04-15 18:12:57,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:12:57,175 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2022-04-15 18:12:57,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:12:57,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:57,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:12:57,248 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:12:57,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:12:57,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:12:57,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:12:57,249 INFO L87 Difference]: Start difference. First operand 380 states and 596 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:12:59,278 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-15 18:13:00,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:13:00,688 INFO L93 Difference]: Finished difference Result 599 states and 942 transitions. [2022-04-15 18:13:00,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:13:00,689 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2022-04-15 18:13:00,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:13:00,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:13:00,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 390 transitions. [2022-04-15 18:13:00,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:13:00,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 390 transitions. [2022-04-15 18:13:00,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 390 transitions. [2022-04-15 18:13:01,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 390 edges. 390 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:13:01,044 INFO L225 Difference]: With dead ends: 599 [2022-04-15 18:13:01,044 INFO L226 Difference]: Without dead ends: 415 [2022-04-15 18:13:01,045 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:13:01,046 INFO L913 BasicCegarLoop]: 200 mSDtfsCounter, 31 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-15 18:13:01,046 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 490 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 361 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-15 18:13:01,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2022-04-15 18:13:01,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 398. [2022-04-15 18:13:01,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:13:01,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 415 states. Second operand has 398 states, 393 states have (on average 1.5826972010178118) internal successors, (622), 393 states have internal predecessors, (622), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:13:01,068 INFO L74 IsIncluded]: Start isIncluded. First operand 415 states. Second operand has 398 states, 393 states have (on average 1.5826972010178118) internal successors, (622), 393 states have internal predecessors, (622), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:13:01,091 INFO L87 Difference]: Start difference. First operand 415 states. Second operand has 398 states, 393 states have (on average 1.5826972010178118) internal successors, (622), 393 states have internal predecessors, (622), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:13:01,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:13:01,105 INFO L93 Difference]: Finished difference Result 415 states and 648 transitions. [2022-04-15 18:13:01,105 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 648 transitions. [2022-04-15 18:13:01,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:13:01,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:13:01,109 INFO L74 IsIncluded]: Start isIncluded. First operand has 398 states, 393 states have (on average 1.5826972010178118) internal successors, (622), 393 states have internal predecessors, (622), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 415 states. [2022-04-15 18:13:01,109 INFO L87 Difference]: Start difference. First operand has 398 states, 393 states have (on average 1.5826972010178118) internal successors, (622), 393 states have internal predecessors, (622), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 415 states. [2022-04-15 18:13:01,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:13:01,121 INFO L93 Difference]: Finished difference Result 415 states and 648 transitions. [2022-04-15 18:13:01,122 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 648 transitions. [2022-04-15 18:13:01,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:13:01,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:13:01,122 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:13:01,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:13:01,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 393 states have (on average 1.5826972010178118) internal successors, (622), 393 states have internal predecessors, (622), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:13:01,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 626 transitions. [2022-04-15 18:13:01,136 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 626 transitions. Word has length 81 [2022-04-15 18:13:01,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:13:01,137 INFO L478 AbstractCegarLoop]: Abstraction has 398 states and 626 transitions. [2022-04-15 18:13:01,137 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:13:01,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 398 states and 626 transitions. [2022-04-15 18:13:01,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 626 edges. 626 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:13:01,689 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 626 transitions. [2022-04-15 18:13:01,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-04-15 18:13:01,690 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:13:01,690 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 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-15 18:13:01,690 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 18:13:01,691 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:13:01,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:13:01,691 INFO L85 PathProgramCache]: Analyzing trace with hash -789307781, now seen corresponding path program 3 times [2022-04-15 18:13:01,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:13:01,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1217180234] [2022-04-15 18:13:11,856 WARN L232 SmtUtils]: Spent 10.15s on a formula simplification that was a NOOP. DAG size: 241 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 18:13:23,485 WARN L232 SmtUtils]: Spent 7.33s on a formula simplification that was a NOOP. DAG size: 166 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 18:13:24,768 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:13:24,768 INFO L85 PathProgramCache]: Analyzing trace with hash -789307781, now seen corresponding path program 4 times [2022-04-15 18:13:24,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:13:24,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995788359] [2022-04-15 18:13:24,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:13:24,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:13:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:13:24,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:13:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:13:25,000 INFO L290 TraceCheckUtils]: 0: Hoare triple {17503#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {17496#true} is VALID [2022-04-15 18:13:25,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {17496#true} assume true; {17496#true} is VALID [2022-04-15 18:13:25,001 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17496#true} {17496#true} #591#return; {17496#true} is VALID [2022-04-15 18:13:25,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {17496#true} call ULTIMATE.init(); {17503#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:13:25,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {17503#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {17496#true} is VALID [2022-04-15 18:13:25,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {17496#true} assume true; {17496#true} is VALID [2022-04-15 18:13:25,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17496#true} {17496#true} #591#return; {17496#true} is VALID [2022-04-15 18:13:25,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {17496#true} call #t~ret159 := main(); {17496#true} is VALID [2022-04-15 18:13:25,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {17496#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {17496#true} is VALID [2022-04-15 18:13:25,003 INFO L272 TraceCheckUtils]: 6: Hoare triple {17496#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {17496#true} is VALID [2022-04-15 18:13:25,003 INFO L290 TraceCheckUtils]: 7: Hoare triple {17496#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {17496#true} is VALID [2022-04-15 18:13:25,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {17496#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {17496#true} is VALID [2022-04-15 18:13:25,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {17496#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {17496#true} is VALID [2022-04-15 18:13:25,003 INFO L290 TraceCheckUtils]: 10: Hoare triple {17496#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {17496#true} is VALID [2022-04-15 18:13:25,003 INFO L290 TraceCheckUtils]: 11: Hoare triple {17496#true} assume !false; {17496#true} is VALID [2022-04-15 18:13:25,003 INFO L290 TraceCheckUtils]: 12: Hoare triple {17496#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {17496#true} is VALID [2022-04-15 18:13:25,003 INFO L290 TraceCheckUtils]: 13: Hoare triple {17496#true} assume 12292 == #t~mem43;havoc #t~mem43; {17496#true} is VALID [2022-04-15 18:13:25,004 INFO L290 TraceCheckUtils]: 14: Hoare triple {17496#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {17496#true} is VALID [2022-04-15 18:13:25,004 INFO L290 TraceCheckUtils]: 15: Hoare triple {17496#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {17496#true} is VALID [2022-04-15 18:13:25,004 INFO L290 TraceCheckUtils]: 16: Hoare triple {17496#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {17496#true} is VALID [2022-04-15 18:13:25,004 INFO L290 TraceCheckUtils]: 17: Hoare triple {17496#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {17496#true} is VALID [2022-04-15 18:13:25,004 INFO L290 TraceCheckUtils]: 18: Hoare triple {17496#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {17496#true} is VALID [2022-04-15 18:13:25,004 INFO L290 TraceCheckUtils]: 19: Hoare triple {17496#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {17496#true} is VALID [2022-04-15 18:13:25,004 INFO L290 TraceCheckUtils]: 20: Hoare triple {17496#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {17496#true} is VALID [2022-04-15 18:13:25,004 INFO L290 TraceCheckUtils]: 21: Hoare triple {17496#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {17496#true} is VALID [2022-04-15 18:13:25,005 INFO L290 TraceCheckUtils]: 22: Hoare triple {17496#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {17496#true} is VALID [2022-04-15 18:13:25,005 INFO L290 TraceCheckUtils]: 23: Hoare triple {17496#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {17496#true} is VALID [2022-04-15 18:13:25,005 INFO L290 TraceCheckUtils]: 24: Hoare triple {17496#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {17496#true} is VALID [2022-04-15 18:13:25,005 INFO L290 TraceCheckUtils]: 25: Hoare triple {17496#true} ~skip~0 := 0; {17496#true} is VALID [2022-04-15 18:13:25,005 INFO L290 TraceCheckUtils]: 26: Hoare triple {17496#true} assume !false; {17496#true} is VALID [2022-04-15 18:13:25,005 INFO L290 TraceCheckUtils]: 27: Hoare triple {17496#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {17496#true} is VALID [2022-04-15 18:13:25,006 INFO L290 TraceCheckUtils]: 28: Hoare triple {17496#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {17496#true} is VALID [2022-04-15 18:13:25,006 INFO L290 TraceCheckUtils]: 29: Hoare triple {17496#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {17496#true} is VALID [2022-04-15 18:13:25,006 INFO L290 TraceCheckUtils]: 30: Hoare triple {17496#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {17496#true} is VALID [2022-04-15 18:13:25,006 INFO L290 TraceCheckUtils]: 31: Hoare triple {17496#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {17496#true} is VALID [2022-04-15 18:13:25,006 INFO L290 TraceCheckUtils]: 32: Hoare triple {17496#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {17496#true} is VALID [2022-04-15 18:13:25,006 INFO L290 TraceCheckUtils]: 33: Hoare triple {17496#true} assume 4368 == #t~mem48;havoc #t~mem48; {17496#true} is VALID [2022-04-15 18:13:25,006 INFO L290 TraceCheckUtils]: 34: Hoare triple {17496#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {17496#true} is VALID [2022-04-15 18:13:25,006 INFO L290 TraceCheckUtils]: 35: Hoare triple {17496#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {17496#true} is VALID [2022-04-15 18:13:25,007 INFO L290 TraceCheckUtils]: 36: Hoare triple {17496#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {17501#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-15 18:13:25,008 INFO L290 TraceCheckUtils]: 37: Hoare triple {17501#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {17501#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-15 18:13:25,008 INFO L290 TraceCheckUtils]: 38: Hoare triple {17501#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {17501#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-15 18:13:25,008 INFO L290 TraceCheckUtils]: 39: Hoare triple {17501#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {17501#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-15 18:13:25,009 INFO L290 TraceCheckUtils]: 40: Hoare triple {17501#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} ~skip~0 := 0; {17501#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-15 18:13:25,009 INFO L290 TraceCheckUtils]: 41: Hoare triple {17501#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !false; {17501#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-15 18:13:25,009 INFO L290 TraceCheckUtils]: 42: Hoare triple {17501#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {17502#(= |ssl3_connect_#t~mem43| 4384)} is VALID [2022-04-15 18:13:25,010 INFO L290 TraceCheckUtils]: 43: Hoare triple {17502#(= |ssl3_connect_#t~mem43| 4384)} assume 12292 == #t~mem43;havoc #t~mem43; {17497#false} is VALID [2022-04-15 18:13:25,010 INFO L290 TraceCheckUtils]: 44: Hoare triple {17497#false} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {17497#false} is VALID [2022-04-15 18:13:25,010 INFO L290 TraceCheckUtils]: 45: Hoare triple {17497#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {17497#false} is VALID [2022-04-15 18:13:25,010 INFO L290 TraceCheckUtils]: 46: Hoare triple {17497#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {17497#false} is VALID [2022-04-15 18:13:25,010 INFO L290 TraceCheckUtils]: 47: Hoare triple {17497#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {17497#false} is VALID [2022-04-15 18:13:25,010 INFO L290 TraceCheckUtils]: 48: Hoare triple {17497#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {17497#false} is VALID [2022-04-15 18:13:25,010 INFO L290 TraceCheckUtils]: 49: Hoare triple {17497#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {17497#false} is VALID [2022-04-15 18:13:25,011 INFO L290 TraceCheckUtils]: 50: Hoare triple {17497#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {17497#false} is VALID [2022-04-15 18:13:25,011 INFO L290 TraceCheckUtils]: 51: Hoare triple {17497#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {17497#false} is VALID [2022-04-15 18:13:25,011 INFO L290 TraceCheckUtils]: 52: Hoare triple {17497#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {17497#false} is VALID [2022-04-15 18:13:25,011 INFO L290 TraceCheckUtils]: 53: Hoare triple {17497#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {17497#false} is VALID [2022-04-15 18:13:25,011 INFO L290 TraceCheckUtils]: 54: Hoare triple {17497#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {17497#false} is VALID [2022-04-15 18:13:25,011 INFO L290 TraceCheckUtils]: 55: Hoare triple {17497#false} ~skip~0 := 0; {17497#false} is VALID [2022-04-15 18:13:25,011 INFO L290 TraceCheckUtils]: 56: Hoare triple {17497#false} assume !false; {17497#false} is VALID [2022-04-15 18:13:25,011 INFO L290 TraceCheckUtils]: 57: Hoare triple {17497#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-15 18:13:25,011 INFO L290 TraceCheckUtils]: 58: Hoare triple {17497#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-15 18:13:25,011 INFO L290 TraceCheckUtils]: 59: Hoare triple {17497#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-15 18:13:25,011 INFO L290 TraceCheckUtils]: 60: Hoare triple {17497#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-15 18:13:25,011 INFO L290 TraceCheckUtils]: 61: Hoare triple {17497#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-15 18:13:25,012 INFO L290 TraceCheckUtils]: 62: Hoare triple {17497#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-15 18:13:25,012 INFO L290 TraceCheckUtils]: 63: Hoare triple {17497#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-15 18:13:25,012 INFO L290 TraceCheckUtils]: 64: Hoare triple {17497#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-15 18:13:25,012 INFO L290 TraceCheckUtils]: 65: Hoare triple {17497#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-15 18:13:25,012 INFO L290 TraceCheckUtils]: 66: Hoare triple {17497#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-15 18:13:25,012 INFO L290 TraceCheckUtils]: 67: Hoare triple {17497#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-15 18:13:25,012 INFO L290 TraceCheckUtils]: 68: Hoare triple {17497#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-15 18:13:25,012 INFO L290 TraceCheckUtils]: 69: Hoare triple {17497#false} assume 4416 == #t~mem54;havoc #t~mem54; {17497#false} is VALID [2022-04-15 18:13:25,012 INFO L290 TraceCheckUtils]: 70: Hoare triple {17497#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {17497#false} is VALID [2022-04-15 18:13:25,012 INFO L290 TraceCheckUtils]: 71: Hoare triple {17497#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {17497#false} is VALID [2022-04-15 18:13:25,012 INFO L290 TraceCheckUtils]: 72: Hoare triple {17497#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {17497#false} is VALID [2022-04-15 18:13:25,012 INFO L290 TraceCheckUtils]: 73: Hoare triple {17497#false} assume !(0 == ~tmp___6~0); {17497#false} is VALID [2022-04-15 18:13:25,013 INFO L290 TraceCheckUtils]: 74: Hoare triple {17497#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {17497#false} is VALID [2022-04-15 18:13:25,013 INFO L290 TraceCheckUtils]: 75: Hoare triple {17497#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {17497#false} is VALID [2022-04-15 18:13:25,013 INFO L290 TraceCheckUtils]: 76: Hoare triple {17497#false} ~skip~0 := 0; {17497#false} is VALID [2022-04-15 18:13:25,013 INFO L290 TraceCheckUtils]: 77: Hoare triple {17497#false} assume !false; {17497#false} is VALID [2022-04-15 18:13:25,013 INFO L290 TraceCheckUtils]: 78: Hoare triple {17497#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-15 18:13:25,013 INFO L290 TraceCheckUtils]: 79: Hoare triple {17497#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-15 18:13:25,013 INFO L290 TraceCheckUtils]: 80: Hoare triple {17497#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-15 18:13:25,013 INFO L290 TraceCheckUtils]: 81: Hoare triple {17497#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-15 18:13:25,013 INFO L290 TraceCheckUtils]: 82: Hoare triple {17497#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-15 18:13:25,013 INFO L290 TraceCheckUtils]: 83: Hoare triple {17497#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-15 18:13:25,013 INFO L290 TraceCheckUtils]: 84: Hoare triple {17497#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-15 18:13:25,014 INFO L290 TraceCheckUtils]: 85: Hoare triple {17497#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-15 18:13:25,014 INFO L290 TraceCheckUtils]: 86: Hoare triple {17497#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-15 18:13:25,014 INFO L290 TraceCheckUtils]: 87: Hoare triple {17497#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-15 18:13:25,014 INFO L290 TraceCheckUtils]: 88: Hoare triple {17497#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-15 18:13:25,014 INFO L290 TraceCheckUtils]: 89: Hoare triple {17497#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-15 18:13:25,014 INFO L290 TraceCheckUtils]: 90: Hoare triple {17497#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-15 18:13:25,014 INFO L290 TraceCheckUtils]: 91: Hoare triple {17497#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {17497#false} is VALID [2022-04-15 18:13:25,014 INFO L290 TraceCheckUtils]: 92: Hoare triple {17497#false} assume 4432 == #t~mem56;havoc #t~mem56; {17497#false} is VALID [2022-04-15 18:13:25,014 INFO L290 TraceCheckUtils]: 93: Hoare triple {17497#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {17497#false} is VALID [2022-04-15 18:13:25,014 INFO L290 TraceCheckUtils]: 94: Hoare triple {17497#false} assume 5 == ~blastFlag~0; {17497#false} is VALID [2022-04-15 18:13:25,014 INFO L290 TraceCheckUtils]: 95: Hoare triple {17497#false} assume !false; {17497#false} is VALID [2022-04-15 18:13:25,015 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-15 18:13:25,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:13:25,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995788359] [2022-04-15 18:13:25,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995788359] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:13:25,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:13:25,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:13:25,015 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:13:25,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1217180234] [2022-04-15 18:13:25,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1217180234] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:13:25,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:13:25,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:13:25,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154649969] [2022-04-15 18:13:25,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:13:25,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2022-04-15 18:13:25,017 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:13:25,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:13:25,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:13:25,090 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:13:25,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:13:25,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:13:25,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:13:25,091 INFO L87 Difference]: Start difference. First operand 398 states and 626 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:13:27,120 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-15 18:13:28,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:13:28,287 INFO L93 Difference]: Finished difference Result 616 states and 970 transitions. [2022-04-15 18:13:28,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:13:28,288 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2022-04-15 18:13:28,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:13:28,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:13:28,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 388 transitions. [2022-04-15 18:13:28,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:13:28,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 388 transitions. [2022-04-15 18:13:28,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 388 transitions. [2022-04-15 18:13:28,623 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 388 edges. 388 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:13:28,637 INFO L225 Difference]: With dead ends: 616 [2022-04-15 18:13:28,637 INFO L226 Difference]: Without dead ends: 414 [2022-04-15 18:13:28,638 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:13:28,639 INFO L913 BasicCegarLoop]: 200 mSDtfsCounter, 37 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 18:13:28,639 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 490 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 354 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 18:13:28,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2022-04-15 18:13:28,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 398. [2022-04-15 18:13:28,679 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:13:28,684 INFO L82 GeneralOperation]: Start isEquivalent. First operand 414 states. Second operand has 398 states, 393 states have (on average 1.5801526717557253) internal successors, (621), 393 states have internal predecessors, (621), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:13:28,686 INFO L74 IsIncluded]: Start isIncluded. First operand 414 states. Second operand has 398 states, 393 states have (on average 1.5801526717557253) internal successors, (621), 393 states have internal predecessors, (621), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:13:28,687 INFO L87 Difference]: Start difference. First operand 414 states. Second operand has 398 states, 393 states have (on average 1.5801526717557253) internal successors, (621), 393 states have internal predecessors, (621), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:13:28,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:13:28,699 INFO L93 Difference]: Finished difference Result 414 states and 646 transitions. [2022-04-15 18:13:28,699 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 646 transitions. [2022-04-15 18:13:28,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:13:28,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:13:28,701 INFO L74 IsIncluded]: Start isIncluded. First operand has 398 states, 393 states have (on average 1.5801526717557253) internal successors, (621), 393 states have internal predecessors, (621), 3 states have call successors, (3), 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 414 states. [2022-04-15 18:13:28,703 INFO L87 Difference]: Start difference. First operand has 398 states, 393 states have (on average 1.5801526717557253) internal successors, (621), 393 states have internal predecessors, (621), 3 states have call successors, (3), 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 414 states. [2022-04-15 18:13:28,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:13:28,714 INFO L93 Difference]: Finished difference Result 414 states and 646 transitions. [2022-04-15 18:13:28,714 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 646 transitions. [2022-04-15 18:13:28,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:13:28,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:13:28,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:13:28,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:13:28,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 393 states have (on average 1.5801526717557253) internal successors, (621), 393 states have internal predecessors, (621), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:13:28,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 625 transitions. [2022-04-15 18:13:28,729 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 625 transitions. Word has length 96 [2022-04-15 18:13:28,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:13:28,729 INFO L478 AbstractCegarLoop]: Abstraction has 398 states and 625 transitions. [2022-04-15 18:13:28,729 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:13:28,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 398 states and 625 transitions. [2022-04-15 18:13:29,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 625 edges. 625 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:13:29,265 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 625 transitions. [2022-04-15 18:13:29,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-04-15 18:13:29,266 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:13:29,266 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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-15 18:13:29,266 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 18:13:29,266 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:13:29,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:13:29,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1141442077, now seen corresponding path program 1 times [2022-04-15 18:13:29,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:13:29,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [876774830] [2022-04-15 18:13:34,787 WARN L232 SmtUtils]: Spent 5.50s on a formula simplification. DAG size of input: 189 DAG size of output: 186 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 18:13:52,881 WARN L232 SmtUtils]: Spent 16.00s on a formula simplification that was a NOOP. DAG size: 241 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 18:14:07,513 WARN L232 SmtUtils]: Spent 9.57s on a formula simplification that was a NOOP. DAG size: 166 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 18:14:09,129 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:14:09,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1141442077, now seen corresponding path program 2 times [2022-04-15 18:14:09,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:14:09,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129285853] [2022-04-15 18:14:09,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:14:09,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:14:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:14:09,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:14:09,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:14:09,512 INFO L290 TraceCheckUtils]: 0: Hoare triple {20371#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {20364#true} is VALID [2022-04-15 18:14:09,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {20364#true} assume true; {20364#true} is VALID [2022-04-15 18:14:09,512 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20364#true} {20364#true} #591#return; {20364#true} is VALID [2022-04-15 18:14:09,513 INFO L272 TraceCheckUtils]: 0: Hoare triple {20364#true} call ULTIMATE.init(); {20371#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:14:09,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {20371#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {20364#true} is VALID [2022-04-15 18:14:09,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {20364#true} assume true; {20364#true} is VALID [2022-04-15 18:14:09,513 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20364#true} {20364#true} #591#return; {20364#true} is VALID [2022-04-15 18:14:09,513 INFO L272 TraceCheckUtils]: 4: Hoare triple {20364#true} call #t~ret159 := main(); {20364#true} is VALID [2022-04-15 18:14:09,513 INFO L290 TraceCheckUtils]: 5: Hoare triple {20364#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {20364#true} is VALID [2022-04-15 18:14:09,513 INFO L272 TraceCheckUtils]: 6: Hoare triple {20364#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {20364#true} is VALID [2022-04-15 18:14:09,513 INFO L290 TraceCheckUtils]: 7: Hoare triple {20364#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {20364#true} is VALID [2022-04-15 18:14:09,513 INFO L290 TraceCheckUtils]: 8: Hoare triple {20364#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {20364#true} is VALID [2022-04-15 18:14:09,514 INFO L290 TraceCheckUtils]: 9: Hoare triple {20364#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {20364#true} is VALID [2022-04-15 18:14:09,514 INFO L290 TraceCheckUtils]: 10: Hoare triple {20364#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {20364#true} is VALID [2022-04-15 18:14:09,514 INFO L290 TraceCheckUtils]: 11: Hoare triple {20364#true} assume !false; {20364#true} is VALID [2022-04-15 18:14:09,514 INFO L290 TraceCheckUtils]: 12: Hoare triple {20364#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {20364#true} is VALID [2022-04-15 18:14:09,514 INFO L290 TraceCheckUtils]: 13: Hoare triple {20364#true} assume 12292 == #t~mem43;havoc #t~mem43; {20364#true} is VALID [2022-04-15 18:14:09,514 INFO L290 TraceCheckUtils]: 14: Hoare triple {20364#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {20364#true} is VALID [2022-04-15 18:14:09,514 INFO L290 TraceCheckUtils]: 15: Hoare triple {20364#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {20364#true} is VALID [2022-04-15 18:14:09,514 INFO L290 TraceCheckUtils]: 16: Hoare triple {20364#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {20364#true} is VALID [2022-04-15 18:14:09,514 INFO L290 TraceCheckUtils]: 17: Hoare triple {20364#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {20364#true} is VALID [2022-04-15 18:14:09,514 INFO L290 TraceCheckUtils]: 18: Hoare triple {20364#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {20364#true} is VALID [2022-04-15 18:14:09,514 INFO L290 TraceCheckUtils]: 19: Hoare triple {20364#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {20364#true} is VALID [2022-04-15 18:14:09,514 INFO L290 TraceCheckUtils]: 20: Hoare triple {20364#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {20364#true} is VALID [2022-04-15 18:14:09,515 INFO L290 TraceCheckUtils]: 21: Hoare triple {20364#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {20364#true} is VALID [2022-04-15 18:14:09,515 INFO L290 TraceCheckUtils]: 22: Hoare triple {20364#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {20364#true} is VALID [2022-04-15 18:14:09,515 INFO L290 TraceCheckUtils]: 23: Hoare triple {20364#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {20364#true} is VALID [2022-04-15 18:14:09,515 INFO L290 TraceCheckUtils]: 24: Hoare triple {20364#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {20364#true} is VALID [2022-04-15 18:14:09,515 INFO L290 TraceCheckUtils]: 25: Hoare triple {20364#true} ~skip~0 := 0; {20364#true} is VALID [2022-04-15 18:14:09,515 INFO L290 TraceCheckUtils]: 26: Hoare triple {20364#true} assume !false; {20364#true} is VALID [2022-04-15 18:14:09,515 INFO L290 TraceCheckUtils]: 27: Hoare triple {20364#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {20364#true} is VALID [2022-04-15 18:14:09,515 INFO L290 TraceCheckUtils]: 28: Hoare triple {20364#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {20364#true} is VALID [2022-04-15 18:14:09,515 INFO L290 TraceCheckUtils]: 29: Hoare triple {20364#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {20364#true} is VALID [2022-04-15 18:14:09,515 INFO L290 TraceCheckUtils]: 30: Hoare triple {20364#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {20364#true} is VALID [2022-04-15 18:14:09,515 INFO L290 TraceCheckUtils]: 31: Hoare triple {20364#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {20364#true} is VALID [2022-04-15 18:14:09,515 INFO L290 TraceCheckUtils]: 32: Hoare triple {20364#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {20364#true} is VALID [2022-04-15 18:14:09,516 INFO L290 TraceCheckUtils]: 33: Hoare triple {20364#true} assume 4368 == #t~mem48;havoc #t~mem48; {20364#true} is VALID [2022-04-15 18:14:09,516 INFO L290 TraceCheckUtils]: 34: Hoare triple {20364#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {20364#true} is VALID [2022-04-15 18:14:09,516 INFO L290 TraceCheckUtils]: 35: Hoare triple {20364#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {20364#true} is VALID [2022-04-15 18:14:09,517 INFO L290 TraceCheckUtils]: 36: Hoare triple {20364#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {20369#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-15 18:14:09,517 INFO L290 TraceCheckUtils]: 37: Hoare triple {20369#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {20369#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-15 18:14:09,518 INFO L290 TraceCheckUtils]: 38: Hoare triple {20369#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {20369#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-15 18:14:09,518 INFO L290 TraceCheckUtils]: 39: Hoare triple {20369#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {20369#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-15 18:14:09,518 INFO L290 TraceCheckUtils]: 40: Hoare triple {20369#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} ~skip~0 := 0; {20369#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-15 18:14:09,519 INFO L290 TraceCheckUtils]: 41: Hoare triple {20369#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !false; {20369#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-15 18:14:09,519 INFO L290 TraceCheckUtils]: 42: Hoare triple {20369#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {20369#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-15 18:14:09,519 INFO L290 TraceCheckUtils]: 43: Hoare triple {20369#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {20370#(= |ssl3_connect_#t~mem44| 4384)} is VALID [2022-04-15 18:14:09,520 INFO L290 TraceCheckUtils]: 44: Hoare triple {20370#(= |ssl3_connect_#t~mem44| 4384)} assume 16384 == #t~mem44;havoc #t~mem44; {20365#false} is VALID [2022-04-15 18:14:09,520 INFO L290 TraceCheckUtils]: 45: Hoare triple {20365#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {20365#false} is VALID [2022-04-15 18:14:09,520 INFO L290 TraceCheckUtils]: 46: Hoare triple {20365#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {20365#false} is VALID [2022-04-15 18:14:09,520 INFO L290 TraceCheckUtils]: 47: Hoare triple {20365#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {20365#false} is VALID [2022-04-15 18:14:09,520 INFO L290 TraceCheckUtils]: 48: Hoare triple {20365#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {20365#false} is VALID [2022-04-15 18:14:09,520 INFO L290 TraceCheckUtils]: 49: Hoare triple {20365#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {20365#false} is VALID [2022-04-15 18:14:09,520 INFO L290 TraceCheckUtils]: 50: Hoare triple {20365#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {20365#false} is VALID [2022-04-15 18:14:09,520 INFO L290 TraceCheckUtils]: 51: Hoare triple {20365#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {20365#false} is VALID [2022-04-15 18:14:09,521 INFO L290 TraceCheckUtils]: 52: Hoare triple {20365#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {20365#false} is VALID [2022-04-15 18:14:09,521 INFO L290 TraceCheckUtils]: 53: Hoare triple {20365#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {20365#false} is VALID [2022-04-15 18:14:09,521 INFO L290 TraceCheckUtils]: 54: Hoare triple {20365#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {20365#false} is VALID [2022-04-15 18:14:09,521 INFO L290 TraceCheckUtils]: 55: Hoare triple {20365#false} ~skip~0 := 0; {20365#false} is VALID [2022-04-15 18:14:09,521 INFO L290 TraceCheckUtils]: 56: Hoare triple {20365#false} assume !false; {20365#false} is VALID [2022-04-15 18:14:09,521 INFO L290 TraceCheckUtils]: 57: Hoare triple {20365#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-15 18:14:09,521 INFO L290 TraceCheckUtils]: 58: Hoare triple {20365#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-15 18:14:09,521 INFO L290 TraceCheckUtils]: 59: Hoare triple {20365#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-15 18:14:09,521 INFO L290 TraceCheckUtils]: 60: Hoare triple {20365#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-15 18:14:09,521 INFO L290 TraceCheckUtils]: 61: Hoare triple {20365#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-15 18:14:09,521 INFO L290 TraceCheckUtils]: 62: Hoare triple {20365#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-15 18:14:09,521 INFO L290 TraceCheckUtils]: 63: Hoare triple {20365#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-15 18:14:09,522 INFO L290 TraceCheckUtils]: 64: Hoare triple {20365#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-15 18:14:09,522 INFO L290 TraceCheckUtils]: 65: Hoare triple {20365#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-15 18:14:09,522 INFO L290 TraceCheckUtils]: 66: Hoare triple {20365#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-15 18:14:09,522 INFO L290 TraceCheckUtils]: 67: Hoare triple {20365#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-15 18:14:09,522 INFO L290 TraceCheckUtils]: 68: Hoare triple {20365#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-15 18:14:09,522 INFO L290 TraceCheckUtils]: 69: Hoare triple {20365#false} assume 4416 == #t~mem54;havoc #t~mem54; {20365#false} is VALID [2022-04-15 18:14:09,522 INFO L290 TraceCheckUtils]: 70: Hoare triple {20365#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {20365#false} is VALID [2022-04-15 18:14:09,522 INFO L290 TraceCheckUtils]: 71: Hoare triple {20365#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {20365#false} is VALID [2022-04-15 18:14:09,522 INFO L290 TraceCheckUtils]: 72: Hoare triple {20365#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {20365#false} is VALID [2022-04-15 18:14:09,522 INFO L290 TraceCheckUtils]: 73: Hoare triple {20365#false} assume !(0 == ~tmp___6~0); {20365#false} is VALID [2022-04-15 18:14:09,522 INFO L290 TraceCheckUtils]: 74: Hoare triple {20365#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {20365#false} is VALID [2022-04-15 18:14:09,522 INFO L290 TraceCheckUtils]: 75: Hoare triple {20365#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {20365#false} is VALID [2022-04-15 18:14:09,523 INFO L290 TraceCheckUtils]: 76: Hoare triple {20365#false} ~skip~0 := 0; {20365#false} is VALID [2022-04-15 18:14:09,523 INFO L290 TraceCheckUtils]: 77: Hoare triple {20365#false} assume !false; {20365#false} is VALID [2022-04-15 18:14:09,523 INFO L290 TraceCheckUtils]: 78: Hoare triple {20365#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-15 18:14:09,523 INFO L290 TraceCheckUtils]: 79: Hoare triple {20365#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-15 18:14:09,523 INFO L290 TraceCheckUtils]: 80: Hoare triple {20365#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-15 18:14:09,523 INFO L290 TraceCheckUtils]: 81: Hoare triple {20365#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-15 18:14:09,523 INFO L290 TraceCheckUtils]: 82: Hoare triple {20365#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-15 18:14:09,523 INFO L290 TraceCheckUtils]: 83: Hoare triple {20365#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-15 18:14:09,523 INFO L290 TraceCheckUtils]: 84: Hoare triple {20365#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-15 18:14:09,523 INFO L290 TraceCheckUtils]: 85: Hoare triple {20365#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-15 18:14:09,523 INFO L290 TraceCheckUtils]: 86: Hoare triple {20365#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-15 18:14:09,524 INFO L290 TraceCheckUtils]: 87: Hoare triple {20365#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-15 18:14:09,524 INFO L290 TraceCheckUtils]: 88: Hoare triple {20365#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-15 18:14:09,524 INFO L290 TraceCheckUtils]: 89: Hoare triple {20365#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-15 18:14:09,524 INFO L290 TraceCheckUtils]: 90: Hoare triple {20365#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-15 18:14:09,524 INFO L290 TraceCheckUtils]: 91: Hoare triple {20365#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {20365#false} is VALID [2022-04-15 18:14:09,524 INFO L290 TraceCheckUtils]: 92: Hoare triple {20365#false} assume 4432 == #t~mem56;havoc #t~mem56; {20365#false} is VALID [2022-04-15 18:14:09,524 INFO L290 TraceCheckUtils]: 93: Hoare triple {20365#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {20365#false} is VALID [2022-04-15 18:14:09,524 INFO L290 TraceCheckUtils]: 94: Hoare triple {20365#false} assume 5 == ~blastFlag~0; {20365#false} is VALID [2022-04-15 18:14:09,524 INFO L290 TraceCheckUtils]: 95: Hoare triple {20365#false} assume !false; {20365#false} is VALID [2022-04-15 18:14:09,524 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-15 18:14:09,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:14:09,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129285853] [2022-04-15 18:14:09,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129285853] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:14:09,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:14:09,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:14:09,525 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:14:09,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [876774830] [2022-04-15 18:14:09,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [876774830] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:14:09,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:14:09,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:14:09,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211578874] [2022-04-15 18:14:09,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:14:09,526 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2022-04-15 18:14:09,526 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:14:09,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:14:09,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:14:09,640 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:14:09,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:14:09,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:14:09,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:14:09,642 INFO L87 Difference]: Start difference. First operand 398 states and 625 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:14:11,680 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-15 18:14:13,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:14:13,344 INFO L93 Difference]: Finished difference Result 616 states and 968 transitions. [2022-04-15 18:14:13,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:14:13,344 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2022-04-15 18:14:13,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:14:13,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:14:13,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 387 transitions. [2022-04-15 18:14:13,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:14:13,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 387 transitions. [2022-04-15 18:14:13,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 387 transitions. [2022-04-15 18:14:13,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 387 edges. 387 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:14:13,926 INFO L225 Difference]: With dead ends: 616 [2022-04-15 18:14:13,926 INFO L226 Difference]: Without dead ends: 414 [2022-04-15 18:14:13,927 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:14:13,930 INFO L913 BasicCegarLoop]: 199 mSDtfsCounter, 35 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-15 18:14:13,930 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 488 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 353 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-04-15 18:14:13,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2022-04-15 18:14:13,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 398. [2022-04-15 18:14:13,949 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:14:13,949 INFO L82 GeneralOperation]: Start isEquivalent. First operand 414 states. Second operand has 398 states, 393 states have (on average 1.5776081424936388) internal successors, (620), 393 states have internal predecessors, (620), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:14:13,950 INFO L74 IsIncluded]: Start isIncluded. First operand 414 states. Second operand has 398 states, 393 states have (on average 1.5776081424936388) internal successors, (620), 393 states have internal predecessors, (620), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:14:13,952 INFO L87 Difference]: Start difference. First operand 414 states. Second operand has 398 states, 393 states have (on average 1.5776081424936388) internal successors, (620), 393 states have internal predecessors, (620), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:14:13,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:14:13,964 INFO L93 Difference]: Finished difference Result 414 states and 645 transitions. [2022-04-15 18:14:13,964 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 645 transitions. [2022-04-15 18:14:13,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:14:13,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:14:13,966 INFO L74 IsIncluded]: Start isIncluded. First operand has 398 states, 393 states have (on average 1.5776081424936388) internal successors, (620), 393 states have internal predecessors, (620), 3 states have call successors, (3), 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 414 states. [2022-04-15 18:14:13,966 INFO L87 Difference]: Start difference. First operand has 398 states, 393 states have (on average 1.5776081424936388) internal successors, (620), 393 states have internal predecessors, (620), 3 states have call successors, (3), 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 414 states. [2022-04-15 18:14:13,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:14:13,978 INFO L93 Difference]: Finished difference Result 414 states and 645 transitions. [2022-04-15 18:14:13,978 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 645 transitions. [2022-04-15 18:14:13,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:14:13,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:14:13,979 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:14:13,979 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:14:13,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 393 states have (on average 1.5776081424936388) internal successors, (620), 393 states have internal predecessors, (620), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:14:13,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 624 transitions. [2022-04-15 18:14:13,993 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 624 transitions. Word has length 96 [2022-04-15 18:14:13,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:14:13,994 INFO L478 AbstractCegarLoop]: Abstraction has 398 states and 624 transitions. [2022-04-15 18:14:13,994 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:14:13,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 398 states and 624 transitions. [2022-04-15 18:14:14,850 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 624 edges. 624 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:14:14,851 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 624 transitions. [2022-04-15 18:14:14,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-15 18:14:14,852 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:14:14,852 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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-15 18:14:14,852 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 18:14:14,852 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:14:14,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:14:14,853 INFO L85 PathProgramCache]: Analyzing trace with hash 2018061342, now seen corresponding path program 1 times [2022-04-15 18:14:14,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:14:14,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [402572040] [2022-04-15 18:14:21,613 WARN L232 SmtUtils]: Spent 6.74s on a formula simplification. DAG size of input: 193 DAG size of output: 187 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 18:14:38,243 WARN L232 SmtUtils]: Spent 14.55s on a formula simplification that was a NOOP. DAG size: 241 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 18:14:50,804 WARN L232 SmtUtils]: Spent 7.79s on a formula simplification that was a NOOP. DAG size: 166 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 18:14:52,483 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:14:52,483 INFO L85 PathProgramCache]: Analyzing trace with hash 2018061342, now seen corresponding path program 2 times [2022-04-15 18:14:52,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:14:52,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503571311] [2022-04-15 18:14:52,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:14:52,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:14:52,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:14:52,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:14:52,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:14:52,840 INFO L290 TraceCheckUtils]: 0: Hoare triple {23239#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {23232#true} is VALID [2022-04-15 18:14:52,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {23232#true} assume true; {23232#true} is VALID [2022-04-15 18:14:52,841 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23232#true} {23232#true} #591#return; {23232#true} is VALID [2022-04-15 18:14:52,842 INFO L272 TraceCheckUtils]: 0: Hoare triple {23232#true} call ULTIMATE.init(); {23239#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:14:52,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {23239#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {23232#true} is VALID [2022-04-15 18:14:52,842 INFO L290 TraceCheckUtils]: 2: Hoare triple {23232#true} assume true; {23232#true} is VALID [2022-04-15 18:14:52,842 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23232#true} {23232#true} #591#return; {23232#true} is VALID [2022-04-15 18:14:52,842 INFO L272 TraceCheckUtils]: 4: Hoare triple {23232#true} call #t~ret159 := main(); {23232#true} is VALID [2022-04-15 18:14:52,842 INFO L290 TraceCheckUtils]: 5: Hoare triple {23232#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {23232#true} is VALID [2022-04-15 18:14:52,842 INFO L272 TraceCheckUtils]: 6: Hoare triple {23232#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {23232#true} is VALID [2022-04-15 18:14:52,842 INFO L290 TraceCheckUtils]: 7: Hoare triple {23232#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {23232#true} is VALID [2022-04-15 18:14:52,842 INFO L290 TraceCheckUtils]: 8: Hoare triple {23232#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {23232#true} is VALID [2022-04-15 18:14:52,842 INFO L290 TraceCheckUtils]: 9: Hoare triple {23232#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {23232#true} is VALID [2022-04-15 18:14:52,843 INFO L290 TraceCheckUtils]: 10: Hoare triple {23232#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {23232#true} is VALID [2022-04-15 18:14:52,843 INFO L290 TraceCheckUtils]: 11: Hoare triple {23232#true} assume !false; {23232#true} is VALID [2022-04-15 18:14:52,843 INFO L290 TraceCheckUtils]: 12: Hoare triple {23232#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {23232#true} is VALID [2022-04-15 18:14:52,843 INFO L290 TraceCheckUtils]: 13: Hoare triple {23232#true} assume 12292 == #t~mem43;havoc #t~mem43; {23232#true} is VALID [2022-04-15 18:14:52,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {23232#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {23232#true} is VALID [2022-04-15 18:14:52,843 INFO L290 TraceCheckUtils]: 15: Hoare triple {23232#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {23232#true} is VALID [2022-04-15 18:14:52,843 INFO L290 TraceCheckUtils]: 16: Hoare triple {23232#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {23232#true} is VALID [2022-04-15 18:14:52,843 INFO L290 TraceCheckUtils]: 17: Hoare triple {23232#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {23232#true} is VALID [2022-04-15 18:14:52,843 INFO L290 TraceCheckUtils]: 18: Hoare triple {23232#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {23232#true} is VALID [2022-04-15 18:14:52,843 INFO L290 TraceCheckUtils]: 19: Hoare triple {23232#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {23232#true} is VALID [2022-04-15 18:14:52,843 INFO L290 TraceCheckUtils]: 20: Hoare triple {23232#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {23232#true} is VALID [2022-04-15 18:14:52,844 INFO L290 TraceCheckUtils]: 21: Hoare triple {23232#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {23232#true} is VALID [2022-04-15 18:14:52,844 INFO L290 TraceCheckUtils]: 22: Hoare triple {23232#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {23232#true} is VALID [2022-04-15 18:14:52,844 INFO L290 TraceCheckUtils]: 23: Hoare triple {23232#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {23232#true} is VALID [2022-04-15 18:14:52,844 INFO L290 TraceCheckUtils]: 24: Hoare triple {23232#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {23232#true} is VALID [2022-04-15 18:14:52,844 INFO L290 TraceCheckUtils]: 25: Hoare triple {23232#true} ~skip~0 := 0; {23232#true} is VALID [2022-04-15 18:14:52,844 INFO L290 TraceCheckUtils]: 26: Hoare triple {23232#true} assume !false; {23232#true} is VALID [2022-04-15 18:14:52,844 INFO L290 TraceCheckUtils]: 27: Hoare triple {23232#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {23232#true} is VALID [2022-04-15 18:14:52,844 INFO L290 TraceCheckUtils]: 28: Hoare triple {23232#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {23232#true} is VALID [2022-04-15 18:14:52,844 INFO L290 TraceCheckUtils]: 29: Hoare triple {23232#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {23232#true} is VALID [2022-04-15 18:14:52,844 INFO L290 TraceCheckUtils]: 30: Hoare triple {23232#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {23232#true} is VALID [2022-04-15 18:14:52,844 INFO L290 TraceCheckUtils]: 31: Hoare triple {23232#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {23232#true} is VALID [2022-04-15 18:14:52,844 INFO L290 TraceCheckUtils]: 32: Hoare triple {23232#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {23232#true} is VALID [2022-04-15 18:14:52,845 INFO L290 TraceCheckUtils]: 33: Hoare triple {23232#true} assume 4368 == #t~mem48;havoc #t~mem48; {23232#true} is VALID [2022-04-15 18:14:52,845 INFO L290 TraceCheckUtils]: 34: Hoare triple {23232#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {23232#true} is VALID [2022-04-15 18:14:52,845 INFO L290 TraceCheckUtils]: 35: Hoare triple {23232#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {23232#true} is VALID [2022-04-15 18:14:52,846 INFO L290 TraceCheckUtils]: 36: Hoare triple {23232#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {23237#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-15 18:14:52,846 INFO L290 TraceCheckUtils]: 37: Hoare triple {23237#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {23237#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-15 18:14:52,847 INFO L290 TraceCheckUtils]: 38: Hoare triple {23237#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {23237#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-15 18:14:52,847 INFO L290 TraceCheckUtils]: 39: Hoare triple {23237#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {23237#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-15 18:14:52,847 INFO L290 TraceCheckUtils]: 40: Hoare triple {23237#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} ~skip~0 := 0; {23237#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-15 18:14:52,848 INFO L290 TraceCheckUtils]: 41: Hoare triple {23237#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !false; {23237#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-15 18:14:52,848 INFO L290 TraceCheckUtils]: 42: Hoare triple {23237#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {23237#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-15 18:14:52,848 INFO L290 TraceCheckUtils]: 43: Hoare triple {23237#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {23237#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-15 18:14:52,849 INFO L290 TraceCheckUtils]: 44: Hoare triple {23237#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {23238#(= |ssl3_connect_#t~mem45| 4384)} is VALID [2022-04-15 18:14:52,849 INFO L290 TraceCheckUtils]: 45: Hoare triple {23238#(= |ssl3_connect_#t~mem45| 4384)} assume 4096 == #t~mem45;havoc #t~mem45; {23233#false} is VALID [2022-04-15 18:14:52,849 INFO L290 TraceCheckUtils]: 46: Hoare triple {23233#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {23233#false} is VALID [2022-04-15 18:14:52,849 INFO L290 TraceCheckUtils]: 47: Hoare triple {23233#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {23233#false} is VALID [2022-04-15 18:14:52,849 INFO L290 TraceCheckUtils]: 48: Hoare triple {23233#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {23233#false} is VALID [2022-04-15 18:14:52,849 INFO L290 TraceCheckUtils]: 49: Hoare triple {23233#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {23233#false} is VALID [2022-04-15 18:14:52,849 INFO L290 TraceCheckUtils]: 50: Hoare triple {23233#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {23233#false} is VALID [2022-04-15 18:14:52,850 INFO L290 TraceCheckUtils]: 51: Hoare triple {23233#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {23233#false} is VALID [2022-04-15 18:14:52,850 INFO L290 TraceCheckUtils]: 52: Hoare triple {23233#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {23233#false} is VALID [2022-04-15 18:14:52,850 INFO L290 TraceCheckUtils]: 53: Hoare triple {23233#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {23233#false} is VALID [2022-04-15 18:14:52,850 INFO L290 TraceCheckUtils]: 54: Hoare triple {23233#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {23233#false} is VALID [2022-04-15 18:14:52,850 INFO L290 TraceCheckUtils]: 55: Hoare triple {23233#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {23233#false} is VALID [2022-04-15 18:14:52,850 INFO L290 TraceCheckUtils]: 56: Hoare triple {23233#false} ~skip~0 := 0; {23233#false} is VALID [2022-04-15 18:14:52,850 INFO L290 TraceCheckUtils]: 57: Hoare triple {23233#false} assume !false; {23233#false} is VALID [2022-04-15 18:14:52,850 INFO L290 TraceCheckUtils]: 58: Hoare triple {23233#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-15 18:14:52,850 INFO L290 TraceCheckUtils]: 59: Hoare triple {23233#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-15 18:14:52,850 INFO L290 TraceCheckUtils]: 60: Hoare triple {23233#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-15 18:14:52,850 INFO L290 TraceCheckUtils]: 61: Hoare triple {23233#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-15 18:14:52,850 INFO L290 TraceCheckUtils]: 62: Hoare triple {23233#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-15 18:14:52,850 INFO L290 TraceCheckUtils]: 63: Hoare triple {23233#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-15 18:14:52,851 INFO L290 TraceCheckUtils]: 64: Hoare triple {23233#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-15 18:14:52,851 INFO L290 TraceCheckUtils]: 65: Hoare triple {23233#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-15 18:14:52,851 INFO L290 TraceCheckUtils]: 66: Hoare triple {23233#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-15 18:14:52,851 INFO L290 TraceCheckUtils]: 67: Hoare triple {23233#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-15 18:14:52,851 INFO L290 TraceCheckUtils]: 68: Hoare triple {23233#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-15 18:14:52,851 INFO L290 TraceCheckUtils]: 69: Hoare triple {23233#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-15 18:14:52,851 INFO L290 TraceCheckUtils]: 70: Hoare triple {23233#false} assume 4416 == #t~mem54;havoc #t~mem54; {23233#false} is VALID [2022-04-15 18:14:52,851 INFO L290 TraceCheckUtils]: 71: Hoare triple {23233#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {23233#false} is VALID [2022-04-15 18:14:52,851 INFO L290 TraceCheckUtils]: 72: Hoare triple {23233#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {23233#false} is VALID [2022-04-15 18:14:52,851 INFO L290 TraceCheckUtils]: 73: Hoare triple {23233#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {23233#false} is VALID [2022-04-15 18:14:52,851 INFO L290 TraceCheckUtils]: 74: Hoare triple {23233#false} assume !(0 == ~tmp___6~0); {23233#false} is VALID [2022-04-15 18:14:52,851 INFO L290 TraceCheckUtils]: 75: Hoare triple {23233#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {23233#false} is VALID [2022-04-15 18:14:52,852 INFO L290 TraceCheckUtils]: 76: Hoare triple {23233#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {23233#false} is VALID [2022-04-15 18:14:52,852 INFO L290 TraceCheckUtils]: 77: Hoare triple {23233#false} ~skip~0 := 0; {23233#false} is VALID [2022-04-15 18:14:52,852 INFO L290 TraceCheckUtils]: 78: Hoare triple {23233#false} assume !false; {23233#false} is VALID [2022-04-15 18:14:52,852 INFO L290 TraceCheckUtils]: 79: Hoare triple {23233#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-15 18:14:52,852 INFO L290 TraceCheckUtils]: 80: Hoare triple {23233#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-15 18:14:52,852 INFO L290 TraceCheckUtils]: 81: Hoare triple {23233#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-15 18:14:52,852 INFO L290 TraceCheckUtils]: 82: Hoare triple {23233#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-15 18:14:52,852 INFO L290 TraceCheckUtils]: 83: Hoare triple {23233#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-15 18:14:52,852 INFO L290 TraceCheckUtils]: 84: Hoare triple {23233#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-15 18:14:52,852 INFO L290 TraceCheckUtils]: 85: Hoare triple {23233#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-15 18:14:52,852 INFO L290 TraceCheckUtils]: 86: Hoare triple {23233#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-15 18:14:52,852 INFO L290 TraceCheckUtils]: 87: Hoare triple {23233#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-15 18:14:52,852 INFO L290 TraceCheckUtils]: 88: Hoare triple {23233#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-15 18:14:52,853 INFO L290 TraceCheckUtils]: 89: Hoare triple {23233#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-15 18:14:52,853 INFO L290 TraceCheckUtils]: 90: Hoare triple {23233#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-15 18:14:52,853 INFO L290 TraceCheckUtils]: 91: Hoare triple {23233#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-15 18:14:52,853 INFO L290 TraceCheckUtils]: 92: Hoare triple {23233#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {23233#false} is VALID [2022-04-15 18:14:52,853 INFO L290 TraceCheckUtils]: 93: Hoare triple {23233#false} assume 4432 == #t~mem56;havoc #t~mem56; {23233#false} is VALID [2022-04-15 18:14:52,853 INFO L290 TraceCheckUtils]: 94: Hoare triple {23233#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {23233#false} is VALID [2022-04-15 18:14:52,853 INFO L290 TraceCheckUtils]: 95: Hoare triple {23233#false} assume 5 == ~blastFlag~0; {23233#false} is VALID [2022-04-15 18:14:52,853 INFO L290 TraceCheckUtils]: 96: Hoare triple {23233#false} assume !false; {23233#false} is VALID [2022-04-15 18:14:52,854 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-15 18:14:52,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:14:52,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503571311] [2022-04-15 18:14:52,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503571311] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:14:52,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:14:52,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:14:52,855 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:14:52,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [402572040] [2022-04-15 18:14:52,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [402572040] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:14:52,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:14:52,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:14:52,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223336449] [2022-04-15 18:14:52,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:14:52,856 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2022-04-15 18:14:52,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:14:52,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:14:52,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:14:52,939 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:14:52,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:14:52,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:14:52,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:14:52,940 INFO L87 Difference]: Start difference. First operand 398 states and 624 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:14:54,986 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-15 18:14:56,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:14:56,542 INFO L93 Difference]: Finished difference Result 616 states and 966 transitions. [2022-04-15 18:14:56,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:14:56,542 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2022-04-15 18:14:56,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:14:56,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:14:56,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 386 transitions. [2022-04-15 18:14:56,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:14:56,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 386 transitions. [2022-04-15 18:14:56,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 386 transitions. [2022-04-15 18:14:56,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 386 edges. 386 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:14:56,872 INFO L225 Difference]: With dead ends: 616 [2022-04-15 18:14:56,872 INFO L226 Difference]: Without dead ends: 414 [2022-04-15 18:14:56,873 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:14:56,873 INFO L913 BasicCegarLoop]: 198 mSDtfsCounter, 33 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-15 18:14:56,874 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 486 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 352 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-04-15 18:14:56,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2022-04-15 18:14:56,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 398. [2022-04-15 18:14:56,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:14:56,892 INFO L82 GeneralOperation]: Start isEquivalent. First operand 414 states. Second operand has 398 states, 393 states have (on average 1.575063613231552) internal successors, (619), 393 states have internal predecessors, (619), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:14:56,893 INFO L74 IsIncluded]: Start isIncluded. First operand 414 states. Second operand has 398 states, 393 states have (on average 1.575063613231552) internal successors, (619), 393 states have internal predecessors, (619), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:14:56,894 INFO L87 Difference]: Start difference. First operand 414 states. Second operand has 398 states, 393 states have (on average 1.575063613231552) internal successors, (619), 393 states have internal predecessors, (619), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:14:56,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:14:56,922 INFO L93 Difference]: Finished difference Result 414 states and 644 transitions. [2022-04-15 18:14:56,922 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 644 transitions. [2022-04-15 18:14:56,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:14:56,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:14:56,924 INFO L74 IsIncluded]: Start isIncluded. First operand has 398 states, 393 states have (on average 1.575063613231552) internal successors, (619), 393 states have internal predecessors, (619), 3 states have call successors, (3), 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 414 states. [2022-04-15 18:14:56,925 INFO L87 Difference]: Start difference. First operand has 398 states, 393 states have (on average 1.575063613231552) internal successors, (619), 393 states have internal predecessors, (619), 3 states have call successors, (3), 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 414 states. [2022-04-15 18:14:56,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:14:56,945 INFO L93 Difference]: Finished difference Result 414 states and 644 transitions. [2022-04-15 18:14:56,945 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 644 transitions. [2022-04-15 18:14:56,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:14:56,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:14:56,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:14:56,946 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:14:56,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 393 states have (on average 1.575063613231552) internal successors, (619), 393 states have internal predecessors, (619), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:14:56,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 623 transitions. [2022-04-15 18:14:56,996 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 623 transitions. Word has length 97 [2022-04-15 18:14:56,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:14:56,997 INFO L478 AbstractCegarLoop]: Abstraction has 398 states and 623 transitions. [2022-04-15 18:14:56,997 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:14:56,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 398 states and 623 transitions. [2022-04-15 18:14:57,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 623 edges. 623 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:14:57,686 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 623 transitions. [2022-04-15 18:14:57,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-15 18:14:57,687 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:14:57,687 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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-15 18:14:57,687 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 18:14:57,688 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:14:57,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:14:57,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1320629736, now seen corresponding path program 1 times [2022-04-15 18:14:57,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:14:57,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1832078946] [2022-04-15 18:15:04,285 WARN L232 SmtUtils]: Spent 6.58s on a formula simplification. DAG size of input: 198 DAG size of output: 190 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 18:15:16,346 WARN L232 SmtUtils]: Spent 10.66s on a formula simplification that was a NOOP. DAG size: 241 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 18:15:25,253 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:15:25,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1320629736, now seen corresponding path program 2 times [2022-04-15 18:15:25,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:15:25,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358596416] [2022-04-15 18:15:25,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:15:25,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:15:25,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:15:25,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:15:25,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:15:25,459 INFO L290 TraceCheckUtils]: 0: Hoare triple {26107#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {26100#true} is VALID [2022-04-15 18:15:25,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {26100#true} assume true; {26100#true} is VALID [2022-04-15 18:15:25,459 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26100#true} {26100#true} #591#return; {26100#true} is VALID [2022-04-15 18:15:25,460 INFO L272 TraceCheckUtils]: 0: Hoare triple {26100#true} call ULTIMATE.init(); {26107#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:15:25,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {26107#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {26100#true} is VALID [2022-04-15 18:15:25,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {26100#true} assume true; {26100#true} is VALID [2022-04-15 18:15:25,475 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26100#true} {26100#true} #591#return; {26100#true} is VALID [2022-04-15 18:15:25,475 INFO L272 TraceCheckUtils]: 4: Hoare triple {26100#true} call #t~ret159 := main(); {26100#true} is VALID [2022-04-15 18:15:25,475 INFO L290 TraceCheckUtils]: 5: Hoare triple {26100#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {26100#true} is VALID [2022-04-15 18:15:25,475 INFO L272 TraceCheckUtils]: 6: Hoare triple {26100#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {26100#true} is VALID [2022-04-15 18:15:25,475 INFO L290 TraceCheckUtils]: 7: Hoare triple {26100#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {26100#true} is VALID [2022-04-15 18:15:25,476 INFO L290 TraceCheckUtils]: 8: Hoare triple {26100#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {26100#true} is VALID [2022-04-15 18:15:25,476 INFO L290 TraceCheckUtils]: 9: Hoare triple {26100#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {26100#true} is VALID [2022-04-15 18:15:25,476 INFO L290 TraceCheckUtils]: 10: Hoare triple {26100#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {26100#true} is VALID [2022-04-15 18:15:25,476 INFO L290 TraceCheckUtils]: 11: Hoare triple {26100#true} assume !false; {26100#true} is VALID [2022-04-15 18:15:25,476 INFO L290 TraceCheckUtils]: 12: Hoare triple {26100#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {26100#true} is VALID [2022-04-15 18:15:25,476 INFO L290 TraceCheckUtils]: 13: Hoare triple {26100#true} assume 12292 == #t~mem43;havoc #t~mem43; {26100#true} is VALID [2022-04-15 18:15:25,476 INFO L290 TraceCheckUtils]: 14: Hoare triple {26100#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {26100#true} is VALID [2022-04-15 18:15:25,476 INFO L290 TraceCheckUtils]: 15: Hoare triple {26100#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {26100#true} is VALID [2022-04-15 18:15:25,476 INFO L290 TraceCheckUtils]: 16: Hoare triple {26100#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {26100#true} is VALID [2022-04-15 18:15:25,476 INFO L290 TraceCheckUtils]: 17: Hoare triple {26100#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {26100#true} is VALID [2022-04-15 18:15:25,476 INFO L290 TraceCheckUtils]: 18: Hoare triple {26100#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {26100#true} is VALID [2022-04-15 18:15:25,477 INFO L290 TraceCheckUtils]: 19: Hoare triple {26100#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {26100#true} is VALID [2022-04-15 18:15:25,477 INFO L290 TraceCheckUtils]: 20: Hoare triple {26100#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {26100#true} is VALID [2022-04-15 18:15:25,477 INFO L290 TraceCheckUtils]: 21: Hoare triple {26100#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {26100#true} is VALID [2022-04-15 18:15:25,477 INFO L290 TraceCheckUtils]: 22: Hoare triple {26100#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {26100#true} is VALID [2022-04-15 18:15:25,477 INFO L290 TraceCheckUtils]: 23: Hoare triple {26100#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {26100#true} is VALID [2022-04-15 18:15:25,477 INFO L290 TraceCheckUtils]: 24: Hoare triple {26100#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {26100#true} is VALID [2022-04-15 18:15:25,477 INFO L290 TraceCheckUtils]: 25: Hoare triple {26100#true} ~skip~0 := 0; {26100#true} is VALID [2022-04-15 18:15:25,477 INFO L290 TraceCheckUtils]: 26: Hoare triple {26100#true} assume !false; {26100#true} is VALID [2022-04-15 18:15:25,477 INFO L290 TraceCheckUtils]: 27: Hoare triple {26100#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {26100#true} is VALID [2022-04-15 18:15:25,477 INFO L290 TraceCheckUtils]: 28: Hoare triple {26100#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {26100#true} is VALID [2022-04-15 18:15:25,477 INFO L290 TraceCheckUtils]: 29: Hoare triple {26100#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {26100#true} is VALID [2022-04-15 18:15:25,478 INFO L290 TraceCheckUtils]: 30: Hoare triple {26100#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {26100#true} is VALID [2022-04-15 18:15:25,478 INFO L290 TraceCheckUtils]: 31: Hoare triple {26100#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {26100#true} is VALID [2022-04-15 18:15:25,478 INFO L290 TraceCheckUtils]: 32: Hoare triple {26100#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {26100#true} is VALID [2022-04-15 18:15:25,478 INFO L290 TraceCheckUtils]: 33: Hoare triple {26100#true} assume 4368 == #t~mem48;havoc #t~mem48; {26100#true} is VALID [2022-04-15 18:15:25,478 INFO L290 TraceCheckUtils]: 34: Hoare triple {26100#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {26100#true} is VALID [2022-04-15 18:15:25,478 INFO L290 TraceCheckUtils]: 35: Hoare triple {26100#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {26100#true} is VALID [2022-04-15 18:15:25,492 INFO L290 TraceCheckUtils]: 36: Hoare triple {26100#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {26105#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:15:25,492 INFO L290 TraceCheckUtils]: 37: Hoare triple {26105#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {26105#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:15:25,493 INFO L290 TraceCheckUtils]: 38: Hoare triple {26105#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {26105#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:15:25,493 INFO L290 TraceCheckUtils]: 39: Hoare triple {26105#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {26105#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:15:25,494 INFO L290 TraceCheckUtils]: 40: Hoare triple {26105#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} ~skip~0 := 0; {26105#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:15:25,494 INFO L290 TraceCheckUtils]: 41: Hoare triple {26105#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !false; {26105#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:15:25,494 INFO L290 TraceCheckUtils]: 42: Hoare triple {26105#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {26105#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:15:25,495 INFO L290 TraceCheckUtils]: 43: Hoare triple {26105#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {26105#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:15:25,495 INFO L290 TraceCheckUtils]: 44: Hoare triple {26105#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {26105#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:15:25,496 INFO L290 TraceCheckUtils]: 45: Hoare triple {26105#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {26106#(not (= |ssl3_connect_#t~mem46| 20480))} is VALID [2022-04-15 18:15:25,496 INFO L290 TraceCheckUtils]: 46: Hoare triple {26106#(not (= |ssl3_connect_#t~mem46| 20480))} assume 20480 == #t~mem46;havoc #t~mem46; {26101#false} is VALID [2022-04-15 18:15:25,496 INFO L290 TraceCheckUtils]: 47: Hoare triple {26101#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {26101#false} is VALID [2022-04-15 18:15:25,496 INFO L290 TraceCheckUtils]: 48: Hoare triple {26101#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {26101#false} is VALID [2022-04-15 18:15:25,496 INFO L290 TraceCheckUtils]: 49: Hoare triple {26101#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {26101#false} is VALID [2022-04-15 18:15:25,496 INFO L290 TraceCheckUtils]: 50: Hoare triple {26101#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {26101#false} is VALID [2022-04-15 18:15:25,496 INFO L290 TraceCheckUtils]: 51: Hoare triple {26101#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {26101#false} is VALID [2022-04-15 18:15:25,497 INFO L290 TraceCheckUtils]: 52: Hoare triple {26101#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {26101#false} is VALID [2022-04-15 18:15:25,497 INFO L290 TraceCheckUtils]: 53: Hoare triple {26101#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {26101#false} is VALID [2022-04-15 18:15:25,497 INFO L290 TraceCheckUtils]: 54: Hoare triple {26101#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {26101#false} is VALID [2022-04-15 18:15:25,497 INFO L290 TraceCheckUtils]: 55: Hoare triple {26101#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {26101#false} is VALID [2022-04-15 18:15:25,497 INFO L290 TraceCheckUtils]: 56: Hoare triple {26101#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {26101#false} is VALID [2022-04-15 18:15:25,497 INFO L290 TraceCheckUtils]: 57: Hoare triple {26101#false} ~skip~0 := 0; {26101#false} is VALID [2022-04-15 18:15:25,497 INFO L290 TraceCheckUtils]: 58: Hoare triple {26101#false} assume !false; {26101#false} is VALID [2022-04-15 18:15:25,497 INFO L290 TraceCheckUtils]: 59: Hoare triple {26101#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-15 18:15:25,497 INFO L290 TraceCheckUtils]: 60: Hoare triple {26101#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-15 18:15:25,497 INFO L290 TraceCheckUtils]: 61: Hoare triple {26101#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-15 18:15:25,497 INFO L290 TraceCheckUtils]: 62: Hoare triple {26101#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-15 18:15:25,498 INFO L290 TraceCheckUtils]: 63: Hoare triple {26101#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-15 18:15:25,498 INFO L290 TraceCheckUtils]: 64: Hoare triple {26101#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-15 18:15:25,498 INFO L290 TraceCheckUtils]: 65: Hoare triple {26101#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-15 18:15:25,498 INFO L290 TraceCheckUtils]: 66: Hoare triple {26101#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-15 18:15:25,498 INFO L290 TraceCheckUtils]: 67: Hoare triple {26101#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-15 18:15:25,498 INFO L290 TraceCheckUtils]: 68: Hoare triple {26101#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-15 18:15:25,498 INFO L290 TraceCheckUtils]: 69: Hoare triple {26101#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-15 18:15:25,498 INFO L290 TraceCheckUtils]: 70: Hoare triple {26101#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-15 18:15:25,498 INFO L290 TraceCheckUtils]: 71: Hoare triple {26101#false} assume 4416 == #t~mem54;havoc #t~mem54; {26101#false} is VALID [2022-04-15 18:15:25,498 INFO L290 TraceCheckUtils]: 72: Hoare triple {26101#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {26101#false} is VALID [2022-04-15 18:15:25,498 INFO L290 TraceCheckUtils]: 73: Hoare triple {26101#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {26101#false} is VALID [2022-04-15 18:15:25,499 INFO L290 TraceCheckUtils]: 74: Hoare triple {26101#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {26101#false} is VALID [2022-04-15 18:15:25,499 INFO L290 TraceCheckUtils]: 75: Hoare triple {26101#false} assume !(0 == ~tmp___6~0); {26101#false} is VALID [2022-04-15 18:15:25,499 INFO L290 TraceCheckUtils]: 76: Hoare triple {26101#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {26101#false} is VALID [2022-04-15 18:15:25,499 INFO L290 TraceCheckUtils]: 77: Hoare triple {26101#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {26101#false} is VALID [2022-04-15 18:15:25,499 INFO L290 TraceCheckUtils]: 78: Hoare triple {26101#false} ~skip~0 := 0; {26101#false} is VALID [2022-04-15 18:15:25,499 INFO L290 TraceCheckUtils]: 79: Hoare triple {26101#false} assume !false; {26101#false} is VALID [2022-04-15 18:15:25,499 INFO L290 TraceCheckUtils]: 80: Hoare triple {26101#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-15 18:15:25,499 INFO L290 TraceCheckUtils]: 81: Hoare triple {26101#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-15 18:15:25,499 INFO L290 TraceCheckUtils]: 82: Hoare triple {26101#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-15 18:15:25,499 INFO L290 TraceCheckUtils]: 83: Hoare triple {26101#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-15 18:15:25,499 INFO L290 TraceCheckUtils]: 84: Hoare triple {26101#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-15 18:15:25,500 INFO L290 TraceCheckUtils]: 85: Hoare triple {26101#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-15 18:15:25,500 INFO L290 TraceCheckUtils]: 86: Hoare triple {26101#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-15 18:15:25,500 INFO L290 TraceCheckUtils]: 87: Hoare triple {26101#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-15 18:15:25,500 INFO L290 TraceCheckUtils]: 88: Hoare triple {26101#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-15 18:15:25,500 INFO L290 TraceCheckUtils]: 89: Hoare triple {26101#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-15 18:15:25,500 INFO L290 TraceCheckUtils]: 90: Hoare triple {26101#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-15 18:15:25,500 INFO L290 TraceCheckUtils]: 91: Hoare triple {26101#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-15 18:15:25,500 INFO L290 TraceCheckUtils]: 92: Hoare triple {26101#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-15 18:15:25,500 INFO L290 TraceCheckUtils]: 93: Hoare triple {26101#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {26101#false} is VALID [2022-04-15 18:15:25,500 INFO L290 TraceCheckUtils]: 94: Hoare triple {26101#false} assume 4432 == #t~mem56;havoc #t~mem56; {26101#false} is VALID [2022-04-15 18:15:25,500 INFO L290 TraceCheckUtils]: 95: Hoare triple {26101#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {26101#false} is VALID [2022-04-15 18:15:25,500 INFO L290 TraceCheckUtils]: 96: Hoare triple {26101#false} assume 5 == ~blastFlag~0; {26101#false} is VALID [2022-04-15 18:15:25,501 INFO L290 TraceCheckUtils]: 97: Hoare triple {26101#false} assume !false; {26101#false} is VALID [2022-04-15 18:15:25,501 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-15 18:15:25,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:15:25,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358596416] [2022-04-15 18:15:25,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358596416] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:15:25,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:15:25,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:15:25,502 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:15:25,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1832078946] [2022-04-15 18:15:25,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1832078946] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:15:25,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:15:25,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:15:25,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754383929] [2022-04-15 18:15:25,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:15:25,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-04-15 18:15:25,503 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:15:25,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:25,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:15:25,569 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:15:25,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:15:25,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:15:25,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:15:25,570 INFO L87 Difference]: Start difference. First operand 398 states and 623 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:27,595 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-15 18:15:28,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:15:28,658 INFO L93 Difference]: Finished difference Result 911 states and 1406 transitions. [2022-04-15 18:15:28,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:15:28,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-04-15 18:15:28,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:15:28,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:28,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2022-04-15 18:15:28,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:28,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2022-04-15 18:15:28,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 478 transitions. [2022-04-15 18:15:29,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 478 edges. 478 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:15:29,059 INFO L225 Difference]: With dead ends: 911 [2022-04-15 18:15:29,059 INFO L226 Difference]: Without dead ends: 529 [2022-04-15 18:15:29,060 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:15:29,061 INFO L913 BasicCegarLoop]: 106 mSDtfsCounter, 116 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 18:15:29,061 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 298 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 391 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 18:15:29,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2022-04-15 18:15:29,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 398. [2022-04-15 18:15:29,082 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:15:29,083 INFO L82 GeneralOperation]: Start isEquivalent. First operand 529 states. Second operand has 398 states, 393 states have (on average 1.5572519083969465) internal successors, (612), 393 states have internal predecessors, (612), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:29,083 INFO L74 IsIncluded]: Start isIncluded. First operand 529 states. Second operand has 398 states, 393 states have (on average 1.5572519083969465) internal successors, (612), 393 states have internal predecessors, (612), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:29,084 INFO L87 Difference]: Start difference. First operand 529 states. Second operand has 398 states, 393 states have (on average 1.5572519083969465) internal successors, (612), 393 states have internal predecessors, (612), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:29,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:15:29,100 INFO L93 Difference]: Finished difference Result 529 states and 796 transitions. [2022-04-15 18:15:29,100 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 796 transitions. [2022-04-15 18:15:29,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:15:29,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:15:29,101 INFO L74 IsIncluded]: Start isIncluded. First operand has 398 states, 393 states have (on average 1.5572519083969465) internal successors, (612), 393 states have internal predecessors, (612), 3 states have call successors, (3), 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 529 states. [2022-04-15 18:15:29,102 INFO L87 Difference]: Start difference. First operand has 398 states, 393 states have (on average 1.5572519083969465) internal successors, (612), 393 states have internal predecessors, (612), 3 states have call successors, (3), 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 529 states. [2022-04-15 18:15:29,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:15:29,117 INFO L93 Difference]: Finished difference Result 529 states and 796 transitions. [2022-04-15 18:15:29,118 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 796 transitions. [2022-04-15 18:15:29,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:15:29,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:15:29,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:15:29,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:15:29,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 393 states have (on average 1.5572519083969465) internal successors, (612), 393 states have internal predecessors, (612), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:29,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 616 transitions. [2022-04-15 18:15:29,131 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 616 transitions. Word has length 98 [2022-04-15 18:15:29,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:15:29,132 INFO L478 AbstractCegarLoop]: Abstraction has 398 states and 616 transitions. [2022-04-15 18:15:29,132 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:15:29,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 398 states and 616 transitions. [2022-04-15 18:15:29,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 616 edges. 616 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:15:29,627 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 616 transitions. [2022-04-15 18:15:29,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-15 18:15:29,628 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:15:29,628 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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-15 18:15:29,628 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 18:15:29,628 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:15:29,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:15:29,629 INFO L85 PathProgramCache]: Analyzing trace with hash 2105012025, now seen corresponding path program 1 times [2022-04-15 18:15:29,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:15:29,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [383958963] [2022-04-15 18:15:48,197 WARN L232 SmtUtils]: Spent 12.44s on a formula simplification that was a NOOP. DAG size: 241 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 18:15:57,733 WARN L232 SmtUtils]: Spent 5.56s on a formula simplification that was a NOOP. DAG size: 166 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 18:15:59,249 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:15:59,249 INFO L85 PathProgramCache]: Analyzing trace with hash 2105012025, now seen corresponding path program 2 times [2022-04-15 18:15:59,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:15:59,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535199751] [2022-04-15 18:15:59,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:15:59,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:15:59,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:15:59,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:15:59,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:15:59,522 INFO L290 TraceCheckUtils]: 0: Hoare triple {29795#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {29788#true} is VALID [2022-04-15 18:15:59,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {29788#true} assume true; {29788#true} is VALID [2022-04-15 18:15:59,523 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29788#true} {29788#true} #591#return; {29788#true} is VALID [2022-04-15 18:15:59,524 INFO L272 TraceCheckUtils]: 0: Hoare triple {29788#true} call ULTIMATE.init(); {29795#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:15:59,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {29795#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {29788#true} is VALID [2022-04-15 18:15:59,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {29788#true} assume true; {29788#true} is VALID [2022-04-15 18:15:59,524 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29788#true} {29788#true} #591#return; {29788#true} is VALID [2022-04-15 18:15:59,524 INFO L272 TraceCheckUtils]: 4: Hoare triple {29788#true} call #t~ret159 := main(); {29788#true} is VALID [2022-04-15 18:15:59,524 INFO L290 TraceCheckUtils]: 5: Hoare triple {29788#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {29788#true} is VALID [2022-04-15 18:15:59,524 INFO L272 TraceCheckUtils]: 6: Hoare triple {29788#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {29788#true} is VALID [2022-04-15 18:15:59,524 INFO L290 TraceCheckUtils]: 7: Hoare triple {29788#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {29788#true} is VALID [2022-04-15 18:15:59,524 INFO L290 TraceCheckUtils]: 8: Hoare triple {29788#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {29788#true} is VALID [2022-04-15 18:15:59,525 INFO L290 TraceCheckUtils]: 9: Hoare triple {29788#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {29788#true} is VALID [2022-04-15 18:15:59,525 INFO L290 TraceCheckUtils]: 10: Hoare triple {29788#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {29788#true} is VALID [2022-04-15 18:15:59,525 INFO L290 TraceCheckUtils]: 11: Hoare triple {29788#true} assume !false; {29788#true} is VALID [2022-04-15 18:15:59,525 INFO L290 TraceCheckUtils]: 12: Hoare triple {29788#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {29788#true} is VALID [2022-04-15 18:15:59,525 INFO L290 TraceCheckUtils]: 13: Hoare triple {29788#true} assume 12292 == #t~mem43;havoc #t~mem43; {29788#true} is VALID [2022-04-15 18:15:59,525 INFO L290 TraceCheckUtils]: 14: Hoare triple {29788#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {29788#true} is VALID [2022-04-15 18:15:59,532 INFO L290 TraceCheckUtils]: 15: Hoare triple {29788#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {29788#true} is VALID [2022-04-15 18:15:59,532 INFO L290 TraceCheckUtils]: 16: Hoare triple {29788#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {29788#true} is VALID [2022-04-15 18:15:59,532 INFO L290 TraceCheckUtils]: 17: Hoare triple {29788#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {29788#true} is VALID [2022-04-15 18:15:59,533 INFO L290 TraceCheckUtils]: 18: Hoare triple {29788#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {29788#true} is VALID [2022-04-15 18:15:59,533 INFO L290 TraceCheckUtils]: 19: Hoare triple {29788#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {29788#true} is VALID [2022-04-15 18:15:59,533 INFO L290 TraceCheckUtils]: 20: Hoare triple {29788#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {29788#true} is VALID [2022-04-15 18:15:59,533 INFO L290 TraceCheckUtils]: 21: Hoare triple {29788#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {29788#true} is VALID [2022-04-15 18:15:59,533 INFO L290 TraceCheckUtils]: 22: Hoare triple {29788#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {29788#true} is VALID [2022-04-15 18:15:59,533 INFO L290 TraceCheckUtils]: 23: Hoare triple {29788#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {29788#true} is VALID [2022-04-15 18:15:59,533 INFO L290 TraceCheckUtils]: 24: Hoare triple {29788#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {29788#true} is VALID [2022-04-15 18:15:59,533 INFO L290 TraceCheckUtils]: 25: Hoare triple {29788#true} ~skip~0 := 0; {29788#true} is VALID [2022-04-15 18:15:59,533 INFO L290 TraceCheckUtils]: 26: Hoare triple {29788#true} assume !false; {29788#true} is VALID [2022-04-15 18:15:59,533 INFO L290 TraceCheckUtils]: 27: Hoare triple {29788#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {29788#true} is VALID [2022-04-15 18:15:59,533 INFO L290 TraceCheckUtils]: 28: Hoare triple {29788#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {29788#true} is VALID [2022-04-15 18:15:59,534 INFO L290 TraceCheckUtils]: 29: Hoare triple {29788#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {29788#true} is VALID [2022-04-15 18:15:59,534 INFO L290 TraceCheckUtils]: 30: Hoare triple {29788#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {29788#true} is VALID [2022-04-15 18:15:59,534 INFO L290 TraceCheckUtils]: 31: Hoare triple {29788#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {29788#true} is VALID [2022-04-15 18:15:59,534 INFO L290 TraceCheckUtils]: 32: Hoare triple {29788#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {29788#true} is VALID [2022-04-15 18:15:59,534 INFO L290 TraceCheckUtils]: 33: Hoare triple {29788#true} assume 4368 == #t~mem48;havoc #t~mem48; {29788#true} is VALID [2022-04-15 18:15:59,534 INFO L290 TraceCheckUtils]: 34: Hoare triple {29788#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {29788#true} is VALID [2022-04-15 18:15:59,534 INFO L290 TraceCheckUtils]: 35: Hoare triple {29788#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {29788#true} is VALID [2022-04-15 18:15:59,536 INFO L290 TraceCheckUtils]: 36: Hoare triple {29788#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {29793#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:15:59,536 INFO L290 TraceCheckUtils]: 37: Hoare triple {29793#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {29793#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:15:59,536 INFO L290 TraceCheckUtils]: 38: Hoare triple {29793#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {29793#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:15:59,537 INFO L290 TraceCheckUtils]: 39: Hoare triple {29793#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {29793#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:15:59,537 INFO L290 TraceCheckUtils]: 40: Hoare triple {29793#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} ~skip~0 := 0; {29793#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:15:59,538 INFO L290 TraceCheckUtils]: 41: Hoare triple {29793#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !false; {29793#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:15:59,538 INFO L290 TraceCheckUtils]: 42: Hoare triple {29793#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {29793#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:15:59,538 INFO L290 TraceCheckUtils]: 43: Hoare triple {29793#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {29793#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:15:59,539 INFO L290 TraceCheckUtils]: 44: Hoare triple {29793#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {29793#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:15:59,539 INFO L290 TraceCheckUtils]: 45: Hoare triple {29793#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {29793#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-15 18:15:59,539 INFO L290 TraceCheckUtils]: 46: Hoare triple {29793#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {29794#(not (= |ssl3_connect_#t~mem47| 4099))} is VALID [2022-04-15 18:15:59,540 INFO L290 TraceCheckUtils]: 47: Hoare triple {29794#(not (= |ssl3_connect_#t~mem47| 4099))} assume 4099 == #t~mem47;havoc #t~mem47; {29789#false} is VALID [2022-04-15 18:15:59,540 INFO L290 TraceCheckUtils]: 48: Hoare triple {29789#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {29789#false} is VALID [2022-04-15 18:15:59,540 INFO L290 TraceCheckUtils]: 49: Hoare triple {29789#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {29789#false} is VALID [2022-04-15 18:15:59,540 INFO L290 TraceCheckUtils]: 50: Hoare triple {29789#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {29789#false} is VALID [2022-04-15 18:15:59,540 INFO L290 TraceCheckUtils]: 51: Hoare triple {29789#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {29789#false} is VALID [2022-04-15 18:15:59,540 INFO L290 TraceCheckUtils]: 52: Hoare triple {29789#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {29789#false} is VALID [2022-04-15 18:15:59,540 INFO L290 TraceCheckUtils]: 53: Hoare triple {29789#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {29789#false} is VALID [2022-04-15 18:15:59,540 INFO L290 TraceCheckUtils]: 54: Hoare triple {29789#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {29789#false} is VALID [2022-04-15 18:15:59,541 INFO L290 TraceCheckUtils]: 55: Hoare triple {29789#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {29789#false} is VALID [2022-04-15 18:15:59,541 INFO L290 TraceCheckUtils]: 56: Hoare triple {29789#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {29789#false} is VALID [2022-04-15 18:15:59,541 INFO L290 TraceCheckUtils]: 57: Hoare triple {29789#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {29789#false} is VALID [2022-04-15 18:15:59,541 INFO L290 TraceCheckUtils]: 58: Hoare triple {29789#false} ~skip~0 := 0; {29789#false} is VALID [2022-04-15 18:15:59,541 INFO L290 TraceCheckUtils]: 59: Hoare triple {29789#false} assume !false; {29789#false} is VALID [2022-04-15 18:15:59,541 INFO L290 TraceCheckUtils]: 60: Hoare triple {29789#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-15 18:15:59,541 INFO L290 TraceCheckUtils]: 61: Hoare triple {29789#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-15 18:15:59,541 INFO L290 TraceCheckUtils]: 62: Hoare triple {29789#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-15 18:15:59,541 INFO L290 TraceCheckUtils]: 63: Hoare triple {29789#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-15 18:15:59,541 INFO L290 TraceCheckUtils]: 64: Hoare triple {29789#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-15 18:15:59,541 INFO L290 TraceCheckUtils]: 65: Hoare triple {29789#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-15 18:15:59,541 INFO L290 TraceCheckUtils]: 66: Hoare triple {29789#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-15 18:15:59,541 INFO L290 TraceCheckUtils]: 67: Hoare triple {29789#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-15 18:15:59,542 INFO L290 TraceCheckUtils]: 68: Hoare triple {29789#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-15 18:15:59,542 INFO L290 TraceCheckUtils]: 69: Hoare triple {29789#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-15 18:15:59,542 INFO L290 TraceCheckUtils]: 70: Hoare triple {29789#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-15 18:15:59,542 INFO L290 TraceCheckUtils]: 71: Hoare triple {29789#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-15 18:15:59,542 INFO L290 TraceCheckUtils]: 72: Hoare triple {29789#false} assume 4416 == #t~mem54;havoc #t~mem54; {29789#false} is VALID [2022-04-15 18:15:59,542 INFO L290 TraceCheckUtils]: 73: Hoare triple {29789#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {29789#false} is VALID [2022-04-15 18:15:59,542 INFO L290 TraceCheckUtils]: 74: Hoare triple {29789#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {29789#false} is VALID [2022-04-15 18:15:59,542 INFO L290 TraceCheckUtils]: 75: Hoare triple {29789#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {29789#false} is VALID [2022-04-15 18:15:59,542 INFO L290 TraceCheckUtils]: 76: Hoare triple {29789#false} assume !(0 == ~tmp___6~0); {29789#false} is VALID [2022-04-15 18:15:59,542 INFO L290 TraceCheckUtils]: 77: Hoare triple {29789#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {29789#false} is VALID [2022-04-15 18:15:59,542 INFO L290 TraceCheckUtils]: 78: Hoare triple {29789#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {29789#false} is VALID [2022-04-15 18:15:59,542 INFO L290 TraceCheckUtils]: 79: Hoare triple {29789#false} ~skip~0 := 0; {29789#false} is VALID [2022-04-15 18:15:59,543 INFO L290 TraceCheckUtils]: 80: Hoare triple {29789#false} assume !false; {29789#false} is VALID [2022-04-15 18:15:59,543 INFO L290 TraceCheckUtils]: 81: Hoare triple {29789#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-15 18:15:59,543 INFO L290 TraceCheckUtils]: 82: Hoare triple {29789#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-15 18:15:59,543 INFO L290 TraceCheckUtils]: 83: Hoare triple {29789#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-15 18:15:59,543 INFO L290 TraceCheckUtils]: 84: Hoare triple {29789#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-15 18:15:59,543 INFO L290 TraceCheckUtils]: 85: Hoare triple {29789#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-15 18:15:59,543 INFO L290 TraceCheckUtils]: 86: Hoare triple {29789#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-15 18:15:59,543 INFO L290 TraceCheckUtils]: 87: Hoare triple {29789#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-15 18:15:59,543 INFO L290 TraceCheckUtils]: 88: Hoare triple {29789#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-15 18:15:59,543 INFO L290 TraceCheckUtils]: 89: Hoare triple {29789#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-15 18:15:59,543 INFO L290 TraceCheckUtils]: 90: Hoare triple {29789#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-15 18:15:59,544 INFO L290 TraceCheckUtils]: 91: Hoare triple {29789#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-15 18:15:59,544 INFO L290 TraceCheckUtils]: 92: Hoare triple {29789#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-15 18:15:59,544 INFO L290 TraceCheckUtils]: 93: Hoare triple {29789#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-15 18:15:59,544 INFO L290 TraceCheckUtils]: 94: Hoare triple {29789#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {29789#false} is VALID [2022-04-15 18:15:59,544 INFO L290 TraceCheckUtils]: 95: Hoare triple {29789#false} assume 4432 == #t~mem56;havoc #t~mem56; {29789#false} is VALID [2022-04-15 18:15:59,544 INFO L290 TraceCheckUtils]: 96: Hoare triple {29789#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {29789#false} is VALID [2022-04-15 18:15:59,544 INFO L290 TraceCheckUtils]: 97: Hoare triple {29789#false} assume 5 == ~blastFlag~0; {29789#false} is VALID [2022-04-15 18:15:59,544 INFO L290 TraceCheckUtils]: 98: Hoare triple {29789#false} assume !false; {29789#false} is VALID [2022-04-15 18:15:59,545 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-15 18:15:59,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:15:59,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535199751] [2022-04-15 18:15:59,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535199751] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:15:59,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:15:59,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:15:59,545 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:15:59,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [383958963] [2022-04-15 18:15:59,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [383958963] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:15:59,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:15:59,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:15:59,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135100341] [2022-04-15 18:15:59,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:15:59,546 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 99 [2022-04-15 18:15:59,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:15:59,547 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-15 18:15:59,620 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-15 18:15:59,620 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:15:59,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:15:59,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:15:59,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:15:59,622 INFO L87 Difference]: Start difference. First operand 398 states and 616 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-15 18:16:01,648 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-15 18:16:02,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:16:02,961 INFO L93 Difference]: Finished difference Result 911 states and 1392 transitions. [2022-04-15 18:16:02,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:16:02,962 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 99 [2022-04-15 18:16:02,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:16:02,962 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-15 18:16:02,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2022-04-15 18:16:02,965 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-15 18:16:02,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2022-04-15 18:16:02,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 477 transitions. [2022-04-15 18:16:03,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 477 edges. 477 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:16:03,413 INFO L225 Difference]: With dead ends: 911 [2022-04-15 18:16:03,413 INFO L226 Difference]: Without dead ends: 529 [2022-04-15 18:16:03,414 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:16:03,418 INFO L913 BasicCegarLoop]: 106 mSDtfsCounter, 114 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-15 18:16:03,418 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 298 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 391 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-15 18:16:03,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2022-04-15 18:16:03,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 398. [2022-04-15 18:16:03,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:16:03,480 INFO L82 GeneralOperation]: Start isEquivalent. First operand 529 states. Second operand has 398 states, 393 states have (on average 1.539440203562341) internal successors, (605), 393 states have internal predecessors, (605), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:03,481 INFO L74 IsIncluded]: Start isIncluded. First operand 529 states. Second operand has 398 states, 393 states have (on average 1.539440203562341) internal successors, (605), 393 states have internal predecessors, (605), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:03,482 INFO L87 Difference]: Start difference. First operand 529 states. Second operand has 398 states, 393 states have (on average 1.539440203562341) internal successors, (605), 393 states have internal predecessors, (605), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:03,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:16:03,509 INFO L93 Difference]: Finished difference Result 529 states and 789 transitions. [2022-04-15 18:16:03,509 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 789 transitions. [2022-04-15 18:16:03,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:16:03,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:16:03,511 INFO L74 IsIncluded]: Start isIncluded. First operand has 398 states, 393 states have (on average 1.539440203562341) internal successors, (605), 393 states have internal predecessors, (605), 3 states have call successors, (3), 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 529 states. [2022-04-15 18:16:03,525 INFO L87 Difference]: Start difference. First operand has 398 states, 393 states have (on average 1.539440203562341) internal successors, (605), 393 states have internal predecessors, (605), 3 states have call successors, (3), 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 529 states. [2022-04-15 18:16:03,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:16:03,555 INFO L93 Difference]: Finished difference Result 529 states and 789 transitions. [2022-04-15 18:16:03,555 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 789 transitions. [2022-04-15 18:16:03,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:16:03,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:16:03,556 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:16:03,556 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:16:03,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 393 states have (on average 1.539440203562341) internal successors, (605), 393 states have internal predecessors, (605), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:03,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 609 transitions. [2022-04-15 18:16:03,568 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 609 transitions. Word has length 99 [2022-04-15 18:16:03,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:16:03,568 INFO L478 AbstractCegarLoop]: Abstraction has 398 states and 609 transitions. [2022-04-15 18:16:03,568 INFO L479 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-15 18:16:03,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 398 states and 609 transitions. [2022-04-15 18:16:04,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 609 edges. 609 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:16:04,207 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 609 transitions. [2022-04-15 18:16:04,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-15 18:16:04,208 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:16:04,209 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:16:04,209 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 18:16:04,209 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:16:04,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:16:04,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1726018170, now seen corresponding path program 1 times [2022-04-15 18:16:04,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:16:04,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [367928439] [2022-04-15 18:16:04,210 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:16:04,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1726018170, now seen corresponding path program 2 times [2022-04-15 18:16:04,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:16:04,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862305056] [2022-04-15 18:16:04,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:16:04,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:16:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:16:04,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:16:04,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:16:04,411 INFO L290 TraceCheckUtils]: 0: Hoare triple {33482#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {33476#true} is VALID [2022-04-15 18:16:04,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {33476#true} assume true; {33476#true} is VALID [2022-04-15 18:16:04,411 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33476#true} {33476#true} #591#return; {33476#true} is VALID [2022-04-15 18:16:04,412 INFO L272 TraceCheckUtils]: 0: Hoare triple {33476#true} call ULTIMATE.init(); {33482#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:16:04,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {33482#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {33476#true} is VALID [2022-04-15 18:16:04,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {33476#true} assume true; {33476#true} is VALID [2022-04-15 18:16:04,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33476#true} {33476#true} #591#return; {33476#true} is VALID [2022-04-15 18:16:04,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {33476#true} call #t~ret159 := main(); {33476#true} is VALID [2022-04-15 18:16:04,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {33476#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {33476#true} is VALID [2022-04-15 18:16:04,413 INFO L272 TraceCheckUtils]: 6: Hoare triple {33476#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {33476#true} is VALID [2022-04-15 18:16:04,413 INFO L290 TraceCheckUtils]: 7: Hoare triple {33476#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {33476#true} is VALID [2022-04-15 18:16:04,413 INFO L290 TraceCheckUtils]: 8: Hoare triple {33476#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {33476#true} is VALID [2022-04-15 18:16:04,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {33476#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {33476#true} is VALID [2022-04-15 18:16:04,413 INFO L290 TraceCheckUtils]: 10: Hoare triple {33476#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {33476#true} is VALID [2022-04-15 18:16:04,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {33476#true} assume !false; {33476#true} is VALID [2022-04-15 18:16:04,413 INFO L290 TraceCheckUtils]: 12: Hoare triple {33476#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {33476#true} is VALID [2022-04-15 18:16:04,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {33476#true} assume 12292 == #t~mem43;havoc #t~mem43; {33476#true} is VALID [2022-04-15 18:16:04,414 INFO L290 TraceCheckUtils]: 14: Hoare triple {33476#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {33476#true} is VALID [2022-04-15 18:16:04,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {33476#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {33476#true} is VALID [2022-04-15 18:16:04,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {33476#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {33476#true} is VALID [2022-04-15 18:16:04,414 INFO L290 TraceCheckUtils]: 17: Hoare triple {33476#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {33476#true} is VALID [2022-04-15 18:16:04,414 INFO L290 TraceCheckUtils]: 18: Hoare triple {33476#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {33476#true} is VALID [2022-04-15 18:16:04,414 INFO L290 TraceCheckUtils]: 19: Hoare triple {33476#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {33476#true} is VALID [2022-04-15 18:16:04,414 INFO L290 TraceCheckUtils]: 20: Hoare triple {33476#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {33476#true} is VALID [2022-04-15 18:16:04,414 INFO L290 TraceCheckUtils]: 21: Hoare triple {33476#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {33476#true} is VALID [2022-04-15 18:16:04,414 INFO L290 TraceCheckUtils]: 22: Hoare triple {33476#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {33476#true} is VALID [2022-04-15 18:16:04,414 INFO L290 TraceCheckUtils]: 23: Hoare triple {33476#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {33476#true} is VALID [2022-04-15 18:16:04,415 INFO L290 TraceCheckUtils]: 24: Hoare triple {33476#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {33476#true} is VALID [2022-04-15 18:16:04,415 INFO L290 TraceCheckUtils]: 25: Hoare triple {33476#true} ~skip~0 := 0; {33476#true} is VALID [2022-04-15 18:16:04,415 INFO L290 TraceCheckUtils]: 26: Hoare triple {33476#true} assume !false; {33476#true} is VALID [2022-04-15 18:16:04,415 INFO L290 TraceCheckUtils]: 27: Hoare triple {33476#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {33476#true} is VALID [2022-04-15 18:16:04,415 INFO L290 TraceCheckUtils]: 28: Hoare triple {33476#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {33476#true} is VALID [2022-04-15 18:16:04,415 INFO L290 TraceCheckUtils]: 29: Hoare triple {33476#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {33476#true} is VALID [2022-04-15 18:16:04,415 INFO L290 TraceCheckUtils]: 30: Hoare triple {33476#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {33476#true} is VALID [2022-04-15 18:16:04,415 INFO L290 TraceCheckUtils]: 31: Hoare triple {33476#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {33476#true} is VALID [2022-04-15 18:16:04,415 INFO L290 TraceCheckUtils]: 32: Hoare triple {33476#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {33476#true} is VALID [2022-04-15 18:16:04,415 INFO L290 TraceCheckUtils]: 33: Hoare triple {33476#true} assume 4368 == #t~mem48;havoc #t~mem48; {33476#true} is VALID [2022-04-15 18:16:04,415 INFO L290 TraceCheckUtils]: 34: Hoare triple {33476#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {33476#true} is VALID [2022-04-15 18:16:04,416 INFO L290 TraceCheckUtils]: 35: Hoare triple {33476#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {33476#true} is VALID [2022-04-15 18:16:04,416 INFO L290 TraceCheckUtils]: 36: Hoare triple {33476#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {33476#true} is VALID [2022-04-15 18:16:04,416 INFO L290 TraceCheckUtils]: 37: Hoare triple {33476#true} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {33476#true} is VALID [2022-04-15 18:16:04,416 INFO L290 TraceCheckUtils]: 38: Hoare triple {33476#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {33476#true} is VALID [2022-04-15 18:16:04,416 INFO L290 TraceCheckUtils]: 39: Hoare triple {33476#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {33476#true} is VALID [2022-04-15 18:16:04,416 INFO L290 TraceCheckUtils]: 40: Hoare triple {33476#true} ~skip~0 := 0; {33476#true} is VALID [2022-04-15 18:16:04,416 INFO L290 TraceCheckUtils]: 41: Hoare triple {33476#true} assume !false; {33476#true} is VALID [2022-04-15 18:16:04,416 INFO L290 TraceCheckUtils]: 42: Hoare triple {33476#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {33476#true} is VALID [2022-04-15 18:16:04,416 INFO L290 TraceCheckUtils]: 43: Hoare triple {33476#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {33476#true} is VALID [2022-04-15 18:16:04,416 INFO L290 TraceCheckUtils]: 44: Hoare triple {33476#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {33476#true} is VALID [2022-04-15 18:16:04,416 INFO L290 TraceCheckUtils]: 45: Hoare triple {33476#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {33476#true} is VALID [2022-04-15 18:16:04,417 INFO L290 TraceCheckUtils]: 46: Hoare triple {33476#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {33476#true} is VALID [2022-04-15 18:16:04,417 INFO L290 TraceCheckUtils]: 47: Hoare triple {33476#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {33476#true} is VALID [2022-04-15 18:16:04,417 INFO L290 TraceCheckUtils]: 48: Hoare triple {33476#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {33476#true} is VALID [2022-04-15 18:16:04,417 INFO L290 TraceCheckUtils]: 49: Hoare triple {33476#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {33476#true} is VALID [2022-04-15 18:16:04,417 INFO L290 TraceCheckUtils]: 50: Hoare triple {33476#true} assume 4384 == #t~mem50;havoc #t~mem50; {33476#true} is VALID [2022-04-15 18:16:04,417 INFO L290 TraceCheckUtils]: 51: Hoare triple {33476#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {33476#true} is VALID [2022-04-15 18:16:04,417 INFO L290 TraceCheckUtils]: 52: Hoare triple {33476#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {33481#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:04,418 INFO L290 TraceCheckUtils]: 53: Hoare triple {33481#(= 2 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {33481#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:04,418 INFO L290 TraceCheckUtils]: 54: Hoare triple {33481#(= 2 ssl3_connect_~blastFlag~0)} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 72 + ~s.offset, 4); {33481#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:04,418 INFO L290 TraceCheckUtils]: 55: Hoare triple {33481#(= 2 ssl3_connect_~blastFlag~0)} call write~int(0, ~s.base, 88 + ~s.offset, 4); {33481#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:04,419 INFO L290 TraceCheckUtils]: 56: Hoare triple {33481#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {33481#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:04,419 INFO L290 TraceCheckUtils]: 57: Hoare triple {33481#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {33481#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:04,419 INFO L290 TraceCheckUtils]: 58: Hoare triple {33481#(= 2 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {33481#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:04,420 INFO L290 TraceCheckUtils]: 59: Hoare triple {33481#(= 2 ssl3_connect_~blastFlag~0)} assume !false; {33481#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:04,420 INFO L290 TraceCheckUtils]: 60: Hoare triple {33481#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {33481#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:04,420 INFO L290 TraceCheckUtils]: 61: Hoare triple {33481#(= 2 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {33481#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:04,421 INFO L290 TraceCheckUtils]: 62: Hoare triple {33481#(= 2 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {33481#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:04,421 INFO L290 TraceCheckUtils]: 63: Hoare triple {33481#(= 2 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {33481#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:04,421 INFO L290 TraceCheckUtils]: 64: Hoare triple {33481#(= 2 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {33481#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:04,422 INFO L290 TraceCheckUtils]: 65: Hoare triple {33481#(= 2 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {33481#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:04,422 INFO L290 TraceCheckUtils]: 66: Hoare triple {33481#(= 2 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {33481#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:04,422 INFO L290 TraceCheckUtils]: 67: Hoare triple {33481#(= 2 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {33481#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:04,423 INFO L290 TraceCheckUtils]: 68: Hoare triple {33481#(= 2 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {33481#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:04,423 INFO L290 TraceCheckUtils]: 69: Hoare triple {33481#(= 2 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {33481#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:04,423 INFO L290 TraceCheckUtils]: 70: Hoare triple {33481#(= 2 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {33481#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:04,423 INFO L290 TraceCheckUtils]: 71: Hoare triple {33481#(= 2 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {33481#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:04,424 INFO L290 TraceCheckUtils]: 72: Hoare triple {33481#(= 2 ssl3_connect_~blastFlag~0)} assume 4416 == #t~mem54;havoc #t~mem54; {33481#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:04,424 INFO L290 TraceCheckUtils]: 73: Hoare triple {33481#(= 2 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {33481#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:04,424 INFO L290 TraceCheckUtils]: 74: Hoare triple {33481#(= 2 ssl3_connect_~blastFlag~0)} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {33477#false} is VALID [2022-04-15 18:16:04,425 INFO L290 TraceCheckUtils]: 75: Hoare triple {33477#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {33477#false} is VALID [2022-04-15 18:16:04,425 INFO L290 TraceCheckUtils]: 76: Hoare triple {33477#false} assume !(0 == ~tmp___6~0); {33477#false} is VALID [2022-04-15 18:16:04,425 INFO L290 TraceCheckUtils]: 77: Hoare triple {33477#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {33477#false} is VALID [2022-04-15 18:16:04,425 INFO L290 TraceCheckUtils]: 78: Hoare triple {33477#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {33477#false} is VALID [2022-04-15 18:16:04,425 INFO L290 TraceCheckUtils]: 79: Hoare triple {33477#false} ~skip~0 := 0; {33477#false} is VALID [2022-04-15 18:16:04,425 INFO L290 TraceCheckUtils]: 80: Hoare triple {33477#false} assume !false; {33477#false} is VALID [2022-04-15 18:16:04,425 INFO L290 TraceCheckUtils]: 81: Hoare triple {33477#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {33477#false} is VALID [2022-04-15 18:16:04,425 INFO L290 TraceCheckUtils]: 82: Hoare triple {33477#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {33477#false} is VALID [2022-04-15 18:16:04,425 INFO L290 TraceCheckUtils]: 83: Hoare triple {33477#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {33477#false} is VALID [2022-04-15 18:16:04,425 INFO L290 TraceCheckUtils]: 84: Hoare triple {33477#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {33477#false} is VALID [2022-04-15 18:16:04,425 INFO L290 TraceCheckUtils]: 85: Hoare triple {33477#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {33477#false} is VALID [2022-04-15 18:16:04,425 INFO L290 TraceCheckUtils]: 86: Hoare triple {33477#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {33477#false} is VALID [2022-04-15 18:16:04,425 INFO L290 TraceCheckUtils]: 87: Hoare triple {33477#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {33477#false} is VALID [2022-04-15 18:16:04,426 INFO L290 TraceCheckUtils]: 88: Hoare triple {33477#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {33477#false} is VALID [2022-04-15 18:16:04,426 INFO L290 TraceCheckUtils]: 89: Hoare triple {33477#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {33477#false} is VALID [2022-04-15 18:16:04,426 INFO L290 TraceCheckUtils]: 90: Hoare triple {33477#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {33477#false} is VALID [2022-04-15 18:16:04,426 INFO L290 TraceCheckUtils]: 91: Hoare triple {33477#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {33477#false} is VALID [2022-04-15 18:16:04,426 INFO L290 TraceCheckUtils]: 92: Hoare triple {33477#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {33477#false} is VALID [2022-04-15 18:16:04,426 INFO L290 TraceCheckUtils]: 93: Hoare triple {33477#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {33477#false} is VALID [2022-04-15 18:16:04,426 INFO L290 TraceCheckUtils]: 94: Hoare triple {33477#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {33477#false} is VALID [2022-04-15 18:16:04,426 INFO L290 TraceCheckUtils]: 95: Hoare triple {33477#false} assume 4432 == #t~mem56;havoc #t~mem56; {33477#false} is VALID [2022-04-15 18:16:04,426 INFO L290 TraceCheckUtils]: 96: Hoare triple {33477#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {33477#false} is VALID [2022-04-15 18:16:04,426 INFO L290 TraceCheckUtils]: 97: Hoare triple {33477#false} assume 5 == ~blastFlag~0; {33477#false} is VALID [2022-04-15 18:16:04,426 INFO L290 TraceCheckUtils]: 98: Hoare triple {33477#false} assume !false; {33477#false} is VALID [2022-04-15 18:16:04,427 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-15 18:16:04,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:16:04,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862305056] [2022-04-15 18:16:04,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862305056] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:16:04,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:16:04,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:16:04,428 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:16:04,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [367928439] [2022-04-15 18:16:04,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [367928439] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:16:04,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:16:04,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:16:04,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037679089] [2022-04-15 18:16:04,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:16:04,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 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 99 [2022-04-15 18:16:04,429 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:16:04,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:04,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:16:04,502 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:16:04,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:16:04,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:16:04,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:16:04,503 INFO L87 Difference]: Start difference. First operand 398 states and 609 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:06,530 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-15 18:16:07,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:16:07,726 INFO L93 Difference]: Finished difference Result 799 states and 1231 transitions. [2022-04-15 18:16:07,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:16:07,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 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 99 [2022-04-15 18:16:07,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:16:07,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:07,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 495 transitions. [2022-04-15 18:16:07,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:07,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 495 transitions. [2022-04-15 18:16:07,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 495 transitions. [2022-04-15 18:16:08,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 495 edges. 495 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:16:08,154 INFO L225 Difference]: With dead ends: 799 [2022-04-15 18:16:08,154 INFO L226 Difference]: Without dead ends: 597 [2022-04-15 18:16:08,155 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:16:08,156 INFO L913 BasicCegarLoop]: 319 mSDtfsCounter, 130 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 18:16:08,156 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 483 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 343 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 18:16:08,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2022-04-15 18:16:08,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2022-04-15 18:16:08,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:16:08,202 INFO L82 GeneralOperation]: Start isEquivalent. First operand 597 states. Second operand has 597 states, 592 states have (on average 1.535472972972973) internal successors, (909), 592 states have internal predecessors, (909), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:08,218 INFO L74 IsIncluded]: Start isIncluded. First operand 597 states. Second operand has 597 states, 592 states have (on average 1.535472972972973) internal successors, (909), 592 states have internal predecessors, (909), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:08,219 INFO L87 Difference]: Start difference. First operand 597 states. Second operand has 597 states, 592 states have (on average 1.535472972972973) internal successors, (909), 592 states have internal predecessors, (909), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:08,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:16:08,238 INFO L93 Difference]: Finished difference Result 597 states and 913 transitions. [2022-04-15 18:16:08,238 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 913 transitions. [2022-04-15 18:16:08,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:16:08,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:16:08,240 INFO L74 IsIncluded]: Start isIncluded. First operand has 597 states, 592 states have (on average 1.535472972972973) internal successors, (909), 592 states have internal predecessors, (909), 3 states have call successors, (3), 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 597 states. [2022-04-15 18:16:08,241 INFO L87 Difference]: Start difference. First operand has 597 states, 592 states have (on average 1.535472972972973) internal successors, (909), 592 states have internal predecessors, (909), 3 states have call successors, (3), 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 597 states. [2022-04-15 18:16:08,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:16:08,259 INFO L93 Difference]: Finished difference Result 597 states and 913 transitions. [2022-04-15 18:16:08,259 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 913 transitions. [2022-04-15 18:16:08,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:16:08,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:16:08,260 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:16:08,260 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:16:08,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 592 states have (on average 1.535472972972973) internal successors, (909), 592 states have internal predecessors, (909), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:08,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 913 transitions. [2022-04-15 18:16:08,301 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 913 transitions. Word has length 99 [2022-04-15 18:16:08,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:16:08,302 INFO L478 AbstractCegarLoop]: Abstraction has 597 states and 913 transitions. [2022-04-15 18:16:08,302 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:08,302 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 597 states and 913 transitions. [2022-04-15 18:16:09,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 913 edges. 913 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:16:09,455 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 913 transitions. [2022-04-15 18:16:09,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-15 18:16:09,456 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:16:09,456 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:16:09,456 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 18:16:09,457 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:16:09,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:16:09,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1372929788, now seen corresponding path program 1 times [2022-04-15 18:16:09,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:16:09,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1324698025] [2022-04-15 18:16:09,458 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:16:09,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1372929788, now seen corresponding path program 2 times [2022-04-15 18:16:09,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:16:09,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330635873] [2022-04-15 18:16:09,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:16:09,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:16:09,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:16:09,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:16:09,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:16:09,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {37477#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {37471#true} is VALID [2022-04-15 18:16:09,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {37471#true} assume true; {37471#true} is VALID [2022-04-15 18:16:09,719 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37471#true} {37471#true} #591#return; {37471#true} is VALID [2022-04-15 18:16:09,720 INFO L272 TraceCheckUtils]: 0: Hoare triple {37471#true} call ULTIMATE.init(); {37477#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:16:09,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {37477#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {37471#true} is VALID [2022-04-15 18:16:09,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {37471#true} assume true; {37471#true} is VALID [2022-04-15 18:16:09,721 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37471#true} {37471#true} #591#return; {37471#true} is VALID [2022-04-15 18:16:09,721 INFO L272 TraceCheckUtils]: 4: Hoare triple {37471#true} call #t~ret159 := main(); {37471#true} is VALID [2022-04-15 18:16:09,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {37471#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {37471#true} is VALID [2022-04-15 18:16:09,721 INFO L272 TraceCheckUtils]: 6: Hoare triple {37471#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {37471#true} is VALID [2022-04-15 18:16:09,721 INFO L290 TraceCheckUtils]: 7: Hoare triple {37471#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {37471#true} is VALID [2022-04-15 18:16:09,721 INFO L290 TraceCheckUtils]: 8: Hoare triple {37471#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {37471#true} is VALID [2022-04-15 18:16:09,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {37471#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {37471#true} is VALID [2022-04-15 18:16:09,721 INFO L290 TraceCheckUtils]: 10: Hoare triple {37471#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {37471#true} is VALID [2022-04-15 18:16:09,721 INFO L290 TraceCheckUtils]: 11: Hoare triple {37471#true} assume !false; {37471#true} is VALID [2022-04-15 18:16:09,722 INFO L290 TraceCheckUtils]: 12: Hoare triple {37471#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {37471#true} is VALID [2022-04-15 18:16:09,722 INFO L290 TraceCheckUtils]: 13: Hoare triple {37471#true} assume 12292 == #t~mem43;havoc #t~mem43; {37471#true} is VALID [2022-04-15 18:16:09,722 INFO L290 TraceCheckUtils]: 14: Hoare triple {37471#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {37471#true} is VALID [2022-04-15 18:16:09,722 INFO L290 TraceCheckUtils]: 15: Hoare triple {37471#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {37471#true} is VALID [2022-04-15 18:16:09,722 INFO L290 TraceCheckUtils]: 16: Hoare triple {37471#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {37471#true} is VALID [2022-04-15 18:16:09,722 INFO L290 TraceCheckUtils]: 17: Hoare triple {37471#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {37471#true} is VALID [2022-04-15 18:16:09,722 INFO L290 TraceCheckUtils]: 18: Hoare triple {37471#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {37471#true} is VALID [2022-04-15 18:16:09,722 INFO L290 TraceCheckUtils]: 19: Hoare triple {37471#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {37471#true} is VALID [2022-04-15 18:16:09,722 INFO L290 TraceCheckUtils]: 20: Hoare triple {37471#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {37471#true} is VALID [2022-04-15 18:16:09,722 INFO L290 TraceCheckUtils]: 21: Hoare triple {37471#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {37471#true} is VALID [2022-04-15 18:16:09,722 INFO L290 TraceCheckUtils]: 22: Hoare triple {37471#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {37471#true} is VALID [2022-04-15 18:16:09,722 INFO L290 TraceCheckUtils]: 23: Hoare triple {37471#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {37471#true} is VALID [2022-04-15 18:16:09,723 INFO L290 TraceCheckUtils]: 24: Hoare triple {37471#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {37471#true} is VALID [2022-04-15 18:16:09,723 INFO L290 TraceCheckUtils]: 25: Hoare triple {37471#true} ~skip~0 := 0; {37471#true} is VALID [2022-04-15 18:16:09,723 INFO L290 TraceCheckUtils]: 26: Hoare triple {37471#true} assume !false; {37471#true} is VALID [2022-04-15 18:16:09,723 INFO L290 TraceCheckUtils]: 27: Hoare triple {37471#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {37471#true} is VALID [2022-04-15 18:16:09,723 INFO L290 TraceCheckUtils]: 28: Hoare triple {37471#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {37471#true} is VALID [2022-04-15 18:16:09,723 INFO L290 TraceCheckUtils]: 29: Hoare triple {37471#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {37471#true} is VALID [2022-04-15 18:16:09,723 INFO L290 TraceCheckUtils]: 30: Hoare triple {37471#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {37471#true} is VALID [2022-04-15 18:16:09,723 INFO L290 TraceCheckUtils]: 31: Hoare triple {37471#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {37471#true} is VALID [2022-04-15 18:16:09,723 INFO L290 TraceCheckUtils]: 32: Hoare triple {37471#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {37471#true} is VALID [2022-04-15 18:16:09,723 INFO L290 TraceCheckUtils]: 33: Hoare triple {37471#true} assume 4368 == #t~mem48;havoc #t~mem48; {37471#true} is VALID [2022-04-15 18:16:09,723 INFO L290 TraceCheckUtils]: 34: Hoare triple {37471#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {37471#true} is VALID [2022-04-15 18:16:09,724 INFO L290 TraceCheckUtils]: 35: Hoare triple {37471#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {37476#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:16:09,724 INFO L290 TraceCheckUtils]: 36: Hoare triple {37476#(= ssl3_connect_~blastFlag~0 1)} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {37476#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:16:09,724 INFO L290 TraceCheckUtils]: 37: Hoare triple {37476#(= ssl3_connect_~blastFlag~0 1)} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {37476#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:16:09,725 INFO L290 TraceCheckUtils]: 38: Hoare triple {37476#(= ssl3_connect_~blastFlag~0 1)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {37476#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:16:09,725 INFO L290 TraceCheckUtils]: 39: Hoare triple {37476#(= ssl3_connect_~blastFlag~0 1)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {37476#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:16:09,725 INFO L290 TraceCheckUtils]: 40: Hoare triple {37476#(= ssl3_connect_~blastFlag~0 1)} ~skip~0 := 0; {37476#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:16:09,726 INFO L290 TraceCheckUtils]: 41: Hoare triple {37476#(= ssl3_connect_~blastFlag~0 1)} assume !false; {37476#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:16:09,726 INFO L290 TraceCheckUtils]: 42: Hoare triple {37476#(= ssl3_connect_~blastFlag~0 1)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {37476#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:16:09,726 INFO L290 TraceCheckUtils]: 43: Hoare triple {37476#(= ssl3_connect_~blastFlag~0 1)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {37476#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:16:09,727 INFO L290 TraceCheckUtils]: 44: Hoare triple {37476#(= ssl3_connect_~blastFlag~0 1)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {37476#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:16:09,727 INFO L290 TraceCheckUtils]: 45: Hoare triple {37476#(= ssl3_connect_~blastFlag~0 1)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {37476#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:16:09,727 INFO L290 TraceCheckUtils]: 46: Hoare triple {37476#(= ssl3_connect_~blastFlag~0 1)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {37476#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:16:09,728 INFO L290 TraceCheckUtils]: 47: Hoare triple {37476#(= ssl3_connect_~blastFlag~0 1)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {37476#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:16:09,728 INFO L290 TraceCheckUtils]: 48: Hoare triple {37476#(= ssl3_connect_~blastFlag~0 1)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37476#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:16:09,728 INFO L290 TraceCheckUtils]: 49: Hoare triple {37476#(= ssl3_connect_~blastFlag~0 1)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37476#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:16:09,729 INFO L290 TraceCheckUtils]: 50: Hoare triple {37476#(= ssl3_connect_~blastFlag~0 1)} assume 4384 == #t~mem50;havoc #t~mem50; {37476#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:16:09,729 INFO L290 TraceCheckUtils]: 51: Hoare triple {37476#(= ssl3_connect_~blastFlag~0 1)} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {37476#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 18:16:09,729 INFO L290 TraceCheckUtils]: 52: Hoare triple {37476#(= ssl3_connect_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {37472#false} is VALID [2022-04-15 18:16:09,729 INFO L290 TraceCheckUtils]: 53: Hoare triple {37472#false} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {37472#false} is VALID [2022-04-15 18:16:09,729 INFO L290 TraceCheckUtils]: 54: Hoare triple {37472#false} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-15 18:16:09,729 INFO L290 TraceCheckUtils]: 55: Hoare triple {37472#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {37472#false} is VALID [2022-04-15 18:16:09,730 INFO L290 TraceCheckUtils]: 56: Hoare triple {37472#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {37472#false} is VALID [2022-04-15 18:16:09,730 INFO L290 TraceCheckUtils]: 57: Hoare triple {37472#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {37472#false} is VALID [2022-04-15 18:16:09,730 INFO L290 TraceCheckUtils]: 58: Hoare triple {37472#false} ~skip~0 := 0; {37472#false} is VALID [2022-04-15 18:16:09,730 INFO L290 TraceCheckUtils]: 59: Hoare triple {37472#false} assume !false; {37472#false} is VALID [2022-04-15 18:16:09,730 INFO L290 TraceCheckUtils]: 60: Hoare triple {37472#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-15 18:16:09,730 INFO L290 TraceCheckUtils]: 61: Hoare triple {37472#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-15 18:16:09,730 INFO L290 TraceCheckUtils]: 62: Hoare triple {37472#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-15 18:16:09,730 INFO L290 TraceCheckUtils]: 63: Hoare triple {37472#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-15 18:16:09,730 INFO L290 TraceCheckUtils]: 64: Hoare triple {37472#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-15 18:16:09,730 INFO L290 TraceCheckUtils]: 65: Hoare triple {37472#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-15 18:16:09,730 INFO L290 TraceCheckUtils]: 66: Hoare triple {37472#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-15 18:16:09,730 INFO L290 TraceCheckUtils]: 67: Hoare triple {37472#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-15 18:16:09,731 INFO L290 TraceCheckUtils]: 68: Hoare triple {37472#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-15 18:16:09,731 INFO L290 TraceCheckUtils]: 69: Hoare triple {37472#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-15 18:16:09,731 INFO L290 TraceCheckUtils]: 70: Hoare triple {37472#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-15 18:16:09,731 INFO L290 TraceCheckUtils]: 71: Hoare triple {37472#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-15 18:16:09,731 INFO L290 TraceCheckUtils]: 72: Hoare triple {37472#false} assume 4416 == #t~mem54;havoc #t~mem54; {37472#false} is VALID [2022-04-15 18:16:09,731 INFO L290 TraceCheckUtils]: 73: Hoare triple {37472#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {37472#false} is VALID [2022-04-15 18:16:09,731 INFO L290 TraceCheckUtils]: 74: Hoare triple {37472#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {37472#false} is VALID [2022-04-15 18:16:09,731 INFO L290 TraceCheckUtils]: 75: Hoare triple {37472#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {37472#false} is VALID [2022-04-15 18:16:09,731 INFO L290 TraceCheckUtils]: 76: Hoare triple {37472#false} assume !(0 == ~tmp___6~0); {37472#false} is VALID [2022-04-15 18:16:09,731 INFO L290 TraceCheckUtils]: 77: Hoare triple {37472#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {37472#false} is VALID [2022-04-15 18:16:09,731 INFO L290 TraceCheckUtils]: 78: Hoare triple {37472#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {37472#false} is VALID [2022-04-15 18:16:09,732 INFO L290 TraceCheckUtils]: 79: Hoare triple {37472#false} ~skip~0 := 0; {37472#false} is VALID [2022-04-15 18:16:09,732 INFO L290 TraceCheckUtils]: 80: Hoare triple {37472#false} assume !false; {37472#false} is VALID [2022-04-15 18:16:09,732 INFO L290 TraceCheckUtils]: 81: Hoare triple {37472#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-15 18:16:09,732 INFO L290 TraceCheckUtils]: 82: Hoare triple {37472#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-15 18:16:09,732 INFO L290 TraceCheckUtils]: 83: Hoare triple {37472#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-15 18:16:09,732 INFO L290 TraceCheckUtils]: 84: Hoare triple {37472#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-15 18:16:09,732 INFO L290 TraceCheckUtils]: 85: Hoare triple {37472#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-15 18:16:09,732 INFO L290 TraceCheckUtils]: 86: Hoare triple {37472#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-15 18:16:09,732 INFO L290 TraceCheckUtils]: 87: Hoare triple {37472#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-15 18:16:09,732 INFO L290 TraceCheckUtils]: 88: Hoare triple {37472#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-15 18:16:09,732 INFO L290 TraceCheckUtils]: 89: Hoare triple {37472#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-15 18:16:09,732 INFO L290 TraceCheckUtils]: 90: Hoare triple {37472#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-15 18:16:09,733 INFO L290 TraceCheckUtils]: 91: Hoare triple {37472#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-15 18:16:09,733 INFO L290 TraceCheckUtils]: 92: Hoare triple {37472#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-15 18:16:09,733 INFO L290 TraceCheckUtils]: 93: Hoare triple {37472#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-15 18:16:09,733 INFO L290 TraceCheckUtils]: 94: Hoare triple {37472#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {37472#false} is VALID [2022-04-15 18:16:09,733 INFO L290 TraceCheckUtils]: 95: Hoare triple {37472#false} assume 4432 == #t~mem56;havoc #t~mem56; {37472#false} is VALID [2022-04-15 18:16:09,733 INFO L290 TraceCheckUtils]: 96: Hoare triple {37472#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {37472#false} is VALID [2022-04-15 18:16:09,733 INFO L290 TraceCheckUtils]: 97: Hoare triple {37472#false} assume 5 == ~blastFlag~0; {37472#false} is VALID [2022-04-15 18:16:09,733 INFO L290 TraceCheckUtils]: 98: Hoare triple {37472#false} assume !false; {37472#false} is VALID [2022-04-15 18:16:09,733 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-15 18:16:09,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:16:09,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330635873] [2022-04-15 18:16:09,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330635873] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:16:09,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:16:09,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:16:09,734 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:16:09,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1324698025] [2022-04-15 18:16:09,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1324698025] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:16:09,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:16:09,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:16:09,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150712433] [2022-04-15 18:16:09,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:16:09,735 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 99 [2022-04-15 18:16:09,735 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:16:09,735 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-15 18:16:09,807 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-15 18:16:09,807 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:16:09,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:16:09,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:16:09,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:16:09,808 INFO L87 Difference]: Start difference. First operand 597 states and 913 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-15 18:16:11,830 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-15 18:16:12,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:16:12,613 INFO L93 Difference]: Finished difference Result 1022 states and 1563 transitions. [2022-04-15 18:16:12,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:16:12,614 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 99 [2022-04-15 18:16:12,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:16:12,614 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-15 18:16:12,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 371 transitions. [2022-04-15 18:16:12,630 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-15 18:16:12,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 371 transitions. [2022-04-15 18:16:12,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 371 transitions. [2022-04-15 18:16:12,919 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 371 edges. 371 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:16:12,948 INFO L225 Difference]: With dead ends: 1022 [2022-04-15 18:16:12,948 INFO L226 Difference]: Without dead ends: 621 [2022-04-15 18:16:12,949 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:16:12,950 INFO L913 BasicCegarLoop]: 199 mSDtfsCounter, 15 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 18:16:12,950 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 363 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 215 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 18:16:12,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2022-04-15 18:16:13,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2022-04-15 18:16:13,025 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:16:13,026 INFO L82 GeneralOperation]: Start isEquivalent. First operand 621 states. Second operand has 621 states, 616 states have (on average 1.5275974025974026) internal successors, (941), 616 states have internal predecessors, (941), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:13,028 INFO L74 IsIncluded]: Start isIncluded. First operand 621 states. Second operand has 621 states, 616 states have (on average 1.5275974025974026) internal successors, (941), 616 states have internal predecessors, (941), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:13,028 INFO L87 Difference]: Start difference. First operand 621 states. Second operand has 621 states, 616 states have (on average 1.5275974025974026) internal successors, (941), 616 states have internal predecessors, (941), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:13,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:16:13,071 INFO L93 Difference]: Finished difference Result 621 states and 945 transitions. [2022-04-15 18:16:13,071 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 945 transitions. [2022-04-15 18:16:13,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:16:13,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:16:13,073 INFO L74 IsIncluded]: Start isIncluded. First operand has 621 states, 616 states have (on average 1.5275974025974026) internal successors, (941), 616 states have internal predecessors, (941), 3 states have call successors, (3), 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 621 states. [2022-04-15 18:16:13,074 INFO L87 Difference]: Start difference. First operand has 621 states, 616 states have (on average 1.5275974025974026) internal successors, (941), 616 states have internal predecessors, (941), 3 states have call successors, (3), 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 621 states. [2022-04-15 18:16:13,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:16:13,106 INFO L93 Difference]: Finished difference Result 621 states and 945 transitions. [2022-04-15 18:16:13,106 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 945 transitions. [2022-04-15 18:16:13,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:16:13,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:16:13,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:16:13,107 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:16:13,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 616 states have (on average 1.5275974025974026) internal successors, (941), 616 states have internal predecessors, (941), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:13,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 945 transitions. [2022-04-15 18:16:13,164 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 945 transitions. Word has length 99 [2022-04-15 18:16:13,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:16:13,164 INFO L478 AbstractCegarLoop]: Abstraction has 621 states and 945 transitions. [2022-04-15 18:16:13,164 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:13,164 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 621 states and 945 transitions. [2022-04-15 18:16:14,115 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 945 edges. 945 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:16:14,116 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 945 transitions. [2022-04-15 18:16:14,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-15 18:16:14,117 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:16:14,117 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:16:14,117 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 18:16:14,117 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:16:14,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:16:14,118 INFO L85 PathProgramCache]: Analyzing trace with hash -816970310, now seen corresponding path program 1 times [2022-04-15 18:16:14,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:16:14,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1694765577] [2022-04-15 18:16:14,118 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:16:14,118 INFO L85 PathProgramCache]: Analyzing trace with hash -816970310, now seen corresponding path program 2 times [2022-04-15 18:16:14,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:16:14,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000039572] [2022-04-15 18:16:14,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:16:14,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:16:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:16:14,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:16:14,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:16:14,453 INFO L290 TraceCheckUtils]: 0: Hoare triple {42014#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {42008#true} is VALID [2022-04-15 18:16:14,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {42008#true} assume true; {42008#true} is VALID [2022-04-15 18:16:14,453 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42008#true} {42008#true} #591#return; {42008#true} is VALID [2022-04-15 18:16:14,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {42008#true} call ULTIMATE.init(); {42014#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:16:14,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {42014#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {42008#true} is VALID [2022-04-15 18:16:14,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {42008#true} assume true; {42008#true} is VALID [2022-04-15 18:16:14,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42008#true} {42008#true} #591#return; {42008#true} is VALID [2022-04-15 18:16:14,455 INFO L272 TraceCheckUtils]: 4: Hoare triple {42008#true} call #t~ret159 := main(); {42008#true} is VALID [2022-04-15 18:16:14,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {42008#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {42008#true} is VALID [2022-04-15 18:16:14,455 INFO L272 TraceCheckUtils]: 6: Hoare triple {42008#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {42008#true} is VALID [2022-04-15 18:16:14,455 INFO L290 TraceCheckUtils]: 7: Hoare triple {42008#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {42008#true} is VALID [2022-04-15 18:16:14,455 INFO L290 TraceCheckUtils]: 8: Hoare triple {42008#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {42008#true} is VALID [2022-04-15 18:16:14,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {42008#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {42008#true} is VALID [2022-04-15 18:16:14,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {42008#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {42008#true} is VALID [2022-04-15 18:16:14,455 INFO L290 TraceCheckUtils]: 11: Hoare triple {42008#true} assume !false; {42008#true} is VALID [2022-04-15 18:16:14,455 INFO L290 TraceCheckUtils]: 12: Hoare triple {42008#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-15 18:16:14,455 INFO L290 TraceCheckUtils]: 13: Hoare triple {42008#true} assume 12292 == #t~mem43;havoc #t~mem43; {42008#true} is VALID [2022-04-15 18:16:14,456 INFO L290 TraceCheckUtils]: 14: Hoare triple {42008#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {42008#true} is VALID [2022-04-15 18:16:14,456 INFO L290 TraceCheckUtils]: 15: Hoare triple {42008#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {42008#true} is VALID [2022-04-15 18:16:14,456 INFO L290 TraceCheckUtils]: 16: Hoare triple {42008#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {42008#true} is VALID [2022-04-15 18:16:14,456 INFO L290 TraceCheckUtils]: 17: Hoare triple {42008#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {42008#true} is VALID [2022-04-15 18:16:14,456 INFO L290 TraceCheckUtils]: 18: Hoare triple {42008#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {42008#true} is VALID [2022-04-15 18:16:14,456 INFO L290 TraceCheckUtils]: 19: Hoare triple {42008#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {42008#true} is VALID [2022-04-15 18:16:14,456 INFO L290 TraceCheckUtils]: 20: Hoare triple {42008#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {42008#true} is VALID [2022-04-15 18:16:14,456 INFO L290 TraceCheckUtils]: 21: Hoare triple {42008#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {42008#true} is VALID [2022-04-15 18:16:14,456 INFO L290 TraceCheckUtils]: 22: Hoare triple {42008#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {42008#true} is VALID [2022-04-15 18:16:14,456 INFO L290 TraceCheckUtils]: 23: Hoare triple {42008#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {42008#true} is VALID [2022-04-15 18:16:14,456 INFO L290 TraceCheckUtils]: 24: Hoare triple {42008#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {42008#true} is VALID [2022-04-15 18:16:14,457 INFO L290 TraceCheckUtils]: 25: Hoare triple {42008#true} ~skip~0 := 0; {42008#true} is VALID [2022-04-15 18:16:14,457 INFO L290 TraceCheckUtils]: 26: Hoare triple {42008#true} assume !false; {42008#true} is VALID [2022-04-15 18:16:14,457 INFO L290 TraceCheckUtils]: 27: Hoare triple {42008#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-15 18:16:14,457 INFO L290 TraceCheckUtils]: 28: Hoare triple {42008#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-15 18:16:14,457 INFO L290 TraceCheckUtils]: 29: Hoare triple {42008#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-15 18:16:14,457 INFO L290 TraceCheckUtils]: 30: Hoare triple {42008#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-15 18:16:14,457 INFO L290 TraceCheckUtils]: 31: Hoare triple {42008#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-15 18:16:14,457 INFO L290 TraceCheckUtils]: 32: Hoare triple {42008#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-15 18:16:14,457 INFO L290 TraceCheckUtils]: 33: Hoare triple {42008#true} assume 4368 == #t~mem48;havoc #t~mem48; {42008#true} is VALID [2022-04-15 18:16:14,457 INFO L290 TraceCheckUtils]: 34: Hoare triple {42008#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {42008#true} is VALID [2022-04-15 18:16:14,457 INFO L290 TraceCheckUtils]: 35: Hoare triple {42008#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {42008#true} is VALID [2022-04-15 18:16:14,457 INFO L290 TraceCheckUtils]: 36: Hoare triple {42008#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {42008#true} is VALID [2022-04-15 18:16:14,458 INFO L290 TraceCheckUtils]: 37: Hoare triple {42008#true} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {42008#true} is VALID [2022-04-15 18:16:14,458 INFO L290 TraceCheckUtils]: 38: Hoare triple {42008#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {42008#true} is VALID [2022-04-15 18:16:14,458 INFO L290 TraceCheckUtils]: 39: Hoare triple {42008#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {42008#true} is VALID [2022-04-15 18:16:14,458 INFO L290 TraceCheckUtils]: 40: Hoare triple {42008#true} ~skip~0 := 0; {42008#true} is VALID [2022-04-15 18:16:14,458 INFO L290 TraceCheckUtils]: 41: Hoare triple {42008#true} assume !false; {42008#true} is VALID [2022-04-15 18:16:14,458 INFO L290 TraceCheckUtils]: 42: Hoare triple {42008#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-15 18:16:14,458 INFO L290 TraceCheckUtils]: 43: Hoare triple {42008#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-15 18:16:14,458 INFO L290 TraceCheckUtils]: 44: Hoare triple {42008#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-15 18:16:14,458 INFO L290 TraceCheckUtils]: 45: Hoare triple {42008#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-15 18:16:14,458 INFO L290 TraceCheckUtils]: 46: Hoare triple {42008#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-15 18:16:14,458 INFO L290 TraceCheckUtils]: 47: Hoare triple {42008#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-15 18:16:14,458 INFO L290 TraceCheckUtils]: 48: Hoare triple {42008#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-15 18:16:14,459 INFO L290 TraceCheckUtils]: 49: Hoare triple {42008#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-15 18:16:14,459 INFO L290 TraceCheckUtils]: 50: Hoare triple {42008#true} assume 4384 == #t~mem50;havoc #t~mem50; {42008#true} is VALID [2022-04-15 18:16:14,459 INFO L290 TraceCheckUtils]: 51: Hoare triple {42008#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {42008#true} is VALID [2022-04-15 18:16:14,459 INFO L290 TraceCheckUtils]: 52: Hoare triple {42008#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {42008#true} is VALID [2022-04-15 18:16:14,459 INFO L290 TraceCheckUtils]: 53: Hoare triple {42008#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {42008#true} is VALID [2022-04-15 18:16:14,459 INFO L290 TraceCheckUtils]: 54: Hoare triple {42008#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-15 18:16:14,459 INFO L290 TraceCheckUtils]: 55: Hoare triple {42008#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {42008#true} is VALID [2022-04-15 18:16:14,459 INFO L290 TraceCheckUtils]: 56: Hoare triple {42008#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {42008#true} is VALID [2022-04-15 18:16:14,459 INFO L290 TraceCheckUtils]: 57: Hoare triple {42008#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {42008#true} is VALID [2022-04-15 18:16:14,459 INFO L290 TraceCheckUtils]: 58: Hoare triple {42008#true} ~skip~0 := 0; {42008#true} is VALID [2022-04-15 18:16:14,459 INFO L290 TraceCheckUtils]: 59: Hoare triple {42008#true} assume !false; {42008#true} is VALID [2022-04-15 18:16:14,460 INFO L290 TraceCheckUtils]: 60: Hoare triple {42008#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-15 18:16:14,460 INFO L290 TraceCheckUtils]: 61: Hoare triple {42008#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-15 18:16:14,460 INFO L290 TraceCheckUtils]: 62: Hoare triple {42008#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-15 18:16:14,460 INFO L290 TraceCheckUtils]: 63: Hoare triple {42008#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-15 18:16:14,460 INFO L290 TraceCheckUtils]: 64: Hoare triple {42008#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-15 18:16:14,460 INFO L290 TraceCheckUtils]: 65: Hoare triple {42008#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-15 18:16:14,460 INFO L290 TraceCheckUtils]: 66: Hoare triple {42008#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-15 18:16:14,460 INFO L290 TraceCheckUtils]: 67: Hoare triple {42008#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-15 18:16:14,460 INFO L290 TraceCheckUtils]: 68: Hoare triple {42008#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-15 18:16:14,460 INFO L290 TraceCheckUtils]: 69: Hoare triple {42008#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-15 18:16:14,460 INFO L290 TraceCheckUtils]: 70: Hoare triple {42008#true} assume 4400 == #t~mem52;havoc #t~mem52; {42008#true} is VALID [2022-04-15 18:16:14,460 INFO L290 TraceCheckUtils]: 71: Hoare triple {42008#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 888 + #t~mem90.offset, 8);call #t~mem92 := read~int(#t~mem91.base, 20 + #t~mem91.offset, 8); {42008#true} is VALID [2022-04-15 18:16:14,461 INFO L290 TraceCheckUtils]: 72: Hoare triple {42008#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 18446744073709551616);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {42008#true} is VALID [2022-04-15 18:16:14,461 INFO L290 TraceCheckUtils]: 73: Hoare triple {42008#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {42008#true} is VALID [2022-04-15 18:16:14,461 INFO L290 TraceCheckUtils]: 74: Hoare triple {42008#true} assume !(~ret~0 <= 0); {42008#true} is VALID [2022-04-15 18:16:14,461 INFO L290 TraceCheckUtils]: 75: Hoare triple {42008#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {42008#true} is VALID [2022-04-15 18:16:14,461 INFO L290 TraceCheckUtils]: 76: Hoare triple {42008#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {42008#true} is VALID [2022-04-15 18:16:14,461 INFO L290 TraceCheckUtils]: 77: Hoare triple {42008#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {42008#true} is VALID [2022-04-15 18:16:14,461 INFO L290 TraceCheckUtils]: 78: Hoare triple {42008#true} ~skip~0 := 0; {42008#true} is VALID [2022-04-15 18:16:14,461 INFO L290 TraceCheckUtils]: 79: Hoare triple {42008#true} assume !false; {42008#true} is VALID [2022-04-15 18:16:14,461 INFO L290 TraceCheckUtils]: 80: Hoare triple {42008#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-15 18:16:14,461 INFO L290 TraceCheckUtils]: 81: Hoare triple {42008#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-15 18:16:14,461 INFO L290 TraceCheckUtils]: 82: Hoare triple {42008#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-15 18:16:14,462 INFO L290 TraceCheckUtils]: 83: Hoare triple {42008#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-15 18:16:14,462 INFO L290 TraceCheckUtils]: 84: Hoare triple {42008#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-15 18:16:14,462 INFO L290 TraceCheckUtils]: 85: Hoare triple {42008#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-15 18:16:14,462 INFO L290 TraceCheckUtils]: 86: Hoare triple {42008#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-15 18:16:14,462 INFO L290 TraceCheckUtils]: 87: Hoare triple {42008#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-15 18:16:14,462 INFO L290 TraceCheckUtils]: 88: Hoare triple {42008#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-15 18:16:14,462 INFO L290 TraceCheckUtils]: 89: Hoare triple {42008#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-15 18:16:14,462 INFO L290 TraceCheckUtils]: 90: Hoare triple {42008#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-15 18:16:14,462 INFO L290 TraceCheckUtils]: 91: Hoare triple {42008#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {42008#true} is VALID [2022-04-15 18:16:14,462 INFO L290 TraceCheckUtils]: 92: Hoare triple {42008#true} assume 4416 == #t~mem54;havoc #t~mem54; {42008#true} is VALID [2022-04-15 18:16:14,462 INFO L290 TraceCheckUtils]: 93: Hoare triple {42008#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {42008#true} is VALID [2022-04-15 18:16:14,463 INFO L290 TraceCheckUtils]: 94: Hoare triple {42008#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {42013#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 18:16:14,463 INFO L290 TraceCheckUtils]: 95: Hoare triple {42013#(= ssl3_connect_~blastFlag~0 4)} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {42013#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 18:16:14,463 INFO L290 TraceCheckUtils]: 96: Hoare triple {42013#(= ssl3_connect_~blastFlag~0 4)} assume !(0 == ~tmp___6~0); {42013#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 18:16:14,464 INFO L290 TraceCheckUtils]: 97: Hoare triple {42013#(= ssl3_connect_~blastFlag~0 4)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {42013#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 18:16:14,464 INFO L290 TraceCheckUtils]: 98: Hoare triple {42013#(= ssl3_connect_~blastFlag~0 4)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {42013#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 18:16:14,464 INFO L290 TraceCheckUtils]: 99: Hoare triple {42013#(= ssl3_connect_~blastFlag~0 4)} ~skip~0 := 0; {42013#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 18:16:14,465 INFO L290 TraceCheckUtils]: 100: Hoare triple {42013#(= ssl3_connect_~blastFlag~0 4)} assume !false; {42013#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 18:16:14,465 INFO L290 TraceCheckUtils]: 101: Hoare triple {42013#(= ssl3_connect_~blastFlag~0 4)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {42013#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 18:16:14,465 INFO L290 TraceCheckUtils]: 102: Hoare triple {42013#(= ssl3_connect_~blastFlag~0 4)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {42013#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 18:16:14,466 INFO L290 TraceCheckUtils]: 103: Hoare triple {42013#(= ssl3_connect_~blastFlag~0 4)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {42013#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 18:16:14,466 INFO L290 TraceCheckUtils]: 104: Hoare triple {42013#(= ssl3_connect_~blastFlag~0 4)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {42013#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 18:16:14,466 INFO L290 TraceCheckUtils]: 105: Hoare triple {42013#(= ssl3_connect_~blastFlag~0 4)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {42013#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 18:16:14,466 INFO L290 TraceCheckUtils]: 106: Hoare triple {42013#(= ssl3_connect_~blastFlag~0 4)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {42013#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 18:16:14,467 INFO L290 TraceCheckUtils]: 107: Hoare triple {42013#(= ssl3_connect_~blastFlag~0 4)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {42013#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 18:16:14,467 INFO L290 TraceCheckUtils]: 108: Hoare triple {42013#(= ssl3_connect_~blastFlag~0 4)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {42013#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 18:16:14,467 INFO L290 TraceCheckUtils]: 109: Hoare triple {42013#(= ssl3_connect_~blastFlag~0 4)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {42013#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 18:16:14,468 INFO L290 TraceCheckUtils]: 110: Hoare triple {42013#(= ssl3_connect_~blastFlag~0 4)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {42013#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 18:16:14,468 INFO L290 TraceCheckUtils]: 111: Hoare triple {42013#(= ssl3_connect_~blastFlag~0 4)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {42013#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 18:16:14,468 INFO L290 TraceCheckUtils]: 112: Hoare triple {42013#(= ssl3_connect_~blastFlag~0 4)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {42013#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 18:16:14,469 INFO L290 TraceCheckUtils]: 113: Hoare triple {42013#(= ssl3_connect_~blastFlag~0 4)} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {42013#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 18:16:14,469 INFO L290 TraceCheckUtils]: 114: Hoare triple {42013#(= ssl3_connect_~blastFlag~0 4)} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {42013#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 18:16:14,469 INFO L290 TraceCheckUtils]: 115: Hoare triple {42013#(= ssl3_connect_~blastFlag~0 4)} assume 4432 == #t~mem56;havoc #t~mem56; {42013#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 18:16:14,469 INFO L290 TraceCheckUtils]: 116: Hoare triple {42013#(= ssl3_connect_~blastFlag~0 4)} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {42013#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 18:16:14,470 INFO L290 TraceCheckUtils]: 117: Hoare triple {42013#(= ssl3_connect_~blastFlag~0 4)} assume 5 == ~blastFlag~0; {42009#false} is VALID [2022-04-15 18:16:14,470 INFO L290 TraceCheckUtils]: 118: Hoare triple {42009#false} assume !false; {42009#false} is VALID [2022-04-15 18:16:14,470 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-04-15 18:16:14,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:16:14,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000039572] [2022-04-15 18:16:14,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000039572] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:16:14,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:16:14,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:16:14,471 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:16:14,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1694765577] [2022-04-15 18:16:14,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1694765577] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:16:14,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:16:14,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:16:14,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636414636] [2022-04-15 18:16:14,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:16:14,472 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2022-04-15 18:16:14,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:16:14,472 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-15 18:16:14,563 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-15 18:16:14,563 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:16:14,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:16:14,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:16:14,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:16:14,564 INFO L87 Difference]: Start difference. First operand 621 states and 945 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-15 18:16:16,588 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-15 18:16:17,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:16:17,863 INFO L93 Difference]: Finished difference Result 1245 states and 1901 transitions. [2022-04-15 18:16:17,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:16:17,863 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2022-04-15 18:16:17,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:16:17,864 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-15 18:16:17,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 493 transitions. [2022-04-15 18:16:17,870 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-15 18:16:17,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 493 transitions. [2022-04-15 18:16:17,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 493 transitions. [2022-04-15 18:16:18,266 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 493 edges. 493 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:16:18,307 INFO L225 Difference]: With dead ends: 1245 [2022-04-15 18:16:18,307 INFO L226 Difference]: Without dead ends: 820 [2022-04-15 18:16:18,310 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:16:18,311 INFO L913 BasicCegarLoop]: 318 mSDtfsCounter, 127 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 18:16:18,311 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 482 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 341 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 18:16:18,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2022-04-15 18:16:18,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 818. [2022-04-15 18:16:18,387 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:16:18,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 820 states. Second operand has 818 states, 813 states have (on average 1.5276752767527675) internal successors, (1242), 813 states have internal predecessors, (1242), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:18,389 INFO L74 IsIncluded]: Start isIncluded. First operand 820 states. Second operand has 818 states, 813 states have (on average 1.5276752767527675) internal successors, (1242), 813 states have internal predecessors, (1242), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:18,404 INFO L87 Difference]: Start difference. First operand 820 states. Second operand has 818 states, 813 states have (on average 1.5276752767527675) internal successors, (1242), 813 states have internal predecessors, (1242), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:18,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:16:18,471 INFO L93 Difference]: Finished difference Result 820 states and 1247 transitions. [2022-04-15 18:16:18,471 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1247 transitions. [2022-04-15 18:16:18,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:16:18,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:16:18,474 INFO L74 IsIncluded]: Start isIncluded. First operand has 818 states, 813 states have (on average 1.5276752767527675) internal successors, (1242), 813 states have internal predecessors, (1242), 3 states have call successors, (3), 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 820 states. [2022-04-15 18:16:18,476 INFO L87 Difference]: Start difference. First operand has 818 states, 813 states have (on average 1.5276752767527675) internal successors, (1242), 813 states have internal predecessors, (1242), 3 states have call successors, (3), 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 820 states. [2022-04-15 18:16:18,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:16:18,543 INFO L93 Difference]: Finished difference Result 820 states and 1247 transitions. [2022-04-15 18:16:18,543 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1247 transitions. [2022-04-15 18:16:18,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:16:18,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:16:18,544 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:16:18,544 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:16:18,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 813 states have (on average 1.5276752767527675) internal successors, (1242), 813 states have internal predecessors, (1242), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:18,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1246 transitions. [2022-04-15 18:16:18,607 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1246 transitions. Word has length 119 [2022-04-15 18:16:18,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:16:18,607 INFO L478 AbstractCegarLoop]: Abstraction has 818 states and 1246 transitions. [2022-04-15 18:16:18,608 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:18,608 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 818 states and 1246 transitions. [2022-04-15 18:16:19,808 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1246 edges. 1246 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:16:19,808 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1246 transitions. [2022-04-15 18:16:19,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-15 18:16:19,809 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:16:19,809 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:16:19,810 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 18:16:19,810 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:16:19,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:16:19,810 INFO L85 PathProgramCache]: Analyzing trace with hash -676421700, now seen corresponding path program 1 times [2022-04-15 18:16:19,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:16:19,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2003382361] [2022-04-15 18:16:19,811 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:16:19,811 INFO L85 PathProgramCache]: Analyzing trace with hash -676421700, now seen corresponding path program 2 times [2022-04-15 18:16:19,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:16:19,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599820957] [2022-04-15 18:16:19,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:16:19,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:16:20,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:16:20,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:16:20,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:16:20,288 INFO L290 TraceCheckUtils]: 0: Hoare triple {47789#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {47783#true} is VALID [2022-04-15 18:16:20,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {47783#true} assume true; {47783#true} is VALID [2022-04-15 18:16:20,289 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47783#true} {47783#true} #591#return; {47783#true} is VALID [2022-04-15 18:16:20,290 INFO L272 TraceCheckUtils]: 0: Hoare triple {47783#true} call ULTIMATE.init(); {47789#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:16:20,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {47789#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {47783#true} is VALID [2022-04-15 18:16:20,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {47783#true} assume true; {47783#true} is VALID [2022-04-15 18:16:20,290 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47783#true} {47783#true} #591#return; {47783#true} is VALID [2022-04-15 18:16:20,290 INFO L272 TraceCheckUtils]: 4: Hoare triple {47783#true} call #t~ret159 := main(); {47783#true} is VALID [2022-04-15 18:16:20,290 INFO L290 TraceCheckUtils]: 5: Hoare triple {47783#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {47783#true} is VALID [2022-04-15 18:16:20,290 INFO L272 TraceCheckUtils]: 6: Hoare triple {47783#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {47783#true} is VALID [2022-04-15 18:16:20,290 INFO L290 TraceCheckUtils]: 7: Hoare triple {47783#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {47783#true} is VALID [2022-04-15 18:16:20,290 INFO L290 TraceCheckUtils]: 8: Hoare triple {47783#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {47783#true} is VALID [2022-04-15 18:16:20,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {47783#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {47783#true} is VALID [2022-04-15 18:16:20,291 INFO L290 TraceCheckUtils]: 10: Hoare triple {47783#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {47783#true} is VALID [2022-04-15 18:16:20,291 INFO L290 TraceCheckUtils]: 11: Hoare triple {47783#true} assume !false; {47783#true} is VALID [2022-04-15 18:16:20,291 INFO L290 TraceCheckUtils]: 12: Hoare triple {47783#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-15 18:16:20,291 INFO L290 TraceCheckUtils]: 13: Hoare triple {47783#true} assume 12292 == #t~mem43;havoc #t~mem43; {47783#true} is VALID [2022-04-15 18:16:20,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {47783#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {47783#true} is VALID [2022-04-15 18:16:20,291 INFO L290 TraceCheckUtils]: 15: Hoare triple {47783#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {47783#true} is VALID [2022-04-15 18:16:20,291 INFO L290 TraceCheckUtils]: 16: Hoare triple {47783#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {47783#true} is VALID [2022-04-15 18:16:20,291 INFO L290 TraceCheckUtils]: 17: Hoare triple {47783#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {47783#true} is VALID [2022-04-15 18:16:20,291 INFO L290 TraceCheckUtils]: 18: Hoare triple {47783#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {47783#true} is VALID [2022-04-15 18:16:20,291 INFO L290 TraceCheckUtils]: 19: Hoare triple {47783#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {47783#true} is VALID [2022-04-15 18:16:20,292 INFO L290 TraceCheckUtils]: 20: Hoare triple {47783#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {47783#true} is VALID [2022-04-15 18:16:20,292 INFO L290 TraceCheckUtils]: 21: Hoare triple {47783#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {47783#true} is VALID [2022-04-15 18:16:20,292 INFO L290 TraceCheckUtils]: 22: Hoare triple {47783#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {47783#true} is VALID [2022-04-15 18:16:20,292 INFO L290 TraceCheckUtils]: 23: Hoare triple {47783#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {47783#true} is VALID [2022-04-15 18:16:20,292 INFO L290 TraceCheckUtils]: 24: Hoare triple {47783#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {47783#true} is VALID [2022-04-15 18:16:20,292 INFO L290 TraceCheckUtils]: 25: Hoare triple {47783#true} ~skip~0 := 0; {47783#true} is VALID [2022-04-15 18:16:20,292 INFO L290 TraceCheckUtils]: 26: Hoare triple {47783#true} assume !false; {47783#true} is VALID [2022-04-15 18:16:20,292 INFO L290 TraceCheckUtils]: 27: Hoare triple {47783#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-15 18:16:20,292 INFO L290 TraceCheckUtils]: 28: Hoare triple {47783#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-15 18:16:20,292 INFO L290 TraceCheckUtils]: 29: Hoare triple {47783#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-15 18:16:20,292 INFO L290 TraceCheckUtils]: 30: Hoare triple {47783#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-15 18:16:20,293 INFO L290 TraceCheckUtils]: 31: Hoare triple {47783#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-15 18:16:20,293 INFO L290 TraceCheckUtils]: 32: Hoare triple {47783#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-15 18:16:20,293 INFO L290 TraceCheckUtils]: 33: Hoare triple {47783#true} assume 4368 == #t~mem48;havoc #t~mem48; {47783#true} is VALID [2022-04-15 18:16:20,293 INFO L290 TraceCheckUtils]: 34: Hoare triple {47783#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {47783#true} is VALID [2022-04-15 18:16:20,293 INFO L290 TraceCheckUtils]: 35: Hoare triple {47783#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {47783#true} is VALID [2022-04-15 18:16:20,293 INFO L290 TraceCheckUtils]: 36: Hoare triple {47783#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {47783#true} is VALID [2022-04-15 18:16:20,293 INFO L290 TraceCheckUtils]: 37: Hoare triple {47783#true} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {47783#true} is VALID [2022-04-15 18:16:20,293 INFO L290 TraceCheckUtils]: 38: Hoare triple {47783#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {47783#true} is VALID [2022-04-15 18:16:20,293 INFO L290 TraceCheckUtils]: 39: Hoare triple {47783#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {47783#true} is VALID [2022-04-15 18:16:20,293 INFO L290 TraceCheckUtils]: 40: Hoare triple {47783#true} ~skip~0 := 0; {47783#true} is VALID [2022-04-15 18:16:20,293 INFO L290 TraceCheckUtils]: 41: Hoare triple {47783#true} assume !false; {47783#true} is VALID [2022-04-15 18:16:20,293 INFO L290 TraceCheckUtils]: 42: Hoare triple {47783#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-15 18:16:20,294 INFO L290 TraceCheckUtils]: 43: Hoare triple {47783#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-15 18:16:20,294 INFO L290 TraceCheckUtils]: 44: Hoare triple {47783#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-15 18:16:20,294 INFO L290 TraceCheckUtils]: 45: Hoare triple {47783#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-15 18:16:20,294 INFO L290 TraceCheckUtils]: 46: Hoare triple {47783#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-15 18:16:20,294 INFO L290 TraceCheckUtils]: 47: Hoare triple {47783#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-15 18:16:20,294 INFO L290 TraceCheckUtils]: 48: Hoare triple {47783#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-15 18:16:20,294 INFO L290 TraceCheckUtils]: 49: Hoare triple {47783#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-15 18:16:20,294 INFO L290 TraceCheckUtils]: 50: Hoare triple {47783#true} assume 4384 == #t~mem50;havoc #t~mem50; {47783#true} is VALID [2022-04-15 18:16:20,294 INFO L290 TraceCheckUtils]: 51: Hoare triple {47783#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {47783#true} is VALID [2022-04-15 18:16:20,294 INFO L290 TraceCheckUtils]: 52: Hoare triple {47783#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {47783#true} is VALID [2022-04-15 18:16:20,294 INFO L290 TraceCheckUtils]: 53: Hoare triple {47783#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {47783#true} is VALID [2022-04-15 18:16:20,294 INFO L290 TraceCheckUtils]: 54: Hoare triple {47783#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-15 18:16:20,295 INFO L290 TraceCheckUtils]: 55: Hoare triple {47783#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {47783#true} is VALID [2022-04-15 18:16:20,295 INFO L290 TraceCheckUtils]: 56: Hoare triple {47783#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {47783#true} is VALID [2022-04-15 18:16:20,295 INFO L290 TraceCheckUtils]: 57: Hoare triple {47783#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {47783#true} is VALID [2022-04-15 18:16:20,295 INFO L290 TraceCheckUtils]: 58: Hoare triple {47783#true} ~skip~0 := 0; {47783#true} is VALID [2022-04-15 18:16:20,295 INFO L290 TraceCheckUtils]: 59: Hoare triple {47783#true} assume !false; {47783#true} is VALID [2022-04-15 18:16:20,295 INFO L290 TraceCheckUtils]: 60: Hoare triple {47783#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-15 18:16:20,295 INFO L290 TraceCheckUtils]: 61: Hoare triple {47783#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-15 18:16:20,295 INFO L290 TraceCheckUtils]: 62: Hoare triple {47783#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-15 18:16:20,295 INFO L290 TraceCheckUtils]: 63: Hoare triple {47783#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-15 18:16:20,295 INFO L290 TraceCheckUtils]: 64: Hoare triple {47783#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-15 18:16:20,295 INFO L290 TraceCheckUtils]: 65: Hoare triple {47783#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-15 18:16:20,295 INFO L290 TraceCheckUtils]: 66: Hoare triple {47783#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-15 18:16:20,296 INFO L290 TraceCheckUtils]: 67: Hoare triple {47783#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-15 18:16:20,296 INFO L290 TraceCheckUtils]: 68: Hoare triple {47783#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-15 18:16:20,296 INFO L290 TraceCheckUtils]: 69: Hoare triple {47783#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {47783#true} is VALID [2022-04-15 18:16:20,296 INFO L290 TraceCheckUtils]: 70: Hoare triple {47783#true} assume 4400 == #t~mem52;havoc #t~mem52; {47783#true} is VALID [2022-04-15 18:16:20,296 INFO L290 TraceCheckUtils]: 71: Hoare triple {47783#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 888 + #t~mem90.offset, 8);call #t~mem92 := read~int(#t~mem91.base, 20 + #t~mem91.offset, 8); {47783#true} is VALID [2022-04-15 18:16:20,296 INFO L290 TraceCheckUtils]: 72: Hoare triple {47783#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 18446744073709551616);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {47783#true} is VALID [2022-04-15 18:16:20,296 INFO L290 TraceCheckUtils]: 73: Hoare triple {47783#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {47788#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:20,297 INFO L290 TraceCheckUtils]: 74: Hoare triple {47788#(= 3 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0); {47788#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:20,297 INFO L290 TraceCheckUtils]: 75: Hoare triple {47788#(= 3 ssl3_connect_~blastFlag~0)} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {47788#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:20,297 INFO L290 TraceCheckUtils]: 76: Hoare triple {47788#(= 3 ssl3_connect_~blastFlag~0)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {47788#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:20,298 INFO L290 TraceCheckUtils]: 77: Hoare triple {47788#(= 3 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {47788#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:20,298 INFO L290 TraceCheckUtils]: 78: Hoare triple {47788#(= 3 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {47788#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:20,298 INFO L290 TraceCheckUtils]: 79: Hoare triple {47788#(= 3 ssl3_connect_~blastFlag~0)} assume !false; {47788#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:20,299 INFO L290 TraceCheckUtils]: 80: Hoare triple {47788#(= 3 ssl3_connect_~blastFlag~0)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {47788#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:20,299 INFO L290 TraceCheckUtils]: 81: Hoare triple {47788#(= 3 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {47788#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:20,299 INFO L290 TraceCheckUtils]: 82: Hoare triple {47788#(= 3 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {47788#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:20,300 INFO L290 TraceCheckUtils]: 83: Hoare triple {47788#(= 3 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {47788#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:20,300 INFO L290 TraceCheckUtils]: 84: Hoare triple {47788#(= 3 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {47788#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:20,300 INFO L290 TraceCheckUtils]: 85: Hoare triple {47788#(= 3 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {47788#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:20,300 INFO L290 TraceCheckUtils]: 86: Hoare triple {47788#(= 3 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {47788#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:20,301 INFO L290 TraceCheckUtils]: 87: Hoare triple {47788#(= 3 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {47788#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:20,301 INFO L290 TraceCheckUtils]: 88: Hoare triple {47788#(= 3 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {47788#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:20,301 INFO L290 TraceCheckUtils]: 89: Hoare triple {47788#(= 3 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {47788#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:20,302 INFO L290 TraceCheckUtils]: 90: Hoare triple {47788#(= 3 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {47788#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:20,302 INFO L290 TraceCheckUtils]: 91: Hoare triple {47788#(= 3 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {47788#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:20,302 INFO L290 TraceCheckUtils]: 92: Hoare triple {47788#(= 3 ssl3_connect_~blastFlag~0)} assume 4416 == #t~mem54;havoc #t~mem54; {47788#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:20,303 INFO L290 TraceCheckUtils]: 93: Hoare triple {47788#(= 3 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {47788#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 18:16:20,303 INFO L290 TraceCheckUtils]: 94: Hoare triple {47788#(= 3 ssl3_connect_~blastFlag~0)} assume !(3 == ~blastFlag~0); {47784#false} is VALID [2022-04-15 18:16:20,303 INFO L290 TraceCheckUtils]: 95: Hoare triple {47784#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {47784#false} is VALID [2022-04-15 18:16:20,303 INFO L290 TraceCheckUtils]: 96: Hoare triple {47784#false} assume !(0 == ~tmp___6~0); {47784#false} is VALID [2022-04-15 18:16:20,303 INFO L290 TraceCheckUtils]: 97: Hoare triple {47784#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {47784#false} is VALID [2022-04-15 18:16:20,303 INFO L290 TraceCheckUtils]: 98: Hoare triple {47784#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {47784#false} is VALID [2022-04-15 18:16:20,303 INFO L290 TraceCheckUtils]: 99: Hoare triple {47784#false} ~skip~0 := 0; {47784#false} is VALID [2022-04-15 18:16:20,304 INFO L290 TraceCheckUtils]: 100: Hoare triple {47784#false} assume !false; {47784#false} is VALID [2022-04-15 18:16:20,304 INFO L290 TraceCheckUtils]: 101: Hoare triple {47784#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {47784#false} is VALID [2022-04-15 18:16:20,304 INFO L290 TraceCheckUtils]: 102: Hoare triple {47784#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {47784#false} is VALID [2022-04-15 18:16:20,304 INFO L290 TraceCheckUtils]: 103: Hoare triple {47784#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {47784#false} is VALID [2022-04-15 18:16:20,304 INFO L290 TraceCheckUtils]: 104: Hoare triple {47784#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {47784#false} is VALID [2022-04-15 18:16:20,304 INFO L290 TraceCheckUtils]: 105: Hoare triple {47784#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {47784#false} is VALID [2022-04-15 18:16:20,304 INFO L290 TraceCheckUtils]: 106: Hoare triple {47784#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {47784#false} is VALID [2022-04-15 18:16:20,304 INFO L290 TraceCheckUtils]: 107: Hoare triple {47784#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {47784#false} is VALID [2022-04-15 18:16:20,304 INFO L290 TraceCheckUtils]: 108: Hoare triple {47784#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {47784#false} is VALID [2022-04-15 18:16:20,304 INFO L290 TraceCheckUtils]: 109: Hoare triple {47784#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {47784#false} is VALID [2022-04-15 18:16:20,304 INFO L290 TraceCheckUtils]: 110: Hoare triple {47784#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {47784#false} is VALID [2022-04-15 18:16:20,304 INFO L290 TraceCheckUtils]: 111: Hoare triple {47784#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {47784#false} is VALID [2022-04-15 18:16:20,305 INFO L290 TraceCheckUtils]: 112: Hoare triple {47784#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {47784#false} is VALID [2022-04-15 18:16:20,305 INFO L290 TraceCheckUtils]: 113: Hoare triple {47784#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {47784#false} is VALID [2022-04-15 18:16:20,305 INFO L290 TraceCheckUtils]: 114: Hoare triple {47784#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {47784#false} is VALID [2022-04-15 18:16:20,305 INFO L290 TraceCheckUtils]: 115: Hoare triple {47784#false} assume 4432 == #t~mem56;havoc #t~mem56; {47784#false} is VALID [2022-04-15 18:16:20,305 INFO L290 TraceCheckUtils]: 116: Hoare triple {47784#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {47784#false} is VALID [2022-04-15 18:16:20,305 INFO L290 TraceCheckUtils]: 117: Hoare triple {47784#false} assume 5 == ~blastFlag~0; {47784#false} is VALID [2022-04-15 18:16:20,305 INFO L290 TraceCheckUtils]: 118: Hoare triple {47784#false} assume !false; {47784#false} is VALID [2022-04-15 18:16:20,305 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-15 18:16:20,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:16:20,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599820957] [2022-04-15 18:16:20,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599820957] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:16:20,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:16:20,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:16:20,308 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:16:20,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2003382361] [2022-04-15 18:16:20,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2003382361] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:16:20,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:16:20,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:16:20,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584817317] [2022-04-15 18:16:20,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:16:20,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2022-04-15 18:16:20,309 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:16:20,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:20,394 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:16:20,394 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:16:20,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:16:20,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:16:20,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:16:20,395 INFO L87 Difference]: Start difference. First operand 818 states and 1246 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:22,416 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-15 18:16:23,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:16:23,771 INFO L93 Difference]: Finished difference Result 1414 states and 2152 transitions. [2022-04-15 18:16:23,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:16:23,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2022-04-15 18:16:23,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:16:23,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:23,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions. [2022-04-15 18:16:23,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:23,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions. [2022-04-15 18:16:23,777 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 492 transitions. [2022-04-15 18:16:24,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 492 edges. 492 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:16:24,208 INFO L225 Difference]: With dead ends: 1414 [2022-04-15 18:16:24,208 INFO L226 Difference]: Without dead ends: 792 [2022-04-15 18:16:24,224 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:16:24,236 INFO L913 BasicCegarLoop]: 317 mSDtfsCounter, 130 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 18:16:24,236 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 481 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 340 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 18:16:24,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2022-04-15 18:16:24,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 792. [2022-04-15 18:16:24,281 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:16:24,282 INFO L82 GeneralOperation]: Start isEquivalent. First operand 792 states. Second operand has 792 states, 787 states have (on average 1.5158831003811943) internal successors, (1193), 787 states have internal predecessors, (1193), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:24,283 INFO L74 IsIncluded]: Start isIncluded. First operand 792 states. Second operand has 792 states, 787 states have (on average 1.5158831003811943) internal successors, (1193), 787 states have internal predecessors, (1193), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:24,284 INFO L87 Difference]: Start difference. First operand 792 states. Second operand has 792 states, 787 states have (on average 1.5158831003811943) internal successors, (1193), 787 states have internal predecessors, (1193), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:24,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:16:24,324 INFO L93 Difference]: Finished difference Result 792 states and 1197 transitions. [2022-04-15 18:16:24,324 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1197 transitions. [2022-04-15 18:16:24,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:16:24,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:16:24,327 INFO L74 IsIncluded]: Start isIncluded. First operand has 792 states, 787 states have (on average 1.5158831003811943) internal successors, (1193), 787 states have internal predecessors, (1193), 3 states have call successors, (3), 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 792 states. [2022-04-15 18:16:24,328 INFO L87 Difference]: Start difference. First operand has 792 states, 787 states have (on average 1.5158831003811943) internal successors, (1193), 787 states have internal predecessors, (1193), 3 states have call successors, (3), 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 792 states. [2022-04-15 18:16:24,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:16:24,364 INFO L93 Difference]: Finished difference Result 792 states and 1197 transitions. [2022-04-15 18:16:24,364 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1197 transitions. [2022-04-15 18:16:24,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:16:24,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:16:24,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:16:24,366 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:16:24,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 787 states have (on average 1.5158831003811943) internal successors, (1193), 787 states have internal predecessors, (1193), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:24,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1197 transitions. [2022-04-15 18:16:24,425 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1197 transitions. Word has length 119 [2022-04-15 18:16:24,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:16:24,425 INFO L478 AbstractCegarLoop]: Abstraction has 792 states and 1197 transitions. [2022-04-15 18:16:24,426 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:24,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 792 states and 1197 transitions. [2022-04-15 18:16:25,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1197 edges. 1197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:16:25,616 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1197 transitions. [2022-04-15 18:16:25,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-04-15 18:16:25,618 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:16:25,618 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:16:25,618 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 18:16:25,618 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:16:25,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:16:25,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1107867599, now seen corresponding path program 1 times [2022-04-15 18:16:25,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:16:25,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1623956302] [2022-04-15 18:16:25,619 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:16:25,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1107867599, now seen corresponding path program 2 times [2022-04-15 18:16:25,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:16:25,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072393733] [2022-04-15 18:16:25,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:16:25,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:16:25,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:16:26,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:16:26,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:16:26,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {53795#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {53788#true} is VALID [2022-04-15 18:16:26,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {53788#true} assume true; {53788#true} is VALID [2022-04-15 18:16:26,028 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {53788#true} {53788#true} #591#return; {53788#true} is VALID [2022-04-15 18:16:26,029 INFO L272 TraceCheckUtils]: 0: Hoare triple {53788#true} call ULTIMATE.init(); {53795#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:16:26,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {53795#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {53788#true} is VALID [2022-04-15 18:16:26,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {53788#true} assume true; {53788#true} is VALID [2022-04-15 18:16:26,030 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53788#true} {53788#true} #591#return; {53788#true} is VALID [2022-04-15 18:16:26,030 INFO L272 TraceCheckUtils]: 4: Hoare triple {53788#true} call #t~ret159 := main(); {53788#true} is VALID [2022-04-15 18:16:26,030 INFO L290 TraceCheckUtils]: 5: Hoare triple {53788#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {53788#true} is VALID [2022-04-15 18:16:26,030 INFO L272 TraceCheckUtils]: 6: Hoare triple {53788#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {53788#true} is VALID [2022-04-15 18:16:26,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {53788#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {53788#true} is VALID [2022-04-15 18:16:26,030 INFO L290 TraceCheckUtils]: 8: Hoare triple {53788#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {53788#true} is VALID [2022-04-15 18:16:26,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {53788#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {53788#true} is VALID [2022-04-15 18:16:26,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {53788#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {53788#true} is VALID [2022-04-15 18:16:26,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {53788#true} assume !false; {53788#true} is VALID [2022-04-15 18:16:26,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {53788#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {53788#true} is VALID [2022-04-15 18:16:26,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {53788#true} assume 12292 == #t~mem43;havoc #t~mem43; {53788#true} is VALID [2022-04-15 18:16:26,031 INFO L290 TraceCheckUtils]: 14: Hoare triple {53788#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {53788#true} is VALID [2022-04-15 18:16:26,031 INFO L290 TraceCheckUtils]: 15: Hoare triple {53788#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {53788#true} is VALID [2022-04-15 18:16:26,031 INFO L290 TraceCheckUtils]: 16: Hoare triple {53788#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {53788#true} is VALID [2022-04-15 18:16:26,031 INFO L290 TraceCheckUtils]: 17: Hoare triple {53788#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {53788#true} is VALID [2022-04-15 18:16:26,031 INFO L290 TraceCheckUtils]: 18: Hoare triple {53788#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {53788#true} is VALID [2022-04-15 18:16:26,031 INFO L290 TraceCheckUtils]: 19: Hoare triple {53788#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {53788#true} is VALID [2022-04-15 18:16:26,031 INFO L290 TraceCheckUtils]: 20: Hoare triple {53788#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {53788#true} is VALID [2022-04-15 18:16:26,031 INFO L290 TraceCheckUtils]: 21: Hoare triple {53788#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {53788#true} is VALID [2022-04-15 18:16:26,031 INFO L290 TraceCheckUtils]: 22: Hoare triple {53788#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {53788#true} is VALID [2022-04-15 18:16:26,031 INFO L290 TraceCheckUtils]: 23: Hoare triple {53788#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {53788#true} is VALID [2022-04-15 18:16:26,031 INFO L290 TraceCheckUtils]: 24: Hoare triple {53788#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {53788#true} is VALID [2022-04-15 18:16:26,031 INFO L290 TraceCheckUtils]: 25: Hoare triple {53788#true} ~skip~0 := 0; {53788#true} is VALID [2022-04-15 18:16:26,031 INFO L290 TraceCheckUtils]: 26: Hoare triple {53788#true} assume !false; {53788#true} is VALID [2022-04-15 18:16:26,032 INFO L290 TraceCheckUtils]: 27: Hoare triple {53788#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {53788#true} is VALID [2022-04-15 18:16:26,032 INFO L290 TraceCheckUtils]: 28: Hoare triple {53788#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {53788#true} is VALID [2022-04-15 18:16:26,032 INFO L290 TraceCheckUtils]: 29: Hoare triple {53788#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {53788#true} is VALID [2022-04-15 18:16:26,032 INFO L290 TraceCheckUtils]: 30: Hoare triple {53788#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {53788#true} is VALID [2022-04-15 18:16:26,032 INFO L290 TraceCheckUtils]: 31: Hoare triple {53788#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {53788#true} is VALID [2022-04-15 18:16:26,032 INFO L290 TraceCheckUtils]: 32: Hoare triple {53788#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {53788#true} is VALID [2022-04-15 18:16:26,032 INFO L290 TraceCheckUtils]: 33: Hoare triple {53788#true} assume 4368 == #t~mem48;havoc #t~mem48; {53788#true} is VALID [2022-04-15 18:16:26,032 INFO L290 TraceCheckUtils]: 34: Hoare triple {53788#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {53788#true} is VALID [2022-04-15 18:16:26,032 INFO L290 TraceCheckUtils]: 35: Hoare triple {53788#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {53788#true} is VALID [2022-04-15 18:16:26,032 INFO L290 TraceCheckUtils]: 36: Hoare triple {53788#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {53788#true} is VALID [2022-04-15 18:16:26,033 INFO L290 TraceCheckUtils]: 37: Hoare triple {53788#true} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {53788#true} is VALID [2022-04-15 18:16:26,033 INFO L290 TraceCheckUtils]: 38: Hoare triple {53788#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {53788#true} is VALID [2022-04-15 18:16:26,033 INFO L290 TraceCheckUtils]: 39: Hoare triple {53788#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {53788#true} is VALID [2022-04-15 18:16:26,033 INFO L290 TraceCheckUtils]: 40: Hoare triple {53788#true} ~skip~0 := 0; {53788#true} is VALID [2022-04-15 18:16:26,033 INFO L290 TraceCheckUtils]: 41: Hoare triple {53788#true} assume !false; {53788#true} is VALID [2022-04-15 18:16:26,033 INFO L290 TraceCheckUtils]: 42: Hoare triple {53788#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {53788#true} is VALID [2022-04-15 18:16:26,033 INFO L290 TraceCheckUtils]: 43: Hoare triple {53788#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {53788#true} is VALID [2022-04-15 18:16:26,033 INFO L290 TraceCheckUtils]: 44: Hoare triple {53788#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {53788#true} is VALID [2022-04-15 18:16:26,033 INFO L290 TraceCheckUtils]: 45: Hoare triple {53788#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {53788#true} is VALID [2022-04-15 18:16:26,033 INFO L290 TraceCheckUtils]: 46: Hoare triple {53788#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {53788#true} is VALID [2022-04-15 18:16:26,033 INFO L290 TraceCheckUtils]: 47: Hoare triple {53788#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {53788#true} is VALID [2022-04-15 18:16:26,034 INFO L290 TraceCheckUtils]: 48: Hoare triple {53788#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {53788#true} is VALID [2022-04-15 18:16:26,034 INFO L290 TraceCheckUtils]: 49: Hoare triple {53788#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {53788#true} is VALID [2022-04-15 18:16:26,034 INFO L290 TraceCheckUtils]: 50: Hoare triple {53788#true} assume 4384 == #t~mem50;havoc #t~mem50; {53788#true} is VALID [2022-04-15 18:16:26,034 INFO L290 TraceCheckUtils]: 51: Hoare triple {53788#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {53788#true} is VALID [2022-04-15 18:16:26,034 INFO L290 TraceCheckUtils]: 52: Hoare triple {53788#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {53788#true} is VALID [2022-04-15 18:16:26,034 INFO L290 TraceCheckUtils]: 53: Hoare triple {53788#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {53788#true} is VALID [2022-04-15 18:16:26,051 INFO L290 TraceCheckUtils]: 54: Hoare triple {53788#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 72 + ~s.offset, 4); {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-15 18:16:26,065 INFO L290 TraceCheckUtils]: 55: Hoare triple {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} call write~int(0, ~s.base, 88 + ~s.offset, 4); {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-15 18:16:26,073 INFO L290 TraceCheckUtils]: 56: Hoare triple {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-15 18:16:26,090 INFO L290 TraceCheckUtils]: 57: Hoare triple {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-15 18:16:26,103 INFO L290 TraceCheckUtils]: 58: Hoare triple {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} ~skip~0 := 0; {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-15 18:16:26,116 INFO L290 TraceCheckUtils]: 59: Hoare triple {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !false; {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-15 18:16:26,117 INFO L290 TraceCheckUtils]: 60: Hoare triple {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-15 18:16:26,117 INFO L290 TraceCheckUtils]: 61: Hoare triple {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-15 18:16:26,118 INFO L290 TraceCheckUtils]: 62: Hoare triple {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-15 18:16:26,118 INFO L290 TraceCheckUtils]: 63: Hoare triple {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-15 18:16:26,118 INFO L290 TraceCheckUtils]: 64: Hoare triple {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-15 18:16:26,118 INFO L290 TraceCheckUtils]: 65: Hoare triple {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-15 18:16:26,119 INFO L290 TraceCheckUtils]: 66: Hoare triple {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-15 18:16:26,119 INFO L290 TraceCheckUtils]: 67: Hoare triple {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-15 18:16:26,119 INFO L290 TraceCheckUtils]: 68: Hoare triple {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-15 18:16:26,120 INFO L290 TraceCheckUtils]: 69: Hoare triple {53793#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {53794#(= |ssl3_connect_#t~mem52| 4560)} is VALID [2022-04-15 18:16:26,120 INFO L290 TraceCheckUtils]: 70: Hoare triple {53794#(= |ssl3_connect_#t~mem52| 4560)} assume 4400 == #t~mem52;havoc #t~mem52; {53789#false} is VALID [2022-04-15 18:16:26,120 INFO L290 TraceCheckUtils]: 71: Hoare triple {53789#false} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 888 + #t~mem90.offset, 8);call #t~mem92 := read~int(#t~mem91.base, 20 + #t~mem91.offset, 8); {53789#false} is VALID [2022-04-15 18:16:26,120 INFO L290 TraceCheckUtils]: 72: Hoare triple {53789#false} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 18446744073709551616);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {53789#false} is VALID [2022-04-15 18:16:26,121 INFO L290 TraceCheckUtils]: 73: Hoare triple {53789#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {53789#false} is VALID [2022-04-15 18:16:26,121 INFO L290 TraceCheckUtils]: 74: Hoare triple {53789#false} assume !(~ret~0 <= 0); {53789#false} is VALID [2022-04-15 18:16:26,121 INFO L290 TraceCheckUtils]: 75: Hoare triple {53789#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {53789#false} is VALID [2022-04-15 18:16:26,121 INFO L290 TraceCheckUtils]: 76: Hoare triple {53789#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {53789#false} is VALID [2022-04-15 18:16:26,126 INFO L290 TraceCheckUtils]: 77: Hoare triple {53789#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {53789#false} is VALID [2022-04-15 18:16:26,126 INFO L290 TraceCheckUtils]: 78: Hoare triple {53789#false} ~skip~0 := 0; {53789#false} is VALID [2022-04-15 18:16:26,126 INFO L290 TraceCheckUtils]: 79: Hoare triple {53789#false} assume !false; {53789#false} is VALID [2022-04-15 18:16:26,127 INFO L290 TraceCheckUtils]: 80: Hoare triple {53789#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-15 18:16:26,127 INFO L290 TraceCheckUtils]: 81: Hoare triple {53789#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-15 18:16:26,127 INFO L290 TraceCheckUtils]: 82: Hoare triple {53789#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-15 18:16:26,127 INFO L290 TraceCheckUtils]: 83: Hoare triple {53789#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-15 18:16:26,127 INFO L290 TraceCheckUtils]: 84: Hoare triple {53789#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-15 18:16:26,127 INFO L290 TraceCheckUtils]: 85: Hoare triple {53789#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-15 18:16:26,127 INFO L290 TraceCheckUtils]: 86: Hoare triple {53789#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-15 18:16:26,127 INFO L290 TraceCheckUtils]: 87: Hoare triple {53789#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-15 18:16:26,127 INFO L290 TraceCheckUtils]: 88: Hoare triple {53789#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-15 18:16:26,127 INFO L290 TraceCheckUtils]: 89: Hoare triple {53789#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-15 18:16:26,128 INFO L290 TraceCheckUtils]: 90: Hoare triple {53789#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-15 18:16:26,128 INFO L290 TraceCheckUtils]: 91: Hoare triple {53789#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-15 18:16:26,128 INFO L290 TraceCheckUtils]: 92: Hoare triple {53789#false} assume 4416 == #t~mem54;havoc #t~mem54; {53789#false} is VALID [2022-04-15 18:16:26,128 INFO L290 TraceCheckUtils]: 93: Hoare triple {53789#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {53789#false} is VALID [2022-04-15 18:16:26,128 INFO L290 TraceCheckUtils]: 94: Hoare triple {53789#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {53789#false} is VALID [2022-04-15 18:16:26,128 INFO L290 TraceCheckUtils]: 95: Hoare triple {53789#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {53789#false} is VALID [2022-04-15 18:16:26,128 INFO L290 TraceCheckUtils]: 96: Hoare triple {53789#false} assume !(0 == ~tmp___6~0); {53789#false} is VALID [2022-04-15 18:16:26,128 INFO L290 TraceCheckUtils]: 97: Hoare triple {53789#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {53789#false} is VALID [2022-04-15 18:16:26,128 INFO L290 TraceCheckUtils]: 98: Hoare triple {53789#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {53789#false} is VALID [2022-04-15 18:16:26,128 INFO L290 TraceCheckUtils]: 99: Hoare triple {53789#false} ~skip~0 := 0; {53789#false} is VALID [2022-04-15 18:16:26,128 INFO L290 TraceCheckUtils]: 100: Hoare triple {53789#false} assume !false; {53789#false} is VALID [2022-04-15 18:16:26,128 INFO L290 TraceCheckUtils]: 101: Hoare triple {53789#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-15 18:16:26,129 INFO L290 TraceCheckUtils]: 102: Hoare triple {53789#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-15 18:16:26,129 INFO L290 TraceCheckUtils]: 103: Hoare triple {53789#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-15 18:16:26,129 INFO L290 TraceCheckUtils]: 104: Hoare triple {53789#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-15 18:16:26,129 INFO L290 TraceCheckUtils]: 105: Hoare triple {53789#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-15 18:16:26,129 INFO L290 TraceCheckUtils]: 106: Hoare triple {53789#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-15 18:16:26,129 INFO L290 TraceCheckUtils]: 107: Hoare triple {53789#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-15 18:16:26,129 INFO L290 TraceCheckUtils]: 108: Hoare triple {53789#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-15 18:16:26,129 INFO L290 TraceCheckUtils]: 109: Hoare triple {53789#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-15 18:16:26,143 INFO L290 TraceCheckUtils]: 110: Hoare triple {53789#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-15 18:16:26,143 INFO L290 TraceCheckUtils]: 111: Hoare triple {53789#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-15 18:16:26,143 INFO L290 TraceCheckUtils]: 112: Hoare triple {53789#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-15 18:16:26,143 INFO L290 TraceCheckUtils]: 113: Hoare triple {53789#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-15 18:16:26,144 INFO L290 TraceCheckUtils]: 114: Hoare triple {53789#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-15 18:16:26,144 INFO L290 TraceCheckUtils]: 115: Hoare triple {53789#false} assume 4432 == #t~mem56;havoc #t~mem56; {53789#false} is VALID [2022-04-15 18:16:26,144 INFO L290 TraceCheckUtils]: 116: Hoare triple {53789#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {53789#false} is VALID [2022-04-15 18:16:26,144 INFO L290 TraceCheckUtils]: 117: Hoare triple {53789#false} assume !(5 == ~blastFlag~0); {53789#false} is VALID [2022-04-15 18:16:26,144 INFO L290 TraceCheckUtils]: 118: Hoare triple {53789#false} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {53789#false} is VALID [2022-04-15 18:16:26,144 INFO L290 TraceCheckUtils]: 119: Hoare triple {53789#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {53789#false} is VALID [2022-04-15 18:16:26,144 INFO L290 TraceCheckUtils]: 120: Hoare triple {53789#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {53789#false} is VALID [2022-04-15 18:16:26,144 INFO L290 TraceCheckUtils]: 121: Hoare triple {53789#false} ~skip~0 := 0; {53789#false} is VALID [2022-04-15 18:16:26,144 INFO L290 TraceCheckUtils]: 122: Hoare triple {53789#false} assume !false; {53789#false} is VALID [2022-04-15 18:16:26,144 INFO L290 TraceCheckUtils]: 123: Hoare triple {53789#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-15 18:16:26,144 INFO L290 TraceCheckUtils]: 124: Hoare triple {53789#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-15 18:16:26,144 INFO L290 TraceCheckUtils]: 125: Hoare triple {53789#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-15 18:16:26,144 INFO L290 TraceCheckUtils]: 126: Hoare triple {53789#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-15 18:16:26,145 INFO L290 TraceCheckUtils]: 127: Hoare triple {53789#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-15 18:16:26,145 INFO L290 TraceCheckUtils]: 128: Hoare triple {53789#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-15 18:16:26,145 INFO L290 TraceCheckUtils]: 129: Hoare triple {53789#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-15 18:16:26,145 INFO L290 TraceCheckUtils]: 130: Hoare triple {53789#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-15 18:16:26,145 INFO L290 TraceCheckUtils]: 131: Hoare triple {53789#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-15 18:16:26,145 INFO L290 TraceCheckUtils]: 132: Hoare triple {53789#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-15 18:16:26,145 INFO L290 TraceCheckUtils]: 133: Hoare triple {53789#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-15 18:16:26,145 INFO L290 TraceCheckUtils]: 134: Hoare triple {53789#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-15 18:16:26,145 INFO L290 TraceCheckUtils]: 135: Hoare triple {53789#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-15 18:16:26,145 INFO L290 TraceCheckUtils]: 136: Hoare triple {53789#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-15 18:16:26,145 INFO L290 TraceCheckUtils]: 137: Hoare triple {53789#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-15 18:16:26,145 INFO L290 TraceCheckUtils]: 138: Hoare triple {53789#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {53789#false} is VALID [2022-04-15 18:16:26,145 INFO L290 TraceCheckUtils]: 139: Hoare triple {53789#false} assume 4448 == #t~mem58;havoc #t~mem58; {53789#false} is VALID [2022-04-15 18:16:26,146 INFO L290 TraceCheckUtils]: 140: Hoare triple {53789#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {53789#false} is VALID [2022-04-15 18:16:26,146 INFO L290 TraceCheckUtils]: 141: Hoare triple {53789#false} assume 4 == ~blastFlag~0; {53789#false} is VALID [2022-04-15 18:16:26,146 INFO L290 TraceCheckUtils]: 142: Hoare triple {53789#false} assume !false; {53789#false} is VALID [2022-04-15 18:16:26,146 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-04-15 18:16:26,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:16:26,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072393733] [2022-04-15 18:16:26,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072393733] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:16:26,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:16:26,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:16:26,147 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:16:26,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1623956302] [2022-04-15 18:16:26,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1623956302] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:16:26,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:16:26,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:16:26,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247627841] [2022-04-15 18:16:26,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:16:26,148 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 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 143 [2022-04-15 18:16:26,148 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:16:26,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 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-15 18:16:26,264 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-15 18:16:26,264 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:16:26,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:16:26,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:16:26,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:16:26,265 INFO L87 Difference]: Start difference. First operand 792 states and 1197 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 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-15 18:16:28,307 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-15 18:16:30,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:16:30,205 INFO L93 Difference]: Finished difference Result 1910 states and 2864 transitions. [2022-04-15 18:16:30,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 18:16:30,205 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 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 143 [2022-04-15 18:16:30,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:16:30,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 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-15 18:16:30,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-04-15 18:16:30,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 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-15 18:16:30,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-04-15 18:16:30,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 461 transitions. [2022-04-15 18:16:31,328 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-15 18:16:31,400 INFO L225 Difference]: With dead ends: 1910 [2022-04-15 18:16:31,400 INFO L226 Difference]: Without dead ends: 1134 [2022-04-15 18:16:31,402 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:16:31,402 INFO L913 BasicCegarLoop]: 233 mSDtfsCounter, 87 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-15 18:16:31,402 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 557 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 525 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-04-15 18:16:31,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2022-04-15 18:16:31,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 876. [2022-04-15 18:16:31,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:16:31,511 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1134 states. Second operand has 876 states, 871 states have (on average 1.521239954075775) internal successors, (1325), 871 states have internal predecessors, (1325), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:31,512 INFO L74 IsIncluded]: Start isIncluded. First operand 1134 states. Second operand has 876 states, 871 states have (on average 1.521239954075775) internal successors, (1325), 871 states have internal predecessors, (1325), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:31,513 INFO L87 Difference]: Start difference. First operand 1134 states. Second operand has 876 states, 871 states have (on average 1.521239954075775) internal successors, (1325), 871 states have internal predecessors, (1325), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:31,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:16:31,589 INFO L93 Difference]: Finished difference Result 1134 states and 1683 transitions. [2022-04-15 18:16:31,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1683 transitions. [2022-04-15 18:16:31,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:16:31,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:16:31,592 INFO L74 IsIncluded]: Start isIncluded. First operand has 876 states, 871 states have (on average 1.521239954075775) internal successors, (1325), 871 states have internal predecessors, (1325), 3 states have call successors, (3), 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 1134 states. [2022-04-15 18:16:31,593 INFO L87 Difference]: Start difference. First operand has 876 states, 871 states have (on average 1.521239954075775) internal successors, (1325), 871 states have internal predecessors, (1325), 3 states have call successors, (3), 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 1134 states. [2022-04-15 18:16:31,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:16:31,665 INFO L93 Difference]: Finished difference Result 1134 states and 1683 transitions. [2022-04-15 18:16:31,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1683 transitions. [2022-04-15 18:16:31,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:16:31,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:16:31,667 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:16:31,667 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:16:31,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 871 states have (on average 1.521239954075775) internal successors, (1325), 871 states have internal predecessors, (1325), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:16:31,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1329 transitions. [2022-04-15 18:16:31,718 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1329 transitions. Word has length 143 [2022-04-15 18:16:31,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:16:31,718 INFO L478 AbstractCegarLoop]: Abstraction has 876 states and 1329 transitions. [2022-04-15 18:16:31,719 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 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-15 18:16:31,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 876 states and 1329 transitions. [2022-04-15 18:16:33,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1329 edges. 1329 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:16:33,121 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1329 transitions. [2022-04-15 18:16:33,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-04-15 18:16:33,123 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:16:33,123 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:16:33,123 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-15 18:16:33,123 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:16:33,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:16:33,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1878601165, now seen corresponding path program 1 times [2022-04-15 18:16:33,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:16:33,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1505111005] [2022-04-15 18:16:33,124 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 18:16:33,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1878601165, now seen corresponding path program 2 times [2022-04-15 18:16:33,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:16:33,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163982483] [2022-04-15 18:16:33,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:16:33,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:16:36,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 18:16:36,005 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 18:16:36,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 18:16:36,938 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 18:16:36,939 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-15 18:16:36,939 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-15 18:16:36,946 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 18:16:36,948 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-15 18:16:36,950 INFO L719 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-15 18:16:36,955 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 18:16:37,005 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 18:16:37,005 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-15 18:16:37,005 WARN L170 areAnnotationChecker]: ssl3_get_client_methodENTRY has no Hoare annotation [2022-04-15 18:16:37,005 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 18:16:37,005 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 18:16:37,005 WARN L170 areAnnotationChecker]: ssl3_connectENTRY has no Hoare annotation [2022-04-15 18:16:37,005 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-15 18:16:37,005 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyENTRY has no Hoare annotation [2022-04-15 18:16:37,005 WARN L170 areAnnotationChecker]: sslv3_base_methodENTRY has no Hoare annotation [2022-04-15 18:16:37,005 WARN L170 areAnnotationChecker]: #Ultimate.meminitENTRY has no Hoare annotation [2022-04-15 18:16:37,005 WARN L170 areAnnotationChecker]: SSLv3_client_methodENTRY has no Hoare annotation [2022-04-15 18:16:37,005 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 18:16:37,005 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 18:16:37,006 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-15 18:16:37,006 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-15 18:16:37,006 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 18:16:37,006 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 18:16:37,006 WARN L170 areAnnotationChecker]: L1133 has no Hoare annotation [2022-04-15 18:16:37,006 WARN L170 areAnnotationChecker]: L1133 has no Hoare annotation [2022-04-15 18:16:37,006 WARN L170 areAnnotationChecker]: L1098 has no Hoare annotation [2022-04-15 18:16:37,006 WARN L170 areAnnotationChecker]: L1098 has no Hoare annotation [2022-04-15 18:16:37,006 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-15 18:16:37,006 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-15 18:16:37,006 WARN L170 areAnnotationChecker]: L1678 has no Hoare annotation [2022-04-15 18:16:37,006 WARN L170 areAnnotationChecker]: L1678 has no Hoare annotation [2022-04-15 18:16:37,006 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2022-04-15 18:16:37,006 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-15 18:16:37,006 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-15 18:16:37,006 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 18:16:37,006 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-15 18:16:37,006 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-15 18:16:37,006 WARN L170 areAnnotationChecker]: ssl3_get_client_methodFINAL has no Hoare annotation [2022-04-15 18:16:37,006 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 18:16:37,006 WARN L170 areAnnotationChecker]: L1136-2 has no Hoare annotation [2022-04-15 18:16:37,006 WARN L170 areAnnotationChecker]: L1136 has no Hoare annotation [2022-04-15 18:16:37,006 WARN L170 areAnnotationChecker]: L1136 has no Hoare annotation [2022-04-15 18:16:37,006 WARN L170 areAnnotationChecker]: L1098-1 has no Hoare annotation [2022-04-15 18:16:37,006 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-15 18:16:37,006 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-15 18:16:37,007 WARN L170 areAnnotationChecker]: L1678-1 has no Hoare annotation [2022-04-15 18:16:37,007 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2022-04-15 18:16:37,007 WARN L170 areAnnotationChecker]: L1064 has no Hoare annotation [2022-04-15 18:16:37,007 WARN L170 areAnnotationChecker]: L1064 has no Hoare annotation [2022-04-15 18:16:37,007 WARN L170 areAnnotationChecker]: L1061-2 has no Hoare annotation [2022-04-15 18:16:37,007 WARN L170 areAnnotationChecker]: L1046-1 has no Hoare annotation [2022-04-15 18:16:37,007 WARN L170 areAnnotationChecker]: L1143 has no Hoare annotation [2022-04-15 18:16:37,007 WARN L170 areAnnotationChecker]: L1143 has no Hoare annotation [2022-04-15 18:16:37,007 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 18:16:37,007 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyFINAL has no Hoare annotation [2022-04-15 18:16:37,007 WARN L170 areAnnotationChecker]: sslv3_base_methodFINAL has no Hoare annotation [2022-04-15 18:16:37,007 WARN L170 areAnnotationChecker]: L1064-1 has no Hoare annotation [2022-04-15 18:16:37,007 WARN L170 areAnnotationChecker]: SSLv3_client_methodFINAL has no Hoare annotation [2022-04-15 18:16:37,007 WARN L170 areAnnotationChecker]: L1144 has no Hoare annotation [2022-04-15 18:16:37,007 WARN L170 areAnnotationChecker]: L1144 has no Hoare annotation [2022-04-15 18:16:37,007 WARN L170 areAnnotationChecker]: L1153-1 has no Hoare annotation [2022-04-15 18:16:37,007 WARN L170 areAnnotationChecker]: L1153-1 has no Hoare annotation [2022-04-15 18:16:37,007 WARN L170 areAnnotationChecker]: L1153-1 has no Hoare annotation [2022-04-15 18:16:37,007 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 18:16:37,007 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyEXIT has no Hoare annotation [2022-04-15 18:16:37,007 WARN L170 areAnnotationChecker]: sslv3_base_methodEXIT has no Hoare annotation [2022-04-15 18:16:37,007 WARN L170 areAnnotationChecker]: L1066 has no Hoare annotation [2022-04-15 18:16:37,008 WARN L170 areAnnotationChecker]: L1066 has no Hoare annotation [2022-04-15 18:16:37,008 WARN L170 areAnnotationChecker]: SSLv3_client_methodEXIT has no Hoare annotation [2022-04-15 18:16:37,008 WARN L170 areAnnotationChecker]: L1658 has no Hoare annotation [2022-04-15 18:16:37,008 WARN L170 areAnnotationChecker]: L1154 has no Hoare annotation [2022-04-15 18:16:37,008 WARN L170 areAnnotationChecker]: L1066-1 has no Hoare annotation [2022-04-15 18:16:37,008 WARN L170 areAnnotationChecker]: L1662 has no Hoare annotation [2022-04-15 18:16:37,008 WARN L170 areAnnotationChecker]: L1662 has no Hoare annotation [2022-04-15 18:16:37,008 WARN L170 areAnnotationChecker]: L1156 has no Hoare annotation [2022-04-15 18:16:37,008 WARN L170 areAnnotationChecker]: L1156 has no Hoare annotation [2022-04-15 18:16:37,008 WARN L170 areAnnotationChecker]: L1662-2 has no Hoare annotation [2022-04-15 18:16:37,008 WARN L170 areAnnotationChecker]: L1157 has no Hoare annotation [2022-04-15 18:16:37,008 WARN L170 areAnnotationChecker]: L1159 has no Hoare annotation [2022-04-15 18:16:37,008 WARN L170 areAnnotationChecker]: L1159 has no Hoare annotation [2022-04-15 18:16:37,008 WARN L170 areAnnotationChecker]: ssl3_connectFINAL has no Hoare annotation [2022-04-15 18:16:37,008 WARN L170 areAnnotationChecker]: L1262 has no Hoare annotation [2022-04-15 18:16:37,008 WARN L170 areAnnotationChecker]: L1162 has no Hoare annotation [2022-04-15 18:16:37,008 WARN L170 areAnnotationChecker]: L1162 has no Hoare annotation [2022-04-15 18:16:37,008 WARN L170 areAnnotationChecker]: ssl3_connectEXIT has no Hoare annotation [2022-04-15 18:16:37,008 WARN L170 areAnnotationChecker]: L1267 has no Hoare annotation [2022-04-15 18:16:37,008 WARN L170 areAnnotationChecker]: L1267 has no Hoare annotation [2022-04-15 18:16:37,008 WARN L170 areAnnotationChecker]: L1165 has no Hoare annotation [2022-04-15 18:16:37,008 WARN L170 areAnnotationChecker]: L1165 has no Hoare annotation [2022-04-15 18:16:37,008 WARN L170 areAnnotationChecker]: L1267-2 has no Hoare annotation [2022-04-15 18:16:37,009 WARN L170 areAnnotationChecker]: L1168 has no Hoare annotation [2022-04-15 18:16:37,009 WARN L170 areAnnotationChecker]: L1168 has no Hoare annotation [2022-04-15 18:16:37,009 WARN L170 areAnnotationChecker]: L1272 has no Hoare annotation [2022-04-15 18:16:37,009 WARN L170 areAnnotationChecker]: L1272 has no Hoare annotation [2022-04-15 18:16:37,009 WARN L170 areAnnotationChecker]: L1171 has no Hoare annotation [2022-04-15 18:16:37,009 WARN L170 areAnnotationChecker]: L1171 has no Hoare annotation [2022-04-15 18:16:37,009 WARN L170 areAnnotationChecker]: L1279 has no Hoare annotation [2022-04-15 18:16:37,009 WARN L170 areAnnotationChecker]: L1279 has no Hoare annotation [2022-04-15 18:16:37,009 WARN L170 areAnnotationChecker]: L1175 has no Hoare annotation [2022-04-15 18:16:37,009 WARN L170 areAnnotationChecker]: L1174 has no Hoare annotation [2022-04-15 18:16:37,009 WARN L170 areAnnotationChecker]: L1174 has no Hoare annotation [2022-04-15 18:16:37,009 WARN L170 areAnnotationChecker]: L1281 has no Hoare annotation [2022-04-15 18:16:37,009 WARN L170 areAnnotationChecker]: L1281 has no Hoare annotation [2022-04-15 18:16:37,009 WARN L170 areAnnotationChecker]: L1279-2 has no Hoare annotation [2022-04-15 18:16:37,009 WARN L170 areAnnotationChecker]: L1313 has no Hoare annotation [2022-04-15 18:16:37,009 WARN L170 areAnnotationChecker]: L1313 has no Hoare annotation [2022-04-15 18:16:37,009 WARN L170 areAnnotationChecker]: L1177 has no Hoare annotation [2022-04-15 18:16:37,009 WARN L170 areAnnotationChecker]: L1177 has no Hoare annotation [2022-04-15 18:16:37,009 WARN L170 areAnnotationChecker]: L1292 has no Hoare annotation [2022-04-15 18:16:37,009 WARN L170 areAnnotationChecker]: L1292 has no Hoare annotation [2022-04-15 18:16:37,009 WARN L170 areAnnotationChecker]: L1313-2 has no Hoare annotation [2022-04-15 18:16:37,009 WARN L170 areAnnotationChecker]: L1313-2 has no Hoare annotation [2022-04-15 18:16:37,009 WARN L170 areAnnotationChecker]: L1181 has no Hoare annotation [2022-04-15 18:16:37,009 WARN L170 areAnnotationChecker]: L1180 has no Hoare annotation [2022-04-15 18:16:37,010 WARN L170 areAnnotationChecker]: L1180 has no Hoare annotation [2022-04-15 18:16:37,010 WARN L170 areAnnotationChecker]: L1299 has no Hoare annotation [2022-04-15 18:16:37,010 WARN L170 areAnnotationChecker]: L1299 has no Hoare annotation [2022-04-15 18:16:37,010 WARN L170 areAnnotationChecker]: L1325 has no Hoare annotation [2022-04-15 18:16:37,010 WARN L170 areAnnotationChecker]: L1325 has no Hoare annotation [2022-04-15 18:16:37,010 WARN L170 areAnnotationChecker]: L1334 has no Hoare annotation [2022-04-15 18:16:37,010 WARN L170 areAnnotationChecker]: L1334 has no Hoare annotation [2022-04-15 18:16:37,010 WARN L170 areAnnotationChecker]: L1183 has no Hoare annotation [2022-04-15 18:16:37,010 WARN L170 areAnnotationChecker]: L1183 has no Hoare annotation [2022-04-15 18:16:37,010 WARN L170 areAnnotationChecker]: L1591 has no Hoare annotation [2022-04-15 18:16:37,010 WARN L170 areAnnotationChecker]: L1334-2 has no Hoare annotation [2022-04-15 18:16:37,010 WARN L170 areAnnotationChecker]: L1334-2 has no Hoare annotation [2022-04-15 18:16:37,010 WARN L170 areAnnotationChecker]: L1187 has no Hoare annotation [2022-04-15 18:16:37,010 WARN L170 areAnnotationChecker]: L1186 has no Hoare annotation [2022-04-15 18:16:37,010 WARN L170 areAnnotationChecker]: L1186 has no Hoare annotation [2022-04-15 18:16:37,010 WARN L170 areAnnotationChecker]: L1627 has no Hoare annotation [2022-04-15 18:16:37,010 WARN L170 areAnnotationChecker]: L1627 has no Hoare annotation [2022-04-15 18:16:37,010 WARN L170 areAnnotationChecker]: L1344 has no Hoare annotation [2022-04-15 18:16:37,010 WARN L170 areAnnotationChecker]: L1344 has no Hoare annotation [2022-04-15 18:16:37,010 WARN L170 areAnnotationChecker]: L1353 has no Hoare annotation [2022-04-15 18:16:37,010 WARN L170 areAnnotationChecker]: L1353 has no Hoare annotation [2022-04-15 18:16:37,010 WARN L170 areAnnotationChecker]: L1189 has no Hoare annotation [2022-04-15 18:16:37,010 WARN L170 areAnnotationChecker]: L1189 has no Hoare annotation [2022-04-15 18:16:37,011 WARN L170 areAnnotationChecker]: L1628 has no Hoare annotation [2022-04-15 18:16:37,011 WARN L170 areAnnotationChecker]: L1628 has no Hoare annotation [2022-04-15 18:16:37,011 WARN L170 areAnnotationChecker]: L1627-1 has no Hoare annotation [2022-04-15 18:16:37,011 WARN L170 areAnnotationChecker]: L1344-2 has no Hoare annotation [2022-04-15 18:16:37,011 WARN L170 areAnnotationChecker]: L1353-2 has no Hoare annotation [2022-04-15 18:16:37,011 WARN L170 areAnnotationChecker]: L1357 has no Hoare annotation [2022-04-15 18:16:37,011 WARN L170 areAnnotationChecker]: L1357 has no Hoare annotation [2022-04-15 18:16:37,011 WARN L170 areAnnotationChecker]: L1193 has no Hoare annotation [2022-04-15 18:16:37,011 WARN L170 areAnnotationChecker]: L1192 has no Hoare annotation [2022-04-15 18:16:37,011 WARN L170 areAnnotationChecker]: L1192 has no Hoare annotation [2022-04-15 18:16:37,011 WARN L170 areAnnotationChecker]: L1629 has no Hoare annotation [2022-04-15 18:16:37,011 WARN L170 areAnnotationChecker]: L1629 has no Hoare annotation [2022-04-15 18:16:37,011 WARN L170 areAnnotationChecker]: L1357-2 has no Hoare annotation [2022-04-15 18:16:37,011 WARN L170 areAnnotationChecker]: L1357-2 has no Hoare annotation [2022-04-15 18:16:37,011 WARN L170 areAnnotationChecker]: L1374 has no Hoare annotation [2022-04-15 18:16:37,011 WARN L170 areAnnotationChecker]: L1374 has no Hoare annotation [2022-04-15 18:16:37,011 WARN L170 areAnnotationChecker]: L1195 has no Hoare annotation [2022-04-15 18:16:37,011 WARN L170 areAnnotationChecker]: L1195 has no Hoare annotation [2022-04-15 18:16:37,011 WARN L170 areAnnotationChecker]: L1631 has no Hoare annotation [2022-04-15 18:16:37,011 WARN L170 areAnnotationChecker]: L1631 has no Hoare annotation [2022-04-15 18:16:37,011 WARN L170 areAnnotationChecker]: L1629-2 has no Hoare annotation [2022-04-15 18:16:37,011 WARN L170 areAnnotationChecker]: L1629-2 has no Hoare annotation [2022-04-15 18:16:37,011 WARN L170 areAnnotationChecker]: L1374-2 has no Hoare annotation [2022-04-15 18:16:37,012 WARN L170 areAnnotationChecker]: L1374-2 has no Hoare annotation [2022-04-15 18:16:37,012 WARN L170 areAnnotationChecker]: L1199 has no Hoare annotation [2022-04-15 18:16:37,012 WARN L170 areAnnotationChecker]: L1198 has no Hoare annotation [2022-04-15 18:16:37,012 WARN L170 areAnnotationChecker]: L1198 has no Hoare annotation [2022-04-15 18:16:37,012 WARN L170 areAnnotationChecker]: L1640 has no Hoare annotation [2022-04-15 18:16:37,012 WARN L170 areAnnotationChecker]: L1640 has no Hoare annotation [2022-04-15 18:16:37,012 WARN L170 areAnnotationChecker]: L1387 has no Hoare annotation [2022-04-15 18:16:37,012 WARN L170 areAnnotationChecker]: L1387 has no Hoare annotation [2022-04-15 18:16:37,012 WARN L170 areAnnotationChecker]: L1397 has no Hoare annotation [2022-04-15 18:16:37,012 WARN L170 areAnnotationChecker]: L1397 has no Hoare annotation [2022-04-15 18:16:37,012 WARN L170 areAnnotationChecker]: L1201 has no Hoare annotation [2022-04-15 18:16:37,012 WARN L170 areAnnotationChecker]: L1201 has no Hoare annotation [2022-04-15 18:16:37,012 WARN L170 areAnnotationChecker]: L1414 has no Hoare annotation [2022-04-15 18:16:37,012 WARN L170 areAnnotationChecker]: L1414 has no Hoare annotation [2022-04-15 18:16:37,012 WARN L170 areAnnotationChecker]: L1402 has no Hoare annotation [2022-04-15 18:16:37,012 WARN L170 areAnnotationChecker]: L1402 has no Hoare annotation [2022-04-15 18:16:37,012 WARN L170 areAnnotationChecker]: L1205 has no Hoare annotation [2022-04-15 18:16:37,012 WARN L170 areAnnotationChecker]: L1204 has no Hoare annotation [2022-04-15 18:16:37,012 WARN L170 areAnnotationChecker]: L1204 has no Hoare annotation [2022-04-15 18:16:37,012 WARN L170 areAnnotationChecker]: L1413 has no Hoare annotation [2022-04-15 18:16:37,012 WARN L170 areAnnotationChecker]: L1413 has no Hoare annotation [2022-04-15 18:16:37,012 WARN L170 areAnnotationChecker]: L1207 has no Hoare annotation [2022-04-15 18:16:37,012 WARN L170 areAnnotationChecker]: L1207 has no Hoare annotation [2022-04-15 18:16:37,012 WARN L170 areAnnotationChecker]: L1418 has no Hoare annotation [2022-04-15 18:16:37,012 WARN L170 areAnnotationChecker]: L1418 has no Hoare annotation [2022-04-15 18:16:37,013 WARN L170 areAnnotationChecker]: L1217 has no Hoare annotation [2022-04-15 18:16:37,013 WARN L170 areAnnotationChecker]: L1210 has no Hoare annotation [2022-04-15 18:16:37,013 WARN L170 areAnnotationChecker]: L1210 has no Hoare annotation [2022-04-15 18:16:37,013 WARN L170 areAnnotationChecker]: L1423 has no Hoare annotation [2022-04-15 18:16:37,013 WARN L170 areAnnotationChecker]: L1423 has no Hoare annotation [2022-04-15 18:16:37,013 WARN L170 areAnnotationChecker]: L1435 has no Hoare annotation [2022-04-15 18:16:37,013 WARN L170 areAnnotationChecker]: L1435 has no Hoare annotation [2022-04-15 18:16:37,013 WARN L170 areAnnotationChecker]: L1213 has no Hoare annotation [2022-04-15 18:16:37,013 WARN L170 areAnnotationChecker]: L1213 has no Hoare annotation [2022-04-15 18:16:37,013 WARN L170 areAnnotationChecker]: L1423-2 has no Hoare annotation [2022-04-15 18:16:37,013 WARN L170 areAnnotationChecker]: L1216 has no Hoare annotation [2022-04-15 18:16:37,013 WARN L170 areAnnotationChecker]: L1216 has no Hoare annotation [2022-04-15 18:16:37,013 WARN L170 areAnnotationChecker]: L1219 has no Hoare annotation [2022-04-15 18:16:37,013 WARN L170 areAnnotationChecker]: L1219 has no Hoare annotation [2022-04-15 18:16:37,013 WARN L170 areAnnotationChecker]: L1223 has no Hoare annotation [2022-04-15 18:16:37,013 WARN L170 areAnnotationChecker]: L1222 has no Hoare annotation [2022-04-15 18:16:37,013 WARN L170 areAnnotationChecker]: L1222 has no Hoare annotation [2022-04-15 18:16:37,013 WARN L170 areAnnotationChecker]: L1446 has no Hoare annotation [2022-04-15 18:16:37,013 WARN L170 areAnnotationChecker]: L1446 has no Hoare annotation [2022-04-15 18:16:37,013 WARN L170 areAnnotationChecker]: L1225 has no Hoare annotation [2022-04-15 18:16:37,013 WARN L170 areAnnotationChecker]: L1225 has no Hoare annotation [2022-04-15 18:16:37,013 WARN L170 areAnnotationChecker]: L1452 has no Hoare annotation [2022-04-15 18:16:37,013 WARN L170 areAnnotationChecker]: L1452 has no Hoare annotation [2022-04-15 18:16:37,013 WARN L170 areAnnotationChecker]: L1229 has no Hoare annotation [2022-04-15 18:16:37,013 WARN L170 areAnnotationChecker]: L1228 has no Hoare annotation [2022-04-15 18:16:37,014 WARN L170 areAnnotationChecker]: L1228 has no Hoare annotation [2022-04-15 18:16:37,014 WARN L170 areAnnotationChecker]: L1452-2 has no Hoare annotation [2022-04-15 18:16:37,014 WARN L170 areAnnotationChecker]: L1463 has no Hoare annotation [2022-04-15 18:16:37,014 WARN L170 areAnnotationChecker]: L1463 has no Hoare annotation [2022-04-15 18:16:37,014 WARN L170 areAnnotationChecker]: L1231 has no Hoare annotation [2022-04-15 18:16:37,014 WARN L170 areAnnotationChecker]: L1231 has no Hoare annotation [2022-04-15 18:16:37,014 WARN L170 areAnnotationChecker]: L1235 has no Hoare annotation [2022-04-15 18:16:37,014 WARN L170 areAnnotationChecker]: L1234 has no Hoare annotation [2022-04-15 18:16:37,014 WARN L170 areAnnotationChecker]: L1234 has no Hoare annotation [2022-04-15 18:16:37,014 WARN L170 areAnnotationChecker]: L1475 has no Hoare annotation [2022-04-15 18:16:37,014 WARN L170 areAnnotationChecker]: L1475 has no Hoare annotation [2022-04-15 18:16:37,014 WARN L170 areAnnotationChecker]: L1237 has no Hoare annotation [2022-04-15 18:16:37,014 WARN L170 areAnnotationChecker]: L1237 has no Hoare annotation [2022-04-15 18:16:37,014 WARN L170 areAnnotationChecker]: L1483 has no Hoare annotation [2022-04-15 18:16:37,014 WARN L170 areAnnotationChecker]: L1483 has no Hoare annotation [2022-04-15 18:16:37,014 WARN L170 areAnnotationChecker]: L1241 has no Hoare annotation [2022-04-15 18:16:37,014 WARN L170 areAnnotationChecker]: L1240 has no Hoare annotation [2022-04-15 18:16:37,014 WARN L170 areAnnotationChecker]: L1240 has no Hoare annotation [2022-04-15 18:16:37,014 WARN L170 areAnnotationChecker]: L1483-2 has no Hoare annotation [2022-04-15 18:16:37,014 WARN L170 areAnnotationChecker]: L1506 has no Hoare annotation [2022-04-15 18:16:37,014 WARN L170 areAnnotationChecker]: L1506 has no Hoare annotation [2022-04-15 18:16:37,014 WARN L170 areAnnotationChecker]: L1243 has no Hoare annotation [2022-04-15 18:16:37,014 WARN L170 areAnnotationChecker]: L1243 has no Hoare annotation [2022-04-15 18:16:37,015 WARN L170 areAnnotationChecker]: L1489 has no Hoare annotation [2022-04-15 18:16:37,015 WARN L170 areAnnotationChecker]: L1489 has no Hoare annotation [2022-04-15 18:16:37,015 WARN L170 areAnnotationChecker]: L1513 has no Hoare annotation [2022-04-15 18:16:37,015 WARN L170 areAnnotationChecker]: L1513 has no Hoare annotation [2022-04-15 18:16:37,015 WARN L170 areAnnotationChecker]: L1247 has no Hoare annotation [2022-04-15 18:16:37,015 WARN L170 areAnnotationChecker]: L1246 has no Hoare annotation [2022-04-15 18:16:37,015 WARN L170 areAnnotationChecker]: L1246 has no Hoare annotation [2022-04-15 18:16:37,015 WARN L170 areAnnotationChecker]: L1496 has no Hoare annotation [2022-04-15 18:16:37,015 WARN L170 areAnnotationChecker]: L1496 has no Hoare annotation [2022-04-15 18:16:37,015 WARN L170 areAnnotationChecker]: L1515 has no Hoare annotation [2022-04-15 18:16:37,015 WARN L170 areAnnotationChecker]: L1515 has no Hoare annotation [2022-04-15 18:16:37,015 WARN L170 areAnnotationChecker]: L1513-1 has no Hoare annotation [2022-04-15 18:16:37,015 WARN L170 areAnnotationChecker]: L1530 has no Hoare annotation [2022-04-15 18:16:37,015 WARN L170 areAnnotationChecker]: L1530 has no Hoare annotation [2022-04-15 18:16:37,015 WARN L170 areAnnotationChecker]: L1249 has no Hoare annotation [2022-04-15 18:16:37,015 WARN L170 areAnnotationChecker]: L1249 has no Hoare annotation [2022-04-15 18:16:37,015 WARN L170 areAnnotationChecker]: L1535 has no Hoare annotation [2022-04-15 18:16:37,016 WARN L170 areAnnotationChecker]: L1535 has no Hoare annotation [2022-04-15 18:16:37,016 WARN L170 areAnnotationChecker]: L1250 has no Hoare annotation [2022-04-15 18:16:37,016 WARN L170 areAnnotationChecker]: L1252 has no Hoare annotation [2022-04-15 18:16:37,016 WARN L170 areAnnotationChecker]: L1252 has no Hoare annotation [2022-04-15 18:16:37,016 WARN L170 areAnnotationChecker]: L1535-2 has no Hoare annotation [2022-04-15 18:16:37,016 WARN L170 areAnnotationChecker]: L1544 has no Hoare annotation [2022-04-15 18:16:37,016 WARN L170 areAnnotationChecker]: L1544 has no Hoare annotation [2022-04-15 18:16:37,016 WARN L170 areAnnotationChecker]: L1253 has no Hoare annotation [2022-04-15 18:16:37,016 WARN L170 areAnnotationChecker]: L1256 has no Hoare annotation [2022-04-15 18:16:37,016 WARN L170 areAnnotationChecker]: L1548 has no Hoare annotation [2022-04-15 18:16:37,016 WARN L170 areAnnotationChecker]: L1548 has no Hoare annotation [2022-04-15 18:16:37,017 WARN L170 areAnnotationChecker]: L1544-2 has no Hoare annotation [2022-04-15 18:16:37,017 WARN L170 areAnnotationChecker]: L1561 has no Hoare annotation [2022-04-15 18:16:37,017 WARN L170 areAnnotationChecker]: L1561 has no Hoare annotation [2022-04-15 18:16:37,017 WARN L170 areAnnotationChecker]: L1561-2 has no Hoare annotation [2022-04-15 18:16:37,017 WARN L170 areAnnotationChecker]: L1566 has no Hoare annotation [2022-04-15 18:16:37,017 WARN L170 areAnnotationChecker]: L1566 has no Hoare annotation [2022-04-15 18:16:37,017 WARN L170 areAnnotationChecker]: L1566-2 has no Hoare annotation [2022-04-15 18:16:37,017 WARN L170 areAnnotationChecker]: L1573 has no Hoare annotation [2022-04-15 18:16:37,017 WARN L170 areAnnotationChecker]: L1573 has no Hoare annotation [2022-04-15 18:16:37,017 WARN L170 areAnnotationChecker]: L1573-2 has no Hoare annotation [2022-04-15 18:16:37,017 WARN L170 areAnnotationChecker]: L1581 has no Hoare annotation [2022-04-15 18:16:37,017 WARN L170 areAnnotationChecker]: L1581 has no Hoare annotation [2022-04-15 18:16:37,017 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-15 18:16:37,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 06:16:37 BoogieIcfgContainer [2022-04-15 18:16:37,020 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 18:16:37,021 INFO L158 Benchmark]: Toolchain (without parser) took 252439.49ms. Allocated memory was 175.1MB in the beginning and 367.0MB in the end (delta: 191.9MB). Free memory was 119.6MB in the beginning and 295.7MB in the end (delta: -176.1MB). Peak memory consumption was 206.8MB. Max. memory is 8.0GB. [2022-04-15 18:16:37,021 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 175.1MB. Free memory was 138.4MB in the beginning and 138.3MB in the end (delta: 71.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 18:16:37,021 INFO L158 Benchmark]: CACSL2BoogieTranslator took 686.29ms. Allocated memory is still 175.1MB. Free memory was 119.4MB in the beginning and 127.0MB in the end (delta: -7.5MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. [2022-04-15 18:16:37,021 INFO L158 Benchmark]: Boogie Preprocessor took 136.90ms. Allocated memory is still 175.1MB. Free memory was 127.0MB in the beginning and 117.7MB in the end (delta: 9.3MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-15 18:16:37,021 INFO L158 Benchmark]: RCFGBuilder took 3096.32ms. Allocated memory was 175.1MB in the beginning and 210.8MB in the end (delta: 35.7MB). Free memory was 117.4MB in the beginning and 109.6MB in the end (delta: 7.8MB). Peak memory consumption was 44.5MB. Max. memory is 8.0GB. [2022-04-15 18:16:37,022 INFO L158 Benchmark]: TraceAbstraction took 248513.18ms. Allocated memory was 210.8MB in the beginning and 367.0MB in the end (delta: 156.2MB). Free memory was 109.1MB in the beginning and 295.7MB in the end (delta: -186.6MB). Peak memory consumption was 159.8MB. Max. memory is 8.0GB. [2022-04-15 18:16:37,022 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 175.1MB. Free memory was 138.4MB in the beginning and 138.3MB in the end (delta: 71.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 686.29ms. Allocated memory is still 175.1MB. Free memory was 119.4MB in the beginning and 127.0MB in the end (delta: -7.5MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 136.90ms. Allocated memory is still 175.1MB. Free memory was 127.0MB in the beginning and 117.7MB in the end (delta: 9.3MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * RCFGBuilder took 3096.32ms. Allocated memory was 175.1MB in the beginning and 210.8MB in the end (delta: 35.7MB). Free memory was 117.4MB in the beginning and 109.6MB in the end (delta: 7.8MB). Peak memory consumption was 44.5MB. Max. memory is 8.0GB. * TraceAbstraction took 248513.18ms. Allocated memory was 210.8MB in the beginning and 367.0MB in the end (delta: 156.2MB). Free memory was 109.1MB in the beginning and 295.7MB in the end (delta: -186.6MB). Peak memory consumption was 159.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: 1668]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 1353. Possible FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_client_data ; [L1077] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1081] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1082] s->ctx = malloc(sizeof(SSL_CTX)) [L1083] s->session = malloc(sizeof(SSL_SESSION)) [L1084] s->state = 12292 [L1085] s->version = __VERIFIER_nondet_int() [L1087] s->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1088] EXPR s->ctx [L1088] (s->ctx)->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1089] s->init_buf = (BUF_MEM *)__VERIFIER_nondet_ulong() [L1090] s->bbio = (BIO *) __VERIFIER_nondet_ulong() [L1091] s->wbio = (BIO *) __VERIFIER_nondet_ulong() [L1092] EXPR s->s3 [L1092] (s->s3)->flags = __VERIFIER_nondet_long() [L1093] EXPR s->s3 [L1093] (s->s3)->tmp.cert_req = __VERIFIER_nondet_int() [L1094] EXPR s->s3 [L1094] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1095] EXPR s->s3 [L1095] EXPR (s->s3)->tmp.new_cipher [L1095] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1096] EXPR s->s3 [L1096] (s->s3)->tmp.next_state = __VERIFIER_nondet_int() [L1098] CALL ssl3_connect(s) [L1104] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1105] unsigned long tmp ; [L1106] unsigned long l ; [L1107] long num1 ; [L1108] void (*cb)() ; [L1109] int ret ; [L1110] int new_state ; [L1111] int state ; [L1112] int skip ; [L1113] int tmp___1 = __VERIFIER_nondet_int() ; [L1114] int tmp___2 = __VERIFIER_nondet_int() ; [L1115] int tmp___3 ; [L1116] int tmp___4 ; [L1117] int tmp___5 ; [L1118] int tmp___6 ; [L1119] int tmp___7 ; [L1120] int tmp___8 ; [L1121] long tmp___9 ; [L1123] int blastFlag ; [L1126] blastFlag = 0 [L1127] s->hit=__VERIFIER_nondet_int () [L1128] s->state = 12292 [L1129] tmp = __VERIFIER_nondet_int() [L1130] cb = (void (*)())((void *)0) [L1131] ret = -1 [L1132] skip = 0 [L1133] EXPR s->info_callback [L1133] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1134] EXPR s->info_callback [L1134] cb = s->info_callback [L1142] EXPR s->in_handshake [L1142] s->in_handshake += 1 [L1143] COND FALSE !(tmp___1 & 12288) [L1153] COND TRUE 1 [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state [L1156] COND TRUE s->state == 12292 [L1259] s->new_session = 1 [L1260] s->state = 4096 [L1261] EXPR s->ctx [L1261] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1261] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1266] s->server = 0 [L1267] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) [L1272] EXPR s->version [L1272] COND FALSE !((s->version & 65280) != 768) [L1278] s->type = 4096 [L1279] EXPR s->init_buf [L1279] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1291] tmp___4 = __VERIFIER_nondet_int() [L1292] COND FALSE !(! tmp___4) [L1298] tmp___5 = __VERIFIER_nondet_int() [L1299] COND FALSE !(! tmp___5) [L1305] s->state = 4368 [L1306] EXPR s->ctx [L1306] EXPR (s->ctx)->stats.sess_connect [L1306] (s->ctx)->stats.sess_connect += 1 [L1307] s->init_num = 0 [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 [L1153] COND TRUE 1 [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state [L1171] COND TRUE s->state == 4368 [L1311] s->shutdown = 0 [L1312] ret = __VERIFIER_nondet_int() [L1313] COND TRUE blastFlag == 0 [L1314] blastFlag = 1 [L1318] COND FALSE !(ret <= 0) [L1323] s->state = 4384 [L1324] s->init_num = 0 [L1325] EXPR s->bbio [L1325] EXPR s->wbio [L1325] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 [L1153] COND TRUE 1 [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state [L1171] COND FALSE !(s->state == 4368) [L1174] EXPR s->state [L1174] COND FALSE !(s->state == 4369) [L1177] EXPR s->state [L1177] COND TRUE s->state == 4384 [L1333] ret = __VERIFIER_nondet_int() [L1334] COND TRUE blastFlag == 1 [L1335] blastFlag = 2 [L1339] COND FALSE !(ret <= 0) [L1344] s->hit [L1344] COND FALSE !(s->hit) [L1347] s->state = 4400 [L1349] s->init_num = 0 [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 [L1153] COND TRUE 1 [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state [L1171] COND FALSE !(s->state == 4368) [L1174] EXPR s->state [L1174] COND FALSE !(s->state == 4369) [L1177] EXPR s->state [L1177] COND FALSE !(s->state == 4384) [L1180] EXPR s->state [L1180] COND FALSE !(s->state == 4385) [L1183] EXPR s->state [L1183] COND TRUE s->state == 4400 [L1353] EXPR s->s3 [L1353] EXPR (s->s3)->tmp.new_cipher [L1353] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1353] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1356] ret = __VERIFIER_nondet_int() [L1357] COND TRUE blastFlag == 2 [L1358] blastFlag = 3 [L1362] COND FALSE !(ret <= 0) [L1368] s->state = 4416 [L1369] s->init_num = 0 [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 [L1153] COND TRUE 1 [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state [L1171] COND FALSE !(s->state == 4368) [L1174] EXPR s->state [L1174] COND FALSE !(s->state == 4369) [L1177] EXPR s->state [L1177] COND FALSE !(s->state == 4384) [L1180] EXPR s->state [L1180] COND FALSE !(s->state == 4385) [L1183] EXPR s->state [L1183] COND FALSE !(s->state == 4400) [L1186] EXPR s->state [L1186] COND FALSE !(s->state == 4401) [L1189] EXPR s->state [L1189] COND TRUE s->state == 4416 [L1373] ret = __VERIFIER_nondet_int() [L1374] COND TRUE blastFlag == 3 [L1375] blastFlag = 4 [L1379] COND FALSE !(ret <= 0) [L1384] s->state = 4432 [L1385] s->init_num = 0 [L1386] tmp___6 = __VERIFIER_nondet_int() [L1387] COND FALSE !(! tmp___6) [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 [L1153] COND TRUE 1 [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state [L1171] COND FALSE !(s->state == 4368) [L1174] EXPR s->state [L1174] COND FALSE !(s->state == 4369) [L1177] EXPR s->state [L1177] COND FALSE !(s->state == 4384) [L1180] EXPR s->state [L1180] COND FALSE !(s->state == 4385) [L1183] EXPR s->state [L1183] COND FALSE !(s->state == 4400) [L1186] EXPR s->state [L1186] COND FALSE !(s->state == 4401) [L1189] EXPR s->state [L1189] COND FALSE !(s->state == 4416) [L1192] EXPR s->state [L1192] COND FALSE !(s->state == 4417) [L1195] EXPR s->state [L1195] COND TRUE s->state == 4432 [L1396] ret = __VERIFIER_nondet_int() [L1397] COND FALSE !(blastFlag == 5) [L1402] COND FALSE !(ret <= 0) [L1407] s->state = 4448 [L1408] s->init_num = 0 [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 [L1153] COND TRUE 1 [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state [L1171] COND FALSE !(s->state == 4368) [L1174] EXPR s->state [L1174] COND FALSE !(s->state == 4369) [L1177] EXPR s->state [L1177] COND FALSE !(s->state == 4384) [L1180] EXPR s->state [L1180] COND FALSE !(s->state == 4385) [L1183] EXPR s->state [L1183] COND FALSE !(s->state == 4400) [L1186] EXPR s->state [L1186] COND FALSE !(s->state == 4401) [L1189] EXPR s->state [L1189] COND FALSE !(s->state == 4416) [L1192] EXPR s->state [L1192] COND FALSE !(s->state == 4417) [L1195] EXPR s->state [L1195] COND FALSE !(s->state == 4432) [L1198] EXPR s->state [L1198] COND FALSE !(s->state == 4433) [L1201] EXPR s->state [L1201] COND TRUE s->state == 4448 [L1412] ret = __VERIFIER_nondet_int() [L1413] COND TRUE blastFlag == 4 [L1668] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 171 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 248.4s, OverallIterations: 18, TraceHistogramMax: 7, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 65.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 17 mSolverCounterUnknown, 1443 SdHoareTripleChecker+Valid, 41.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1443 mSDsluCounter, 6933 SdHoareTripleChecker+Invalid, 41.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3760 mSDsCounter, 346 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6043 IncrementalHoareTripleChecker+Invalid, 6406 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 346 mSolverCounterUnsat, 3173 mSDtfsCounter, 6043 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=876occurred in iteration=17, InterpolantAutomatonStates: 80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 1057 StatesRemovedByMinimization, 13 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-15 18:16:37,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...