/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/openssl/s3_clnt.blast.02.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 18:23:04,234 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 18:23:04,237 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 18:23:04,281 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 18:23:04,281 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 18:23:04,283 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 18:23:04,285 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 18:23:04,287 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 18:23:04,289 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 18:23:04,293 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 18:23:04,294 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 18:23:04,296 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 18:23:04,296 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 18:23:04,298 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 18:23:04,299 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 18:23:04,301 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 18:23:04,302 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 18:23:04,302 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 18:23:04,304 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 18:23:04,310 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 18:23:04,312 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 18:23:04,313 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 18:23:04,314 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 18:23:04,314 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 18:23:04,316 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 18:23:04,322 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 18:23:04,322 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 18:23:04,322 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 18:23:04,323 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 18:23:04,324 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 18:23:04,325 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 18:23:04,325 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 18:23:04,327 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 18:23:04,327 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 18:23:04,328 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 18:23:04,329 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 18:23:04,329 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 18:23:04,329 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 18:23:04,330 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 18:23:04,330 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 18:23:04,330 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 18:23:04,332 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 18:23:04,333 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-14 18:23:04,367 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 18:23:04,367 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 18:23:04,367 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-14 18:23:04,368 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-14 18:23:04,368 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-14 18:23:04,368 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-14 18:23:04,369 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-14 18:23:04,369 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-14 18:23:04,369 INFO L138 SettingsManager]: * Use SBE=true [2022-04-14 18:23:04,370 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 18:23:04,370 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 18:23:04,370 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 18:23:04,371 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 18:23:04,371 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 18:23:04,371 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 18:23:04,371 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 18:23:04,371 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 18:23:04,373 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 18:23:04,373 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 18:23:04,373 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 18:23:04,373 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 18:23:04,373 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 18:23:04,373 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 18:23:04,374 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 18:23:04,374 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 18:23:04,374 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 18:23:04,374 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-14 18:23:04,374 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-14 18:23:04,374 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 18:23:04,374 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-14 18:23:04,375 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-14 18:23:04,375 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-14 18:23:04,375 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-14 18:23:04,375 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-14 18:23:04,598 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 18:23:04,627 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 18:23:04,629 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 18:23:04,630 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 18:23:04,630 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 18:23:04,631 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_clnt.blast.02.i.cil-1.c [2022-04-14 18:23:04,683 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d476c4ecc/097983f2d5d64c9bbd46f411badb5d02/FLAG82c4458a7 [2022-04-14 18:23:05,178 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 18:23:05,178 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.02.i.cil-1.c [2022-04-14 18:23:05,203 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d476c4ecc/097983f2d5d64c9bbd46f411badb5d02/FLAG82c4458a7 [2022-04-14 18:23:05,705 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d476c4ecc/097983f2d5d64c9bbd46f411badb5d02 [2022-04-14 18:23:05,707 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 18:23:05,708 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-14 18:23:05,709 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 18:23:05,710 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 18:23:05,712 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 18:23:05,712 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 06:23:05" (1/1) ... [2022-04-14 18:23:05,714 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64a90a9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:23:05, skipping insertion in model container [2022-04-14 18:23:05,714 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 06:23:05" (1/1) ... [2022-04-14 18:23:05,721 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 18:23:05,778 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 18:23:06,133 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.02.i.cil-1.c[65397,65410] [2022-04-14 18:23:06,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 18:23:06,180 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 18:23:06,305 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.02.i.cil-1.c[65397,65410] [2022-04-14 18:23:06,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 18:23:06,331 INFO L208 MainTranslator]: Completed translation [2022-04-14 18:23:06,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:23:06 WrapperNode [2022-04-14 18:23:06,332 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 18:23:06,333 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 18:23:06,333 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 18:23:06,333 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 18:23:06,343 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:23:06" (1/1) ... [2022-04-14 18:23:06,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:23:06" (1/1) ... [2022-04-14 18:23:06,375 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:23:06" (1/1) ... [2022-04-14 18:23:06,376 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:23:06" (1/1) ... [2022-04-14 18:23:06,454 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:23:06" (1/1) ... [2022-04-14 18:23:06,468 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:23:06" (1/1) ... [2022-04-14 18:23:06,471 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:23:06" (1/1) ... [2022-04-14 18:23:06,476 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 18:23:06,477 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 18:23:06,477 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 18:23:06,477 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 18:23:06,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:23:06" (1/1) ... [2022-04-14 18:23:06,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 18:23:06,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 18:23:06,512 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-14 18:23:06,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 18:23:06,539 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-14 18:23:06,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 18:23:06,555 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 18:23:06,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2022-04-14 18:23:06,557 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2022-04-14 18:23:06,557 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 18:23:06,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2022-04-14 18:23:06,558 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-14 18:23:06,558 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-14 18:23:06,558 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-14 18:23:06,558 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 18:23:06,558 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 18:23:06,558 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 18:23:06,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 18:23:06,558 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-14 18:23:06,559 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-14 18:23:06,559 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-14 18:23:06,559 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-14 18:23:06,559 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-14 18:23:06,559 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-14 18:23:06,559 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2022-04-14 18:23:06,559 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-14 18:23:06,559 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2022-04-14 18:23:06,559 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2022-04-14 18:23:06,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-14 18:23:06,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-14 18:23:06,560 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 18:23:06,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-14 18:23:06,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 18:23:06,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-14 18:23:06,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 18:23:06,560 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-14 18:23:06,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-14 18:23:06,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 18:23:06,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 18:23:06,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 18:23:06,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-14 18:23:06,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-14 18:23:06,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-14 18:23:06,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-14 18:23:06,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 18:23:06,755 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 18:23:06,756 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 18:23:08,063 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-14 18:23:08,562 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-04-14 18:23:08,562 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-04-14 18:23:08,585 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 18:23:08,599 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 18:23:08,600 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 18:23:08,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 06:23:08 BoogieIcfgContainer [2022-04-14 18:23:08,602 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 18:23:08,604 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 18:23:08,605 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 18:23:08,607 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 18:23:08,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 06:23:05" (1/3) ... [2022-04-14 18:23:08,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@729a612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 06:23:08, skipping insertion in model container [2022-04-14 18:23:08,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:23:06" (2/3) ... [2022-04-14 18:23:08,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@729a612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 06:23:08, skipping insertion in model container [2022-04-14 18:23:08,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 06:23:08" (3/3) ... [2022-04-14 18:23:08,612 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.02.i.cil-1.c [2022-04-14 18:23:08,618 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-14 18:23:08,618 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 18:23:08,670 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 18:23:08,675 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-14 18:23:08,677 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 18:23:08,706 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 130 states have (on average 1.6923076923076923) internal successors, (220), 131 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 18:23:08,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-14 18:23:08,714 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:23:08,714 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-14 18:23:08,715 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:23:08,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:23:08,722 INFO L85 PathProgramCache]: Analyzing trace with hash -22644822, now seen corresponding path program 1 times [2022-04-14 18:23:08,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:23:08,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246102752] [2022-04-14 18:23:08,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:23:08,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:23:09,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:23:09,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:23:09,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:23:09,341 INFO L290 TraceCheckUtils]: 0: Hoare triple {148#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {141#true} is VALID [2022-04-14 18:23:09,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {141#true} assume true; {141#true} is VALID [2022-04-14 18:23:09,342 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {141#true} {141#true} #593#return; {141#true} is VALID [2022-04-14 18:23:09,344 INFO L272 TraceCheckUtils]: 0: Hoare triple {141#true} call ULTIMATE.init(); {148#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 18:23:09,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {148#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {141#true} is VALID [2022-04-14 18:23:09,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {141#true} assume true; {141#true} is VALID [2022-04-14 18:23:09,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {141#true} {141#true} #593#return; {141#true} is VALID [2022-04-14 18:23:09,345 INFO L272 TraceCheckUtils]: 4: Hoare triple {141#true} call #t~ret158 := main(); {141#true} is VALID [2022-04-14 18:23:09,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {141#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {141#true} is VALID [2022-04-14 18:23:09,347 INFO L272 TraceCheckUtils]: 6: Hoare triple {141#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {141#true} is VALID [2022-04-14 18:23:09,350 INFO L290 TraceCheckUtils]: 7: Hoare triple {141#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-14 18:23:09,351 INFO L290 TraceCheckUtils]: 8: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-14 18:23:09,352 INFO L290 TraceCheckUtils]: 9: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-14 18:23:09,352 INFO L290 TraceCheckUtils]: 10: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-14 18:23:09,353 INFO L290 TraceCheckUtils]: 11: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-14 18:23:09,353 INFO L290 TraceCheckUtils]: 12: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {147#(= 12292 |ssl3_connect_#t~mem49|)} is VALID [2022-04-14 18:23:09,354 INFO L290 TraceCheckUtils]: 13: Hoare triple {147#(= 12292 |ssl3_connect_#t~mem49|)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-14 18:23:09,354 INFO L290 TraceCheckUtils]: 14: Hoare triple {142#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-14 18:23:09,354 INFO L290 TraceCheckUtils]: 15: Hoare triple {142#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-14 18:23:09,354 INFO L290 TraceCheckUtils]: 16: Hoare triple {142#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-14 18:23:09,354 INFO L290 TraceCheckUtils]: 17: Hoare triple {142#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-14 18:23:09,355 INFO L290 TraceCheckUtils]: 18: Hoare triple {142#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-14 18:23:09,355 INFO L290 TraceCheckUtils]: 19: Hoare triple {142#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-14 18:23:09,355 INFO L290 TraceCheckUtils]: 20: Hoare triple {142#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-14 18:23:09,355 INFO L290 TraceCheckUtils]: 21: Hoare triple {142#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-14 18:23:09,356 INFO L290 TraceCheckUtils]: 22: Hoare triple {142#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-14 18:23:09,356 INFO L290 TraceCheckUtils]: 23: Hoare triple {142#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-14 18:23:09,356 INFO L290 TraceCheckUtils]: 24: Hoare triple {142#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-14 18:23:09,356 INFO L290 TraceCheckUtils]: 25: Hoare triple {142#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-14 18:23:09,356 INFO L290 TraceCheckUtils]: 26: Hoare triple {142#false} assume 4432 == #t~mem62;havoc #t~mem62; {142#false} is VALID [2022-04-14 18:23:09,357 INFO L290 TraceCheckUtils]: 27: Hoare triple {142#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {142#false} is VALID [2022-04-14 18:23:09,357 INFO L290 TraceCheckUtils]: 28: Hoare triple {142#false} assume 4 == ~blastFlag~0; {142#false} is VALID [2022-04-14 18:23:09,357 INFO L290 TraceCheckUtils]: 29: Hoare triple {142#false} assume !false; {142#false} is VALID [2022-04-14 18:23:09,357 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-14 18:23:09,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:23:09,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246102752] [2022-04-14 18:23:09,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246102752] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:23:09,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:23:09,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:23:09,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487990107] [2022-04-14 18:23:09,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:23:09,365 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-14 18:23:09,367 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:23:09,370 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-14 18:23:09,410 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-14 18:23:09,410 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:23:09,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:23:09,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:23:09,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:23:09,431 INFO L87 Difference]: Start difference. First operand has 138 states, 130 states have (on average 1.6923076923076923) internal successors, (220), 131 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:11,483 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-14 18:23:12,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:23:12,986 INFO L93 Difference]: Finished difference Result 267 states and 442 transitions. [2022-04-14 18:23:12,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:23:12,987 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-14 18:23:12,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:23:12,988 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-14 18:23:13,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-14 18:23:13,001 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-14 18:23:13,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-14 18:23:13,008 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 442 transitions. [2022-04-14 18:23:13,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 442 edges. 442 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:23:13,416 INFO L225 Difference]: With dead ends: 267 [2022-04-14 18:23:13,416 INFO L226 Difference]: Without dead ends: 122 [2022-04-14 18:23:13,419 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-14 18:23:13,421 INFO L913 BasicCegarLoop]: 213 mSDtfsCounter, 7 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-14 18:23:13,422 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 555 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 320 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-14 18:23:13,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-04-14 18:23:13,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2022-04-14 18:23:13,461 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:23:13,466 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:13,468 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:13,468 INFO L87 Difference]: Start difference. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:13,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:23:13,479 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2022-04-14 18:23:13,479 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2022-04-14 18:23:13,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:23:13,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:23:13,481 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 122 states. [2022-04-14 18:23:13,482 INFO L87 Difference]: Start difference. First operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 122 states. [2022-04-14 18:23:13,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:23:13,489 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2022-04-14 18:23:13,489 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2022-04-14 18:23:13,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:23:13,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:23:13,492 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:23:13,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:23:13,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:13,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 178 transitions. [2022-04-14 18:23:13,499 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 178 transitions. Word has length 30 [2022-04-14 18:23:13,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:23:13,499 INFO L478 AbstractCegarLoop]: Abstraction has 121 states and 178 transitions. [2022-04-14 18:23:13,500 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-14 18:23:13,500 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 178 transitions. [2022-04-14 18:23:13,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-14 18:23:13,506 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:23:13,506 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] [2022-04-14 18:23:13,506 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 18:23:13,506 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:23:13,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:23:13,509 INFO L85 PathProgramCache]: Analyzing trace with hash 868047042, now seen corresponding path program 1 times [2022-04-14 18:23:13,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:23:13,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2803635] [2022-04-14 18:23:13,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:23:13,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:23:13,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:23:13,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:23:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:23:13,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {861#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {855#true} is VALID [2022-04-14 18:23:13,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {855#true} assume true; {855#true} is VALID [2022-04-14 18:23:13,803 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {855#true} {855#true} #593#return; {855#true} is VALID [2022-04-14 18:23:13,804 INFO L272 TraceCheckUtils]: 0: Hoare triple {855#true} call ULTIMATE.init(); {861#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 18:23:13,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {861#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {855#true} is VALID [2022-04-14 18:23:13,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {855#true} assume true; {855#true} is VALID [2022-04-14 18:23:13,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {855#true} {855#true} #593#return; {855#true} is VALID [2022-04-14 18:23:13,804 INFO L272 TraceCheckUtils]: 4: Hoare triple {855#true} call #t~ret158 := main(); {855#true} is VALID [2022-04-14 18:23:13,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {855#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {855#true} is VALID [2022-04-14 18:23:13,804 INFO L272 TraceCheckUtils]: 6: Hoare triple {855#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {855#true} is VALID [2022-04-14 18:23:13,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {855#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-14 18:23:13,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-14 18:23:13,806 INFO L290 TraceCheckUtils]: 9: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-14 18:23:13,806 INFO L290 TraceCheckUtils]: 10: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-14 18:23:13,807 INFO L290 TraceCheckUtils]: 11: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !false; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-14 18:23:13,807 INFO L290 TraceCheckUtils]: 12: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-14 18:23:13,810 INFO L290 TraceCheckUtils]: 13: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume 12292 == #t~mem49;havoc #t~mem49; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-14 18:23:13,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-14 18:23:13,812 INFO L290 TraceCheckUtils]: 15: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} call write~int(0, ~s.base, 36 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-14 18:23:13,813 INFO L290 TraceCheckUtils]: 16: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-14 18:23:13,813 INFO L290 TraceCheckUtils]: 17: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-14 18:23:13,813 INFO L290 TraceCheckUtils]: 18: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-14 18:23:13,814 INFO L290 TraceCheckUtils]: 19: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-14 18:23:13,814 INFO L290 TraceCheckUtils]: 20: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == ~tmp___4~0); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-14 18:23:13,815 INFO L290 TraceCheckUtils]: 21: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-14 18:23:13,815 INFO L290 TraceCheckUtils]: 22: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-14 18:23:13,815 INFO L290 TraceCheckUtils]: 23: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-14 18:23:13,816 INFO L290 TraceCheckUtils]: 24: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} ~skip~0 := 0; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-14 18:23:13,816 INFO L290 TraceCheckUtils]: 25: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !false; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-14 18:23:13,816 INFO L290 TraceCheckUtils]: 26: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-14 18:23:13,817 INFO L290 TraceCheckUtils]: 27: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-14 18:23:13,817 INFO L290 TraceCheckUtils]: 28: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-14 18:23:13,818 INFO L290 TraceCheckUtils]: 29: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-14 18:23:13,818 INFO L290 TraceCheckUtils]: 30: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-14 18:23:13,818 INFO L290 TraceCheckUtils]: 31: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-14 18:23:13,819 INFO L290 TraceCheckUtils]: 32: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-14 18:23:13,819 INFO L290 TraceCheckUtils]: 33: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-14 18:23:13,820 INFO L290 TraceCheckUtils]: 34: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-14 18:23:13,820 INFO L290 TraceCheckUtils]: 35: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-14 18:23:13,820 INFO L290 TraceCheckUtils]: 36: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-14 18:23:13,821 INFO L290 TraceCheckUtils]: 37: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-14 18:23:13,821 INFO L290 TraceCheckUtils]: 38: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-14 18:23:13,822 INFO L290 TraceCheckUtils]: 39: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-14 18:23:13,822 INFO L290 TraceCheckUtils]: 40: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume 4432 == #t~mem62;havoc #t~mem62; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-14 18:23:13,822 INFO L290 TraceCheckUtils]: 41: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-14 18:23:13,823 INFO L290 TraceCheckUtils]: 42: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume 4 == ~blastFlag~0; {856#false} is VALID [2022-04-14 18:23:13,823 INFO L290 TraceCheckUtils]: 43: Hoare triple {856#false} assume !false; {856#false} is VALID [2022-04-14 18:23:13,823 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-14 18:23:13,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:23:13,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2803635] [2022-04-14 18:23:13,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2803635] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:23:13,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:23:13,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 18:23:13,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081523663] [2022-04-14 18:23:13,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:23:13,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-14 18:23:13,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:23:13,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:13,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:23:13,867 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 18:23:13,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:23:13,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 18:23:13,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 18:23:13,868 INFO L87 Difference]: Start difference. First operand 121 states and 178 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:15,892 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-14 18:23:16,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:23:16,630 INFO L93 Difference]: Finished difference Result 326 states and 488 transitions. [2022-04-14 18:23:16,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 18:23:16,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-14 18:23:16,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:23:16,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:16,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 485 transitions. [2022-04-14 18:23:16,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:16,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 485 transitions. [2022-04-14 18:23:16,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 485 transitions. [2022-04-14 18:23:17,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 485 edges. 485 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:23:17,072 INFO L225 Difference]: With dead ends: 326 [2022-04-14 18:23:17,072 INFO L226 Difference]: Without dead ends: 221 [2022-04-14 18:23:17,073 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-14 18:23:17,074 INFO L913 BasicCegarLoop]: 167 mSDtfsCounter, 123 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-14 18:23:17,075 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 320 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 189 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-14 18:23:17,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-04-14 18:23:17,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2022-04-14 18:23:17,087 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:23:17,088 INFO L82 GeneralOperation]: Start isEquivalent. First operand 221 states. Second operand has 221 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 216 states have internal predecessors, (321), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:17,089 INFO L74 IsIncluded]: Start isIncluded. First operand 221 states. Second operand has 221 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 216 states have internal predecessors, (321), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:17,089 INFO L87 Difference]: Start difference. First operand 221 states. Second operand has 221 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 216 states have internal predecessors, (321), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:17,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:23:17,098 INFO L93 Difference]: Finished difference Result 221 states and 325 transitions. [2022-04-14 18:23:17,098 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 325 transitions. [2022-04-14 18:23:17,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:23:17,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:23:17,099 INFO L74 IsIncluded]: Start isIncluded. First operand has 221 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 216 states have internal predecessors, (321), 3 states have call successors, (3), 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 221 states. [2022-04-14 18:23:17,100 INFO L87 Difference]: Start difference. First operand has 221 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 216 states have internal predecessors, (321), 3 states have call successors, (3), 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 221 states. [2022-04-14 18:23:17,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:23:17,109 INFO L93 Difference]: Finished difference Result 221 states and 325 transitions. [2022-04-14 18:23:17,109 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 325 transitions. [2022-04-14 18:23:17,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:23:17,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:23:17,110 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:23:17,110 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:23:17,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 216 states have internal predecessors, (321), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:17,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 325 transitions. [2022-04-14 18:23:17,119 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 325 transitions. Word has length 44 [2022-04-14 18:23:17,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:23:17,119 INFO L478 AbstractCegarLoop]: Abstraction has 221 states and 325 transitions. [2022-04-14 18:23:17,119 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:17,120 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 325 transitions. [2022-04-14 18:23:17,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-14 18:23:17,121 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:23:17,121 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] [2022-04-14 18:23:17,121 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-14 18:23:17,121 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:23:17,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:23:17,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1147706284, now seen corresponding path program 1 times [2022-04-14 18:23:17,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:23:17,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586602988] [2022-04-14 18:23:17,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:23:17,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:23:17,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:23:17,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:23:17,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:23:17,341 INFO L290 TraceCheckUtils]: 0: Hoare triple {1955#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {1948#true} is VALID [2022-04-14 18:23:17,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {1948#true} assume true; {1948#true} is VALID [2022-04-14 18:23:17,341 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1948#true} {1948#true} #593#return; {1948#true} is VALID [2022-04-14 18:23:17,342 INFO L272 TraceCheckUtils]: 0: Hoare triple {1948#true} call ULTIMATE.init(); {1955#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-14 18:23:17,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {1955#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {1948#true} is VALID [2022-04-14 18:23:17,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {1948#true} assume true; {1948#true} is VALID [2022-04-14 18:23:17,343 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1948#true} {1948#true} #593#return; {1948#true} is VALID [2022-04-14 18:23:17,343 INFO L272 TraceCheckUtils]: 4: Hoare triple {1948#true} call #t~ret158 := main(); {1948#true} is VALID [2022-04-14 18:23:17,343 INFO L290 TraceCheckUtils]: 5: Hoare triple {1948#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {1948#true} is VALID [2022-04-14 18:23:17,343 INFO L272 TraceCheckUtils]: 6: Hoare triple {1948#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {1948#true} is VALID [2022-04-14 18:23:17,343 INFO L290 TraceCheckUtils]: 7: Hoare triple {1948#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {1948#true} is VALID [2022-04-14 18:23:17,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {1948#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {1948#true} is VALID [2022-04-14 18:23:17,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {1948#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {1948#true} is VALID [2022-04-14 18:23:17,344 INFO L290 TraceCheckUtils]: 10: Hoare triple {1948#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {1948#true} is VALID [2022-04-14 18:23:17,344 INFO L290 TraceCheckUtils]: 11: Hoare triple {1948#true} assume !false; {1948#true} is VALID [2022-04-14 18:23:17,344 INFO L290 TraceCheckUtils]: 12: Hoare triple {1948#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1948#true} is VALID [2022-04-14 18:23:17,344 INFO L290 TraceCheckUtils]: 13: Hoare triple {1948#true} assume 12292 == #t~mem49;havoc #t~mem49; {1948#true} is VALID [2022-04-14 18:23:17,344 INFO L290 TraceCheckUtils]: 14: Hoare triple {1948#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {1948#true} is VALID [2022-04-14 18:23:17,345 INFO L290 TraceCheckUtils]: 15: Hoare triple {1948#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {1948#true} is VALID [2022-04-14 18:23:17,345 INFO L290 TraceCheckUtils]: 16: Hoare triple {1948#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {1948#true} is VALID [2022-04-14 18:23:17,345 INFO L290 TraceCheckUtils]: 17: Hoare triple {1948#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {1948#true} is VALID [2022-04-14 18:23:17,345 INFO L290 TraceCheckUtils]: 18: Hoare triple {1948#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {1948#true} is VALID [2022-04-14 18:23:17,345 INFO L290 TraceCheckUtils]: 19: Hoare triple {1948#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {1948#true} is VALID [2022-04-14 18:23:17,345 INFO L290 TraceCheckUtils]: 20: Hoare triple {1948#true} assume !(0 == ~tmp___4~0); {1948#true} is VALID [2022-04-14 18:23:17,346 INFO L290 TraceCheckUtils]: 21: Hoare triple {1948#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {1948#true} is VALID [2022-04-14 18:23:17,346 INFO L290 TraceCheckUtils]: 22: Hoare triple {1948#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {1948#true} is VALID [2022-04-14 18:23:17,346 INFO L290 TraceCheckUtils]: 23: Hoare triple {1948#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {1948#true} is VALID [2022-04-14 18:23:17,346 INFO L290 TraceCheckUtils]: 24: Hoare triple {1948#true} ~skip~0 := 0; {1948#true} is VALID [2022-04-14 18:23:17,346 INFO L290 TraceCheckUtils]: 25: Hoare triple {1948#true} assume !false; {1948#true} is VALID [2022-04-14 18:23:17,346 INFO L290 TraceCheckUtils]: 26: Hoare triple {1948#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1948#true} is VALID [2022-04-14 18:23:17,347 INFO L290 TraceCheckUtils]: 27: Hoare triple {1948#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {1948#true} is VALID [2022-04-14 18:23:17,347 INFO L290 TraceCheckUtils]: 28: Hoare triple {1948#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {1948#true} is VALID [2022-04-14 18:23:17,347 INFO L290 TraceCheckUtils]: 29: Hoare triple {1948#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {1948#true} is VALID [2022-04-14 18:23:17,347 INFO L290 TraceCheckUtils]: 30: Hoare triple {1948#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {1948#true} is VALID [2022-04-14 18:23:17,347 INFO L290 TraceCheckUtils]: 31: Hoare triple {1948#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {1948#true} is VALID [2022-04-14 18:23:17,347 INFO L290 TraceCheckUtils]: 32: Hoare triple {1948#true} assume 4368 == #t~mem54;havoc #t~mem54; {1948#true} is VALID [2022-04-14 18:23:17,348 INFO L290 TraceCheckUtils]: 33: Hoare triple {1948#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {1948#true} is VALID [2022-04-14 18:23:17,348 INFO L290 TraceCheckUtils]: 34: Hoare triple {1948#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {1948#true} is VALID [2022-04-14 18:23:17,349 INFO L290 TraceCheckUtils]: 35: Hoare triple {1948#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-14 18:23:17,350 INFO L290 TraceCheckUtils]: 36: Hoare triple {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-14 18:23:17,358 INFO L290 TraceCheckUtils]: 37: Hoare triple {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-14 18:23:17,359 INFO L290 TraceCheckUtils]: 38: Hoare triple {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-14 18:23:17,359 INFO L290 TraceCheckUtils]: 39: Hoare triple {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-14 18:23:17,360 INFO L290 TraceCheckUtils]: 40: Hoare triple {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-14 18:23:17,360 INFO L290 TraceCheckUtils]: 41: Hoare triple {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-14 18:23:17,361 INFO L290 TraceCheckUtils]: 42: Hoare triple {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-14 18:23:17,361 INFO L290 TraceCheckUtils]: 43: Hoare triple {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-14 18:23:17,362 INFO L290 TraceCheckUtils]: 44: Hoare triple {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-14 18:23:17,363 INFO L290 TraceCheckUtils]: 45: Hoare triple {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-14 18:23:17,363 INFO L290 TraceCheckUtils]: 46: Hoare triple {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-14 18:23:17,364 INFO L290 TraceCheckUtils]: 47: Hoare triple {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-14 18:23:17,364 INFO L290 TraceCheckUtils]: 48: Hoare triple {1953#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {1954#(= |ssl3_connect_#t~mem56| 4384)} is VALID [2022-04-14 18:23:17,365 INFO L290 TraceCheckUtils]: 49: Hoare triple {1954#(= |ssl3_connect_#t~mem56| 4384)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {1949#false} is VALID [2022-04-14 18:23:17,365 INFO L290 TraceCheckUtils]: 50: Hoare triple {1949#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {1949#false} is VALID [2022-04-14 18:23:17,365 INFO L290 TraceCheckUtils]: 51: Hoare triple {1949#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {1949#false} is VALID [2022-04-14 18:23:17,365 INFO L290 TraceCheckUtils]: 52: Hoare triple {1949#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {1949#false} is VALID [2022-04-14 18:23:17,365 INFO L290 TraceCheckUtils]: 53: Hoare triple {1949#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {1949#false} is VALID [2022-04-14 18:23:17,365 INFO L290 TraceCheckUtils]: 54: Hoare triple {1949#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {1949#false} is VALID [2022-04-14 18:23:17,365 INFO L290 TraceCheckUtils]: 55: Hoare triple {1949#false} assume 4432 == #t~mem62;havoc #t~mem62; {1949#false} is VALID [2022-04-14 18:23:17,366 INFO L290 TraceCheckUtils]: 56: Hoare triple {1949#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {1949#false} is VALID [2022-04-14 18:23:17,366 INFO L290 TraceCheckUtils]: 57: Hoare triple {1949#false} assume 4 == ~blastFlag~0; {1949#false} is VALID [2022-04-14 18:23:17,366 INFO L290 TraceCheckUtils]: 58: Hoare triple {1949#false} assume !false; {1949#false} is VALID [2022-04-14 18:23:17,366 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-14 18:23:17,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:23:17,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586602988] [2022-04-14 18:23:17,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586602988] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:23:17,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:23:17,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:23:17,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213082039] [2022-04-14 18:23:17,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:23:17,368 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-14 18:23:17,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:23:17,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:17,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:23:17,424 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:23:17,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:23:17,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:23:17,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:23:17,425 INFO L87 Difference]: Start difference. First operand 221 states and 325 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:19,456 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-14 18:23:20,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:23:20,601 INFO L93 Difference]: Finished difference Result 362 states and 538 transitions. [2022-04-14 18:23:20,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:23:20,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-14 18:23:20,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:23:20,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:20,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 388 transitions. [2022-04-14 18:23:20,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:20,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 388 transitions. [2022-04-14 18:23:20,611 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 388 transitions. [2022-04-14 18:23:20,892 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-14 18:23:20,897 INFO L225 Difference]: With dead ends: 362 [2022-04-14 18:23:20,897 INFO L226 Difference]: Without dead ends: 257 [2022-04-14 18:23:20,898 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-14 18:23:20,899 INFO L913 BasicCegarLoop]: 198 mSDtfsCounter, 33 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-14 18:23:20,900 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 484 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 359 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-14 18:23:20,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-04-14 18:23:20,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 239. [2022-04-14 18:23:20,910 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:23:20,911 INFO L82 GeneralOperation]: Start isEquivalent. First operand 257 states. Second operand has 239 states, 234 states have (on average 1.5) internal successors, (351), 234 states have internal predecessors, (351), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:20,912 INFO L74 IsIncluded]: Start isIncluded. First operand 257 states. Second operand has 239 states, 234 states have (on average 1.5) internal successors, (351), 234 states have internal predecessors, (351), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:20,912 INFO L87 Difference]: Start difference. First operand 257 states. Second operand has 239 states, 234 states have (on average 1.5) internal successors, (351), 234 states have internal predecessors, (351), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:20,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:23:20,920 INFO L93 Difference]: Finished difference Result 257 states and 379 transitions. [2022-04-14 18:23:20,920 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 379 transitions. [2022-04-14 18:23:20,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:23:20,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:23:20,922 INFO L74 IsIncluded]: Start isIncluded. First operand has 239 states, 234 states have (on average 1.5) internal successors, (351), 234 states have internal predecessors, (351), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 257 states. [2022-04-14 18:23:20,922 INFO L87 Difference]: Start difference. First operand has 239 states, 234 states have (on average 1.5) internal successors, (351), 234 states have internal predecessors, (351), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 257 states. [2022-04-14 18:23:20,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:23:20,930 INFO L93 Difference]: Finished difference Result 257 states and 379 transitions. [2022-04-14 18:23:20,931 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 379 transitions. [2022-04-14 18:23:20,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:23:20,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:23:20,931 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:23:20,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:23:20,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 234 states have (on average 1.5) internal successors, (351), 234 states have internal predecessors, (351), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:20,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 355 transitions. [2022-04-14 18:23:20,939 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 355 transitions. Word has length 59 [2022-04-14 18:23:20,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:23:20,940 INFO L478 AbstractCegarLoop]: Abstraction has 239 states and 355 transitions. [2022-04-14 18:23:20,940 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:20,940 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 355 transitions. [2022-04-14 18:23:20,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-14 18:23:20,941 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:23:20,941 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:23:20,941 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-14 18:23:20,942 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:23:20,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:23:20,942 INFO L85 PathProgramCache]: Analyzing trace with hash -861449916, now seen corresponding path program 2 times [2022-04-14 18:23:20,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:23:20,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258113269] [2022-04-14 18:23:20,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:23:20,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:23:21,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:23:21,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:23:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:23:21,235 INFO L290 TraceCheckUtils]: 0: Hoare triple {3183#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {3176#true} is VALID [2022-04-14 18:23:21,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {3176#true} assume true; {3176#true} is VALID [2022-04-14 18:23:21,235 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3176#true} {3176#true} #593#return; {3176#true} is VALID [2022-04-14 18:23:21,236 INFO L272 TraceCheckUtils]: 0: Hoare triple {3176#true} call ULTIMATE.init(); {3183#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-14 18:23:21,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {3183#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {3176#true} is VALID [2022-04-14 18:23:21,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {3176#true} assume true; {3176#true} is VALID [2022-04-14 18:23:21,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3176#true} {3176#true} #593#return; {3176#true} is VALID [2022-04-14 18:23:21,237 INFO L272 TraceCheckUtils]: 4: Hoare triple {3176#true} call #t~ret158 := main(); {3176#true} is VALID [2022-04-14 18:23:21,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {3176#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {3176#true} is VALID [2022-04-14 18:23:21,237 INFO L272 TraceCheckUtils]: 6: Hoare triple {3176#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {3176#true} is VALID [2022-04-14 18:23:21,237 INFO L290 TraceCheckUtils]: 7: Hoare triple {3176#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {3176#true} is VALID [2022-04-14 18:23:21,237 INFO L290 TraceCheckUtils]: 8: Hoare triple {3176#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {3176#true} is VALID [2022-04-14 18:23:21,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {3176#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {3176#true} is VALID [2022-04-14 18:23:21,237 INFO L290 TraceCheckUtils]: 10: Hoare triple {3176#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {3176#true} is VALID [2022-04-14 18:23:21,237 INFO L290 TraceCheckUtils]: 11: Hoare triple {3176#true} assume !false; {3176#true} is VALID [2022-04-14 18:23:21,238 INFO L290 TraceCheckUtils]: 12: Hoare triple {3176#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {3176#true} is VALID [2022-04-14 18:23:21,238 INFO L290 TraceCheckUtils]: 13: Hoare triple {3176#true} assume 12292 == #t~mem49;havoc #t~mem49; {3176#true} is VALID [2022-04-14 18:23:21,238 INFO L290 TraceCheckUtils]: 14: Hoare triple {3176#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {3176#true} is VALID [2022-04-14 18:23:21,238 INFO L290 TraceCheckUtils]: 15: Hoare triple {3176#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {3176#true} is VALID [2022-04-14 18:23:21,238 INFO L290 TraceCheckUtils]: 16: Hoare triple {3176#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {3176#true} is VALID [2022-04-14 18:23:21,238 INFO L290 TraceCheckUtils]: 17: Hoare triple {3176#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {3176#true} is VALID [2022-04-14 18:23:21,238 INFO L290 TraceCheckUtils]: 18: Hoare triple {3176#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {3176#true} is VALID [2022-04-14 18:23:21,238 INFO L290 TraceCheckUtils]: 19: Hoare triple {3176#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {3176#true} is VALID [2022-04-14 18:23:21,239 INFO L290 TraceCheckUtils]: 20: Hoare triple {3176#true} assume !(0 == ~tmp___4~0); {3176#true} is VALID [2022-04-14 18:23:21,239 INFO L290 TraceCheckUtils]: 21: Hoare triple {3176#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {3176#true} is VALID [2022-04-14 18:23:21,239 INFO L290 TraceCheckUtils]: 22: Hoare triple {3176#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {3176#true} is VALID [2022-04-14 18:23:21,239 INFO L290 TraceCheckUtils]: 23: Hoare triple {3176#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {3176#true} is VALID [2022-04-14 18:23:21,239 INFO L290 TraceCheckUtils]: 24: Hoare triple {3176#true} ~skip~0 := 0; {3176#true} is VALID [2022-04-14 18:23:21,239 INFO L290 TraceCheckUtils]: 25: Hoare triple {3176#true} assume !false; {3176#true} is VALID [2022-04-14 18:23:21,239 INFO L290 TraceCheckUtils]: 26: Hoare triple {3176#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {3176#true} is VALID [2022-04-14 18:23:21,241 INFO L290 TraceCheckUtils]: 27: Hoare triple {3176#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {3176#true} is VALID [2022-04-14 18:23:21,241 INFO L290 TraceCheckUtils]: 28: Hoare triple {3176#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {3176#true} is VALID [2022-04-14 18:23:21,241 INFO L290 TraceCheckUtils]: 29: Hoare triple {3176#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {3176#true} is VALID [2022-04-14 18:23:21,242 INFO L290 TraceCheckUtils]: 30: Hoare triple {3176#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {3176#true} is VALID [2022-04-14 18:23:21,242 INFO L290 TraceCheckUtils]: 31: Hoare triple {3176#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {3176#true} is VALID [2022-04-14 18:23:21,242 INFO L290 TraceCheckUtils]: 32: Hoare triple {3176#true} assume 4368 == #t~mem54;havoc #t~mem54; {3176#true} is VALID [2022-04-14 18:23:21,244 INFO L290 TraceCheckUtils]: 33: Hoare triple {3176#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {3176#true} is VALID [2022-04-14 18:23:21,245 INFO L290 TraceCheckUtils]: 34: Hoare triple {3176#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {3176#true} is VALID [2022-04-14 18:23:21,246 INFO L290 TraceCheckUtils]: 35: Hoare triple {3176#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {3181#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-14 18:23:21,246 INFO L290 TraceCheckUtils]: 36: Hoare triple {3181#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {3181#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-14 18:23:21,247 INFO L290 TraceCheckUtils]: 37: Hoare triple {3181#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {3181#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-14 18:23:21,247 INFO L290 TraceCheckUtils]: 38: Hoare triple {3181#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {3181#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-14 18:23:21,248 INFO L290 TraceCheckUtils]: 39: Hoare triple {3181#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {3181#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-14 18:23:21,248 INFO L290 TraceCheckUtils]: 40: Hoare triple {3181#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {3181#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-14 18:23:21,249 INFO L290 TraceCheckUtils]: 41: Hoare triple {3181#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {3182#(= |ssl3_connect_#t~mem49| 4384)} is VALID [2022-04-14 18:23:21,249 INFO L290 TraceCheckUtils]: 42: Hoare triple {3182#(= |ssl3_connect_#t~mem49| 4384)} assume 12292 == #t~mem49;havoc #t~mem49; {3177#false} is VALID [2022-04-14 18:23:21,249 INFO L290 TraceCheckUtils]: 43: Hoare triple {3177#false} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {3177#false} is VALID [2022-04-14 18:23:21,249 INFO L290 TraceCheckUtils]: 44: Hoare triple {3177#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {3177#false} is VALID [2022-04-14 18:23:21,249 INFO L290 TraceCheckUtils]: 45: Hoare triple {3177#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {3177#false} is VALID [2022-04-14 18:23:21,250 INFO L290 TraceCheckUtils]: 46: Hoare triple {3177#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {3177#false} is VALID [2022-04-14 18:23:21,250 INFO L290 TraceCheckUtils]: 47: Hoare triple {3177#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {3177#false} is VALID [2022-04-14 18:23:21,250 INFO L290 TraceCheckUtils]: 48: Hoare triple {3177#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {3177#false} is VALID [2022-04-14 18:23:21,250 INFO L290 TraceCheckUtils]: 49: Hoare triple {3177#false} assume !(0 == ~tmp___4~0); {3177#false} is VALID [2022-04-14 18:23:21,250 INFO L290 TraceCheckUtils]: 50: Hoare triple {3177#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {3177#false} is VALID [2022-04-14 18:23:21,250 INFO L290 TraceCheckUtils]: 51: Hoare triple {3177#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {3177#false} is VALID [2022-04-14 18:23:21,250 INFO L290 TraceCheckUtils]: 52: Hoare triple {3177#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {3177#false} is VALID [2022-04-14 18:23:21,250 INFO L290 TraceCheckUtils]: 53: Hoare triple {3177#false} ~skip~0 := 0; {3177#false} is VALID [2022-04-14 18:23:21,250 INFO L290 TraceCheckUtils]: 54: Hoare triple {3177#false} assume !false; {3177#false} is VALID [2022-04-14 18:23:21,251 INFO L290 TraceCheckUtils]: 55: Hoare triple {3177#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {3177#false} is VALID [2022-04-14 18:23:21,251 INFO L290 TraceCheckUtils]: 56: Hoare triple {3177#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {3177#false} is VALID [2022-04-14 18:23:21,254 INFO L290 TraceCheckUtils]: 57: Hoare triple {3177#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {3177#false} is VALID [2022-04-14 18:23:21,254 INFO L290 TraceCheckUtils]: 58: Hoare triple {3177#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {3177#false} is VALID [2022-04-14 18:23:21,254 INFO L290 TraceCheckUtils]: 59: Hoare triple {3177#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {3177#false} is VALID [2022-04-14 18:23:21,255 INFO L290 TraceCheckUtils]: 60: Hoare triple {3177#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {3177#false} is VALID [2022-04-14 18:23:21,255 INFO L290 TraceCheckUtils]: 61: Hoare triple {3177#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {3177#false} is VALID [2022-04-14 18:23:21,255 INFO L290 TraceCheckUtils]: 62: Hoare triple {3177#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {3177#false} is VALID [2022-04-14 18:23:21,255 INFO L290 TraceCheckUtils]: 63: Hoare triple {3177#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {3177#false} is VALID [2022-04-14 18:23:21,255 INFO L290 TraceCheckUtils]: 64: Hoare triple {3177#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {3177#false} is VALID [2022-04-14 18:23:21,255 INFO L290 TraceCheckUtils]: 65: Hoare triple {3177#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {3177#false} is VALID [2022-04-14 18:23:21,255 INFO L290 TraceCheckUtils]: 66: Hoare triple {3177#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {3177#false} is VALID [2022-04-14 18:23:21,257 INFO L290 TraceCheckUtils]: 67: Hoare triple {3177#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {3177#false} is VALID [2022-04-14 18:23:21,257 INFO L290 TraceCheckUtils]: 68: Hoare triple {3177#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {3177#false} is VALID [2022-04-14 18:23:21,257 INFO L290 TraceCheckUtils]: 69: Hoare triple {3177#false} assume 4432 == #t~mem62;havoc #t~mem62; {3177#false} is VALID [2022-04-14 18:23:21,258 INFO L290 TraceCheckUtils]: 70: Hoare triple {3177#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {3177#false} is VALID [2022-04-14 18:23:21,258 INFO L290 TraceCheckUtils]: 71: Hoare triple {3177#false} assume 4 == ~blastFlag~0; {3177#false} is VALID [2022-04-14 18:23:21,258 INFO L290 TraceCheckUtils]: 72: Hoare triple {3177#false} assume !false; {3177#false} is VALID [2022-04-14 18:23:21,258 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-14 18:23:21,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:23:21,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258113269] [2022-04-14 18:23:21,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258113269] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:23:21,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:23:21,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:23:21,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956110344] [2022-04-14 18:23:21,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:23:21,262 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-04-14 18:23:21,263 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:23:21,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:21,324 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:23:21,324 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:23:21,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:23:21,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:23:21,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:23:21,326 INFO L87 Difference]: Start difference. First operand 239 states and 355 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:23,352 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-14 18:23:24,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:23:24,384 INFO L93 Difference]: Finished difference Result 379 states and 566 transitions. [2022-04-14 18:23:24,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:23:24,385 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-04-14 18:23:24,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:23:24,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:24,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 386 transitions. [2022-04-14 18:23:24,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:24,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 386 transitions. [2022-04-14 18:23:24,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 386 transitions. [2022-04-14 18:23:24,665 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-14 18:23:24,669 INFO L225 Difference]: With dead ends: 379 [2022-04-14 18:23:24,669 INFO L226 Difference]: Without dead ends: 256 [2022-04-14 18:23:24,670 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-14 18:23:24,671 INFO L913 BasicCegarLoop]: 198 mSDtfsCounter, 39 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-14 18:23:24,671 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 484 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 352 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-14 18:23:24,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-04-14 18:23:24,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 239. [2022-04-14 18:23:24,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:23:24,682 INFO L82 GeneralOperation]: Start isEquivalent. First operand 256 states. Second operand has 239 states, 234 states have (on average 1.4957264957264957) internal successors, (350), 234 states have internal predecessors, (350), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:24,682 INFO L74 IsIncluded]: Start isIncluded. First operand 256 states. Second operand has 239 states, 234 states have (on average 1.4957264957264957) internal successors, (350), 234 states have internal predecessors, (350), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:24,683 INFO L87 Difference]: Start difference. First operand 256 states. Second operand has 239 states, 234 states have (on average 1.4957264957264957) internal successors, (350), 234 states have internal predecessors, (350), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:24,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:23:24,688 INFO L93 Difference]: Finished difference Result 256 states and 377 transitions. [2022-04-14 18:23:24,688 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 377 transitions. [2022-04-14 18:23:24,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:23:24,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:23:24,689 INFO L74 IsIncluded]: Start isIncluded. First operand has 239 states, 234 states have (on average 1.4957264957264957) internal successors, (350), 234 states have internal predecessors, (350), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 256 states. [2022-04-14 18:23:24,690 INFO L87 Difference]: Start difference. First operand has 239 states, 234 states have (on average 1.4957264957264957) internal successors, (350), 234 states have internal predecessors, (350), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 256 states. [2022-04-14 18:23:24,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:23:24,696 INFO L93 Difference]: Finished difference Result 256 states and 377 transitions. [2022-04-14 18:23:24,696 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 377 transitions. [2022-04-14 18:23:24,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:23:24,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:23:24,697 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:23:24,697 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:23:24,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 234 states have (on average 1.4957264957264957) internal successors, (350), 234 states have internal predecessors, (350), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:24,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 354 transitions. [2022-04-14 18:23:24,703 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 354 transitions. Word has length 73 [2022-04-14 18:23:24,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:23:24,703 INFO L478 AbstractCegarLoop]: Abstraction has 239 states and 354 transitions. [2022-04-14 18:23:24,703 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:24,703 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 354 transitions. [2022-04-14 18:23:24,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-14 18:23:24,704 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:23:24,704 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:23:24,704 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-14 18:23:24,705 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:23:24,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:23:24,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1970430362, now seen corresponding path program 1 times [2022-04-14 18:23:24,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:23:24,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57028600] [2022-04-14 18:23:24,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:23:24,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:23:24,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:23:24,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:23:24,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:23:24,951 INFO L290 TraceCheckUtils]: 0: Hoare triple {4426#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {4419#true} is VALID [2022-04-14 18:23:24,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {4419#true} assume true; {4419#true} is VALID [2022-04-14 18:23:24,952 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4419#true} {4419#true} #593#return; {4419#true} is VALID [2022-04-14 18:23:24,952 INFO L272 TraceCheckUtils]: 0: Hoare triple {4419#true} call ULTIMATE.init(); {4426#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-14 18:23:24,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {4426#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {4419#true} is VALID [2022-04-14 18:23:24,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {4419#true} assume true; {4419#true} is VALID [2022-04-14 18:23:24,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4419#true} {4419#true} #593#return; {4419#true} is VALID [2022-04-14 18:23:24,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {4419#true} call #t~ret158 := main(); {4419#true} is VALID [2022-04-14 18:23:24,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {4419#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {4419#true} is VALID [2022-04-14 18:23:24,953 INFO L272 TraceCheckUtils]: 6: Hoare triple {4419#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {4419#true} is VALID [2022-04-14 18:23:24,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {4419#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {4419#true} is VALID [2022-04-14 18:23:24,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {4419#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {4419#true} is VALID [2022-04-14 18:23:24,954 INFO L290 TraceCheckUtils]: 9: Hoare triple {4419#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {4419#true} is VALID [2022-04-14 18:23:24,954 INFO L290 TraceCheckUtils]: 10: Hoare triple {4419#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {4419#true} is VALID [2022-04-14 18:23:24,954 INFO L290 TraceCheckUtils]: 11: Hoare triple {4419#true} assume !false; {4419#true} is VALID [2022-04-14 18:23:24,954 INFO L290 TraceCheckUtils]: 12: Hoare triple {4419#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4419#true} is VALID [2022-04-14 18:23:24,954 INFO L290 TraceCheckUtils]: 13: Hoare triple {4419#true} assume 12292 == #t~mem49;havoc #t~mem49; {4419#true} is VALID [2022-04-14 18:23:24,954 INFO L290 TraceCheckUtils]: 14: Hoare triple {4419#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {4419#true} is VALID [2022-04-14 18:23:24,959 INFO L290 TraceCheckUtils]: 15: Hoare triple {4419#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {4419#true} is VALID [2022-04-14 18:23:24,959 INFO L290 TraceCheckUtils]: 16: Hoare triple {4419#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {4419#true} is VALID [2022-04-14 18:23:24,960 INFO L290 TraceCheckUtils]: 17: Hoare triple {4419#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {4419#true} is VALID [2022-04-14 18:23:24,961 INFO L290 TraceCheckUtils]: 18: Hoare triple {4419#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {4419#true} is VALID [2022-04-14 18:23:24,963 INFO L290 TraceCheckUtils]: 19: Hoare triple {4419#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {4419#true} is VALID [2022-04-14 18:23:24,964 INFO L290 TraceCheckUtils]: 20: Hoare triple {4419#true} assume !(0 == ~tmp___4~0); {4419#true} is VALID [2022-04-14 18:23:24,964 INFO L290 TraceCheckUtils]: 21: Hoare triple {4419#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {4419#true} is VALID [2022-04-14 18:23:24,964 INFO L290 TraceCheckUtils]: 22: Hoare triple {4419#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {4419#true} is VALID [2022-04-14 18:23:24,965 INFO L290 TraceCheckUtils]: 23: Hoare triple {4419#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {4419#true} is VALID [2022-04-14 18:23:24,965 INFO L290 TraceCheckUtils]: 24: Hoare triple {4419#true} ~skip~0 := 0; {4419#true} is VALID [2022-04-14 18:23:24,966 INFO L290 TraceCheckUtils]: 25: Hoare triple {4419#true} assume !false; {4419#true} is VALID [2022-04-14 18:23:24,966 INFO L290 TraceCheckUtils]: 26: Hoare triple {4419#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4419#true} is VALID [2022-04-14 18:23:24,966 INFO L290 TraceCheckUtils]: 27: Hoare triple {4419#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4419#true} is VALID [2022-04-14 18:23:24,966 INFO L290 TraceCheckUtils]: 28: Hoare triple {4419#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4419#true} is VALID [2022-04-14 18:23:24,966 INFO L290 TraceCheckUtils]: 29: Hoare triple {4419#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4419#true} is VALID [2022-04-14 18:23:24,967 INFO L290 TraceCheckUtils]: 30: Hoare triple {4419#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4419#true} is VALID [2022-04-14 18:23:24,967 INFO L290 TraceCheckUtils]: 31: Hoare triple {4419#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {4419#true} is VALID [2022-04-14 18:23:24,967 INFO L290 TraceCheckUtils]: 32: Hoare triple {4419#true} assume 4368 == #t~mem54;havoc #t~mem54; {4419#true} is VALID [2022-04-14 18:23:24,967 INFO L290 TraceCheckUtils]: 33: Hoare triple {4419#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {4419#true} is VALID [2022-04-14 18:23:24,967 INFO L290 TraceCheckUtils]: 34: Hoare triple {4419#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {4419#true} is VALID [2022-04-14 18:23:24,969 INFO L290 TraceCheckUtils]: 35: Hoare triple {4419#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {4424#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-14 18:23:24,970 INFO L290 TraceCheckUtils]: 36: Hoare triple {4424#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {4424#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-14 18:23:24,970 INFO L290 TraceCheckUtils]: 37: Hoare triple {4424#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {4424#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-14 18:23:24,971 INFO L290 TraceCheckUtils]: 38: Hoare triple {4424#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {4424#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-14 18:23:24,971 INFO L290 TraceCheckUtils]: 39: Hoare triple {4424#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {4424#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-14 18:23:24,971 INFO L290 TraceCheckUtils]: 40: Hoare triple {4424#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {4424#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-14 18:23:24,972 INFO L290 TraceCheckUtils]: 41: Hoare triple {4424#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4424#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-14 18:23:24,972 INFO L290 TraceCheckUtils]: 42: Hoare triple {4424#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4425#(not (= |ssl3_connect_#t~mem50| 16384))} is VALID [2022-04-14 18:23:24,972 INFO L290 TraceCheckUtils]: 43: Hoare triple {4425#(not (= |ssl3_connect_#t~mem50| 16384))} assume 16384 == #t~mem50;havoc #t~mem50; {4420#false} is VALID [2022-04-14 18:23:24,973 INFO L290 TraceCheckUtils]: 44: Hoare triple {4420#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {4420#false} is VALID [2022-04-14 18:23:24,973 INFO L290 TraceCheckUtils]: 45: Hoare triple {4420#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {4420#false} is VALID [2022-04-14 18:23:24,973 INFO L290 TraceCheckUtils]: 46: Hoare triple {4420#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {4420#false} is VALID [2022-04-14 18:23:24,973 INFO L290 TraceCheckUtils]: 47: Hoare triple {4420#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {4420#false} is VALID [2022-04-14 18:23:24,973 INFO L290 TraceCheckUtils]: 48: Hoare triple {4420#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {4420#false} is VALID [2022-04-14 18:23:24,973 INFO L290 TraceCheckUtils]: 49: Hoare triple {4420#false} assume !(0 == ~tmp___4~0); {4420#false} is VALID [2022-04-14 18:23:24,973 INFO L290 TraceCheckUtils]: 50: Hoare triple {4420#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {4420#false} is VALID [2022-04-14 18:23:24,973 INFO L290 TraceCheckUtils]: 51: Hoare triple {4420#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {4420#false} is VALID [2022-04-14 18:23:24,973 INFO L290 TraceCheckUtils]: 52: Hoare triple {4420#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {4420#false} is VALID [2022-04-14 18:23:24,973 INFO L290 TraceCheckUtils]: 53: Hoare triple {4420#false} ~skip~0 := 0; {4420#false} is VALID [2022-04-14 18:23:24,974 INFO L290 TraceCheckUtils]: 54: Hoare triple {4420#false} assume !false; {4420#false} is VALID [2022-04-14 18:23:24,975 INFO L290 TraceCheckUtils]: 55: Hoare triple {4420#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4420#false} is VALID [2022-04-14 18:23:24,975 INFO L290 TraceCheckUtils]: 56: Hoare triple {4420#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4420#false} is VALID [2022-04-14 18:23:24,975 INFO L290 TraceCheckUtils]: 57: Hoare triple {4420#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4420#false} is VALID [2022-04-14 18:23:24,975 INFO L290 TraceCheckUtils]: 58: Hoare triple {4420#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4420#false} is VALID [2022-04-14 18:23:24,975 INFO L290 TraceCheckUtils]: 59: Hoare triple {4420#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4420#false} is VALID [2022-04-14 18:23:24,975 INFO L290 TraceCheckUtils]: 60: Hoare triple {4420#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {4420#false} is VALID [2022-04-14 18:23:24,975 INFO L290 TraceCheckUtils]: 61: Hoare triple {4420#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {4420#false} is VALID [2022-04-14 18:23:24,975 INFO L290 TraceCheckUtils]: 62: Hoare triple {4420#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {4420#false} is VALID [2022-04-14 18:23:24,976 INFO L290 TraceCheckUtils]: 63: Hoare triple {4420#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {4420#false} is VALID [2022-04-14 18:23:24,976 INFO L290 TraceCheckUtils]: 64: Hoare triple {4420#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {4420#false} is VALID [2022-04-14 18:23:24,976 INFO L290 TraceCheckUtils]: 65: Hoare triple {4420#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {4420#false} is VALID [2022-04-14 18:23:24,976 INFO L290 TraceCheckUtils]: 66: Hoare triple {4420#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {4420#false} is VALID [2022-04-14 18:23:24,976 INFO L290 TraceCheckUtils]: 67: Hoare triple {4420#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {4420#false} is VALID [2022-04-14 18:23:24,976 INFO L290 TraceCheckUtils]: 68: Hoare triple {4420#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {4420#false} is VALID [2022-04-14 18:23:24,976 INFO L290 TraceCheckUtils]: 69: Hoare triple {4420#false} assume 4432 == #t~mem62;havoc #t~mem62; {4420#false} is VALID [2022-04-14 18:23:24,976 INFO L290 TraceCheckUtils]: 70: Hoare triple {4420#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {4420#false} is VALID [2022-04-14 18:23:24,976 INFO L290 TraceCheckUtils]: 71: Hoare triple {4420#false} assume 4 == ~blastFlag~0; {4420#false} is VALID [2022-04-14 18:23:24,976 INFO L290 TraceCheckUtils]: 72: Hoare triple {4420#false} assume !false; {4420#false} is VALID [2022-04-14 18:23:24,978 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-14 18:23:24,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:23:24,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57028600] [2022-04-14 18:23:24,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57028600] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:23:24,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:23:24,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:23:24,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745892684] [2022-04-14 18:23:24,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:23:24,980 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-04-14 18:23:24,981 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:23:24,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:25,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:23:25,044 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:23:25,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:23:25,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:23:25,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:23:25,045 INFO L87 Difference]: Start difference. First operand 239 states and 354 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:27,073 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-14 18:23:28,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:23:28,277 INFO L93 Difference]: Finished difference Result 644 states and 963 transitions. [2022-04-14 18:23:28,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:23:28,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-04-14 18:23:28,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:23:28,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:28,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-14 18:23:28,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:28,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-14 18:23:28,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-14 18:23:28,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 475 edges. 475 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:23:28,654 INFO L225 Difference]: With dead ends: 644 [2022-04-14 18:23:28,655 INFO L226 Difference]: Without dead ends: 421 [2022-04-14 18:23:28,655 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-14 18:23:28,656 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 119 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-14 18:23:28,656 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 278 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 382 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-14 18:23:28,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2022-04-14 18:23:28,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 263. [2022-04-14 18:23:28,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:23:28,669 INFO L82 GeneralOperation]: Start isEquivalent. First operand 421 states. Second operand has 263 states, 258 states have (on average 1.4922480620155039) internal successors, (385), 258 states have internal predecessors, (385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:28,670 INFO L74 IsIncluded]: Start isIncluded. First operand 421 states. Second operand has 263 states, 258 states have (on average 1.4922480620155039) internal successors, (385), 258 states have internal predecessors, (385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:28,670 INFO L87 Difference]: Start difference. First operand 421 states. Second operand has 263 states, 258 states have (on average 1.4922480620155039) internal successors, (385), 258 states have internal predecessors, (385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:28,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:23:28,682 INFO L93 Difference]: Finished difference Result 421 states and 626 transitions. [2022-04-14 18:23:28,682 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 626 transitions. [2022-04-14 18:23:28,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:23:28,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:23:28,684 INFO L74 IsIncluded]: Start isIncluded. First operand has 263 states, 258 states have (on average 1.4922480620155039) internal successors, (385), 258 states have internal predecessors, (385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 421 states. [2022-04-14 18:23:28,684 INFO L87 Difference]: Start difference. First operand has 263 states, 258 states have (on average 1.4922480620155039) internal successors, (385), 258 states have internal predecessors, (385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 421 states. [2022-04-14 18:23:28,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:23:28,696 INFO L93 Difference]: Finished difference Result 421 states and 626 transitions. [2022-04-14 18:23:28,696 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 626 transitions. [2022-04-14 18:23:28,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:23:28,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:23:28,697 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:23:28,697 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:23:28,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 258 states have (on average 1.4922480620155039) internal successors, (385), 258 states have internal predecessors, (385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:28,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 389 transitions. [2022-04-14 18:23:28,704 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 389 transitions. Word has length 73 [2022-04-14 18:23:28,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:23:28,704 INFO L478 AbstractCegarLoop]: Abstraction has 263 states and 389 transitions. [2022-04-14 18:23:28,705 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:28,705 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 389 transitions. [2022-04-14 18:23:28,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-14 18:23:28,705 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:23:28,705 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:23:28,706 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-14 18:23:28,706 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:23:28,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:23:28,706 INFO L85 PathProgramCache]: Analyzing trace with hash -899406007, now seen corresponding path program 1 times [2022-04-14 18:23:28,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:23:28,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436106453] [2022-04-14 18:23:28,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:23:28,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:23:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:23:28,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:23:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:23:28,919 INFO L290 TraceCheckUtils]: 0: Hoare triple {6336#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {6329#true} is VALID [2022-04-14 18:23:28,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {6329#true} assume true; {6329#true} is VALID [2022-04-14 18:23:28,919 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6329#true} {6329#true} #593#return; {6329#true} is VALID [2022-04-14 18:23:28,920 INFO L272 TraceCheckUtils]: 0: Hoare triple {6329#true} call ULTIMATE.init(); {6336#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-14 18:23:28,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {6336#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {6329#true} is VALID [2022-04-14 18:23:28,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {6329#true} assume true; {6329#true} is VALID [2022-04-14 18:23:28,921 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6329#true} {6329#true} #593#return; {6329#true} is VALID [2022-04-14 18:23:28,921 INFO L272 TraceCheckUtils]: 4: Hoare triple {6329#true} call #t~ret158 := main(); {6329#true} is VALID [2022-04-14 18:23:28,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {6329#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {6329#true} is VALID [2022-04-14 18:23:28,921 INFO L272 TraceCheckUtils]: 6: Hoare triple {6329#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {6329#true} is VALID [2022-04-14 18:23:28,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {6329#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {6329#true} is VALID [2022-04-14 18:23:28,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {6329#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {6329#true} is VALID [2022-04-14 18:23:28,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {6329#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {6329#true} is VALID [2022-04-14 18:23:28,922 INFO L290 TraceCheckUtils]: 10: Hoare triple {6329#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {6329#true} is VALID [2022-04-14 18:23:28,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {6329#true} assume !false; {6329#true} is VALID [2022-04-14 18:23:28,923 INFO L290 TraceCheckUtils]: 12: Hoare triple {6329#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {6329#true} is VALID [2022-04-14 18:23:28,923 INFO L290 TraceCheckUtils]: 13: Hoare triple {6329#true} assume 12292 == #t~mem49;havoc #t~mem49; {6329#true} is VALID [2022-04-14 18:23:28,923 INFO L290 TraceCheckUtils]: 14: Hoare triple {6329#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {6329#true} is VALID [2022-04-14 18:23:28,923 INFO L290 TraceCheckUtils]: 15: Hoare triple {6329#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {6329#true} is VALID [2022-04-14 18:23:28,923 INFO L290 TraceCheckUtils]: 16: Hoare triple {6329#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {6329#true} is VALID [2022-04-14 18:23:28,923 INFO L290 TraceCheckUtils]: 17: Hoare triple {6329#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {6329#true} is VALID [2022-04-14 18:23:28,923 INFO L290 TraceCheckUtils]: 18: Hoare triple {6329#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {6329#true} is VALID [2022-04-14 18:23:28,925 INFO L290 TraceCheckUtils]: 19: Hoare triple {6329#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {6329#true} is VALID [2022-04-14 18:23:28,925 INFO L290 TraceCheckUtils]: 20: Hoare triple {6329#true} assume !(0 == ~tmp___4~0); {6329#true} is VALID [2022-04-14 18:23:28,925 INFO L290 TraceCheckUtils]: 21: Hoare triple {6329#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {6329#true} is VALID [2022-04-14 18:23:28,925 INFO L290 TraceCheckUtils]: 22: Hoare triple {6329#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {6329#true} is VALID [2022-04-14 18:23:28,925 INFO L290 TraceCheckUtils]: 23: Hoare triple {6329#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {6329#true} is VALID [2022-04-14 18:23:28,925 INFO L290 TraceCheckUtils]: 24: Hoare triple {6329#true} ~skip~0 := 0; {6329#true} is VALID [2022-04-14 18:23:28,925 INFO L290 TraceCheckUtils]: 25: Hoare triple {6329#true} assume !false; {6329#true} is VALID [2022-04-14 18:23:28,926 INFO L290 TraceCheckUtils]: 26: Hoare triple {6329#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {6329#true} is VALID [2022-04-14 18:23:28,926 INFO L290 TraceCheckUtils]: 27: Hoare triple {6329#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {6329#true} is VALID [2022-04-14 18:23:28,926 INFO L290 TraceCheckUtils]: 28: Hoare triple {6329#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {6329#true} is VALID [2022-04-14 18:23:28,926 INFO L290 TraceCheckUtils]: 29: Hoare triple {6329#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {6329#true} is VALID [2022-04-14 18:23:28,926 INFO L290 TraceCheckUtils]: 30: Hoare triple {6329#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {6329#true} is VALID [2022-04-14 18:23:28,926 INFO L290 TraceCheckUtils]: 31: Hoare triple {6329#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {6329#true} is VALID [2022-04-14 18:23:28,926 INFO L290 TraceCheckUtils]: 32: Hoare triple {6329#true} assume 4368 == #t~mem54;havoc #t~mem54; {6329#true} is VALID [2022-04-14 18:23:28,926 INFO L290 TraceCheckUtils]: 33: Hoare triple {6329#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {6329#true} is VALID [2022-04-14 18:23:28,926 INFO L290 TraceCheckUtils]: 34: Hoare triple {6329#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {6329#true} is VALID [2022-04-14 18:23:28,928 INFO L290 TraceCheckUtils]: 35: Hoare triple {6329#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {6334#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-14 18:23:28,928 INFO L290 TraceCheckUtils]: 36: Hoare triple {6334#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {6334#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-14 18:23:28,929 INFO L290 TraceCheckUtils]: 37: Hoare triple {6334#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {6334#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-14 18:23:28,929 INFO L290 TraceCheckUtils]: 38: Hoare triple {6334#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {6334#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-14 18:23:28,929 INFO L290 TraceCheckUtils]: 39: Hoare triple {6334#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {6334#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-14 18:23:28,930 INFO L290 TraceCheckUtils]: 40: Hoare triple {6334#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {6334#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-14 18:23:28,930 INFO L290 TraceCheckUtils]: 41: Hoare triple {6334#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {6334#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-14 18:23:28,930 INFO L290 TraceCheckUtils]: 42: Hoare triple {6334#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {6334#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-14 18:23:28,931 INFO L290 TraceCheckUtils]: 43: Hoare triple {6334#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {6335#(= |ssl3_connect_#t~mem51| 4384)} is VALID [2022-04-14 18:23:28,931 INFO L290 TraceCheckUtils]: 44: Hoare triple {6335#(= |ssl3_connect_#t~mem51| 4384)} assume 4096 == #t~mem51;havoc #t~mem51; {6330#false} is VALID [2022-04-14 18:23:28,931 INFO L290 TraceCheckUtils]: 45: Hoare triple {6330#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {6330#false} is VALID [2022-04-14 18:23:28,932 INFO L290 TraceCheckUtils]: 46: Hoare triple {6330#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {6330#false} is VALID [2022-04-14 18:23:28,932 INFO L290 TraceCheckUtils]: 47: Hoare triple {6330#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {6330#false} is VALID [2022-04-14 18:23:28,932 INFO L290 TraceCheckUtils]: 48: Hoare triple {6330#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {6330#false} is VALID [2022-04-14 18:23:28,937 INFO L290 TraceCheckUtils]: 49: Hoare triple {6330#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {6330#false} is VALID [2022-04-14 18:23:28,937 INFO L290 TraceCheckUtils]: 50: Hoare triple {6330#false} assume !(0 == ~tmp___4~0); {6330#false} is VALID [2022-04-14 18:23:28,937 INFO L290 TraceCheckUtils]: 51: Hoare triple {6330#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {6330#false} is VALID [2022-04-14 18:23:28,937 INFO L290 TraceCheckUtils]: 52: Hoare triple {6330#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {6330#false} is VALID [2022-04-14 18:23:28,938 INFO L290 TraceCheckUtils]: 53: Hoare triple {6330#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {6330#false} is VALID [2022-04-14 18:23:28,938 INFO L290 TraceCheckUtils]: 54: Hoare triple {6330#false} ~skip~0 := 0; {6330#false} is VALID [2022-04-14 18:23:28,938 INFO L290 TraceCheckUtils]: 55: Hoare triple {6330#false} assume !false; {6330#false} is VALID [2022-04-14 18:23:28,938 INFO L290 TraceCheckUtils]: 56: Hoare triple {6330#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {6330#false} is VALID [2022-04-14 18:23:28,938 INFO L290 TraceCheckUtils]: 57: Hoare triple {6330#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {6330#false} is VALID [2022-04-14 18:23:28,938 INFO L290 TraceCheckUtils]: 58: Hoare triple {6330#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {6330#false} is VALID [2022-04-14 18:23:28,938 INFO L290 TraceCheckUtils]: 59: Hoare triple {6330#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {6330#false} is VALID [2022-04-14 18:23:28,938 INFO L290 TraceCheckUtils]: 60: Hoare triple {6330#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {6330#false} is VALID [2022-04-14 18:23:28,938 INFO L290 TraceCheckUtils]: 61: Hoare triple {6330#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {6330#false} is VALID [2022-04-14 18:23:28,938 INFO L290 TraceCheckUtils]: 62: Hoare triple {6330#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {6330#false} is VALID [2022-04-14 18:23:28,939 INFO L290 TraceCheckUtils]: 63: Hoare triple {6330#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {6330#false} is VALID [2022-04-14 18:23:28,939 INFO L290 TraceCheckUtils]: 64: Hoare triple {6330#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {6330#false} is VALID [2022-04-14 18:23:28,939 INFO L290 TraceCheckUtils]: 65: Hoare triple {6330#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {6330#false} is VALID [2022-04-14 18:23:28,939 INFO L290 TraceCheckUtils]: 66: Hoare triple {6330#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {6330#false} is VALID [2022-04-14 18:23:28,940 INFO L290 TraceCheckUtils]: 67: Hoare triple {6330#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {6330#false} is VALID [2022-04-14 18:23:28,941 INFO L290 TraceCheckUtils]: 68: Hoare triple {6330#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {6330#false} is VALID [2022-04-14 18:23:28,941 INFO L290 TraceCheckUtils]: 69: Hoare triple {6330#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {6330#false} is VALID [2022-04-14 18:23:28,943 INFO L290 TraceCheckUtils]: 70: Hoare triple {6330#false} assume 4432 == #t~mem62;havoc #t~mem62; {6330#false} is VALID [2022-04-14 18:23:28,943 INFO L290 TraceCheckUtils]: 71: Hoare triple {6330#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {6330#false} is VALID [2022-04-14 18:23:28,944 INFO L290 TraceCheckUtils]: 72: Hoare triple {6330#false} assume 4 == ~blastFlag~0; {6330#false} is VALID [2022-04-14 18:23:28,944 INFO L290 TraceCheckUtils]: 73: Hoare triple {6330#false} assume !false; {6330#false} is VALID [2022-04-14 18:23:28,944 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-14 18:23:28,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:23:28,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436106453] [2022-04-14 18:23:28,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436106453] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:23:28,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:23:28,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:23:28,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874645539] [2022-04-14 18:23:28,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:23:28,946 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-04-14 18:23:28,946 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:23:28,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:29,009 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:23:29,010 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:23:29,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:23:29,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:23:29,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:23:29,010 INFO L87 Difference]: Start difference. First operand 263 states and 389 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:31,037 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-14 18:23:32,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:23:32,067 INFO L93 Difference]: Finished difference Result 415 states and 616 transitions. [2022-04-14 18:23:32,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:23:32,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-04-14 18:23:32,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:23:32,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:32,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 384 transitions. [2022-04-14 18:23:32,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:32,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 384 transitions. [2022-04-14 18:23:32,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 384 transitions. [2022-04-14 18:23:32,400 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 384 edges. 384 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:23:32,406 INFO L225 Difference]: With dead ends: 415 [2022-04-14 18:23:32,406 INFO L226 Difference]: Without dead ends: 280 [2022-04-14 18:23:32,407 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-14 18:23:32,409 INFO L913 BasicCegarLoop]: 196 mSDtfsCounter, 35 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-14 18:23:32,409 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 480 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 350 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-14 18:23:32,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-04-14 18:23:32,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 263. [2022-04-14 18:23:32,422 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:23:32,423 INFO L82 GeneralOperation]: Start isEquivalent. First operand 280 states. Second operand has 263 states, 258 states have (on average 1.4883720930232558) internal successors, (384), 258 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:32,424 INFO L74 IsIncluded]: Start isIncluded. First operand 280 states. Second operand has 263 states, 258 states have (on average 1.4883720930232558) internal successors, (384), 258 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:32,424 INFO L87 Difference]: Start difference. First operand 280 states. Second operand has 263 states, 258 states have (on average 1.4883720930232558) internal successors, (384), 258 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:32,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:23:32,431 INFO L93 Difference]: Finished difference Result 280 states and 411 transitions. [2022-04-14 18:23:32,431 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 411 transitions. [2022-04-14 18:23:32,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:23:32,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:23:32,432 INFO L74 IsIncluded]: Start isIncluded. First operand has 263 states, 258 states have (on average 1.4883720930232558) internal successors, (384), 258 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 280 states. [2022-04-14 18:23:32,433 INFO L87 Difference]: Start difference. First operand has 263 states, 258 states have (on average 1.4883720930232558) internal successors, (384), 258 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 280 states. [2022-04-14 18:23:32,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:23:32,439 INFO L93 Difference]: Finished difference Result 280 states and 411 transitions. [2022-04-14 18:23:32,439 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 411 transitions. [2022-04-14 18:23:32,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:23:32,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:23:32,440 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:23:32,440 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:23:32,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 258 states have (on average 1.4883720930232558) internal successors, (384), 258 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:32,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 388 transitions. [2022-04-14 18:23:32,447 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 388 transitions. Word has length 74 [2022-04-14 18:23:32,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:23:32,447 INFO L478 AbstractCegarLoop]: Abstraction has 263 states and 388 transitions. [2022-04-14 18:23:32,447 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:32,447 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 388 transitions. [2022-04-14 18:23:32,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-14 18:23:32,450 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:23:32,450 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:23:32,451 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-14 18:23:32,451 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:23:32,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:23:32,451 INFO L85 PathProgramCache]: Analyzing trace with hash -2000808735, now seen corresponding path program 1 times [2022-04-14 18:23:32,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:23:32,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213132138] [2022-04-14 18:23:32,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:23:32,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:23:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:23:32,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:23:32,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:23:32,748 INFO L290 TraceCheckUtils]: 0: Hoare triple {7692#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {7685#true} is VALID [2022-04-14 18:23:32,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {7685#true} assume true; {7685#true} is VALID [2022-04-14 18:23:32,749 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7685#true} {7685#true} #593#return; {7685#true} is VALID [2022-04-14 18:23:32,752 INFO L272 TraceCheckUtils]: 0: Hoare triple {7685#true} call ULTIMATE.init(); {7692#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-14 18:23:32,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {7692#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {7685#true} is VALID [2022-04-14 18:23:32,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {7685#true} assume true; {7685#true} is VALID [2022-04-14 18:23:32,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7685#true} {7685#true} #593#return; {7685#true} is VALID [2022-04-14 18:23:32,753 INFO L272 TraceCheckUtils]: 4: Hoare triple {7685#true} call #t~ret158 := main(); {7685#true} is VALID [2022-04-14 18:23:32,753 INFO L290 TraceCheckUtils]: 5: Hoare triple {7685#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {7685#true} is VALID [2022-04-14 18:23:32,753 INFO L272 TraceCheckUtils]: 6: Hoare triple {7685#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {7685#true} is VALID [2022-04-14 18:23:32,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {7685#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {7685#true} is VALID [2022-04-14 18:23:32,754 INFO L290 TraceCheckUtils]: 8: Hoare triple {7685#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {7685#true} is VALID [2022-04-14 18:23:32,756 INFO L290 TraceCheckUtils]: 9: Hoare triple {7685#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {7685#true} is VALID [2022-04-14 18:23:32,756 INFO L290 TraceCheckUtils]: 10: Hoare triple {7685#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {7685#true} is VALID [2022-04-14 18:23:32,756 INFO L290 TraceCheckUtils]: 11: Hoare triple {7685#true} assume !false; {7685#true} is VALID [2022-04-14 18:23:32,757 INFO L290 TraceCheckUtils]: 12: Hoare triple {7685#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7685#true} is VALID [2022-04-14 18:23:32,757 INFO L290 TraceCheckUtils]: 13: Hoare triple {7685#true} assume 12292 == #t~mem49;havoc #t~mem49; {7685#true} is VALID [2022-04-14 18:23:32,757 INFO L290 TraceCheckUtils]: 14: Hoare triple {7685#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {7685#true} is VALID [2022-04-14 18:23:32,757 INFO L290 TraceCheckUtils]: 15: Hoare triple {7685#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {7685#true} is VALID [2022-04-14 18:23:32,757 INFO L290 TraceCheckUtils]: 16: Hoare triple {7685#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7685#true} is VALID [2022-04-14 18:23:32,757 INFO L290 TraceCheckUtils]: 17: Hoare triple {7685#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {7685#true} is VALID [2022-04-14 18:23:32,757 INFO L290 TraceCheckUtils]: 18: Hoare triple {7685#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {7685#true} is VALID [2022-04-14 18:23:32,757 INFO L290 TraceCheckUtils]: 19: Hoare triple {7685#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {7685#true} is VALID [2022-04-14 18:23:32,757 INFO L290 TraceCheckUtils]: 20: Hoare triple {7685#true} assume !(0 == ~tmp___4~0); {7685#true} is VALID [2022-04-14 18:23:32,757 INFO L290 TraceCheckUtils]: 21: Hoare triple {7685#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {7685#true} is VALID [2022-04-14 18:23:32,757 INFO L290 TraceCheckUtils]: 22: Hoare triple {7685#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {7685#true} is VALID [2022-04-14 18:23:32,758 INFO L290 TraceCheckUtils]: 23: Hoare triple {7685#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {7685#true} is VALID [2022-04-14 18:23:32,758 INFO L290 TraceCheckUtils]: 24: Hoare triple {7685#true} ~skip~0 := 0; {7685#true} is VALID [2022-04-14 18:23:32,758 INFO L290 TraceCheckUtils]: 25: Hoare triple {7685#true} assume !false; {7685#true} is VALID [2022-04-14 18:23:32,758 INFO L290 TraceCheckUtils]: 26: Hoare triple {7685#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7685#true} is VALID [2022-04-14 18:23:32,758 INFO L290 TraceCheckUtils]: 27: Hoare triple {7685#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7685#true} is VALID [2022-04-14 18:23:32,758 INFO L290 TraceCheckUtils]: 28: Hoare triple {7685#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7685#true} is VALID [2022-04-14 18:23:32,758 INFO L290 TraceCheckUtils]: 29: Hoare triple {7685#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7685#true} is VALID [2022-04-14 18:23:32,758 INFO L290 TraceCheckUtils]: 30: Hoare triple {7685#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7685#true} is VALID [2022-04-14 18:23:32,758 INFO L290 TraceCheckUtils]: 31: Hoare triple {7685#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7685#true} is VALID [2022-04-14 18:23:32,758 INFO L290 TraceCheckUtils]: 32: Hoare triple {7685#true} assume 4368 == #t~mem54;havoc #t~mem54; {7685#true} is VALID [2022-04-14 18:23:32,758 INFO L290 TraceCheckUtils]: 33: Hoare triple {7685#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {7685#true} is VALID [2022-04-14 18:23:32,759 INFO L290 TraceCheckUtils]: 34: Hoare triple {7685#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {7685#true} is VALID [2022-04-14 18:23:32,760 INFO L290 TraceCheckUtils]: 35: Hoare triple {7685#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {7690#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-14 18:23:32,760 INFO L290 TraceCheckUtils]: 36: Hoare triple {7690#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {7690#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-14 18:23:32,761 INFO L290 TraceCheckUtils]: 37: Hoare triple {7690#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {7690#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-14 18:23:32,761 INFO L290 TraceCheckUtils]: 38: Hoare triple {7690#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {7690#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-14 18:23:32,762 INFO L290 TraceCheckUtils]: 39: Hoare triple {7690#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {7690#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-14 18:23:32,762 INFO L290 TraceCheckUtils]: 40: Hoare triple {7690#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {7690#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-14 18:23:32,763 INFO L290 TraceCheckUtils]: 41: Hoare triple {7690#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7690#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-14 18:23:32,764 INFO L290 TraceCheckUtils]: 42: Hoare triple {7690#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7690#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-14 18:23:32,764 INFO L290 TraceCheckUtils]: 43: Hoare triple {7690#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7690#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-14 18:23:32,765 INFO L290 TraceCheckUtils]: 44: Hoare triple {7690#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7691#(= |ssl3_connect_#t~mem52| 4384)} is VALID [2022-04-14 18:23:32,765 INFO L290 TraceCheckUtils]: 45: Hoare triple {7691#(= |ssl3_connect_#t~mem52| 4384)} assume 20480 == #t~mem52;havoc #t~mem52; {7686#false} is VALID [2022-04-14 18:23:32,765 INFO L290 TraceCheckUtils]: 46: Hoare triple {7686#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {7686#false} is VALID [2022-04-14 18:23:32,765 INFO L290 TraceCheckUtils]: 47: Hoare triple {7686#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7686#false} is VALID [2022-04-14 18:23:32,765 INFO L290 TraceCheckUtils]: 48: Hoare triple {7686#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {7686#false} is VALID [2022-04-14 18:23:32,765 INFO L290 TraceCheckUtils]: 49: Hoare triple {7686#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {7686#false} is VALID [2022-04-14 18:23:32,765 INFO L290 TraceCheckUtils]: 50: Hoare triple {7686#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {7686#false} is VALID [2022-04-14 18:23:32,766 INFO L290 TraceCheckUtils]: 51: Hoare triple {7686#false} assume !(0 == ~tmp___4~0); {7686#false} is VALID [2022-04-14 18:23:32,766 INFO L290 TraceCheckUtils]: 52: Hoare triple {7686#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {7686#false} is VALID [2022-04-14 18:23:32,766 INFO L290 TraceCheckUtils]: 53: Hoare triple {7686#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {7686#false} is VALID [2022-04-14 18:23:32,766 INFO L290 TraceCheckUtils]: 54: Hoare triple {7686#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {7686#false} is VALID [2022-04-14 18:23:32,766 INFO L290 TraceCheckUtils]: 55: Hoare triple {7686#false} ~skip~0 := 0; {7686#false} is VALID [2022-04-14 18:23:32,766 INFO L290 TraceCheckUtils]: 56: Hoare triple {7686#false} assume !false; {7686#false} is VALID [2022-04-14 18:23:32,766 INFO L290 TraceCheckUtils]: 57: Hoare triple {7686#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7686#false} is VALID [2022-04-14 18:23:32,766 INFO L290 TraceCheckUtils]: 58: Hoare triple {7686#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7686#false} is VALID [2022-04-14 18:23:32,766 INFO L290 TraceCheckUtils]: 59: Hoare triple {7686#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7686#false} is VALID [2022-04-14 18:23:32,766 INFO L290 TraceCheckUtils]: 60: Hoare triple {7686#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7686#false} is VALID [2022-04-14 18:23:32,766 INFO L290 TraceCheckUtils]: 61: Hoare triple {7686#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7686#false} is VALID [2022-04-14 18:23:32,767 INFO L290 TraceCheckUtils]: 62: Hoare triple {7686#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7686#false} is VALID [2022-04-14 18:23:32,767 INFO L290 TraceCheckUtils]: 63: Hoare triple {7686#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {7686#false} is VALID [2022-04-14 18:23:32,767 INFO L290 TraceCheckUtils]: 64: Hoare triple {7686#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {7686#false} is VALID [2022-04-14 18:23:32,767 INFO L290 TraceCheckUtils]: 65: Hoare triple {7686#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {7686#false} is VALID [2022-04-14 18:23:32,767 INFO L290 TraceCheckUtils]: 66: Hoare triple {7686#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {7686#false} is VALID [2022-04-14 18:23:32,767 INFO L290 TraceCheckUtils]: 67: Hoare triple {7686#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {7686#false} is VALID [2022-04-14 18:23:32,767 INFO L290 TraceCheckUtils]: 68: Hoare triple {7686#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {7686#false} is VALID [2022-04-14 18:23:32,767 INFO L290 TraceCheckUtils]: 69: Hoare triple {7686#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {7686#false} is VALID [2022-04-14 18:23:32,767 INFO L290 TraceCheckUtils]: 70: Hoare triple {7686#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {7686#false} is VALID [2022-04-14 18:23:32,767 INFO L290 TraceCheckUtils]: 71: Hoare triple {7686#false} assume 4432 == #t~mem62;havoc #t~mem62; {7686#false} is VALID [2022-04-14 18:23:32,767 INFO L290 TraceCheckUtils]: 72: Hoare triple {7686#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {7686#false} is VALID [2022-04-14 18:23:32,767 INFO L290 TraceCheckUtils]: 73: Hoare triple {7686#false} assume 4 == ~blastFlag~0; {7686#false} is VALID [2022-04-14 18:23:32,768 INFO L290 TraceCheckUtils]: 74: Hoare triple {7686#false} assume !false; {7686#false} is VALID [2022-04-14 18:23:32,768 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-14 18:23:32,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:23:32,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213132138] [2022-04-14 18:23:32,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213132138] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:23:32,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:23:32,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:23:32,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39565436] [2022-04-14 18:23:32,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:23:32,770 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-14 18:23:32,770 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:23:32,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:32,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:23:32,836 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:23:32,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:23:32,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:23:32,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:23:32,838 INFO L87 Difference]: Start difference. First operand 263 states and 388 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:34,864 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-14 18:23:35,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:23:35,910 INFO L93 Difference]: Finished difference Result 415 states and 614 transitions. [2022-04-14 18:23:35,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:23:35,911 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-14 18:23:35,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:23:35,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:35,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 383 transitions. [2022-04-14 18:23:35,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:35,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 383 transitions. [2022-04-14 18:23:35,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 383 transitions. [2022-04-14 18:23:36,208 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 383 edges. 383 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:23:36,214 INFO L225 Difference]: With dead ends: 415 [2022-04-14 18:23:36,214 INFO L226 Difference]: Without dead ends: 280 [2022-04-14 18:23:36,214 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-14 18:23:36,215 INFO L913 BasicCegarLoop]: 195 mSDtfsCounter, 33 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-14 18:23:36,215 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 478 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 349 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-14 18:23:36,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-04-14 18:23:36,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 263. [2022-04-14 18:23:36,221 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:23:36,222 INFO L82 GeneralOperation]: Start isEquivalent. First operand 280 states. Second operand has 263 states, 258 states have (on average 1.4844961240310077) internal successors, (383), 258 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:36,223 INFO L74 IsIncluded]: Start isIncluded. First operand 280 states. Second operand has 263 states, 258 states have (on average 1.4844961240310077) internal successors, (383), 258 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:36,223 INFO L87 Difference]: Start difference. First operand 280 states. Second operand has 263 states, 258 states have (on average 1.4844961240310077) internal successors, (383), 258 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:36,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:23:36,229 INFO L93 Difference]: Finished difference Result 280 states and 410 transitions. [2022-04-14 18:23:36,229 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 410 transitions. [2022-04-14 18:23:36,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:23:36,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:23:36,231 INFO L74 IsIncluded]: Start isIncluded. First operand has 263 states, 258 states have (on average 1.4844961240310077) internal successors, (383), 258 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 280 states. [2022-04-14 18:23:36,231 INFO L87 Difference]: Start difference. First operand has 263 states, 258 states have (on average 1.4844961240310077) internal successors, (383), 258 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 280 states. [2022-04-14 18:23:36,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:23:36,237 INFO L93 Difference]: Finished difference Result 280 states and 410 transitions. [2022-04-14 18:23:36,238 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 410 transitions. [2022-04-14 18:23:36,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:23:36,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:23:36,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:23:36,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:23:36,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 258 states have (on average 1.4844961240310077) internal successors, (383), 258 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:36,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 387 transitions. [2022-04-14 18:23:36,245 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 387 transitions. Word has length 75 [2022-04-14 18:23:36,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:23:36,245 INFO L478 AbstractCegarLoop]: Abstraction has 263 states and 387 transitions. [2022-04-14 18:23:36,246 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:36,246 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 387 transitions. [2022-04-14 18:23:36,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-14 18:23:36,246 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:23:36,247 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:23:36,247 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-14 18:23:36,247 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:23:36,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:23:36,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1727974300, now seen corresponding path program 1 times [2022-04-14 18:23:36,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:23:36,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255642283] [2022-04-14 18:23:36,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:23:36,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:23:36,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:23:36,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:23:36,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:23:36,453 INFO L290 TraceCheckUtils]: 0: Hoare triple {9048#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {9041#true} is VALID [2022-04-14 18:23:36,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {9041#true} assume true; {9041#true} is VALID [2022-04-14 18:23:36,453 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9041#true} {9041#true} #593#return; {9041#true} is VALID [2022-04-14 18:23:36,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {9041#true} call ULTIMATE.init(); {9048#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-14 18:23:36,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {9048#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {9041#true} is VALID [2022-04-14 18:23:36,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {9041#true} assume true; {9041#true} is VALID [2022-04-14 18:23:36,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9041#true} {9041#true} #593#return; {9041#true} is VALID [2022-04-14 18:23:36,455 INFO L272 TraceCheckUtils]: 4: Hoare triple {9041#true} call #t~ret158 := main(); {9041#true} is VALID [2022-04-14 18:23:36,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {9041#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {9041#true} is VALID [2022-04-14 18:23:36,455 INFO L272 TraceCheckUtils]: 6: Hoare triple {9041#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {9041#true} is VALID [2022-04-14 18:23:36,455 INFO L290 TraceCheckUtils]: 7: Hoare triple {9041#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {9041#true} is VALID [2022-04-14 18:23:36,455 INFO L290 TraceCheckUtils]: 8: Hoare triple {9041#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {9041#true} is VALID [2022-04-14 18:23:36,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {9041#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {9041#true} is VALID [2022-04-14 18:23:36,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {9041#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {9041#true} is VALID [2022-04-14 18:23:36,455 INFO L290 TraceCheckUtils]: 11: Hoare triple {9041#true} assume !false; {9041#true} is VALID [2022-04-14 18:23:36,455 INFO L290 TraceCheckUtils]: 12: Hoare triple {9041#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9041#true} is VALID [2022-04-14 18:23:36,455 INFO L290 TraceCheckUtils]: 13: Hoare triple {9041#true} assume 12292 == #t~mem49;havoc #t~mem49; {9041#true} is VALID [2022-04-14 18:23:36,456 INFO L290 TraceCheckUtils]: 14: Hoare triple {9041#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {9041#true} is VALID [2022-04-14 18:23:36,456 INFO L290 TraceCheckUtils]: 15: Hoare triple {9041#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {9041#true} is VALID [2022-04-14 18:23:36,456 INFO L290 TraceCheckUtils]: 16: Hoare triple {9041#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9041#true} is VALID [2022-04-14 18:23:36,456 INFO L290 TraceCheckUtils]: 17: Hoare triple {9041#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {9041#true} is VALID [2022-04-14 18:23:36,456 INFO L290 TraceCheckUtils]: 18: Hoare triple {9041#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {9041#true} is VALID [2022-04-14 18:23:36,456 INFO L290 TraceCheckUtils]: 19: Hoare triple {9041#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {9041#true} is VALID [2022-04-14 18:23:36,456 INFO L290 TraceCheckUtils]: 20: Hoare triple {9041#true} assume !(0 == ~tmp___4~0); {9041#true} is VALID [2022-04-14 18:23:36,456 INFO L290 TraceCheckUtils]: 21: Hoare triple {9041#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {9041#true} is VALID [2022-04-14 18:23:36,456 INFO L290 TraceCheckUtils]: 22: Hoare triple {9041#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {9041#true} is VALID [2022-04-14 18:23:36,456 INFO L290 TraceCheckUtils]: 23: Hoare triple {9041#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {9041#true} is VALID [2022-04-14 18:23:36,456 INFO L290 TraceCheckUtils]: 24: Hoare triple {9041#true} ~skip~0 := 0; {9041#true} is VALID [2022-04-14 18:23:36,456 INFO L290 TraceCheckUtils]: 25: Hoare triple {9041#true} assume !false; {9041#true} is VALID [2022-04-14 18:23:36,456 INFO L290 TraceCheckUtils]: 26: Hoare triple {9041#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9041#true} is VALID [2022-04-14 18:23:36,457 INFO L290 TraceCheckUtils]: 27: Hoare triple {9041#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9041#true} is VALID [2022-04-14 18:23:36,457 INFO L290 TraceCheckUtils]: 28: Hoare triple {9041#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9041#true} is VALID [2022-04-14 18:23:36,457 INFO L290 TraceCheckUtils]: 29: Hoare triple {9041#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9041#true} is VALID [2022-04-14 18:23:36,457 INFO L290 TraceCheckUtils]: 30: Hoare triple {9041#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9041#true} is VALID [2022-04-14 18:23:36,457 INFO L290 TraceCheckUtils]: 31: Hoare triple {9041#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9041#true} is VALID [2022-04-14 18:23:36,457 INFO L290 TraceCheckUtils]: 32: Hoare triple {9041#true} assume 4368 == #t~mem54;havoc #t~mem54; {9041#true} is VALID [2022-04-14 18:23:36,457 INFO L290 TraceCheckUtils]: 33: Hoare triple {9041#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {9041#true} is VALID [2022-04-14 18:23:36,457 INFO L290 TraceCheckUtils]: 34: Hoare triple {9041#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {9041#true} is VALID [2022-04-14 18:23:36,458 INFO L290 TraceCheckUtils]: 35: Hoare triple {9041#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {9046#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-14 18:23:36,459 INFO L290 TraceCheckUtils]: 36: Hoare triple {9046#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {9046#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-14 18:23:36,459 INFO L290 TraceCheckUtils]: 37: Hoare triple {9046#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {9046#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-14 18:23:36,459 INFO L290 TraceCheckUtils]: 38: Hoare triple {9046#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {9046#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-14 18:23:36,460 INFO L290 TraceCheckUtils]: 39: Hoare triple {9046#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {9046#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-14 18:23:36,460 INFO L290 TraceCheckUtils]: 40: Hoare triple {9046#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {9046#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-14 18:23:36,460 INFO L290 TraceCheckUtils]: 41: Hoare triple {9046#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9046#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-14 18:23:36,461 INFO L290 TraceCheckUtils]: 42: Hoare triple {9046#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9046#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-14 18:23:36,461 INFO L290 TraceCheckUtils]: 43: Hoare triple {9046#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9046#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-14 18:23:36,461 INFO L290 TraceCheckUtils]: 44: Hoare triple {9046#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9046#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-14 18:23:36,462 INFO L290 TraceCheckUtils]: 45: Hoare triple {9046#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9047#(not (= |ssl3_connect_#t~mem53| 4099))} is VALID [2022-04-14 18:23:36,462 INFO L290 TraceCheckUtils]: 46: Hoare triple {9047#(not (= |ssl3_connect_#t~mem53| 4099))} assume 4099 == #t~mem53;havoc #t~mem53; {9042#false} is VALID [2022-04-14 18:23:36,462 INFO L290 TraceCheckUtils]: 47: Hoare triple {9042#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {9042#false} is VALID [2022-04-14 18:23:36,462 INFO L290 TraceCheckUtils]: 48: Hoare triple {9042#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9042#false} is VALID [2022-04-14 18:23:36,462 INFO L290 TraceCheckUtils]: 49: Hoare triple {9042#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {9042#false} is VALID [2022-04-14 18:23:36,462 INFO L290 TraceCheckUtils]: 50: Hoare triple {9042#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {9042#false} is VALID [2022-04-14 18:23:36,462 INFO L290 TraceCheckUtils]: 51: Hoare triple {9042#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {9042#false} is VALID [2022-04-14 18:23:36,462 INFO L290 TraceCheckUtils]: 52: Hoare triple {9042#false} assume !(0 == ~tmp___4~0); {9042#false} is VALID [2022-04-14 18:23:36,463 INFO L290 TraceCheckUtils]: 53: Hoare triple {9042#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {9042#false} is VALID [2022-04-14 18:23:36,463 INFO L290 TraceCheckUtils]: 54: Hoare triple {9042#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {9042#false} is VALID [2022-04-14 18:23:36,463 INFO L290 TraceCheckUtils]: 55: Hoare triple {9042#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {9042#false} is VALID [2022-04-14 18:23:36,463 INFO L290 TraceCheckUtils]: 56: Hoare triple {9042#false} ~skip~0 := 0; {9042#false} is VALID [2022-04-14 18:23:36,463 INFO L290 TraceCheckUtils]: 57: Hoare triple {9042#false} assume !false; {9042#false} is VALID [2022-04-14 18:23:36,463 INFO L290 TraceCheckUtils]: 58: Hoare triple {9042#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9042#false} is VALID [2022-04-14 18:23:36,463 INFO L290 TraceCheckUtils]: 59: Hoare triple {9042#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9042#false} is VALID [2022-04-14 18:23:36,463 INFO L290 TraceCheckUtils]: 60: Hoare triple {9042#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9042#false} is VALID [2022-04-14 18:23:36,463 INFO L290 TraceCheckUtils]: 61: Hoare triple {9042#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9042#false} is VALID [2022-04-14 18:23:36,463 INFO L290 TraceCheckUtils]: 62: Hoare triple {9042#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9042#false} is VALID [2022-04-14 18:23:36,463 INFO L290 TraceCheckUtils]: 63: Hoare triple {9042#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9042#false} is VALID [2022-04-14 18:23:36,463 INFO L290 TraceCheckUtils]: 64: Hoare triple {9042#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {9042#false} is VALID [2022-04-14 18:23:36,464 INFO L290 TraceCheckUtils]: 65: Hoare triple {9042#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {9042#false} is VALID [2022-04-14 18:23:36,464 INFO L290 TraceCheckUtils]: 66: Hoare triple {9042#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {9042#false} is VALID [2022-04-14 18:23:36,464 INFO L290 TraceCheckUtils]: 67: Hoare triple {9042#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {9042#false} is VALID [2022-04-14 18:23:36,464 INFO L290 TraceCheckUtils]: 68: Hoare triple {9042#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {9042#false} is VALID [2022-04-14 18:23:36,464 INFO L290 TraceCheckUtils]: 69: Hoare triple {9042#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {9042#false} is VALID [2022-04-14 18:23:36,464 INFO L290 TraceCheckUtils]: 70: Hoare triple {9042#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {9042#false} is VALID [2022-04-14 18:23:36,464 INFO L290 TraceCheckUtils]: 71: Hoare triple {9042#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {9042#false} is VALID [2022-04-14 18:23:36,464 INFO L290 TraceCheckUtils]: 72: Hoare triple {9042#false} assume 4432 == #t~mem62;havoc #t~mem62; {9042#false} is VALID [2022-04-14 18:23:36,464 INFO L290 TraceCheckUtils]: 73: Hoare triple {9042#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {9042#false} is VALID [2022-04-14 18:23:36,464 INFO L290 TraceCheckUtils]: 74: Hoare triple {9042#false} assume 4 == ~blastFlag~0; {9042#false} is VALID [2022-04-14 18:23:36,464 INFO L290 TraceCheckUtils]: 75: Hoare triple {9042#false} assume !false; {9042#false} is VALID [2022-04-14 18:23:36,465 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-14 18:23:36,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:23:36,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255642283] [2022-04-14 18:23:36,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255642283] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:23:36,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:23:36,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:23:36,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777146197] [2022-04-14 18:23:36,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:23:36,466 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2022-04-14 18:23:36,466 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:23:36,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:36,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:23:36,531 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:23:36,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:23:36,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:23:36,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:23:36,532 INFO L87 Difference]: Start difference. First operand 263 states and 387 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:38,558 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-14 18:23:39,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:23:39,566 INFO L93 Difference]: Finished difference Result 668 states and 991 transitions. [2022-04-14 18:23:39,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:23:39,567 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2022-04-14 18:23:39,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:23:39,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:39,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-14 18:23:39,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:39,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-14 18:23:39,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 474 transitions. [2022-04-14 18:23:39,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 474 edges. 474 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:23:39,920 INFO L225 Difference]: With dead ends: 668 [2022-04-14 18:23:39,920 INFO L226 Difference]: Without dead ends: 421 [2022-04-14 18:23:39,920 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-14 18:23:39,921 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 115 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-14 18:23:39,921 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 278 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 382 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-14 18:23:39,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2022-04-14 18:23:39,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 269. [2022-04-14 18:23:39,928 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:23:39,928 INFO L82 GeneralOperation]: Start isEquivalent. First operand 421 states. Second operand has 269 states, 264 states have (on average 1.4848484848484849) internal successors, (392), 264 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:39,929 INFO L74 IsIncluded]: Start isIncluded. First operand 421 states. Second operand has 269 states, 264 states have (on average 1.4848484848484849) internal successors, (392), 264 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:39,930 INFO L87 Difference]: Start difference. First operand 421 states. Second operand has 269 states, 264 states have (on average 1.4848484848484849) internal successors, (392), 264 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:39,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:23:39,940 INFO L93 Difference]: Finished difference Result 421 states and 621 transitions. [2022-04-14 18:23:39,940 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 621 transitions. [2022-04-14 18:23:39,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:23:39,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:23:39,942 INFO L74 IsIncluded]: Start isIncluded. First operand has 269 states, 264 states have (on average 1.4848484848484849) internal successors, (392), 264 states have internal predecessors, (392), 3 states have call successors, (3), 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 421 states. [2022-04-14 18:23:39,942 INFO L87 Difference]: Start difference. First operand has 269 states, 264 states have (on average 1.4848484848484849) internal successors, (392), 264 states have internal predecessors, (392), 3 states have call successors, (3), 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 421 states. [2022-04-14 18:23:39,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:23:39,953 INFO L93 Difference]: Finished difference Result 421 states and 621 transitions. [2022-04-14 18:23:39,953 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 621 transitions. [2022-04-14 18:23:39,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:23:39,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:23:39,954 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:23:39,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:23:39,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 264 states have (on average 1.4848484848484849) internal successors, (392), 264 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:39,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 396 transitions. [2022-04-14 18:23:39,959 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 396 transitions. Word has length 76 [2022-04-14 18:23:39,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:23:39,960 INFO L478 AbstractCegarLoop]: Abstraction has 269 states and 396 transitions. [2022-04-14 18:23:39,960 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:39,960 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 396 transitions. [2022-04-14 18:23:39,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-14 18:23:39,961 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:23:39,961 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:23:39,961 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-14 18:23:39,961 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:23:39,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:23:39,961 INFO L85 PathProgramCache]: Analyzing trace with hash -988156823, now seen corresponding path program 1 times [2022-04-14 18:23:39,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:23:39,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734227825] [2022-04-14 18:23:39,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:23:39,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:23:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:23:40,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:23:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:23:40,148 INFO L290 TraceCheckUtils]: 0: Hoare triple {10989#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {10983#true} is VALID [2022-04-14 18:23:40,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {10983#true} assume true; {10983#true} is VALID [2022-04-14 18:23:40,148 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10983#true} {10983#true} #593#return; {10983#true} is VALID [2022-04-14 18:23:40,149 INFO L272 TraceCheckUtils]: 0: Hoare triple {10983#true} call ULTIMATE.init(); {10989#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-14 18:23:40,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {10989#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {10983#true} is VALID [2022-04-14 18:23:40,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {10983#true} assume true; {10983#true} is VALID [2022-04-14 18:23:40,150 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10983#true} {10983#true} #593#return; {10983#true} is VALID [2022-04-14 18:23:40,150 INFO L272 TraceCheckUtils]: 4: Hoare triple {10983#true} call #t~ret158 := main(); {10983#true} is VALID [2022-04-14 18:23:40,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {10983#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {10983#true} is VALID [2022-04-14 18:23:40,150 INFO L272 TraceCheckUtils]: 6: Hoare triple {10983#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {10983#true} is VALID [2022-04-14 18:23:40,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {10983#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {10983#true} is VALID [2022-04-14 18:23:40,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {10983#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {10983#true} is VALID [2022-04-14 18:23:40,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {10983#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {10983#true} is VALID [2022-04-14 18:23:40,151 INFO L290 TraceCheckUtils]: 10: Hoare triple {10983#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {10983#true} is VALID [2022-04-14 18:23:40,151 INFO L290 TraceCheckUtils]: 11: Hoare triple {10983#true} assume !false; {10983#true} is VALID [2022-04-14 18:23:40,151 INFO L290 TraceCheckUtils]: 12: Hoare triple {10983#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {10983#true} is VALID [2022-04-14 18:23:40,151 INFO L290 TraceCheckUtils]: 13: Hoare triple {10983#true} assume 12292 == #t~mem49;havoc #t~mem49; {10983#true} is VALID [2022-04-14 18:23:40,151 INFO L290 TraceCheckUtils]: 14: Hoare triple {10983#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {10983#true} is VALID [2022-04-14 18:23:40,151 INFO L290 TraceCheckUtils]: 15: Hoare triple {10983#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {10983#true} is VALID [2022-04-14 18:23:40,151 INFO L290 TraceCheckUtils]: 16: Hoare triple {10983#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {10983#true} is VALID [2022-04-14 18:23:40,151 INFO L290 TraceCheckUtils]: 17: Hoare triple {10983#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {10983#true} is VALID [2022-04-14 18:23:40,151 INFO L290 TraceCheckUtils]: 18: Hoare triple {10983#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {10983#true} is VALID [2022-04-14 18:23:40,151 INFO L290 TraceCheckUtils]: 19: Hoare triple {10983#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {10983#true} is VALID [2022-04-14 18:23:40,151 INFO L290 TraceCheckUtils]: 20: Hoare triple {10983#true} assume !(0 == ~tmp___4~0); {10983#true} is VALID [2022-04-14 18:23:40,151 INFO L290 TraceCheckUtils]: 21: Hoare triple {10983#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {10983#true} is VALID [2022-04-14 18:23:40,152 INFO L290 TraceCheckUtils]: 22: Hoare triple {10983#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {10983#true} is VALID [2022-04-14 18:23:40,152 INFO L290 TraceCheckUtils]: 23: Hoare triple {10983#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {10983#true} is VALID [2022-04-14 18:23:40,152 INFO L290 TraceCheckUtils]: 24: Hoare triple {10983#true} ~skip~0 := 0; {10983#true} is VALID [2022-04-14 18:23:40,152 INFO L290 TraceCheckUtils]: 25: Hoare triple {10983#true} assume !false; {10983#true} is VALID [2022-04-14 18:23:40,152 INFO L290 TraceCheckUtils]: 26: Hoare triple {10983#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {10983#true} is VALID [2022-04-14 18:23:40,152 INFO L290 TraceCheckUtils]: 27: Hoare triple {10983#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {10983#true} is VALID [2022-04-14 18:23:40,152 INFO L290 TraceCheckUtils]: 28: Hoare triple {10983#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {10983#true} is VALID [2022-04-14 18:23:40,152 INFO L290 TraceCheckUtils]: 29: Hoare triple {10983#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {10983#true} is VALID [2022-04-14 18:23:40,152 INFO L290 TraceCheckUtils]: 30: Hoare triple {10983#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {10983#true} is VALID [2022-04-14 18:23:40,152 INFO L290 TraceCheckUtils]: 31: Hoare triple {10983#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {10983#true} is VALID [2022-04-14 18:23:40,152 INFO L290 TraceCheckUtils]: 32: Hoare triple {10983#true} assume 4368 == #t~mem54;havoc #t~mem54; {10983#true} is VALID [2022-04-14 18:23:40,152 INFO L290 TraceCheckUtils]: 33: Hoare triple {10983#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {10983#true} is VALID [2022-04-14 18:23:40,153 INFO L290 TraceCheckUtils]: 34: Hoare triple {10983#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {10983#true} is VALID [2022-04-14 18:23:40,153 INFO L290 TraceCheckUtils]: 35: Hoare triple {10983#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {10983#true} is VALID [2022-04-14 18:23:40,153 INFO L290 TraceCheckUtils]: 36: Hoare triple {10983#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {10983#true} is VALID [2022-04-14 18:23:40,153 INFO L290 TraceCheckUtils]: 37: Hoare triple {10983#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {10983#true} is VALID [2022-04-14 18:23:40,153 INFO L290 TraceCheckUtils]: 38: Hoare triple {10983#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {10983#true} is VALID [2022-04-14 18:23:40,153 INFO L290 TraceCheckUtils]: 39: Hoare triple {10983#true} ~skip~0 := 0; {10983#true} is VALID [2022-04-14 18:23:40,153 INFO L290 TraceCheckUtils]: 40: Hoare triple {10983#true} assume !false; {10983#true} is VALID [2022-04-14 18:23:40,153 INFO L290 TraceCheckUtils]: 41: Hoare triple {10983#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {10983#true} is VALID [2022-04-14 18:23:40,153 INFO L290 TraceCheckUtils]: 42: Hoare triple {10983#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {10983#true} is VALID [2022-04-14 18:23:40,153 INFO L290 TraceCheckUtils]: 43: Hoare triple {10983#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {10983#true} is VALID [2022-04-14 18:23:40,153 INFO L290 TraceCheckUtils]: 44: Hoare triple {10983#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {10983#true} is VALID [2022-04-14 18:23:40,153 INFO L290 TraceCheckUtils]: 45: Hoare triple {10983#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {10983#true} is VALID [2022-04-14 18:23:40,154 INFO L290 TraceCheckUtils]: 46: Hoare triple {10983#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {10983#true} is VALID [2022-04-14 18:23:40,154 INFO L290 TraceCheckUtils]: 47: Hoare triple {10983#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {10983#true} is VALID [2022-04-14 18:23:40,154 INFO L290 TraceCheckUtils]: 48: Hoare triple {10983#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {10983#true} is VALID [2022-04-14 18:23:40,154 INFO L290 TraceCheckUtils]: 49: Hoare triple {10983#true} assume 4384 == #t~mem56;havoc #t~mem56; {10983#true} is VALID [2022-04-14 18:23:40,154 INFO L290 TraceCheckUtils]: 50: Hoare triple {10983#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {10983#true} is VALID [2022-04-14 18:23:40,154 INFO L290 TraceCheckUtils]: 51: Hoare triple {10983#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {10988#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-14 18:23:40,155 INFO L290 TraceCheckUtils]: 52: Hoare triple {10988#(= 2 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {10988#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-14 18:23:40,155 INFO L290 TraceCheckUtils]: 53: Hoare triple {10988#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {10988#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-14 18:23:40,155 INFO L290 TraceCheckUtils]: 54: Hoare triple {10988#(= 2 ssl3_connect_~blastFlag~0)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {10988#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-14 18:23:40,155 INFO L290 TraceCheckUtils]: 55: Hoare triple {10988#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {10988#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-14 18:23:40,156 INFO L290 TraceCheckUtils]: 56: Hoare triple {10988#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {10988#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-14 18:23:40,156 INFO L290 TraceCheckUtils]: 57: Hoare triple {10988#(= 2 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {10988#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-14 18:23:40,156 INFO L290 TraceCheckUtils]: 58: Hoare triple {10988#(= 2 ssl3_connect_~blastFlag~0)} assume !false; {10988#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-14 18:23:40,157 INFO L290 TraceCheckUtils]: 59: Hoare triple {10988#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {10988#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-14 18:23:40,157 INFO L290 TraceCheckUtils]: 60: Hoare triple {10988#(= 2 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {10988#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-14 18:23:40,157 INFO L290 TraceCheckUtils]: 61: Hoare triple {10988#(= 2 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {10988#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-14 18:23:40,157 INFO L290 TraceCheckUtils]: 62: Hoare triple {10988#(= 2 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {10988#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-14 18:23:40,158 INFO L290 TraceCheckUtils]: 63: Hoare triple {10988#(= 2 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {10988#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-14 18:23:40,158 INFO L290 TraceCheckUtils]: 64: Hoare triple {10988#(= 2 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {10988#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-14 18:23:40,158 INFO L290 TraceCheckUtils]: 65: Hoare triple {10988#(= 2 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {10988#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-14 18:23:40,158 INFO L290 TraceCheckUtils]: 66: Hoare triple {10988#(= 2 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {10988#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-14 18:23:40,159 INFO L290 TraceCheckUtils]: 67: Hoare triple {10988#(= 2 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {10988#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-14 18:23:40,159 INFO L290 TraceCheckUtils]: 68: Hoare triple {10988#(= 2 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {10988#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-14 18:23:40,159 INFO L290 TraceCheckUtils]: 69: Hoare triple {10988#(= 2 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {10988#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-14 18:23:40,160 INFO L290 TraceCheckUtils]: 70: Hoare triple {10988#(= 2 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {10988#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-14 18:23:40,160 INFO L290 TraceCheckUtils]: 71: Hoare triple {10988#(= 2 ssl3_connect_~blastFlag~0)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {10988#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-14 18:23:40,160 INFO L290 TraceCheckUtils]: 72: Hoare triple {10988#(= 2 ssl3_connect_~blastFlag~0)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {10988#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-14 18:23:40,160 INFO L290 TraceCheckUtils]: 73: Hoare triple {10988#(= 2 ssl3_connect_~blastFlag~0)} assume 4432 == #t~mem62;havoc #t~mem62; {10988#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-14 18:23:40,161 INFO L290 TraceCheckUtils]: 74: Hoare triple {10988#(= 2 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {10988#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-14 18:23:40,161 INFO L290 TraceCheckUtils]: 75: Hoare triple {10988#(= 2 ssl3_connect_~blastFlag~0)} assume 4 == ~blastFlag~0; {10984#false} is VALID [2022-04-14 18:23:40,161 INFO L290 TraceCheckUtils]: 76: Hoare triple {10984#false} assume !false; {10984#false} is VALID [2022-04-14 18:23:40,161 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-14 18:23:40,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:23:40,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734227825] [2022-04-14 18:23:40,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734227825] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:23:40,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:23:40,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 18:23:40,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718156365] [2022-04-14 18:23:40,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:23:40,163 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-14 18:23:40,163 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:23:40,163 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:40,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:23:40,219 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 18:23:40,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:23:40,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 18:23:40,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 18:23:40,220 INFO L87 Difference]: Start difference. First operand 269 states and 396 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:42,258 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-14 18:23:43,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:23:43,338 INFO L93 Difference]: Finished difference Result 542 states and 806 transitions. [2022-04-14 18:23:43,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 18:23:43,338 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-14 18:23:43,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:23:43,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:43,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2022-04-14 18:23:43,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:43,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2022-04-14 18:23:43,344 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 489 transitions. [2022-04-14 18:23:43,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 489 edges. 489 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:23:43,738 INFO L225 Difference]: With dead ends: 542 [2022-04-14 18:23:43,739 INFO L226 Difference]: Without dead ends: 404 [2022-04-14 18:23:43,739 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-14 18:23:43,741 INFO L913 BasicCegarLoop]: 315 mSDtfsCounter, 126 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-14 18:23:43,741 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 477 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 339 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-14 18:23:43,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2022-04-14 18:23:43,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2022-04-14 18:23:43,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:23:43,760 INFO L82 GeneralOperation]: Start isEquivalent. First operand 404 states. Second operand has 404 states, 399 states have (on average 1.4786967418546366) internal successors, (590), 399 states have internal predecessors, (590), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:43,776 INFO L74 IsIncluded]: Start isIncluded. First operand 404 states. Second operand has 404 states, 399 states have (on average 1.4786967418546366) internal successors, (590), 399 states have internal predecessors, (590), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:43,778 INFO L87 Difference]: Start difference. First operand 404 states. Second operand has 404 states, 399 states have (on average 1.4786967418546366) internal successors, (590), 399 states have internal predecessors, (590), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:43,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:23:43,787 INFO L93 Difference]: Finished difference Result 404 states and 594 transitions. [2022-04-14 18:23:43,788 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 594 transitions. [2022-04-14 18:23:43,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:23:43,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:23:43,789 INFO L74 IsIncluded]: Start isIncluded. First operand has 404 states, 399 states have (on average 1.4786967418546366) internal successors, (590), 399 states have internal predecessors, (590), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 404 states. [2022-04-14 18:23:43,790 INFO L87 Difference]: Start difference. First operand has 404 states, 399 states have (on average 1.4786967418546366) internal successors, (590), 399 states have internal predecessors, (590), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 404 states. [2022-04-14 18:23:43,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:23:43,799 INFO L93 Difference]: Finished difference Result 404 states and 594 transitions. [2022-04-14 18:23:43,799 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 594 transitions. [2022-04-14 18:23:43,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:23:43,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:23:43,800 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:23:43,800 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:23:43,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 399 states have (on average 1.4786967418546366) internal successors, (590), 399 states have internal predecessors, (590), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:43,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 594 transitions. [2022-04-14 18:23:43,811 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 594 transitions. Word has length 77 [2022-04-14 18:23:43,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:23:43,811 INFO L478 AbstractCegarLoop]: Abstraction has 404 states and 594 transitions. [2022-04-14 18:23:43,811 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:43,812 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 594 transitions. [2022-04-14 18:23:43,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-14 18:23:43,812 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:23:43,812 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:23:43,813 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-14 18:23:43,813 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:23:43,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:23:43,814 INFO L85 PathProgramCache]: Analyzing trace with hash -926117209, now seen corresponding path program 1 times [2022-04-14 18:23:43,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:23:43,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917583602] [2022-04-14 18:23:43,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:23:43,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:23:43,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:23:43,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:23:43,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:23:43,979 INFO L290 TraceCheckUtils]: 0: Hoare triple {12891#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {12885#true} is VALID [2022-04-14 18:23:43,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {12885#true} assume true; {12885#true} is VALID [2022-04-14 18:23:43,980 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12885#true} {12885#true} #593#return; {12885#true} is VALID [2022-04-14 18:23:43,980 INFO L272 TraceCheckUtils]: 0: Hoare triple {12885#true} call ULTIMATE.init(); {12891#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-14 18:23:43,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {12891#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {12885#true} is VALID [2022-04-14 18:23:43,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {12885#true} assume true; {12885#true} is VALID [2022-04-14 18:23:43,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12885#true} {12885#true} #593#return; {12885#true} is VALID [2022-04-14 18:23:43,981 INFO L272 TraceCheckUtils]: 4: Hoare triple {12885#true} call #t~ret158 := main(); {12885#true} is VALID [2022-04-14 18:23:43,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {12885#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {12885#true} is VALID [2022-04-14 18:23:43,981 INFO L272 TraceCheckUtils]: 6: Hoare triple {12885#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {12885#true} is VALID [2022-04-14 18:23:43,981 INFO L290 TraceCheckUtils]: 7: Hoare triple {12885#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {12885#true} is VALID [2022-04-14 18:23:43,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {12885#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {12885#true} is VALID [2022-04-14 18:23:43,981 INFO L290 TraceCheckUtils]: 9: Hoare triple {12885#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {12885#true} is VALID [2022-04-14 18:23:43,981 INFO L290 TraceCheckUtils]: 10: Hoare triple {12885#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {12885#true} is VALID [2022-04-14 18:23:43,982 INFO L290 TraceCheckUtils]: 11: Hoare triple {12885#true} assume !false; {12885#true} is VALID [2022-04-14 18:23:43,982 INFO L290 TraceCheckUtils]: 12: Hoare triple {12885#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12885#true} is VALID [2022-04-14 18:23:43,982 INFO L290 TraceCheckUtils]: 13: Hoare triple {12885#true} assume 12292 == #t~mem49;havoc #t~mem49; {12885#true} is VALID [2022-04-14 18:23:43,982 INFO L290 TraceCheckUtils]: 14: Hoare triple {12885#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {12885#true} is VALID [2022-04-14 18:23:43,982 INFO L290 TraceCheckUtils]: 15: Hoare triple {12885#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {12885#true} is VALID [2022-04-14 18:23:43,982 INFO L290 TraceCheckUtils]: 16: Hoare triple {12885#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {12885#true} is VALID [2022-04-14 18:23:43,982 INFO L290 TraceCheckUtils]: 17: Hoare triple {12885#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {12885#true} is VALID [2022-04-14 18:23:43,982 INFO L290 TraceCheckUtils]: 18: Hoare triple {12885#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {12885#true} is VALID [2022-04-14 18:23:43,982 INFO L290 TraceCheckUtils]: 19: Hoare triple {12885#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {12885#true} is VALID [2022-04-14 18:23:43,982 INFO L290 TraceCheckUtils]: 20: Hoare triple {12885#true} assume !(0 == ~tmp___4~0); {12885#true} is VALID [2022-04-14 18:23:43,982 INFO L290 TraceCheckUtils]: 21: Hoare triple {12885#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {12885#true} is VALID [2022-04-14 18:23:43,983 INFO L290 TraceCheckUtils]: 22: Hoare triple {12885#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {12885#true} is VALID [2022-04-14 18:23:43,983 INFO L290 TraceCheckUtils]: 23: Hoare triple {12885#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {12885#true} is VALID [2022-04-14 18:23:43,983 INFO L290 TraceCheckUtils]: 24: Hoare triple {12885#true} ~skip~0 := 0; {12885#true} is VALID [2022-04-14 18:23:43,983 INFO L290 TraceCheckUtils]: 25: Hoare triple {12885#true} assume !false; {12885#true} is VALID [2022-04-14 18:23:43,983 INFO L290 TraceCheckUtils]: 26: Hoare triple {12885#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12885#true} is VALID [2022-04-14 18:23:43,983 INFO L290 TraceCheckUtils]: 27: Hoare triple {12885#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12885#true} is VALID [2022-04-14 18:23:43,983 INFO L290 TraceCheckUtils]: 28: Hoare triple {12885#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12885#true} is VALID [2022-04-14 18:23:43,983 INFO L290 TraceCheckUtils]: 29: Hoare triple {12885#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12885#true} is VALID [2022-04-14 18:23:43,983 INFO L290 TraceCheckUtils]: 30: Hoare triple {12885#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12885#true} is VALID [2022-04-14 18:23:43,983 INFO L290 TraceCheckUtils]: 31: Hoare triple {12885#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12885#true} is VALID [2022-04-14 18:23:43,983 INFO L290 TraceCheckUtils]: 32: Hoare triple {12885#true} assume 4368 == #t~mem54;havoc #t~mem54; {12885#true} is VALID [2022-04-14 18:23:43,984 INFO L290 TraceCheckUtils]: 33: Hoare triple {12885#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {12885#true} is VALID [2022-04-14 18:23:43,984 INFO L290 TraceCheckUtils]: 34: Hoare triple {12885#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {12890#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-14 18:23:43,984 INFO L290 TraceCheckUtils]: 35: Hoare triple {12890#(= ssl3_connect_~blastFlag~0 1)} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {12890#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-14 18:23:43,985 INFO L290 TraceCheckUtils]: 36: Hoare triple {12890#(= ssl3_connect_~blastFlag~0 1)} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {12890#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-14 18:23:43,985 INFO L290 TraceCheckUtils]: 37: Hoare triple {12890#(= ssl3_connect_~blastFlag~0 1)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {12890#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-14 18:23:43,985 INFO L290 TraceCheckUtils]: 38: Hoare triple {12890#(= ssl3_connect_~blastFlag~0 1)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {12890#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-14 18:23:43,986 INFO L290 TraceCheckUtils]: 39: Hoare triple {12890#(= ssl3_connect_~blastFlag~0 1)} ~skip~0 := 0; {12890#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-14 18:23:43,986 INFO L290 TraceCheckUtils]: 40: Hoare triple {12890#(= ssl3_connect_~blastFlag~0 1)} assume !false; {12890#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-14 18:23:43,986 INFO L290 TraceCheckUtils]: 41: Hoare triple {12890#(= ssl3_connect_~blastFlag~0 1)} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12890#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-14 18:23:43,987 INFO L290 TraceCheckUtils]: 42: Hoare triple {12890#(= ssl3_connect_~blastFlag~0 1)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12890#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-14 18:23:43,987 INFO L290 TraceCheckUtils]: 43: Hoare triple {12890#(= ssl3_connect_~blastFlag~0 1)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12890#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-14 18:23:43,987 INFO L290 TraceCheckUtils]: 44: Hoare triple {12890#(= ssl3_connect_~blastFlag~0 1)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12890#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-14 18:23:43,987 INFO L290 TraceCheckUtils]: 45: Hoare triple {12890#(= ssl3_connect_~blastFlag~0 1)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12890#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-14 18:23:43,988 INFO L290 TraceCheckUtils]: 46: Hoare triple {12890#(= ssl3_connect_~blastFlag~0 1)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12890#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-14 18:23:43,988 INFO L290 TraceCheckUtils]: 47: Hoare triple {12890#(= ssl3_connect_~blastFlag~0 1)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {12890#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-14 18:23:43,988 INFO L290 TraceCheckUtils]: 48: Hoare triple {12890#(= ssl3_connect_~blastFlag~0 1)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {12890#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-14 18:23:43,989 INFO L290 TraceCheckUtils]: 49: Hoare triple {12890#(= ssl3_connect_~blastFlag~0 1)} assume 4384 == #t~mem56;havoc #t~mem56; {12890#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-14 18:23:43,989 INFO L290 TraceCheckUtils]: 50: Hoare triple {12890#(= ssl3_connect_~blastFlag~0 1)} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {12890#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-14 18:23:43,989 INFO L290 TraceCheckUtils]: 51: Hoare triple {12890#(= ssl3_connect_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {12886#false} is VALID [2022-04-14 18:23:43,990 INFO L290 TraceCheckUtils]: 52: Hoare triple {12886#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {12886#false} is VALID [2022-04-14 18:23:43,990 INFO L290 TraceCheckUtils]: 53: Hoare triple {12886#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {12886#false} is VALID [2022-04-14 18:23:43,990 INFO L290 TraceCheckUtils]: 54: Hoare triple {12886#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {12886#false} is VALID [2022-04-14 18:23:43,990 INFO L290 TraceCheckUtils]: 55: Hoare triple {12886#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {12886#false} is VALID [2022-04-14 18:23:43,990 INFO L290 TraceCheckUtils]: 56: Hoare triple {12886#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {12886#false} is VALID [2022-04-14 18:23:43,990 INFO L290 TraceCheckUtils]: 57: Hoare triple {12886#false} ~skip~0 := 0; {12886#false} is VALID [2022-04-14 18:23:43,990 INFO L290 TraceCheckUtils]: 58: Hoare triple {12886#false} assume !false; {12886#false} is VALID [2022-04-14 18:23:43,990 INFO L290 TraceCheckUtils]: 59: Hoare triple {12886#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12886#false} is VALID [2022-04-14 18:23:43,990 INFO L290 TraceCheckUtils]: 60: Hoare triple {12886#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12886#false} is VALID [2022-04-14 18:23:43,990 INFO L290 TraceCheckUtils]: 61: Hoare triple {12886#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12886#false} is VALID [2022-04-14 18:23:43,990 INFO L290 TraceCheckUtils]: 62: Hoare triple {12886#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12886#false} is VALID [2022-04-14 18:23:43,990 INFO L290 TraceCheckUtils]: 63: Hoare triple {12886#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12886#false} is VALID [2022-04-14 18:23:43,991 INFO L290 TraceCheckUtils]: 64: Hoare triple {12886#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12886#false} is VALID [2022-04-14 18:23:43,991 INFO L290 TraceCheckUtils]: 65: Hoare triple {12886#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {12886#false} is VALID [2022-04-14 18:23:43,991 INFO L290 TraceCheckUtils]: 66: Hoare triple {12886#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {12886#false} is VALID [2022-04-14 18:23:43,991 INFO L290 TraceCheckUtils]: 67: Hoare triple {12886#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {12886#false} is VALID [2022-04-14 18:23:43,991 INFO L290 TraceCheckUtils]: 68: Hoare triple {12886#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {12886#false} is VALID [2022-04-14 18:23:43,991 INFO L290 TraceCheckUtils]: 69: Hoare triple {12886#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {12886#false} is VALID [2022-04-14 18:23:43,991 INFO L290 TraceCheckUtils]: 70: Hoare triple {12886#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {12886#false} is VALID [2022-04-14 18:23:43,991 INFO L290 TraceCheckUtils]: 71: Hoare triple {12886#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {12886#false} is VALID [2022-04-14 18:23:43,991 INFO L290 TraceCheckUtils]: 72: Hoare triple {12886#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {12886#false} is VALID [2022-04-14 18:23:43,991 INFO L290 TraceCheckUtils]: 73: Hoare triple {12886#false} assume 4432 == #t~mem62;havoc #t~mem62; {12886#false} is VALID [2022-04-14 18:23:43,991 INFO L290 TraceCheckUtils]: 74: Hoare triple {12886#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {12886#false} is VALID [2022-04-14 18:23:43,992 INFO L290 TraceCheckUtils]: 75: Hoare triple {12886#false} assume 4 == ~blastFlag~0; {12886#false} is VALID [2022-04-14 18:23:43,992 INFO L290 TraceCheckUtils]: 76: Hoare triple {12886#false} assume !false; {12886#false} is VALID [2022-04-14 18:23:43,992 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-14 18:23:43,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:23:43,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917583602] [2022-04-14 18:23:43,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917583602] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:23:43,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:23:43,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 18:23:43,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925854590] [2022-04-14 18:23:43,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:23:43,993 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-14 18:23:43,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:23:43,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:44,058 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:23:44,058 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 18:23:44,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:23:44,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 18:23:44,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 18:23:44,059 INFO L87 Difference]: Start difference. First operand 404 states and 594 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:46,079 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-14 18:23:46,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:23:46,675 INFO L93 Difference]: Finished difference Result 702 states and 1034 transitions. [2022-04-14 18:23:46,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 18:23:46,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-14 18:23:46,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:23:46,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:46,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 369 transitions. [2022-04-14 18:23:46,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:46,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 369 transitions. [2022-04-14 18:23:46,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 369 transitions. [2022-04-14 18:23:46,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 369 edges. 369 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:23:46,948 INFO L225 Difference]: With dead ends: 702 [2022-04-14 18:23:46,948 INFO L226 Difference]: Without dead ends: 429 [2022-04-14 18:23:46,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-14 18:23:46,949 INFO L913 BasicCegarLoop]: 196 mSDtfsCounter, 16 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-14 18:23:46,950 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 358 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 214 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-14 18:23:46,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2022-04-14 18:23:46,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2022-04-14 18:23:46,959 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:23:46,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 429 states. Second operand has 429 states, 424 states have (on average 1.4693396226415094) internal successors, (623), 424 states have internal predecessors, (623), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:46,960 INFO L74 IsIncluded]: Start isIncluded. First operand 429 states. Second operand has 429 states, 424 states have (on average 1.4693396226415094) internal successors, (623), 424 states have internal predecessors, (623), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:46,961 INFO L87 Difference]: Start difference. First operand 429 states. Second operand has 429 states, 424 states have (on average 1.4693396226415094) internal successors, (623), 424 states have internal predecessors, (623), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:46,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:23:46,971 INFO L93 Difference]: Finished difference Result 429 states and 627 transitions. [2022-04-14 18:23:46,972 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 627 transitions. [2022-04-14 18:23:46,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:23:46,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:23:46,973 INFO L74 IsIncluded]: Start isIncluded. First operand has 429 states, 424 states have (on average 1.4693396226415094) internal successors, (623), 424 states have internal predecessors, (623), 3 states have call successors, (3), 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 429 states. [2022-04-14 18:23:46,974 INFO L87 Difference]: Start difference. First operand has 429 states, 424 states have (on average 1.4693396226415094) internal successors, (623), 424 states have internal predecessors, (623), 3 states have call successors, (3), 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 429 states. [2022-04-14 18:23:46,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:23:46,984 INFO L93 Difference]: Finished difference Result 429 states and 627 transitions. [2022-04-14 18:23:46,984 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 627 transitions. [2022-04-14 18:23:46,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:23:46,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:23:46,985 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:23:46,985 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:23:46,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 424 states have (on average 1.4693396226415094) internal successors, (623), 424 states have internal predecessors, (623), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:46,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 627 transitions. [2022-04-14 18:23:46,997 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 627 transitions. Word has length 77 [2022-04-14 18:23:46,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:23:46,997 INFO L478 AbstractCegarLoop]: Abstraction has 429 states and 627 transitions. [2022-04-14 18:23:46,998 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:46,998 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 627 transitions. [2022-04-14 18:23:46,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-14 18:23:46,999 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:23:46,999 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:23:46,999 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-14 18:23:46,999 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:23:47,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:23:47,000 INFO L85 PathProgramCache]: Analyzing trace with hash 140608816, now seen corresponding path program 1 times [2022-04-14 18:23:47,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:23:47,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939247010] [2022-04-14 18:23:47,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:23:47,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:23:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:23:47,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:23:47,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:23:47,218 INFO L290 TraceCheckUtils]: 0: Hoare triple {15052#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {15046#true} is VALID [2022-04-14 18:23:47,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {15046#true} assume true; {15046#true} is VALID [2022-04-14 18:23:47,219 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15046#true} {15046#true} #593#return; {15046#true} is VALID [2022-04-14 18:23:47,220 INFO L272 TraceCheckUtils]: 0: Hoare triple {15046#true} call ULTIMATE.init(); {15052#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#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-14 18:23:47,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {15052#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {15046#true} is VALID [2022-04-14 18:23:47,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {15046#true} assume true; {15046#true} is VALID [2022-04-14 18:23:47,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15046#true} {15046#true} #593#return; {15046#true} is VALID [2022-04-14 18:23:47,220 INFO L272 TraceCheckUtils]: 4: Hoare triple {15046#true} call #t~ret158 := main(); {15046#true} is VALID [2022-04-14 18:23:47,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {15046#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {15046#true} is VALID [2022-04-14 18:23:47,220 INFO L272 TraceCheckUtils]: 6: Hoare triple {15046#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {15046#true} is VALID [2022-04-14 18:23:47,235 INFO L290 TraceCheckUtils]: 7: Hoare triple {15046#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {15046#true} is VALID [2022-04-14 18:23:47,235 INFO L290 TraceCheckUtils]: 8: Hoare triple {15046#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {15046#true} is VALID [2022-04-14 18:23:47,235 INFO L290 TraceCheckUtils]: 9: Hoare triple {15046#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {15046#true} is VALID [2022-04-14 18:23:47,235 INFO L290 TraceCheckUtils]: 10: Hoare triple {15046#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {15046#true} is VALID [2022-04-14 18:23:47,235 INFO L290 TraceCheckUtils]: 11: Hoare triple {15046#true} assume !false; {15046#true} is VALID [2022-04-14 18:23:47,235 INFO L290 TraceCheckUtils]: 12: Hoare triple {15046#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-14 18:23:47,235 INFO L290 TraceCheckUtils]: 13: Hoare triple {15046#true} assume 12292 == #t~mem49;havoc #t~mem49; {15046#true} is VALID [2022-04-14 18:23:47,235 INFO L290 TraceCheckUtils]: 14: Hoare triple {15046#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {15046#true} is VALID [2022-04-14 18:23:47,236 INFO L290 TraceCheckUtils]: 15: Hoare triple {15046#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {15046#true} is VALID [2022-04-14 18:23:47,236 INFO L290 TraceCheckUtils]: 16: Hoare triple {15046#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {15046#true} is VALID [2022-04-14 18:23:47,236 INFO L290 TraceCheckUtils]: 17: Hoare triple {15046#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {15046#true} is VALID [2022-04-14 18:23:47,236 INFO L290 TraceCheckUtils]: 18: Hoare triple {15046#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {15046#true} is VALID [2022-04-14 18:23:47,236 INFO L290 TraceCheckUtils]: 19: Hoare triple {15046#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {15046#true} is VALID [2022-04-14 18:23:47,236 INFO L290 TraceCheckUtils]: 20: Hoare triple {15046#true} assume !(0 == ~tmp___4~0); {15046#true} is VALID [2022-04-14 18:23:47,236 INFO L290 TraceCheckUtils]: 21: Hoare triple {15046#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {15046#true} is VALID [2022-04-14 18:23:47,236 INFO L290 TraceCheckUtils]: 22: Hoare triple {15046#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {15046#true} is VALID [2022-04-14 18:23:47,236 INFO L290 TraceCheckUtils]: 23: Hoare triple {15046#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15046#true} is VALID [2022-04-14 18:23:47,236 INFO L290 TraceCheckUtils]: 24: Hoare triple {15046#true} ~skip~0 := 0; {15046#true} is VALID [2022-04-14 18:23:47,236 INFO L290 TraceCheckUtils]: 25: Hoare triple {15046#true} assume !false; {15046#true} is VALID [2022-04-14 18:23:47,236 INFO L290 TraceCheckUtils]: 26: Hoare triple {15046#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-14 18:23:47,237 INFO L290 TraceCheckUtils]: 27: Hoare triple {15046#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-14 18:23:47,237 INFO L290 TraceCheckUtils]: 28: Hoare triple {15046#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-14 18:23:47,237 INFO L290 TraceCheckUtils]: 29: Hoare triple {15046#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-14 18:23:47,237 INFO L290 TraceCheckUtils]: 30: Hoare triple {15046#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-14 18:23:47,237 INFO L290 TraceCheckUtils]: 31: Hoare triple {15046#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-14 18:23:47,237 INFO L290 TraceCheckUtils]: 32: Hoare triple {15046#true} assume 4368 == #t~mem54;havoc #t~mem54; {15046#true} is VALID [2022-04-14 18:23:47,237 INFO L290 TraceCheckUtils]: 33: Hoare triple {15046#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {15046#true} is VALID [2022-04-14 18:23:47,237 INFO L290 TraceCheckUtils]: 34: Hoare triple {15046#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {15046#true} is VALID [2022-04-14 18:23:47,237 INFO L290 TraceCheckUtils]: 35: Hoare triple {15046#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {15046#true} is VALID [2022-04-14 18:23:47,237 INFO L290 TraceCheckUtils]: 36: Hoare triple {15046#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {15046#true} is VALID [2022-04-14 18:23:47,237 INFO L290 TraceCheckUtils]: 37: Hoare triple {15046#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {15046#true} is VALID [2022-04-14 18:23:47,237 INFO L290 TraceCheckUtils]: 38: Hoare triple {15046#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15046#true} is VALID [2022-04-14 18:23:47,238 INFO L290 TraceCheckUtils]: 39: Hoare triple {15046#true} ~skip~0 := 0; {15046#true} is VALID [2022-04-14 18:23:47,238 INFO L290 TraceCheckUtils]: 40: Hoare triple {15046#true} assume !false; {15046#true} is VALID [2022-04-14 18:23:47,238 INFO L290 TraceCheckUtils]: 41: Hoare triple {15046#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-14 18:23:47,238 INFO L290 TraceCheckUtils]: 42: Hoare triple {15046#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-14 18:23:47,238 INFO L290 TraceCheckUtils]: 43: Hoare triple {15046#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-14 18:23:47,238 INFO L290 TraceCheckUtils]: 44: Hoare triple {15046#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-14 18:23:47,238 INFO L290 TraceCheckUtils]: 45: Hoare triple {15046#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-14 18:23:47,238 INFO L290 TraceCheckUtils]: 46: Hoare triple {15046#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-14 18:23:47,238 INFO L290 TraceCheckUtils]: 47: Hoare triple {15046#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-14 18:23:47,238 INFO L290 TraceCheckUtils]: 48: Hoare triple {15046#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-14 18:23:47,238 INFO L290 TraceCheckUtils]: 49: Hoare triple {15046#true} assume 4384 == #t~mem56;havoc #t~mem56; {15046#true} is VALID [2022-04-14 18:23:47,238 INFO L290 TraceCheckUtils]: 50: Hoare triple {15046#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {15046#true} is VALID [2022-04-14 18:23:47,238 INFO L290 TraceCheckUtils]: 51: Hoare triple {15046#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {15046#true} is VALID [2022-04-14 18:23:47,239 INFO L290 TraceCheckUtils]: 52: Hoare triple {15046#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {15046#true} is VALID [2022-04-14 18:23:47,239 INFO L290 TraceCheckUtils]: 53: Hoare triple {15046#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-14 18:23:47,239 INFO L290 TraceCheckUtils]: 54: Hoare triple {15046#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {15046#true} is VALID [2022-04-14 18:23:47,239 INFO L290 TraceCheckUtils]: 55: Hoare triple {15046#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {15046#true} is VALID [2022-04-14 18:23:47,239 INFO L290 TraceCheckUtils]: 56: Hoare triple {15046#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15046#true} is VALID [2022-04-14 18:23:47,239 INFO L290 TraceCheckUtils]: 57: Hoare triple {15046#true} ~skip~0 := 0; {15046#true} is VALID [2022-04-14 18:23:47,239 INFO L290 TraceCheckUtils]: 58: Hoare triple {15046#true} assume !false; {15046#true} is VALID [2022-04-14 18:23:47,239 INFO L290 TraceCheckUtils]: 59: Hoare triple {15046#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-14 18:23:47,239 INFO L290 TraceCheckUtils]: 60: Hoare triple {15046#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-14 18:23:47,239 INFO L290 TraceCheckUtils]: 61: Hoare triple {15046#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-14 18:23:47,239 INFO L290 TraceCheckUtils]: 62: Hoare triple {15046#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-14 18:23:47,239 INFO L290 TraceCheckUtils]: 63: Hoare triple {15046#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-14 18:23:47,240 INFO L290 TraceCheckUtils]: 64: Hoare triple {15046#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-14 18:23:47,240 INFO L290 TraceCheckUtils]: 65: Hoare triple {15046#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-14 18:23:47,240 INFO L290 TraceCheckUtils]: 66: Hoare triple {15046#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-14 18:23:47,240 INFO L290 TraceCheckUtils]: 67: Hoare triple {15046#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-14 18:23:47,240 INFO L290 TraceCheckUtils]: 68: Hoare triple {15046#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {15046#true} is VALID [2022-04-14 18:23:47,240 INFO L290 TraceCheckUtils]: 69: Hoare triple {15046#true} assume 4400 == #t~mem58;havoc #t~mem58; {15046#true} is VALID [2022-04-14 18:23:47,240 INFO L290 TraceCheckUtils]: 70: Hoare triple {15046#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {15046#true} is VALID [2022-04-14 18:23:47,240 INFO L290 TraceCheckUtils]: 71: Hoare triple {15046#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {15046#true} is VALID [2022-04-14 18:23:47,253 INFO L290 TraceCheckUtils]: 72: Hoare triple {15046#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {15051#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-14 18:23:47,253 INFO L290 TraceCheckUtils]: 73: Hoare triple {15051#(= 3 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0); {15051#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-14 18:23:47,254 INFO L290 TraceCheckUtils]: 74: Hoare triple {15051#(= 3 ssl3_connect_~blastFlag~0)} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {15051#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-14 18:23:47,254 INFO L290 TraceCheckUtils]: 75: Hoare triple {15051#(= 3 ssl3_connect_~blastFlag~0)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {15051#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-14 18:23:47,254 INFO L290 TraceCheckUtils]: 76: Hoare triple {15051#(= 3 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15051#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-14 18:23:47,254 INFO L290 TraceCheckUtils]: 77: Hoare triple {15051#(= 3 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {15051#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-14 18:23:47,255 INFO L290 TraceCheckUtils]: 78: Hoare triple {15051#(= 3 ssl3_connect_~blastFlag~0)} assume !false; {15051#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-14 18:23:47,255 INFO L290 TraceCheckUtils]: 79: Hoare triple {15051#(= 3 ssl3_connect_~blastFlag~0)} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15051#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-14 18:23:47,255 INFO L290 TraceCheckUtils]: 80: Hoare triple {15051#(= 3 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15051#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-14 18:23:47,256 INFO L290 TraceCheckUtils]: 81: Hoare triple {15051#(= 3 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15051#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-14 18:23:47,256 INFO L290 TraceCheckUtils]: 82: Hoare triple {15051#(= 3 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15051#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-14 18:23:47,256 INFO L290 TraceCheckUtils]: 83: Hoare triple {15051#(= 3 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15051#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-14 18:23:47,256 INFO L290 TraceCheckUtils]: 84: Hoare triple {15051#(= 3 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15051#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-14 18:23:47,257 INFO L290 TraceCheckUtils]: 85: Hoare triple {15051#(= 3 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15051#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-14 18:23:47,257 INFO L290 TraceCheckUtils]: 86: Hoare triple {15051#(= 3 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {15051#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-14 18:23:47,257 INFO L290 TraceCheckUtils]: 87: Hoare triple {15051#(= 3 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {15051#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-14 18:23:47,258 INFO L290 TraceCheckUtils]: 88: Hoare triple {15051#(= 3 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {15051#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-14 18:23:47,258 INFO L290 TraceCheckUtils]: 89: Hoare triple {15051#(= 3 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {15051#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-14 18:23:47,258 INFO L290 TraceCheckUtils]: 90: Hoare triple {15051#(= 3 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {15051#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-14 18:23:47,258 INFO L290 TraceCheckUtils]: 91: Hoare triple {15051#(= 3 ssl3_connect_~blastFlag~0)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {15051#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-14 18:23:47,259 INFO L290 TraceCheckUtils]: 92: Hoare triple {15051#(= 3 ssl3_connect_~blastFlag~0)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {15051#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-14 18:23:47,259 INFO L290 TraceCheckUtils]: 93: Hoare triple {15051#(= 3 ssl3_connect_~blastFlag~0)} assume 4432 == #t~mem62;havoc #t~mem62; {15051#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-14 18:23:47,259 INFO L290 TraceCheckUtils]: 94: Hoare triple {15051#(= 3 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {15051#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-14 18:23:47,260 INFO L290 TraceCheckUtils]: 95: Hoare triple {15051#(= 3 ssl3_connect_~blastFlag~0)} assume 4 == ~blastFlag~0; {15047#false} is VALID [2022-04-14 18:23:47,260 INFO L290 TraceCheckUtils]: 96: Hoare triple {15047#false} assume !false; {15047#false} is VALID [2022-04-14 18:23:47,260 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-14 18:23:47,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:23:47,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939247010] [2022-04-14 18:23:47,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939247010] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:23:47,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:23:47,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 18:23:47,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985027299] [2022-04-14 18:23:47,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:23:47,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2022-04-14 18:23:47,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:23:47,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:47,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:23:47,323 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 18:23:47,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:23:47,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 18:23:47,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 18:23:47,324 INFO L87 Difference]: Start difference. First operand 429 states and 627 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:49,345 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-14 18:23:50,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:23:50,279 INFO L93 Difference]: Finished difference Result 861 states and 1267 transitions. [2022-04-14 18:23:50,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 18:23:50,280 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2022-04-14 18:23:50,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:23:50,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:50,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2022-04-14 18:23:50,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:50,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2022-04-14 18:23:50,285 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 488 transitions. [2022-04-14 18:23:50,601 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 488 edges. 488 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:23:50,612 INFO L225 Difference]: With dead ends: 861 [2022-04-14 18:23:50,612 INFO L226 Difference]: Without dead ends: 563 [2022-04-14 18:23:50,613 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-14 18:23:50,613 INFO L913 BasicCegarLoop]: 314 mSDtfsCounter, 126 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-14 18:23:50,614 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 476 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 338 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-14 18:23:50,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2022-04-14 18:23:50,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2022-04-14 18:23:50,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:23:50,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 563 states. Second operand has 563 states, 558 states have (on average 1.4695340501792116) internal successors, (820), 558 states have internal predecessors, (820), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:50,626 INFO L74 IsIncluded]: Start isIncluded. First operand 563 states. Second operand has 563 states, 558 states have (on average 1.4695340501792116) internal successors, (820), 558 states have internal predecessors, (820), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:50,627 INFO L87 Difference]: Start difference. First operand 563 states. Second operand has 563 states, 558 states have (on average 1.4695340501792116) internal successors, (820), 558 states have internal predecessors, (820), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:50,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:23:50,652 INFO L93 Difference]: Finished difference Result 563 states and 824 transitions. [2022-04-14 18:23:50,652 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 824 transitions. [2022-04-14 18:23:50,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:23:50,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:23:50,654 INFO L74 IsIncluded]: Start isIncluded. First operand has 563 states, 558 states have (on average 1.4695340501792116) internal successors, (820), 558 states have internal predecessors, (820), 3 states have call successors, (3), 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 563 states. [2022-04-14 18:23:50,655 INFO L87 Difference]: Start difference. First operand has 563 states, 558 states have (on average 1.4695340501792116) internal successors, (820), 558 states have internal predecessors, (820), 3 states have call successors, (3), 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 563 states. [2022-04-14 18:23:50,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:23:50,670 INFO L93 Difference]: Finished difference Result 563 states and 824 transitions. [2022-04-14 18:23:50,670 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 824 transitions. [2022-04-14 18:23:50,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:23:50,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:23:50,671 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:23:50,671 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:23:50,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 558 states have (on average 1.4695340501792116) internal successors, (820), 558 states have internal predecessors, (820), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:50,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 824 transitions. [2022-04-14 18:23:50,688 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 824 transitions. Word has length 97 [2022-04-14 18:23:50,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:23:50,689 INFO L478 AbstractCegarLoop]: Abstraction has 563 states and 824 transitions. [2022-04-14 18:23:50,689 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:23:50,689 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 824 transitions. [2022-04-14 18:23:50,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-14 18:23:50,690 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:23:50,691 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] [2022-04-14 18:23:50,691 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-14 18:23:50,691 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:23:50,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:23:50,691 INFO L85 PathProgramCache]: Analyzing trace with hash -2136926065, now seen corresponding path program 1 times [2022-04-14 18:23:50,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:23:50,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931405295] [2022-04-14 18:23:50,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:23:50,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:23:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-14 18:23:52,054 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-14 18:23:52,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-14 18:23:52,776 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-14 18:23:52,776 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-14 18:23:52,777 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 18:23:52,778 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-14 18:23:52,781 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:23:52,784 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 18:23:52,892 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-14 18:23:52,892 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-14 18:23:52,892 WARN L170 areAnnotationChecker]: ssl3_get_client_methodENTRY has no Hoare annotation [2022-04-14 18:23:52,893 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-14 18:23:52,893 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-14 18:23:52,893 WARN L170 areAnnotationChecker]: ssl3_connectENTRY has no Hoare annotation [2022-04-14 18:23:52,893 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-14 18:23:52,893 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyENTRY has no Hoare annotation [2022-04-14 18:23:52,893 WARN L170 areAnnotationChecker]: sslv3_base_methodENTRY has no Hoare annotation [2022-04-14 18:23:52,893 WARN L170 areAnnotationChecker]: #Ultimate.meminitENTRY has no Hoare annotation [2022-04-14 18:23:52,893 WARN L170 areAnnotationChecker]: SSLv3_client_methodENTRY has no Hoare annotation [2022-04-14 18:23:52,893 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-14 18:23:52,893 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-14 18:23:52,893 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-14 18:23:52,893 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-14 18:23:52,893 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-14 18:23:52,893 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-14 18:23:52,893 WARN L170 areAnnotationChecker]: L1132 has no Hoare annotation [2022-04-14 18:23:52,893 WARN L170 areAnnotationChecker]: L1132 has no Hoare annotation [2022-04-14 18:23:52,893 WARN L170 areAnnotationChecker]: L1098 has no Hoare annotation [2022-04-14 18:23:52,893 WARN L170 areAnnotationChecker]: L1098 has no Hoare annotation [2022-04-14 18:23:52,893 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-14 18:23:52,894 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-14 18:23:52,894 WARN L170 areAnnotationChecker]: L1675 has no Hoare annotation [2022-04-14 18:23:52,894 WARN L170 areAnnotationChecker]: L1675 has no Hoare annotation [2022-04-14 18:23:52,894 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2022-04-14 18:23:52,894 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-14 18:23:52,894 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-14 18:23:52,894 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-14 18:23:52,894 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-14 18:23:52,894 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-14 18:23:52,894 WARN L170 areAnnotationChecker]: ssl3_get_client_methodFINAL has no Hoare annotation [2022-04-14 18:23:52,894 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-14 18:23:52,894 WARN L170 areAnnotationChecker]: L1135-2 has no Hoare annotation [2022-04-14 18:23:52,894 WARN L170 areAnnotationChecker]: L1135 has no Hoare annotation [2022-04-14 18:23:52,894 WARN L170 areAnnotationChecker]: L1135 has no Hoare annotation [2022-04-14 18:23:52,894 WARN L170 areAnnotationChecker]: L1098-1 has no Hoare annotation [2022-04-14 18:23:52,894 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-14 18:23:52,894 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-14 18:23:52,894 WARN L170 areAnnotationChecker]: L1675-1 has no Hoare annotation [2022-04-14 18:23:52,894 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2022-04-14 18:23:52,895 WARN L170 areAnnotationChecker]: L1064 has no Hoare annotation [2022-04-14 18:23:52,895 WARN L170 areAnnotationChecker]: L1064 has no Hoare annotation [2022-04-14 18:23:52,895 WARN L170 areAnnotationChecker]: L1061-2 has no Hoare annotation [2022-04-14 18:23:52,895 WARN L170 areAnnotationChecker]: L1046-1 has no Hoare annotation [2022-04-14 18:23:52,895 WARN L170 areAnnotationChecker]: L1142 has no Hoare annotation [2022-04-14 18:23:52,895 WARN L170 areAnnotationChecker]: L1142 has no Hoare annotation [2022-04-14 18:23:52,895 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-14 18:23:52,895 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyFINAL has no Hoare annotation [2022-04-14 18:23:52,895 WARN L170 areAnnotationChecker]: sslv3_base_methodFINAL has no Hoare annotation [2022-04-14 18:23:52,895 WARN L170 areAnnotationChecker]: L1064-1 has no Hoare annotation [2022-04-14 18:23:52,895 WARN L170 areAnnotationChecker]: SSLv3_client_methodFINAL has no Hoare annotation [2022-04-14 18:23:52,895 WARN L170 areAnnotationChecker]: L1143 has no Hoare annotation [2022-04-14 18:23:52,895 WARN L170 areAnnotationChecker]: L1143 has no Hoare annotation [2022-04-14 18:23:52,895 WARN L170 areAnnotationChecker]: L1152-1 has no Hoare annotation [2022-04-14 18:23:52,895 WARN L170 areAnnotationChecker]: L1152-1 has no Hoare annotation [2022-04-14 18:23:52,895 WARN L170 areAnnotationChecker]: L1152-1 has no Hoare annotation [2022-04-14 18:23:52,895 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-14 18:23:52,895 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyEXIT has no Hoare annotation [2022-04-14 18:23:52,895 WARN L170 areAnnotationChecker]: sslv3_base_methodEXIT has no Hoare annotation [2022-04-14 18:23:52,896 WARN L170 areAnnotationChecker]: L1066 has no Hoare annotation [2022-04-14 18:23:52,896 WARN L170 areAnnotationChecker]: L1066 has no Hoare annotation [2022-04-14 18:23:52,896 WARN L170 areAnnotationChecker]: SSLv3_client_methodEXIT has no Hoare annotation [2022-04-14 18:23:52,896 WARN L170 areAnnotationChecker]: L1655 has no Hoare annotation [2022-04-14 18:23:52,896 WARN L170 areAnnotationChecker]: L1153 has no Hoare annotation [2022-04-14 18:23:52,896 WARN L170 areAnnotationChecker]: L1066-1 has no Hoare annotation [2022-04-14 18:23:52,896 WARN L170 areAnnotationChecker]: L1659 has no Hoare annotation [2022-04-14 18:23:52,896 WARN L170 areAnnotationChecker]: L1659 has no Hoare annotation [2022-04-14 18:23:52,896 WARN L170 areAnnotationChecker]: L1155 has no Hoare annotation [2022-04-14 18:23:52,896 WARN L170 areAnnotationChecker]: L1155 has no Hoare annotation [2022-04-14 18:23:52,896 WARN L170 areAnnotationChecker]: L1659-2 has no Hoare annotation [2022-04-14 18:23:52,896 WARN L170 areAnnotationChecker]: L1156 has no Hoare annotation [2022-04-14 18:23:52,896 WARN L170 areAnnotationChecker]: L1158 has no Hoare annotation [2022-04-14 18:23:52,896 WARN L170 areAnnotationChecker]: L1158 has no Hoare annotation [2022-04-14 18:23:52,896 WARN L170 areAnnotationChecker]: ssl3_connectFINAL has no Hoare annotation [2022-04-14 18:23:52,896 WARN L170 areAnnotationChecker]: L1261 has no Hoare annotation [2022-04-14 18:23:52,896 WARN L170 areAnnotationChecker]: L1161 has no Hoare annotation [2022-04-14 18:23:52,896 WARN L170 areAnnotationChecker]: L1161 has no Hoare annotation [2022-04-14 18:23:52,896 WARN L170 areAnnotationChecker]: ssl3_connectEXIT has no Hoare annotation [2022-04-14 18:23:52,896 WARN L170 areAnnotationChecker]: L1266 has no Hoare annotation [2022-04-14 18:23:52,897 WARN L170 areAnnotationChecker]: L1266 has no Hoare annotation [2022-04-14 18:23:52,897 WARN L170 areAnnotationChecker]: L1164 has no Hoare annotation [2022-04-14 18:23:52,897 WARN L170 areAnnotationChecker]: L1164 has no Hoare annotation [2022-04-14 18:23:52,897 WARN L170 areAnnotationChecker]: L1266-2 has no Hoare annotation [2022-04-14 18:23:52,897 WARN L170 areAnnotationChecker]: L1167 has no Hoare annotation [2022-04-14 18:23:52,897 WARN L170 areAnnotationChecker]: L1167 has no Hoare annotation [2022-04-14 18:23:52,897 WARN L170 areAnnotationChecker]: L1271 has no Hoare annotation [2022-04-14 18:23:52,897 WARN L170 areAnnotationChecker]: L1271 has no Hoare annotation [2022-04-14 18:23:52,897 WARN L170 areAnnotationChecker]: L1170 has no Hoare annotation [2022-04-14 18:23:52,897 WARN L170 areAnnotationChecker]: L1170 has no Hoare annotation [2022-04-14 18:23:52,897 WARN L170 areAnnotationChecker]: L1278 has no Hoare annotation [2022-04-14 18:23:52,897 WARN L170 areAnnotationChecker]: L1278 has no Hoare annotation [2022-04-14 18:23:52,897 WARN L170 areAnnotationChecker]: L1174 has no Hoare annotation [2022-04-14 18:23:52,897 WARN L170 areAnnotationChecker]: L1173 has no Hoare annotation [2022-04-14 18:23:52,897 WARN L170 areAnnotationChecker]: L1173 has no Hoare annotation [2022-04-14 18:23:52,897 WARN L170 areAnnotationChecker]: L1280 has no Hoare annotation [2022-04-14 18:23:52,897 WARN L170 areAnnotationChecker]: L1280 has no Hoare annotation [2022-04-14 18:23:52,897 WARN L170 areAnnotationChecker]: L1278-2 has no Hoare annotation [2022-04-14 18:23:52,897 WARN L170 areAnnotationChecker]: L1278-2 has no Hoare annotation [2022-04-14 18:23:52,898 WARN L170 areAnnotationChecker]: L1316 has no Hoare annotation [2022-04-14 18:23:52,898 WARN L170 areAnnotationChecker]: L1316 has no Hoare annotation [2022-04-14 18:23:52,898 WARN L170 areAnnotationChecker]: L1176 has no Hoare annotation [2022-04-14 18:23:52,898 WARN L170 areAnnotationChecker]: L1176 has no Hoare annotation [2022-04-14 18:23:52,898 WARN L170 areAnnotationChecker]: L1286 has no Hoare annotation [2022-04-14 18:23:52,898 WARN L170 areAnnotationChecker]: L1286 has no Hoare annotation [2022-04-14 18:23:52,898 WARN L170 areAnnotationChecker]: L1302 has no Hoare annotation [2022-04-14 18:23:52,898 WARN L170 areAnnotationChecker]: L1302 has no Hoare annotation [2022-04-14 18:23:52,898 WARN L170 areAnnotationChecker]: L1319-2 has no Hoare annotation [2022-04-14 18:23:52,898 WARN L170 areAnnotationChecker]: L1319-2 has no Hoare annotation [2022-04-14 18:23:52,898 WARN L170 areAnnotationChecker]: L1319 has no Hoare annotation [2022-04-14 18:23:52,898 WARN L170 areAnnotationChecker]: L1319 has no Hoare annotation [2022-04-14 18:23:52,898 WARN L170 areAnnotationChecker]: L1180 has no Hoare annotation [2022-04-14 18:23:52,898 WARN L170 areAnnotationChecker]: L1179 has no Hoare annotation [2022-04-14 18:23:52,898 WARN L170 areAnnotationChecker]: L1179 has no Hoare annotation [2022-04-14 18:23:52,898 WARN L170 areAnnotationChecker]: L1588 has no Hoare annotation [2022-04-14 18:23:52,898 WARN L170 areAnnotationChecker]: L1332 has no Hoare annotation [2022-04-14 18:23:52,898 WARN L170 areAnnotationChecker]: L1332 has no Hoare annotation [2022-04-14 18:23:52,898 WARN L170 areAnnotationChecker]: L1341 has no Hoare annotation [2022-04-14 18:23:52,898 WARN L170 areAnnotationChecker]: L1341 has no Hoare annotation [2022-04-14 18:23:52,899 WARN L170 areAnnotationChecker]: L1182 has no Hoare annotation [2022-04-14 18:23:52,899 WARN L170 areAnnotationChecker]: L1182 has no Hoare annotation [2022-04-14 18:23:52,899 WARN L170 areAnnotationChecker]: L1624 has no Hoare annotation [2022-04-14 18:23:52,899 WARN L170 areAnnotationChecker]: L1624 has no Hoare annotation [2022-04-14 18:23:52,899 WARN L170 areAnnotationChecker]: L1341-2 has no Hoare annotation [2022-04-14 18:23:52,899 WARN L170 areAnnotationChecker]: L1341-2 has no Hoare annotation [2022-04-14 18:23:52,899 WARN L170 areAnnotationChecker]: L1186 has no Hoare annotation [2022-04-14 18:23:52,899 WARN L170 areAnnotationChecker]: L1185 has no Hoare annotation [2022-04-14 18:23:52,899 WARN L170 areAnnotationChecker]: L1185 has no Hoare annotation [2022-04-14 18:23:52,899 WARN L170 areAnnotationChecker]: L1625 has no Hoare annotation [2022-04-14 18:23:52,899 WARN L170 areAnnotationChecker]: L1625 has no Hoare annotation [2022-04-14 18:23:52,899 WARN L170 areAnnotationChecker]: L1624-1 has no Hoare annotation [2022-04-14 18:23:52,899 WARN L170 areAnnotationChecker]: L1351 has no Hoare annotation [2022-04-14 18:23:52,899 WARN L170 areAnnotationChecker]: L1351 has no Hoare annotation [2022-04-14 18:23:52,899 WARN L170 areAnnotationChecker]: L1360 has no Hoare annotation [2022-04-14 18:23:52,899 WARN L170 areAnnotationChecker]: L1360 has no Hoare annotation [2022-04-14 18:23:52,899 WARN L170 areAnnotationChecker]: L1188 has no Hoare annotation [2022-04-14 18:23:52,899 WARN L170 areAnnotationChecker]: L1188 has no Hoare annotation [2022-04-14 18:23:52,899 WARN L170 areAnnotationChecker]: L1626 has no Hoare annotation [2022-04-14 18:23:52,900 WARN L170 areAnnotationChecker]: L1626 has no Hoare annotation [2022-04-14 18:23:52,900 WARN L170 areAnnotationChecker]: L1351-2 has no Hoare annotation [2022-04-14 18:23:52,900 WARN L170 areAnnotationChecker]: L1360-2 has no Hoare annotation [2022-04-14 18:23:52,900 WARN L170 areAnnotationChecker]: L1364 has no Hoare annotation [2022-04-14 18:23:52,900 WARN L170 areAnnotationChecker]: L1364 has no Hoare annotation [2022-04-14 18:23:52,900 WARN L170 areAnnotationChecker]: L1192 has no Hoare annotation [2022-04-14 18:23:52,900 WARN L170 areAnnotationChecker]: L1191 has no Hoare annotation [2022-04-14 18:23:52,900 WARN L170 areAnnotationChecker]: L1191 has no Hoare annotation [2022-04-14 18:23:52,900 WARN L170 areAnnotationChecker]: L1628 has no Hoare annotation [2022-04-14 18:23:52,900 WARN L170 areAnnotationChecker]: L1628 has no Hoare annotation [2022-04-14 18:23:52,900 WARN L170 areAnnotationChecker]: L1626-2 has no Hoare annotation [2022-04-14 18:23:52,900 WARN L170 areAnnotationChecker]: L1626-2 has no Hoare annotation [2022-04-14 18:23:52,900 WARN L170 areAnnotationChecker]: L1364-2 has no Hoare annotation [2022-04-14 18:23:52,900 WARN L170 areAnnotationChecker]: L1364-2 has no Hoare annotation [2022-04-14 18:23:52,900 WARN L170 areAnnotationChecker]: L1381 has no Hoare annotation [2022-04-14 18:23:52,900 WARN L170 areAnnotationChecker]: L1381 has no Hoare annotation [2022-04-14 18:23:52,900 WARN L170 areAnnotationChecker]: L1194 has no Hoare annotation [2022-04-14 18:23:52,900 WARN L170 areAnnotationChecker]: L1194 has no Hoare annotation [2022-04-14 18:23:52,900 WARN L170 areAnnotationChecker]: L1637 has no Hoare annotation [2022-04-14 18:23:52,900 WARN L170 areAnnotationChecker]: L1637 has no Hoare annotation [2022-04-14 18:23:52,900 WARN L170 areAnnotationChecker]: L1381-2 has no Hoare annotation [2022-04-14 18:23:52,901 WARN L170 areAnnotationChecker]: L1381-2 has no Hoare annotation [2022-04-14 18:23:52,901 WARN L170 areAnnotationChecker]: L1198 has no Hoare annotation [2022-04-14 18:23:52,901 WARN L170 areAnnotationChecker]: L1197 has no Hoare annotation [2022-04-14 18:23:52,901 WARN L170 areAnnotationChecker]: L1197 has no Hoare annotation [2022-04-14 18:23:52,901 WARN L170 areAnnotationChecker]: L1393 has no Hoare annotation [2022-04-14 18:23:52,901 WARN L170 areAnnotationChecker]: L1393 has no Hoare annotation [2022-04-14 18:23:52,901 WARN L170 areAnnotationChecker]: L1403 has no Hoare annotation [2022-04-14 18:23:52,901 WARN L170 areAnnotationChecker]: L1403 has no Hoare annotation [2022-04-14 18:23:52,901 WARN L170 areAnnotationChecker]: L1200 has no Hoare annotation [2022-04-14 18:23:52,901 WARN L170 areAnnotationChecker]: L1200 has no Hoare annotation [2022-04-14 18:23:52,901 WARN L170 areAnnotationChecker]: L1404 has no Hoare annotation [2022-04-14 18:23:52,901 WARN L170 areAnnotationChecker]: L1404 has no Hoare annotation [2022-04-14 18:23:52,901 WARN L170 areAnnotationChecker]: L1408 has no Hoare annotation [2022-04-14 18:23:52,901 WARN L170 areAnnotationChecker]: L1408 has no Hoare annotation [2022-04-14 18:23:52,901 WARN L170 areAnnotationChecker]: L1204 has no Hoare annotation [2022-04-14 18:23:52,901 WARN L170 areAnnotationChecker]: L1203 has no Hoare annotation [2022-04-14 18:23:52,901 WARN L170 areAnnotationChecker]: L1203 has no Hoare annotation [2022-04-14 18:23:52,901 WARN L170 areAnnotationChecker]: L1419 has no Hoare annotation [2022-04-14 18:23:52,901 WARN L170 areAnnotationChecker]: L1419 has no Hoare annotation [2022-04-14 18:23:52,901 WARN L170 areAnnotationChecker]: L1206 has no Hoare annotation [2022-04-14 18:23:52,902 WARN L170 areAnnotationChecker]: L1206 has no Hoare annotation [2022-04-14 18:23:52,902 WARN L170 areAnnotationChecker]: L1424 has no Hoare annotation [2022-04-14 18:23:52,902 WARN L170 areAnnotationChecker]: L1424 has no Hoare annotation [2022-04-14 18:23:52,902 WARN L170 areAnnotationChecker]: L1216 has no Hoare annotation [2022-04-14 18:23:52,902 WARN L170 areAnnotationChecker]: L1209 has no Hoare annotation [2022-04-14 18:23:52,902 WARN L170 areAnnotationChecker]: L1209 has no Hoare annotation [2022-04-14 18:23:52,902 WARN L170 areAnnotationChecker]: L1424-2 has no Hoare annotation [2022-04-14 18:23:52,902 WARN L170 areAnnotationChecker]: L1436 has no Hoare annotation [2022-04-14 18:23:52,902 WARN L170 areAnnotationChecker]: L1436 has no Hoare annotation [2022-04-14 18:23:52,902 WARN L170 areAnnotationChecker]: L1212 has no Hoare annotation [2022-04-14 18:23:52,902 WARN L170 areAnnotationChecker]: L1212 has no Hoare annotation [2022-04-14 18:23:52,902 WARN L170 areAnnotationChecker]: L1215 has no Hoare annotation [2022-04-14 18:23:52,902 WARN L170 areAnnotationChecker]: L1215 has no Hoare annotation [2022-04-14 18:23:52,902 WARN L170 areAnnotationChecker]: L1218 has no Hoare annotation [2022-04-14 18:23:52,902 WARN L170 areAnnotationChecker]: L1218 has no Hoare annotation [2022-04-14 18:23:52,902 WARN L170 areAnnotationChecker]: L1222 has no Hoare annotation [2022-04-14 18:23:52,902 WARN L170 areAnnotationChecker]: L1221 has no Hoare annotation [2022-04-14 18:23:52,902 WARN L170 areAnnotationChecker]: L1221 has no Hoare annotation [2022-04-14 18:23:52,902 WARN L170 areAnnotationChecker]: L1447 has no Hoare annotation [2022-04-14 18:23:52,902 WARN L170 areAnnotationChecker]: L1447 has no Hoare annotation [2022-04-14 18:23:52,903 WARN L170 areAnnotationChecker]: L1224 has no Hoare annotation [2022-04-14 18:23:52,903 WARN L170 areAnnotationChecker]: L1224 has no Hoare annotation [2022-04-14 18:23:52,903 WARN L170 areAnnotationChecker]: L1453 has no Hoare annotation [2022-04-14 18:23:52,903 WARN L170 areAnnotationChecker]: L1453 has no Hoare annotation [2022-04-14 18:23:52,903 WARN L170 areAnnotationChecker]: L1228 has no Hoare annotation [2022-04-14 18:23:52,903 WARN L170 areAnnotationChecker]: L1227 has no Hoare annotation [2022-04-14 18:23:52,903 WARN L170 areAnnotationChecker]: L1227 has no Hoare annotation [2022-04-14 18:23:52,903 WARN L170 areAnnotationChecker]: L1453-2 has no Hoare annotation [2022-04-14 18:23:52,903 WARN L170 areAnnotationChecker]: L1464 has no Hoare annotation [2022-04-14 18:23:52,903 WARN L170 areAnnotationChecker]: L1464 has no Hoare annotation [2022-04-14 18:23:52,903 WARN L170 areAnnotationChecker]: L1230 has no Hoare annotation [2022-04-14 18:23:52,903 WARN L170 areAnnotationChecker]: L1230 has no Hoare annotation [2022-04-14 18:23:52,903 WARN L170 areAnnotationChecker]: L1234 has no Hoare annotation [2022-04-14 18:23:52,903 WARN L170 areAnnotationChecker]: L1233 has no Hoare annotation [2022-04-14 18:23:52,903 WARN L170 areAnnotationChecker]: L1233 has no Hoare annotation [2022-04-14 18:23:52,903 WARN L170 areAnnotationChecker]: L1476 has no Hoare annotation [2022-04-14 18:23:52,903 WARN L170 areAnnotationChecker]: L1476 has no Hoare annotation [2022-04-14 18:23:52,903 WARN L170 areAnnotationChecker]: L1236 has no Hoare annotation [2022-04-14 18:23:52,903 WARN L170 areAnnotationChecker]: L1236 has no Hoare annotation [2022-04-14 18:23:52,904 WARN L170 areAnnotationChecker]: L1484 has no Hoare annotation [2022-04-14 18:23:52,904 WARN L170 areAnnotationChecker]: L1484 has no Hoare annotation [2022-04-14 18:23:52,904 WARN L170 areAnnotationChecker]: L1240 has no Hoare annotation [2022-04-14 18:23:52,904 WARN L170 areAnnotationChecker]: L1239 has no Hoare annotation [2022-04-14 18:23:52,904 WARN L170 areAnnotationChecker]: L1239 has no Hoare annotation [2022-04-14 18:23:52,904 WARN L170 areAnnotationChecker]: L1484-2 has no Hoare annotation [2022-04-14 18:23:52,904 WARN L170 areAnnotationChecker]: L1484-2 has no Hoare annotation [2022-04-14 18:23:52,904 WARN L170 areAnnotationChecker]: L1505 has no Hoare annotation [2022-04-14 18:23:52,904 WARN L170 areAnnotationChecker]: L1505 has no Hoare annotation [2022-04-14 18:23:52,904 WARN L170 areAnnotationChecker]: L1242 has no Hoare annotation [2022-04-14 18:23:52,904 WARN L170 areAnnotationChecker]: L1242 has no Hoare annotation [2022-04-14 18:23:52,904 WARN L170 areAnnotationChecker]: L1495 has no Hoare annotation [2022-04-14 18:23:52,904 WARN L170 areAnnotationChecker]: L1495 has no Hoare annotation [2022-04-14 18:23:52,904 WARN L170 areAnnotationChecker]: L1512 has no Hoare annotation [2022-04-14 18:23:52,904 WARN L170 areAnnotationChecker]: L1512 has no Hoare annotation [2022-04-14 18:23:52,904 WARN L170 areAnnotationChecker]: L1246 has no Hoare annotation [2022-04-14 18:23:52,904 WARN L170 areAnnotationChecker]: L1245 has no Hoare annotation [2022-04-14 18:23:52,904 WARN L170 areAnnotationChecker]: L1245 has no Hoare annotation [2022-04-14 18:23:52,904 WARN L170 areAnnotationChecker]: L1514 has no Hoare annotation [2022-04-14 18:23:52,905 WARN L170 areAnnotationChecker]: L1514 has no Hoare annotation [2022-04-14 18:23:52,905 WARN L170 areAnnotationChecker]: L1512-1 has no Hoare annotation [2022-04-14 18:23:52,905 WARN L170 areAnnotationChecker]: L1529 has no Hoare annotation [2022-04-14 18:23:52,905 WARN L170 areAnnotationChecker]: L1529 has no Hoare annotation [2022-04-14 18:23:52,905 WARN L170 areAnnotationChecker]: L1248 has no Hoare annotation [2022-04-14 18:23:52,905 WARN L170 areAnnotationChecker]: L1248 has no Hoare annotation [2022-04-14 18:23:52,905 WARN L170 areAnnotationChecker]: L1534 has no Hoare annotation [2022-04-14 18:23:52,905 WARN L170 areAnnotationChecker]: L1534 has no Hoare annotation [2022-04-14 18:23:52,905 WARN L170 areAnnotationChecker]: L1249 has no Hoare annotation [2022-04-14 18:23:52,905 WARN L170 areAnnotationChecker]: L1249 has no Hoare annotation [2022-04-14 18:23:52,905 WARN L170 areAnnotationChecker]: L1251 has no Hoare annotation [2022-04-14 18:23:52,905 WARN L170 areAnnotationChecker]: L1251 has no Hoare annotation [2022-04-14 18:23:52,905 WARN L170 areAnnotationChecker]: L1534-2 has no Hoare annotation [2022-04-14 18:23:52,905 WARN L170 areAnnotationChecker]: L1545 has no Hoare annotation [2022-04-14 18:23:52,905 WARN L170 areAnnotationChecker]: L1545 has no Hoare annotation [2022-04-14 18:23:52,905 WARN L170 areAnnotationChecker]: L1542-1 has no Hoare annotation [2022-04-14 18:23:52,905 WARN L170 areAnnotationChecker]: L1252 has no Hoare annotation [2022-04-14 18:23:52,905 WARN L170 areAnnotationChecker]: L1255 has no Hoare annotation [2022-04-14 18:23:52,905 WARN L170 areAnnotationChecker]: L1558 has no Hoare annotation [2022-04-14 18:23:52,905 WARN L170 areAnnotationChecker]: L1558 has no Hoare annotation [2022-04-14 18:23:52,906 WARN L170 areAnnotationChecker]: L1558-2 has no Hoare annotation [2022-04-14 18:23:52,906 WARN L170 areAnnotationChecker]: L1563 has no Hoare annotation [2022-04-14 18:23:52,906 WARN L170 areAnnotationChecker]: L1563 has no Hoare annotation [2022-04-14 18:23:52,906 WARN L170 areAnnotationChecker]: L1563-2 has no Hoare annotation [2022-04-14 18:23:52,906 WARN L170 areAnnotationChecker]: L1570 has no Hoare annotation [2022-04-14 18:23:52,906 WARN L170 areAnnotationChecker]: L1570 has no Hoare annotation [2022-04-14 18:23:52,906 WARN L170 areAnnotationChecker]: L1570-2 has no Hoare annotation [2022-04-14 18:23:52,906 WARN L170 areAnnotationChecker]: L1578 has no Hoare annotation [2022-04-14 18:23:52,906 WARN L170 areAnnotationChecker]: L1578 has no Hoare annotation [2022-04-14 18:23:52,906 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-14 18:23:52,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 06:23:52 BoogieIcfgContainer [2022-04-14 18:23:52,909 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 18:23:52,910 INFO L158 Benchmark]: Toolchain (without parser) took 47201.87ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 134.0MB in the beginning and 121.6MB in the end (delta: 12.5MB). Peak memory consumption was 114.9MB. Max. memory is 8.0GB. [2022-04-14 18:23:52,911 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 186.6MB. Free memory is still 153.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 18:23:52,911 INFO L158 Benchmark]: CACSL2BoogieTranslator took 622.82ms. Allocated memory is still 186.6MB. Free memory was 133.9MB in the beginning and 144.3MB in the end (delta: -10.4MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. [2022-04-14 18:23:52,912 INFO L158 Benchmark]: Boogie Preprocessor took 143.25ms. Allocated memory is still 186.6MB. Free memory was 144.3MB in the beginning and 134.8MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-14 18:23:52,912 INFO L158 Benchmark]: RCFGBuilder took 2125.49ms. Allocated memory is still 186.6MB. Free memory was 134.8MB in the beginning and 131.4MB in the end (delta: 3.4MB). Peak memory consumption was 79.4MB. Max. memory is 8.0GB. [2022-04-14 18:23:52,912 INFO L158 Benchmark]: TraceAbstraction took 44305.03ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 130.9MB in the beginning and 121.6MB in the end (delta: 9.3MB). Peak memory consumption was 111.0MB. Max. memory is 8.0GB. [2022-04-14 18:23:52,913 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.11ms. Allocated memory is still 186.6MB. Free memory is still 153.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 622.82ms. Allocated memory is still 186.6MB. Free memory was 133.9MB in the beginning and 144.3MB in the end (delta: -10.4MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 143.25ms. Allocated memory is still 186.6MB. Free memory was 144.3MB in the beginning and 134.8MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * RCFGBuilder took 2125.49ms. Allocated memory is still 186.6MB. Free memory was 134.8MB in the beginning and 131.4MB in the end (delta: 3.4MB). Peak memory consumption was 79.4MB. Max. memory is 8.0GB. * TraceAbstraction took 44305.03ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 130.9MB in the beginning and 121.6MB in the end (delta: 9.3MB). Peak memory consumption was 111.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1665]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 1360. Possible FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_client_data ; VAL [\old(init)=4294967300, \old(SSLv3_client_data)=null, \old(SSLv3_client_data)=null, init=1, SSLv3_client_data={4:0}] [L1077] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1081] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1082] s->ctx = malloc(sizeof(SSL_CTX)) [L1083] s->session = malloc(sizeof(SSL_SESSION)) [L1084] s->state = 12292 [L1085] s->version = __VERIFIER_nondet_int() [L1087] s->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1088] EXPR s->ctx [L1088] (s->ctx)->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1089] s->init_buf = (BUF_MEM *)__VERIFIER_nondet_ulong() [L1090] s->bbio = (BIO *) __VERIFIER_nondet_ulong() [L1091] s->wbio = (BIO *) __VERIFIER_nondet_ulong() [L1092] EXPR s->s3 [L1092] (s->s3)->flags = __VERIFIER_nondet_long() [L1093] EXPR s->s3 [L1093] (s->s3)->tmp.cert_req = __VERIFIER_nondet_int() [L1094] EXPR s->s3 [L1094] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1095] EXPR s->s3 [L1095] EXPR (s->s3)->tmp.new_cipher [L1095] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1096] EXPR s->s3 [L1096] (s->s3)->tmp.next_state = __VERIFIER_nondet_int() [L1098] CALL ssl3_connect(s) VAL [init=1, s={-10:0}, SSLv3_client_data={4:0}] [L1104] BUF_MEM *buf ; [L1105] unsigned long tmp ; [L1106] unsigned long l ; [L1107] long num1 ; [L1108] void (*cb)() ; [L1109] int ret ; [L1110] int new_state ; [L1111] int state ; [L1112] int skip ; [L1113] int tmp___1 = __VERIFIER_nondet_int() ; [L1114] int tmp___2 = __VERIFIER_nondet_int() ; [L1115] int tmp___3 = __VERIFIER_nondet_int() ; [L1116] int tmp___4 = __VERIFIER_nondet_int() ; [L1117] int tmp___5 = __VERIFIER_nondet_int() ; [L1118] int tmp___6 = __VERIFIER_nondet_int() ; [L1119] int tmp___7 = __VERIFIER_nondet_int() ; [L1120] int tmp___8 = __VERIFIER_nondet_int() ; [L1121] long tmp___9 = __VERIFIER_nondet_long() ; [L1122] int blastFlag ; [L1125] blastFlag = 0 [L1126] s->hit=__VERIFIER_nondet_int () [L1127] s->state = 12292 [L1128] tmp = __VERIFIER_nondet_int() [L1129] cb = (void (*)())((void *)0) [L1130] ret = -1 [L1131] skip = 0 [L1132] EXPR s->info_callback VAL [={0:0}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, s->info_callback={0:-6}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1132] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1133] EXPR s->info_callback [L1133] cb = s->info_callback [L1141] EXPR s->in_handshake [L1141] s->in_handshake += 1 [L1142] COND FALSE !(tmp___1 & 12288) VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, s->state=12292, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1155] COND TRUE s->state == 12292 [L1258] s->new_session = 1 [L1259] s->state = 4096 [L1260] EXPR s->ctx [L1260] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1260] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1265] s->server = 0 VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1266] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1271] EXPR s->version VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, s->version=-5, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1271] COND FALSE !((s->version & 65280) != 768) [L1277] s->type = 4096 [L1278] EXPR s->init_buf VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, s->init_buf={0:15}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1278] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1296] COND FALSE !(! tmp___4) VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1302] COND FALSE !(! tmp___5) [L1308] s->state = 4368 [L1309] EXPR s->ctx [L1309] EXPR (s->ctx)->stats.sess_connect [L1309] (s->ctx)->stats.sess_connect += 1 [L1310] s->init_num = 0 VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:-6}, (s->s3)->tmp.reuse_message=4294967343, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, s->s3={-9:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1170] COND TRUE s->state == 4368 [L1314] s->shutdown = 0 [L1315] ret = __VERIFIER_nondet_int() [L1316] COND TRUE blastFlag == 0 [L1317] blastFlag = 1 VAL [={0:-6}, blastFlag=1, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1325] COND FALSE !(ret <= 0) [L1330] s->state = 4384 [L1331] s->init_num = 0 [L1332] EXPR s->bbio [L1332] EXPR s->wbio VAL [={0:-6}, blastFlag=1, init=1, ret=1, s={-10:0}, s={-10:0}, s->bbio={0:-11}, s->wbio={0:-13}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1332] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:-6}, (s->s3)->tmp.reuse_message=4294967343, blastFlag=1, init=1, ret=1, s={-10:0}, s={-10:0}, s->s3={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:-6}, blastFlag=1, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-6}, blastFlag=1, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-6}, blastFlag=1, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:-6}, blastFlag=1, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:-6}, blastFlag=1, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:-6}, blastFlag=1, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:-6}, blastFlag=1, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:-6}, blastFlag=1, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state VAL [={0:-6}, blastFlag=1, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state VAL [={0:-6}, blastFlag=1, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1176] COND TRUE s->state == 4384 [L1340] ret = __VERIFIER_nondet_int() [L1341] COND TRUE blastFlag == 1 [L1342] blastFlag = 2 VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1346] COND FALSE !(ret <= 0) [L1351] s->hit VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, s->hit=0, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1351] COND FALSE !(s->hit) [L1354] s->state = 4400 VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1356] s->init_num = 0 VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:-6}, (s->s3)->tmp.reuse_message=4294967343, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, s->s3={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1182] COND TRUE s->state == 4400 [L1360] EXPR s->s3 [L1360] EXPR (s->s3)->tmp.new_cipher [L1360] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:-6}, ((s->s3)->tmp.new_cipher)->algorithms=4294967346, (s->s3)->tmp.new_cipher={-8:0}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, s->s3={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1360] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1363] ret = __VERIFIER_nondet_int() [L1364] COND TRUE blastFlag == 2 [L1365] blastFlag = 3 VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1369] COND FALSE !(ret <= 0) VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1375] s->state = 4416 [L1376] s->init_num = 0 VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:-6}, (s->s3)->tmp.reuse_message=4294967343, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, s->s3={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1182] COND FALSE !(s->state == 4400) [L1185] EXPR s->state VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1185] COND FALSE !(s->state == 4401) [L1188] EXPR s->state VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1188] COND TRUE s->state == 4416 [L1380] ret = __VERIFIER_nondet_int() [L1381] COND TRUE blastFlag == 3 [L1382] blastFlag = 4 VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1386] COND FALSE !(ret <= 0) [L1391] s->state = 4432 [L1392] s->init_num = 0 VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1393] COND FALSE !(! tmp___6) VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:-6}, (s->s3)->tmp.reuse_message=4294967343, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, s->s3={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1182] COND FALSE !(s->state == 4400) [L1185] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1185] COND FALSE !(s->state == 4401) [L1188] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1188] COND FALSE !(s->state == 4416) [L1191] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1191] COND FALSE !(s->state == 4417) [L1194] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1194] COND TRUE s->state == 4432 [L1402] ret = __VERIFIER_nondet_int() [L1403] COND TRUE blastFlag == 4 VAL [={0:-6}, blastFlag=4, init=1, ret=0, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1665] reach_error() VAL [={0:-6}, blastFlag=4, init=1, ret=0, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 169 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 44.1s, OverallIterations: 12, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 37.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 11 mSolverCounterUnknown, 772 SdHoareTripleChecker+Valid, 25.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 772 mSDsluCounter, 4668 SdHoareTripleChecker+Invalid, 25.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2482 mSDsCounter, 151 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3574 IncrementalHoareTripleChecker+Invalid, 3736 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 151 mSolverCounterUnsat, 2186 mSDtfsCounter, 3574 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=563occurred in iteration=11, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 380 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 873 NumberOfCodeBlocks, 873 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 744 ConstructedInterpolants, 0 QuantifiedInterpolants, 1703 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 410/410 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-04-14 18:23:52,967 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...