/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_srvr.blast.01.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 16:10:38,514 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 16:10:38,515 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 16:10:38,539 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 16:10:38,539 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 16:10:38,540 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 16:10:38,540 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 16:10:38,542 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 16:10:38,543 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 16:10:38,543 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 16:10:38,544 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 16:10:38,545 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 16:10:38,545 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 16:10:38,546 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 16:10:38,546 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 16:10:38,547 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 16:10:38,547 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 16:10:38,548 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 16:10:38,549 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 16:10:38,550 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 16:10:38,551 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 16:10:38,552 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 16:10:38,552 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 16:10:38,553 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 16:10:38,553 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 16:10:38,555 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 16:10:38,555 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 16:10:38,556 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 16:10:38,556 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 16:10:38,556 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 16:10:38,557 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 16:10:38,557 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 16:10:38,557 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 16:10:38,558 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 16:10:38,558 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 16:10:38,559 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 16:10:38,559 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 16:10:38,559 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 16:10:38,559 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 16:10:38,560 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 16:10:38,560 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 16:10:38,562 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 16:10:38,562 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-07 16:10:38,588 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 16:10:38,588 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 16:10:38,588 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-07 16:10:38,589 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-07 16:10:38,589 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 16:10:38,589 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 16:10:38,590 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 16:10:38,590 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 16:10:38,590 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 16:10:38,591 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 16:10:38,591 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 16:10:38,591 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 16:10:38,591 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 16:10:38,591 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 16:10:38,591 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 16:10:38,591 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 16:10:38,591 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 16:10:38,591 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 16:10:38,591 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 16:10:38,591 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 16:10:38,592 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 16:10:38,592 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 16:10:38,592 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 16:10:38,592 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 16:10:38,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 16:10:38,592 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 16:10:38,592 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 16:10:38,592 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 16:10:38,592 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 16:10:38,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 16:10:38,593 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-07 16:10:38,593 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-07 16:10:38,593 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 16:10:38,593 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-07 16:10:38,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 16:10:38,794 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 16:10:38,795 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 16:10:38,796 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 16:10:38,796 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 16:10:38,797 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.01.i.cil-2.c [2022-04-07 16:10:38,832 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01a46c3e6/57c463612b21403ab74163deca9fb345/FLAG6c2fa39b2 [2022-04-07 16:10:39,315 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 16:10:39,316 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.01.i.cil-2.c [2022-04-07 16:10:39,340 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01a46c3e6/57c463612b21403ab74163deca9fb345/FLAG6c2fa39b2 [2022-04-07 16:10:39,356 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01a46c3e6/57c463612b21403ab74163deca9fb345 [2022-04-07 16:10:39,367 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 16:10:39,368 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 16:10:39,370 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 16:10:39,370 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 16:10:39,372 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 16:10:39,374 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 04:10:39" (1/1) ... [2022-04-07 16:10:39,375 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5142feb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:10:39, skipping insertion in model container [2022-04-07 16:10:39,375 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 04:10:39" (1/1) ... [2022-04-07 16:10:39,380 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 16:10:39,426 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 16:10:39,670 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.01.i.cil-2.c[72913,72926] [2022-04-07 16:10:39,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 16:10:39,684 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 16:10:39,755 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.01.i.cil-2.c[72913,72926] [2022-04-07 16:10:39,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 16:10:39,768 INFO L208 MainTranslator]: Completed translation [2022-04-07 16:10:39,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:10:39 WrapperNode [2022-04-07 16:10:39,769 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 16:10:39,769 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 16:10:39,769 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 16:10:39,769 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 16:10:39,776 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:10:39" (1/1) ... [2022-04-07 16:10:39,776 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:10:39" (1/1) ... [2022-04-07 16:10:39,789 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:10:39" (1/1) ... [2022-04-07 16:10:39,789 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:10:39" (1/1) ... [2022-04-07 16:10:39,824 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:10:39" (1/1) ... [2022-04-07 16:10:39,829 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:10:39" (1/1) ... [2022-04-07 16:10:39,831 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:10:39" (1/1) ... [2022-04-07 16:10:39,836 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 16:10:39,843 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 16:10:39,843 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 16:10:39,843 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 16:10:39,844 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:10:39" (1/1) ... [2022-04-07 16:10:39,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 16:10:39,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 16:10:39,867 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-07 16:10:39,874 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-07 16:10:39,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 16:10:39,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 16:10:39,901 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 16:10:39,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-07 16:10:39,903 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-07 16:10:39,903 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 16:10:39,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-07 16:10:39,903 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-07 16:10:39,903 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-07 16:10:39,903 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-07 16:10:39,903 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 16:10:39,903 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 16:10:39,904 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 16:10:39,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 16:10:39,906 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-07 16:10:39,906 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-07 16:10:39,906 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 16:10:39,907 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-07 16:10:39,907 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-07 16:10:39,907 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-07 16:10:39,907 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-07 16:10:39,907 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-07 16:10:39,907 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-07 16:10:39,907 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-07 16:10:39,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-07 16:10:39,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-07 16:10:39,907 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 16:10:39,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-07 16:10:39,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 16:10:39,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-07 16:10:39,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 16:10:39,907 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-07 16:10:39,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-07 16:10:39,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 16:10:39,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 16:10:39,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 16:10:39,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-07 16:10:39,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-07 16:10:39,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-07 16:10:39,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-07 16:10:39,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 16:10:40,016 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 16:10:40,023 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 16:10:42,326 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-07 16:10:42,729 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-07 16:10:42,729 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-07 16:10:42,739 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 16:10:42,747 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 16:10:42,747 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 16:10:42,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 04:10:42 BoogieIcfgContainer [2022-04-07 16:10:42,749 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 16:10:42,750 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 16:10:42,750 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 16:10:42,752 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 16:10:42,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 04:10:39" (1/3) ... [2022-04-07 16:10:42,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55bab136 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 04:10:42, skipping insertion in model container [2022-04-07 16:10:42,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:10:39" (2/3) ... [2022-04-07 16:10:42,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55bab136 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 04:10:42, skipping insertion in model container [2022-04-07 16:10:42,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 04:10:42" (3/3) ... [2022-04-07 16:10:42,756 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.01.i.cil-2.c [2022-04-07 16:10:42,761 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 16:10:42,761 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 16:10:42,803 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 16:10:42,821 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-07 16:10:42,821 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 16:10:42,838 INFO L276 IsEmpty]: Start isEmpty. Operand has 155 states, 147 states have (on average 1.6870748299319729) internal successors, (248), 148 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 16:10:42,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-07 16:10:42,845 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:10:42,846 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:10:42,846 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:10:42,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:10:42,849 INFO L85 PathProgramCache]: Analyzing trace with hash 740864289, now seen corresponding path program 1 times [2022-04-07 16:10:42,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:10:42,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110253318] [2022-04-07 16:10:42,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:42,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:10:43,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:43,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:10:43,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:43,346 INFO L290 TraceCheckUtils]: 0: Hoare triple {165#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {158#true} is VALID [2022-04-07 16:10:43,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {158#true} assume true; {158#true} is VALID [2022-04-07 16:10:43,347 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {158#true} {158#true} #664#return; {158#true} is VALID [2022-04-07 16:10:43,349 INFO L272 TraceCheckUtils]: 0: Hoare triple {158#true} call ULTIMATE.init(); {165#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:10:43,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {165#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {158#true} is VALID [2022-04-07 16:10:43,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {158#true} assume true; {158#true} is VALID [2022-04-07 16:10:43,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {158#true} {158#true} #664#return; {158#true} is VALID [2022-04-07 16:10:43,350 INFO L272 TraceCheckUtils]: 4: Hoare triple {158#true} call #t~ret162 := main(); {158#true} is VALID [2022-04-07 16:10:43,350 INFO L290 TraceCheckUtils]: 5: Hoare triple {158#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(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(8464, ~s~0.base, 52 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {158#true} is VALID [2022-04-07 16:10:43,350 INFO L290 TraceCheckUtils]: 6: Hoare triple {158#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {158#true} is VALID [2022-04-07 16:10:43,350 INFO L272 TraceCheckUtils]: 7: Hoare triple {158#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {158#true} is VALID [2022-04-07 16:10:43,353 INFO L290 TraceCheckUtils]: 8: Hoare triple {158#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:10:43,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:10:43,359 INFO L290 TraceCheckUtils]: 10: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:10:43,359 INFO L290 TraceCheckUtils]: 11: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:10:43,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:10:43,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:10:43,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:10:43,361 INFO L290 TraceCheckUtils]: 15: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:10:43,362 INFO L290 TraceCheckUtils]: 16: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:10:43,362 INFO L290 TraceCheckUtils]: 17: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:10:43,363 INFO L290 TraceCheckUtils]: 18: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:10:43,363 INFO L290 TraceCheckUtils]: 19: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:10:43,364 INFO L290 TraceCheckUtils]: 20: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:10:43,364 INFO L290 TraceCheckUtils]: 21: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:10:43,365 INFO L290 TraceCheckUtils]: 22: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:10:43,366 INFO L290 TraceCheckUtils]: 23: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {164#(= 8464 |ssl3_accept_#t~mem50|)} is VALID [2022-04-07 16:10:43,367 INFO L290 TraceCheckUtils]: 24: Hoare triple {164#(= 8464 |ssl3_accept_#t~mem50|)} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-07 16:10:43,367 INFO L290 TraceCheckUtils]: 25: Hoare triple {159#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-07 16:10:43,367 INFO L290 TraceCheckUtils]: 26: Hoare triple {159#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-07 16:10:43,367 INFO L290 TraceCheckUtils]: 27: Hoare triple {159#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-07 16:10:43,367 INFO L290 TraceCheckUtils]: 28: Hoare triple {159#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-07 16:10:43,367 INFO L290 TraceCheckUtils]: 29: Hoare triple {159#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-07 16:10:43,368 INFO L290 TraceCheckUtils]: 30: Hoare triple {159#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-07 16:10:43,368 INFO L290 TraceCheckUtils]: 31: Hoare triple {159#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-07 16:10:43,368 INFO L290 TraceCheckUtils]: 32: Hoare triple {159#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-07 16:10:43,368 INFO L290 TraceCheckUtils]: 33: Hoare triple {159#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-07 16:10:43,368 INFO L290 TraceCheckUtils]: 34: Hoare triple {159#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-07 16:10:43,368 INFO L290 TraceCheckUtils]: 35: Hoare triple {159#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-07 16:10:43,368 INFO L290 TraceCheckUtils]: 36: Hoare triple {159#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-07 16:10:43,369 INFO L290 TraceCheckUtils]: 37: Hoare triple {159#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-07 16:10:43,369 INFO L290 TraceCheckUtils]: 38: Hoare triple {159#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-07 16:10:43,369 INFO L290 TraceCheckUtils]: 39: Hoare triple {159#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-07 16:10:43,369 INFO L290 TraceCheckUtils]: 40: Hoare triple {159#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-07 16:10:43,369 INFO L290 TraceCheckUtils]: 41: Hoare triple {159#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-07 16:10:43,369 INFO L290 TraceCheckUtils]: 42: Hoare triple {159#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-07 16:10:43,369 INFO L290 TraceCheckUtils]: 43: Hoare triple {159#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-07 16:10:43,370 INFO L290 TraceCheckUtils]: 44: Hoare triple {159#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-07 16:10:43,370 INFO L290 TraceCheckUtils]: 45: Hoare triple {159#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-07 16:10:43,370 INFO L290 TraceCheckUtils]: 46: Hoare triple {159#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-07 16:10:43,370 INFO L290 TraceCheckUtils]: 47: Hoare triple {159#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {159#false} is VALID [2022-04-07 16:10:43,370 INFO L290 TraceCheckUtils]: 48: Hoare triple {159#false} assume 8672 == #t~mem74;havoc #t~mem74; {159#false} is VALID [2022-04-07 16:10:43,370 INFO L290 TraceCheckUtils]: 49: Hoare triple {159#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {159#false} is VALID [2022-04-07 16:10:43,370 INFO L290 TraceCheckUtils]: 50: Hoare triple {159#false} assume 4 == ~blastFlag~0; {159#false} is VALID [2022-04-07 16:10:43,371 INFO L290 TraceCheckUtils]: 51: Hoare triple {159#false} assume !false; {159#false} is VALID [2022-04-07 16:10:43,371 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-07 16:10:43,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:10:43,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110253318] [2022-04-07 16:10:43,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110253318] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:10:43,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:10:43,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:10:43,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670987777] [2022-04-07 16:10:43,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:10:43,377 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-07 16:10:43,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:10:43,380 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:43,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:10:43,429 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:10:43,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:10:43,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:10:43,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:10:43,461 INFO L87 Difference]: Start difference. First operand has 155 states, 147 states have (on average 1.6870748299319729) internal successors, (248), 148 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:45,501 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-07 16:10:46,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:46,580 INFO L93 Difference]: Finished difference Result 328 states and 543 transitions. [2022-04-07 16:10:46,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:10:46,581 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-07 16:10:46,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:10:46,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:46,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 543 transitions. [2022-04-07 16:10:46,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:46,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 543 transitions. [2022-04-07 16:10:46,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 543 transitions. [2022-04-07 16:10:46,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 543 edges. 543 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:10:47,004 INFO L225 Difference]: With dead ends: 328 [2022-04-07 16:10:47,004 INFO L226 Difference]: Without dead ends: 167 [2022-04-07 16:10:47,006 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-07 16:10:47,008 INFO L913 BasicCegarLoop]: 221 mSDtfsCounter, 33 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-07 16:10:47,008 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 583 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 403 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-07 16:10:47,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-04-07 16:10:47,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 150. [2022-04-07 16:10:47,031 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:10:47,032 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand has 150 states, 145 states have (on average 1.5379310344827586) internal successors, (223), 145 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:47,033 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand has 150 states, 145 states have (on average 1.5379310344827586) internal successors, (223), 145 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:47,034 INFO L87 Difference]: Start difference. First operand 167 states. Second operand has 150 states, 145 states have (on average 1.5379310344827586) internal successors, (223), 145 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:47,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:47,039 INFO L93 Difference]: Finished difference Result 167 states and 248 transitions. [2022-04-07 16:10:47,039 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 248 transitions. [2022-04-07 16:10:47,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:47,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:47,040 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 145 states have (on average 1.5379310344827586) internal successors, (223), 145 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 167 states. [2022-04-07 16:10:47,041 INFO L87 Difference]: Start difference. First operand has 150 states, 145 states have (on average 1.5379310344827586) internal successors, (223), 145 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 167 states. [2022-04-07 16:10:47,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:47,045 INFO L93 Difference]: Finished difference Result 167 states and 248 transitions. [2022-04-07 16:10:47,045 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 248 transitions. [2022-04-07 16:10:47,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:47,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:47,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:10:47,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:10:47,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 145 states have (on average 1.5379310344827586) internal successors, (223), 145 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:47,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 227 transitions. [2022-04-07 16:10:47,051 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 227 transitions. Word has length 52 [2022-04-07 16:10:47,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:10:47,051 INFO L478 AbstractCegarLoop]: Abstraction has 150 states and 227 transitions. [2022-04-07 16:10:47,051 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:47,052 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 227 transitions. [2022-04-07 16:10:47,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-07 16:10:47,053 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:10:47,053 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:10:47,053 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 16:10:47,053 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:10:47,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:10:47,054 INFO L85 PathProgramCache]: Analyzing trace with hash -444444622, now seen corresponding path program 1 times [2022-04-07 16:10:47,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:10:47,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853656003] [2022-04-07 16:10:47,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:47,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:10:47,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:47,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:10:47,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:47,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {1084#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {1077#true} is VALID [2022-04-07 16:10:47,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {1077#true} assume true; {1077#true} is VALID [2022-04-07 16:10:47,183 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1077#true} {1077#true} #664#return; {1077#true} is VALID [2022-04-07 16:10:47,184 INFO L272 TraceCheckUtils]: 0: Hoare triple {1077#true} call ULTIMATE.init(); {1084#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:10:47,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {1084#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {1077#true} is VALID [2022-04-07 16:10:47,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {1077#true} assume true; {1077#true} is VALID [2022-04-07 16:10:47,184 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1077#true} {1077#true} #664#return; {1077#true} is VALID [2022-04-07 16:10:47,185 INFO L272 TraceCheckUtils]: 4: Hoare triple {1077#true} call #t~ret162 := main(); {1077#true} is VALID [2022-04-07 16:10:47,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {1077#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 52 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {1077#true} is VALID [2022-04-07 16:10:47,185 INFO L290 TraceCheckUtils]: 6: Hoare triple {1077#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {1077#true} is VALID [2022-04-07 16:10:47,185 INFO L272 TraceCheckUtils]: 7: Hoare triple {1077#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {1077#true} is VALID [2022-04-07 16:10:47,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {1077#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {1082#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:10:47,187 INFO L290 TraceCheckUtils]: 9: Hoare triple {1082#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {1082#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:10:47,187 INFO L290 TraceCheckUtils]: 10: Hoare triple {1082#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {1082#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:10:47,188 INFO L290 TraceCheckUtils]: 11: Hoare triple {1082#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {1082#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:10:47,188 INFO L290 TraceCheckUtils]: 12: Hoare triple {1082#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {1082#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:10:47,189 INFO L290 TraceCheckUtils]: 13: Hoare triple {1082#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {1082#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:10:47,189 INFO L290 TraceCheckUtils]: 14: Hoare triple {1082#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {1082#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:10:47,190 INFO L290 TraceCheckUtils]: 15: Hoare triple {1082#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {1082#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:10:47,190 INFO L290 TraceCheckUtils]: 16: Hoare triple {1082#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {1082#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:10:47,191 INFO L290 TraceCheckUtils]: 17: Hoare triple {1082#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {1082#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:10:47,193 INFO L290 TraceCheckUtils]: 18: Hoare triple {1082#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {1082#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:10:47,193 INFO L290 TraceCheckUtils]: 19: Hoare triple {1082#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {1082#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:10:47,194 INFO L290 TraceCheckUtils]: 20: Hoare triple {1082#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {1083#(not (= |ssl3_accept_#t~mem47| 8480))} is VALID [2022-04-07 16:10:47,194 INFO L290 TraceCheckUtils]: 21: Hoare triple {1083#(not (= |ssl3_accept_#t~mem47| 8480))} assume 8480 == #t~mem47;havoc #t~mem47; {1078#false} is VALID [2022-04-07 16:10:47,194 INFO L290 TraceCheckUtils]: 22: Hoare triple {1078#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet87 && #t~nondet87 <= 2147483647;~ret~0 := #t~nondet87;havoc #t~nondet87; {1078#false} is VALID [2022-04-07 16:10:47,194 INFO L290 TraceCheckUtils]: 23: Hoare triple {1078#false} assume !(~ret~0 <= 0);call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem88.base, 844 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {1078#false} is VALID [2022-04-07 16:10:47,195 INFO L290 TraceCheckUtils]: 24: Hoare triple {1078#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {1078#false} is VALID [2022-04-07 16:10:47,195 INFO L290 TraceCheckUtils]: 25: Hoare triple {1078#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {1078#false} is VALID [2022-04-07 16:10:47,195 INFO L290 TraceCheckUtils]: 26: Hoare triple {1078#false} ~skip~0 := 0; {1078#false} is VALID [2022-04-07 16:10:47,195 INFO L290 TraceCheckUtils]: 27: Hoare triple {1078#false} assume !false; {1078#false} is VALID [2022-04-07 16:10:47,195 INFO L290 TraceCheckUtils]: 28: Hoare triple {1078#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-07 16:10:47,195 INFO L290 TraceCheckUtils]: 29: Hoare triple {1078#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-07 16:10:47,195 INFO L290 TraceCheckUtils]: 30: Hoare triple {1078#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-07 16:10:47,195 INFO L290 TraceCheckUtils]: 31: Hoare triple {1078#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-07 16:10:47,196 INFO L290 TraceCheckUtils]: 32: Hoare triple {1078#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-07 16:10:47,196 INFO L290 TraceCheckUtils]: 33: Hoare triple {1078#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-07 16:10:47,196 INFO L290 TraceCheckUtils]: 34: Hoare triple {1078#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-07 16:10:47,196 INFO L290 TraceCheckUtils]: 35: Hoare triple {1078#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-07 16:10:47,196 INFO L290 TraceCheckUtils]: 36: Hoare triple {1078#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-07 16:10:47,196 INFO L290 TraceCheckUtils]: 37: Hoare triple {1078#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-07 16:10:47,196 INFO L290 TraceCheckUtils]: 38: Hoare triple {1078#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-07 16:10:47,196 INFO L290 TraceCheckUtils]: 39: Hoare triple {1078#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-07 16:10:47,197 INFO L290 TraceCheckUtils]: 40: Hoare triple {1078#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-07 16:10:47,197 INFO L290 TraceCheckUtils]: 41: Hoare triple {1078#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-07 16:10:47,197 INFO L290 TraceCheckUtils]: 42: Hoare triple {1078#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-07 16:10:47,197 INFO L290 TraceCheckUtils]: 43: Hoare triple {1078#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-07 16:10:47,197 INFO L290 TraceCheckUtils]: 44: Hoare triple {1078#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-07 16:10:47,198 INFO L290 TraceCheckUtils]: 45: Hoare triple {1078#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-07 16:10:47,198 INFO L290 TraceCheckUtils]: 46: Hoare triple {1078#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-07 16:10:47,198 INFO L290 TraceCheckUtils]: 47: Hoare triple {1078#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-07 16:10:47,198 INFO L290 TraceCheckUtils]: 48: Hoare triple {1078#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-07 16:10:47,198 INFO L290 TraceCheckUtils]: 49: Hoare triple {1078#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-07 16:10:47,198 INFO L290 TraceCheckUtils]: 50: Hoare triple {1078#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-07 16:10:47,199 INFO L290 TraceCheckUtils]: 51: Hoare triple {1078#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-07 16:10:47,199 INFO L290 TraceCheckUtils]: 52: Hoare triple {1078#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-07 16:10:47,199 INFO L290 TraceCheckUtils]: 53: Hoare triple {1078#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-07 16:10:47,199 INFO L290 TraceCheckUtils]: 54: Hoare triple {1078#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-07 16:10:47,199 INFO L290 TraceCheckUtils]: 55: Hoare triple {1078#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-07 16:10:47,199 INFO L290 TraceCheckUtils]: 56: Hoare triple {1078#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-07 16:10:47,199 INFO L290 TraceCheckUtils]: 57: Hoare triple {1078#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-07 16:10:47,199 INFO L290 TraceCheckUtils]: 58: Hoare triple {1078#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-07 16:10:47,200 INFO L290 TraceCheckUtils]: 59: Hoare triple {1078#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-07 16:10:47,200 INFO L290 TraceCheckUtils]: 60: Hoare triple {1078#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {1078#false} is VALID [2022-04-07 16:10:47,200 INFO L290 TraceCheckUtils]: 61: Hoare triple {1078#false} assume 8672 == #t~mem74;havoc #t~mem74; {1078#false} is VALID [2022-04-07 16:10:47,200 INFO L290 TraceCheckUtils]: 62: Hoare triple {1078#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {1078#false} is VALID [2022-04-07 16:10:47,200 INFO L290 TraceCheckUtils]: 63: Hoare triple {1078#false} assume 4 == ~blastFlag~0; {1078#false} is VALID [2022-04-07 16:10:47,200 INFO L290 TraceCheckUtils]: 64: Hoare triple {1078#false} assume !false; {1078#false} is VALID [2022-04-07 16:10:47,201 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:10:47,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:10:47,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853656003] [2022-04-07 16:10:47,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853656003] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:10:47,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:10:47,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:10:47,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115891415] [2022-04-07 16:10:47,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:10:47,202 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-07 16:10:47,203 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:10:47,203 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:47,242 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-07 16:10:47,242 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:10:47,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:10:47,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:10:47,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:10:47,243 INFO L87 Difference]: Start difference. First operand 150 states and 227 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:49,264 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-07 16:10:50,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:50,415 INFO L93 Difference]: Finished difference Result 390 states and 595 transitions. [2022-04-07 16:10:50,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:10:50,415 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-07 16:10:50,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:10:50,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:50,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2022-04-07 16:10:50,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:50,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2022-04-07 16:10:50,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 576 transitions. [2022-04-07 16:10:50,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 576 edges. 576 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:10:50,825 INFO L225 Difference]: With dead ends: 390 [2022-04-07 16:10:50,825 INFO L226 Difference]: Without dead ends: 266 [2022-04-07 16:10:50,826 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-07 16:10:50,826 INFO L913 BasicCegarLoop]: 110 mSDtfsCounter, 140 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 62 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-07 16:10:50,827 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 321 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 467 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-07 16:10:50,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-04-07 16:10:50,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 166. [2022-04-07 16:10:50,836 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:10:50,836 INFO L82 GeneralOperation]: Start isEquivalent. First operand 266 states. Second operand has 166 states, 161 states have (on average 1.5403726708074534) internal successors, (248), 161 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:50,837 INFO L74 IsIncluded]: Start isIncluded. First operand 266 states. Second operand has 166 states, 161 states have (on average 1.5403726708074534) internal successors, (248), 161 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:50,837 INFO L87 Difference]: Start difference. First operand 266 states. Second operand has 166 states, 161 states have (on average 1.5403726708074534) internal successors, (248), 161 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:50,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:50,844 INFO L93 Difference]: Finished difference Result 266 states and 404 transitions. [2022-04-07 16:10:50,844 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 404 transitions. [2022-04-07 16:10:50,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:50,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:50,845 INFO L74 IsIncluded]: Start isIncluded. First operand has 166 states, 161 states have (on average 1.5403726708074534) internal successors, (248), 161 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 266 states. [2022-04-07 16:10:50,845 INFO L87 Difference]: Start difference. First operand has 166 states, 161 states have (on average 1.5403726708074534) internal successors, (248), 161 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 266 states. [2022-04-07 16:10:50,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:50,852 INFO L93 Difference]: Finished difference Result 266 states and 404 transitions. [2022-04-07 16:10:50,852 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 404 transitions. [2022-04-07 16:10:50,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:50,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:50,853 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:10:50,853 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:10:50,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 161 states have (on average 1.5403726708074534) internal successors, (248), 161 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:50,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 252 transitions. [2022-04-07 16:10:50,857 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 252 transitions. Word has length 65 [2022-04-07 16:10:50,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:10:50,857 INFO L478 AbstractCegarLoop]: Abstraction has 166 states and 252 transitions. [2022-04-07 16:10:50,857 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:50,857 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 252 transitions. [2022-04-07 16:10:50,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-07 16:10:50,858 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:10:50,859 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:10:50,859 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 16:10:50,859 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:10:50,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:10:50,859 INFO L85 PathProgramCache]: Analyzing trace with hash 795477037, now seen corresponding path program 1 times [2022-04-07 16:10:50,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:10:50,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634208489] [2022-04-07 16:10:50,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:50,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:10:50,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:50,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:10:50,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:50,993 INFO L290 TraceCheckUtils]: 0: Hoare triple {2292#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {2285#true} is VALID [2022-04-07 16:10:50,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-07 16:10:50,993 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2285#true} {2285#true} #664#return; {2285#true} is VALID [2022-04-07 16:10:50,997 INFO L272 TraceCheckUtils]: 0: Hoare triple {2285#true} call ULTIMATE.init(); {2292#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:10:50,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {2292#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {2285#true} is VALID [2022-04-07 16:10:50,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {2285#true} assume true; {2285#true} is VALID [2022-04-07 16:10:50,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2285#true} {2285#true} #664#return; {2285#true} is VALID [2022-04-07 16:10:50,998 INFO L272 TraceCheckUtils]: 4: Hoare triple {2285#true} call #t~ret162 := main(); {2285#true} is VALID [2022-04-07 16:10:50,998 INFO L290 TraceCheckUtils]: 5: Hoare triple {2285#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 52 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {2285#true} is VALID [2022-04-07 16:10:50,998 INFO L290 TraceCheckUtils]: 6: Hoare triple {2285#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {2285#true} is VALID [2022-04-07 16:10:50,998 INFO L272 TraceCheckUtils]: 7: Hoare triple {2285#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {2285#true} is VALID [2022-04-07 16:10:50,999 INFO L290 TraceCheckUtils]: 8: Hoare triple {2285#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:10:51,000 INFO L290 TraceCheckUtils]: 9: Hoare triple {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:10:51,001 INFO L290 TraceCheckUtils]: 10: Hoare triple {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:10:51,001 INFO L290 TraceCheckUtils]: 11: Hoare triple {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:10:51,002 INFO L290 TraceCheckUtils]: 12: Hoare triple {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:10:51,002 INFO L290 TraceCheckUtils]: 13: Hoare triple {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:10:51,002 INFO L290 TraceCheckUtils]: 14: Hoare triple {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:10:51,003 INFO L290 TraceCheckUtils]: 15: Hoare triple {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:10:51,003 INFO L290 TraceCheckUtils]: 16: Hoare triple {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:10:51,003 INFO L290 TraceCheckUtils]: 17: Hoare triple {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:10:51,004 INFO L290 TraceCheckUtils]: 18: Hoare triple {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:10:51,004 INFO L290 TraceCheckUtils]: 19: Hoare triple {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:10:51,005 INFO L290 TraceCheckUtils]: 20: Hoare triple {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:10:51,005 INFO L290 TraceCheckUtils]: 21: Hoare triple {2290#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {2291#(= 8464 |ssl3_accept_#t~mem48|)} is VALID [2022-04-07 16:10:51,005 INFO L290 TraceCheckUtils]: 22: Hoare triple {2291#(= 8464 |ssl3_accept_#t~mem48|)} assume 8481 == #t~mem48;havoc #t~mem48; {2286#false} is VALID [2022-04-07 16:10:51,005 INFO L290 TraceCheckUtils]: 23: Hoare triple {2286#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet87 && #t~nondet87 <= 2147483647;~ret~0 := #t~nondet87;havoc #t~nondet87; {2286#false} is VALID [2022-04-07 16:10:51,006 INFO L290 TraceCheckUtils]: 24: Hoare triple {2286#false} assume !(~ret~0 <= 0);call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem88.base, 844 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {2286#false} is VALID [2022-04-07 16:10:51,006 INFO L290 TraceCheckUtils]: 25: Hoare triple {2286#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {2286#false} is VALID [2022-04-07 16:10:51,006 INFO L290 TraceCheckUtils]: 26: Hoare triple {2286#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {2286#false} is VALID [2022-04-07 16:10:51,006 INFO L290 TraceCheckUtils]: 27: Hoare triple {2286#false} ~skip~0 := 0; {2286#false} is VALID [2022-04-07 16:10:51,006 INFO L290 TraceCheckUtils]: 28: Hoare triple {2286#false} assume !false; {2286#false} is VALID [2022-04-07 16:10:51,006 INFO L290 TraceCheckUtils]: 29: Hoare triple {2286#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-07 16:10:51,006 INFO L290 TraceCheckUtils]: 30: Hoare triple {2286#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-07 16:10:51,006 INFO L290 TraceCheckUtils]: 31: Hoare triple {2286#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-07 16:10:51,007 INFO L290 TraceCheckUtils]: 32: Hoare triple {2286#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-07 16:10:51,007 INFO L290 TraceCheckUtils]: 33: Hoare triple {2286#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-07 16:10:51,007 INFO L290 TraceCheckUtils]: 34: Hoare triple {2286#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-07 16:10:51,007 INFO L290 TraceCheckUtils]: 35: Hoare triple {2286#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-07 16:10:51,007 INFO L290 TraceCheckUtils]: 36: Hoare triple {2286#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-07 16:10:51,007 INFO L290 TraceCheckUtils]: 37: Hoare triple {2286#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-07 16:10:51,007 INFO L290 TraceCheckUtils]: 38: Hoare triple {2286#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-07 16:10:51,007 INFO L290 TraceCheckUtils]: 39: Hoare triple {2286#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-07 16:10:51,007 INFO L290 TraceCheckUtils]: 40: Hoare triple {2286#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-07 16:10:51,008 INFO L290 TraceCheckUtils]: 41: Hoare triple {2286#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-07 16:10:51,008 INFO L290 TraceCheckUtils]: 42: Hoare triple {2286#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-07 16:10:51,008 INFO L290 TraceCheckUtils]: 43: Hoare triple {2286#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-07 16:10:51,008 INFO L290 TraceCheckUtils]: 44: Hoare triple {2286#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-07 16:10:51,008 INFO L290 TraceCheckUtils]: 45: Hoare triple {2286#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-07 16:10:51,008 INFO L290 TraceCheckUtils]: 46: Hoare triple {2286#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-07 16:10:51,008 INFO L290 TraceCheckUtils]: 47: Hoare triple {2286#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-07 16:10:51,008 INFO L290 TraceCheckUtils]: 48: Hoare triple {2286#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-07 16:10:51,008 INFO L290 TraceCheckUtils]: 49: Hoare triple {2286#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-07 16:10:51,009 INFO L290 TraceCheckUtils]: 50: Hoare triple {2286#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-07 16:10:51,009 INFO L290 TraceCheckUtils]: 51: Hoare triple {2286#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-07 16:10:51,009 INFO L290 TraceCheckUtils]: 52: Hoare triple {2286#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-07 16:10:51,009 INFO L290 TraceCheckUtils]: 53: Hoare triple {2286#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-07 16:10:51,009 INFO L290 TraceCheckUtils]: 54: Hoare triple {2286#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-07 16:10:51,009 INFO L290 TraceCheckUtils]: 55: Hoare triple {2286#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-07 16:10:51,009 INFO L290 TraceCheckUtils]: 56: Hoare triple {2286#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-07 16:10:51,009 INFO L290 TraceCheckUtils]: 57: Hoare triple {2286#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-07 16:10:51,009 INFO L290 TraceCheckUtils]: 58: Hoare triple {2286#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-07 16:10:51,009 INFO L290 TraceCheckUtils]: 59: Hoare triple {2286#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-07 16:10:51,010 INFO L290 TraceCheckUtils]: 60: Hoare triple {2286#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-07 16:10:51,010 INFO L290 TraceCheckUtils]: 61: Hoare triple {2286#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {2286#false} is VALID [2022-04-07 16:10:51,010 INFO L290 TraceCheckUtils]: 62: Hoare triple {2286#false} assume 8672 == #t~mem74;havoc #t~mem74; {2286#false} is VALID [2022-04-07 16:10:51,010 INFO L290 TraceCheckUtils]: 63: Hoare triple {2286#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {2286#false} is VALID [2022-04-07 16:10:51,010 INFO L290 TraceCheckUtils]: 64: Hoare triple {2286#false} assume 4 == ~blastFlag~0; {2286#false} is VALID [2022-04-07 16:10:51,010 INFO L290 TraceCheckUtils]: 65: Hoare triple {2286#false} assume !false; {2286#false} is VALID [2022-04-07 16:10:51,010 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:10:51,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:10:51,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634208489] [2022-04-07 16:10:51,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634208489] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:10:51,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:10:51,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:10:51,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986375278] [2022-04-07 16:10:51,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:10:51,012 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-07 16:10:51,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:10:51,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:51,052 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:10:51,053 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:10:51,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:10:51,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:10:51,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:10:51,054 INFO L87 Difference]: Start difference. First operand 166 states and 252 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:53,072 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-07 16:10:53,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:53,907 INFO L93 Difference]: Finished difference Result 321 states and 486 transitions. [2022-04-07 16:10:53,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:10:53,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-07 16:10:53,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:10:53,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:53,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 434 transitions. [2022-04-07 16:10:53,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:53,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 434 transitions. [2022-04-07 16:10:53,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 434 transitions. [2022-04-07 16:10:54,172 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 434 edges. 434 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:10:54,176 INFO L225 Difference]: With dead ends: 321 [2022-04-07 16:10:54,176 INFO L226 Difference]: Without dead ends: 181 [2022-04-07 16:10:54,179 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-07 16:10:54,181 INFO L913 BasicCegarLoop]: 182 mSDtfsCounter, 22 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-07 16:10:54,182 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 466 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 349 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-07 16:10:54,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-04-07 16:10:54,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 166. [2022-04-07 16:10:54,187 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:10:54,187 INFO L82 GeneralOperation]: Start isEquivalent. First operand 181 states. Second operand has 166 states, 161 states have (on average 1.5341614906832297) internal successors, (247), 161 states have internal predecessors, (247), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:54,188 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand has 166 states, 161 states have (on average 1.5341614906832297) internal successors, (247), 161 states have internal predecessors, (247), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:54,188 INFO L87 Difference]: Start difference. First operand 181 states. Second operand has 166 states, 161 states have (on average 1.5341614906832297) internal successors, (247), 161 states have internal predecessors, (247), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:54,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:54,191 INFO L93 Difference]: Finished difference Result 181 states and 270 transitions. [2022-04-07 16:10:54,191 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 270 transitions. [2022-04-07 16:10:54,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:54,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:54,192 INFO L74 IsIncluded]: Start isIncluded. First operand has 166 states, 161 states have (on average 1.5341614906832297) internal successors, (247), 161 states have internal predecessors, (247), 3 states have call successors, (3), 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 181 states. [2022-04-07 16:10:54,192 INFO L87 Difference]: Start difference. First operand has 166 states, 161 states have (on average 1.5341614906832297) internal successors, (247), 161 states have internal predecessors, (247), 3 states have call successors, (3), 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 181 states. [2022-04-07 16:10:54,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:54,201 INFO L93 Difference]: Finished difference Result 181 states and 270 transitions. [2022-04-07 16:10:54,201 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 270 transitions. [2022-04-07 16:10:54,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:54,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:54,201 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:10:54,201 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:10:54,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 161 states have (on average 1.5341614906832297) internal successors, (247), 161 states have internal predecessors, (247), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:54,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 251 transitions. [2022-04-07 16:10:54,221 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 251 transitions. Word has length 66 [2022-04-07 16:10:54,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:10:54,222 INFO L478 AbstractCegarLoop]: Abstraction has 166 states and 251 transitions. [2022-04-07 16:10:54,222 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:54,222 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 251 transitions. [2022-04-07 16:10:54,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-07 16:10:54,223 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:10:54,223 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:10:54,223 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-07 16:10:54,223 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:10:54,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:10:54,223 INFO L85 PathProgramCache]: Analyzing trace with hash -498657998, now seen corresponding path program 1 times [2022-04-07 16:10:54,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:10:54,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66631835] [2022-04-07 16:10:54,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:54,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:10:54,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:54,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:10:54,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:54,370 INFO L290 TraceCheckUtils]: 0: Hoare triple {3246#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {3239#true} is VALID [2022-04-07 16:10:54,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {3239#true} assume true; {3239#true} is VALID [2022-04-07 16:10:54,370 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3239#true} {3239#true} #664#return; {3239#true} is VALID [2022-04-07 16:10:54,371 INFO L272 TraceCheckUtils]: 0: Hoare triple {3239#true} call ULTIMATE.init(); {3246#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:10:54,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {3246#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {3239#true} is VALID [2022-04-07 16:10:54,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {3239#true} assume true; {3239#true} is VALID [2022-04-07 16:10:54,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3239#true} {3239#true} #664#return; {3239#true} is VALID [2022-04-07 16:10:54,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {3239#true} call #t~ret162 := main(); {3239#true} is VALID [2022-04-07 16:10:54,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {3239#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 52 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {3239#true} is VALID [2022-04-07 16:10:54,371 INFO L290 TraceCheckUtils]: 6: Hoare triple {3239#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {3239#true} is VALID [2022-04-07 16:10:54,372 INFO L272 TraceCheckUtils]: 7: Hoare triple {3239#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {3239#true} is VALID [2022-04-07 16:10:54,375 INFO L290 TraceCheckUtils]: 8: Hoare triple {3239#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:10:54,376 INFO L290 TraceCheckUtils]: 9: Hoare triple {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:10:54,376 INFO L290 TraceCheckUtils]: 10: Hoare triple {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:10:54,377 INFO L290 TraceCheckUtils]: 11: Hoare triple {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:10:54,377 INFO L290 TraceCheckUtils]: 12: Hoare triple {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:10:54,377 INFO L290 TraceCheckUtils]: 13: Hoare triple {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:10:54,378 INFO L290 TraceCheckUtils]: 14: Hoare triple {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:10:54,378 INFO L290 TraceCheckUtils]: 15: Hoare triple {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:10:54,378 INFO L290 TraceCheckUtils]: 16: Hoare triple {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:10:54,379 INFO L290 TraceCheckUtils]: 17: Hoare triple {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:10:54,379 INFO L290 TraceCheckUtils]: 18: Hoare triple {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:10:54,379 INFO L290 TraceCheckUtils]: 19: Hoare triple {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:10:54,380 INFO L290 TraceCheckUtils]: 20: Hoare triple {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:10:54,380 INFO L290 TraceCheckUtils]: 21: Hoare triple {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:10:54,380 INFO L290 TraceCheckUtils]: 22: Hoare triple {3244#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {3245#(= 8464 |ssl3_accept_#t~mem49|)} is VALID [2022-04-07 16:10:54,381 INFO L290 TraceCheckUtils]: 23: Hoare triple {3245#(= 8464 |ssl3_accept_#t~mem49|)} assume 8482 == #t~mem49;havoc #t~mem49; {3240#false} is VALID [2022-04-07 16:10:54,381 INFO L290 TraceCheckUtils]: 24: Hoare triple {3240#false} call write~int(3, ~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-07 16:10:54,381 INFO L290 TraceCheckUtils]: 25: Hoare triple {3240#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {3240#false} is VALID [2022-04-07 16:10:54,381 INFO L290 TraceCheckUtils]: 26: Hoare triple {3240#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {3240#false} is VALID [2022-04-07 16:10:54,381 INFO L290 TraceCheckUtils]: 27: Hoare triple {3240#false} ~skip~0 := 0; {3240#false} is VALID [2022-04-07 16:10:54,381 INFO L290 TraceCheckUtils]: 28: Hoare triple {3240#false} assume !false; {3240#false} is VALID [2022-04-07 16:10:54,381 INFO L290 TraceCheckUtils]: 29: Hoare triple {3240#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-07 16:10:54,381 INFO L290 TraceCheckUtils]: 30: Hoare triple {3240#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-07 16:10:54,381 INFO L290 TraceCheckUtils]: 31: Hoare triple {3240#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-07 16:10:54,381 INFO L290 TraceCheckUtils]: 32: Hoare triple {3240#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-07 16:10:54,382 INFO L290 TraceCheckUtils]: 33: Hoare triple {3240#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-07 16:10:54,382 INFO L290 TraceCheckUtils]: 34: Hoare triple {3240#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-07 16:10:54,382 INFO L290 TraceCheckUtils]: 35: Hoare triple {3240#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-07 16:10:54,382 INFO L290 TraceCheckUtils]: 36: Hoare triple {3240#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-07 16:10:54,382 INFO L290 TraceCheckUtils]: 37: Hoare triple {3240#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-07 16:10:54,382 INFO L290 TraceCheckUtils]: 38: Hoare triple {3240#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-07 16:10:54,382 INFO L290 TraceCheckUtils]: 39: Hoare triple {3240#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-07 16:10:54,382 INFO L290 TraceCheckUtils]: 40: Hoare triple {3240#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-07 16:10:54,382 INFO L290 TraceCheckUtils]: 41: Hoare triple {3240#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-07 16:10:54,382 INFO L290 TraceCheckUtils]: 42: Hoare triple {3240#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-07 16:10:54,382 INFO L290 TraceCheckUtils]: 43: Hoare triple {3240#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-07 16:10:54,382 INFO L290 TraceCheckUtils]: 44: Hoare triple {3240#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-07 16:10:54,382 INFO L290 TraceCheckUtils]: 45: Hoare triple {3240#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-07 16:10:54,382 INFO L290 TraceCheckUtils]: 46: Hoare triple {3240#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-07 16:10:54,383 INFO L290 TraceCheckUtils]: 47: Hoare triple {3240#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-07 16:10:54,383 INFO L290 TraceCheckUtils]: 48: Hoare triple {3240#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-07 16:10:54,383 INFO L290 TraceCheckUtils]: 49: Hoare triple {3240#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-07 16:10:54,383 INFO L290 TraceCheckUtils]: 50: Hoare triple {3240#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-07 16:10:54,383 INFO L290 TraceCheckUtils]: 51: Hoare triple {3240#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-07 16:10:54,383 INFO L290 TraceCheckUtils]: 52: Hoare triple {3240#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-07 16:10:54,383 INFO L290 TraceCheckUtils]: 53: Hoare triple {3240#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-07 16:10:54,383 INFO L290 TraceCheckUtils]: 54: Hoare triple {3240#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-07 16:10:54,383 INFO L290 TraceCheckUtils]: 55: Hoare triple {3240#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-07 16:10:54,383 INFO L290 TraceCheckUtils]: 56: Hoare triple {3240#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-07 16:10:54,383 INFO L290 TraceCheckUtils]: 57: Hoare triple {3240#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-07 16:10:54,383 INFO L290 TraceCheckUtils]: 58: Hoare triple {3240#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-07 16:10:54,383 INFO L290 TraceCheckUtils]: 59: Hoare triple {3240#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-07 16:10:54,383 INFO L290 TraceCheckUtils]: 60: Hoare triple {3240#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-07 16:10:54,384 INFO L290 TraceCheckUtils]: 61: Hoare triple {3240#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {3240#false} is VALID [2022-04-07 16:10:54,384 INFO L290 TraceCheckUtils]: 62: Hoare triple {3240#false} assume 8672 == #t~mem74;havoc #t~mem74; {3240#false} is VALID [2022-04-07 16:10:54,384 INFO L290 TraceCheckUtils]: 63: Hoare triple {3240#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {3240#false} is VALID [2022-04-07 16:10:54,384 INFO L290 TraceCheckUtils]: 64: Hoare triple {3240#false} assume 4 == ~blastFlag~0; {3240#false} is VALID [2022-04-07 16:10:54,384 INFO L290 TraceCheckUtils]: 65: Hoare triple {3240#false} assume !false; {3240#false} is VALID [2022-04-07 16:10:54,384 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:10:54,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:10:54,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66631835] [2022-04-07 16:10:54,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66631835] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:10:54,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:10:54,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:10:54,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550461888] [2022-04-07 16:10:54,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:10:54,385 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-07 16:10:54,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:10:54,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:54,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:10:54,429 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:10:54,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:10:54,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:10:54,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:10:54,430 INFO L87 Difference]: Start difference. First operand 166 states and 251 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:56,455 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-07 16:10:57,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:57,282 INFO L93 Difference]: Finished difference Result 320 states and 484 transitions. [2022-04-07 16:10:57,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:10:57,282 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-07 16:10:57,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:10:57,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:57,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 432 transitions. [2022-04-07 16:10:57,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:57,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 432 transitions. [2022-04-07 16:10:57,288 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 432 transitions. [2022-04-07 16:10:57,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 432 edges. 432 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:10:57,621 INFO L225 Difference]: With dead ends: 320 [2022-04-07 16:10:57,621 INFO L226 Difference]: Without dead ends: 180 [2022-04-07 16:10:57,622 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-07 16:10:57,623 INFO L913 BasicCegarLoop]: 183 mSDtfsCounter, 20 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-07 16:10:57,623 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 468 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 347 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-07 16:10:57,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-04-07 16:10:57,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 166. [2022-04-07 16:10:57,628 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:10:57,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 180 states. Second operand has 166 states, 161 states have (on average 1.5279503105590062) internal successors, (246), 161 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:57,628 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand has 166 states, 161 states have (on average 1.5279503105590062) internal successors, (246), 161 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:57,629 INFO L87 Difference]: Start difference. First operand 180 states. Second operand has 166 states, 161 states have (on average 1.5279503105590062) internal successors, (246), 161 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:57,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:57,631 INFO L93 Difference]: Finished difference Result 180 states and 268 transitions. [2022-04-07 16:10:57,631 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 268 transitions. [2022-04-07 16:10:57,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:57,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:57,632 INFO L74 IsIncluded]: Start isIncluded. First operand has 166 states, 161 states have (on average 1.5279503105590062) internal successors, (246), 161 states have internal predecessors, (246), 3 states have call successors, (3), 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 180 states. [2022-04-07 16:10:57,632 INFO L87 Difference]: Start difference. First operand has 166 states, 161 states have (on average 1.5279503105590062) internal successors, (246), 161 states have internal predecessors, (246), 3 states have call successors, (3), 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 180 states. [2022-04-07 16:10:57,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:57,634 INFO L93 Difference]: Finished difference Result 180 states and 268 transitions. [2022-04-07 16:10:57,634 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 268 transitions. [2022-04-07 16:10:57,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:57,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:57,634 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:10:57,634 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:10:57,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 161 states have (on average 1.5279503105590062) internal successors, (246), 161 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:57,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 250 transitions. [2022-04-07 16:10:57,637 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 250 transitions. Word has length 66 [2022-04-07 16:10:57,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:10:57,637 INFO L478 AbstractCegarLoop]: Abstraction has 166 states and 250 transitions. [2022-04-07 16:10:57,637 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:57,637 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 250 transitions. [2022-04-07 16:10:57,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-07 16:10:57,638 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:10:57,638 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:10:57,638 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-07 16:10:57,638 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:10:57,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:10:57,638 INFO L85 PathProgramCache]: Analyzing trace with hash -2086075870, now seen corresponding path program 1 times [2022-04-07 16:10:57,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:10:57,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988085220] [2022-04-07 16:10:57,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:57,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:10:57,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:57,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:10:57,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:57,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {4196#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {4189#true} is VALID [2022-04-07 16:10:57,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {4189#true} assume true; {4189#true} is VALID [2022-04-07 16:10:57,737 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4189#true} {4189#true} #664#return; {4189#true} is VALID [2022-04-07 16:10:57,737 INFO L272 TraceCheckUtils]: 0: Hoare triple {4189#true} call ULTIMATE.init(); {4196#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:10:57,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {4196#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {4189#true} is VALID [2022-04-07 16:10:57,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {4189#true} assume true; {4189#true} is VALID [2022-04-07 16:10:57,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4189#true} {4189#true} #664#return; {4189#true} is VALID [2022-04-07 16:10:57,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {4189#true} call #t~ret162 := main(); {4189#true} is VALID [2022-04-07 16:10:57,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {4189#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 52 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {4189#true} is VALID [2022-04-07 16:10:57,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {4189#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {4189#true} is VALID [2022-04-07 16:10:57,738 INFO L272 TraceCheckUtils]: 7: Hoare triple {4189#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {4189#true} is VALID [2022-04-07 16:10:57,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {4189#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {4194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:10:57,740 INFO L290 TraceCheckUtils]: 9: Hoare triple {4194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {4194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:10:57,740 INFO L290 TraceCheckUtils]: 10: Hoare triple {4194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {4194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:10:57,741 INFO L290 TraceCheckUtils]: 11: Hoare triple {4194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {4194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:10:57,741 INFO L290 TraceCheckUtils]: 12: Hoare triple {4194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {4194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:10:57,741 INFO L290 TraceCheckUtils]: 13: Hoare triple {4194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {4194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:10:57,742 INFO L290 TraceCheckUtils]: 14: Hoare triple {4194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {4194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:10:57,742 INFO L290 TraceCheckUtils]: 15: Hoare triple {4194#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {4195#(= 8464 |ssl3_accept_#t~mem42|)} is VALID [2022-04-07 16:10:57,742 INFO L290 TraceCheckUtils]: 16: Hoare triple {4195#(= 8464 |ssl3_accept_#t~mem42|)} assume 12292 == #t~mem42;havoc #t~mem42; {4190#false} is VALID [2022-04-07 16:10:57,743 INFO L290 TraceCheckUtils]: 17: Hoare triple {4190#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {4190#false} is VALID [2022-04-07 16:10:57,743 INFO L290 TraceCheckUtils]: 18: Hoare triple {4190#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {4190#false} is VALID [2022-04-07 16:10:57,743 INFO L290 TraceCheckUtils]: 19: Hoare triple {4190#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {4190#false} is VALID [2022-04-07 16:10:57,744 INFO L290 TraceCheckUtils]: 20: Hoare triple {4190#false} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {4190#false} is VALID [2022-04-07 16:10:57,744 INFO L290 TraceCheckUtils]: 21: Hoare triple {4190#false} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {4190#false} is VALID [2022-04-07 16:10:57,744 INFO L290 TraceCheckUtils]: 22: Hoare triple {4190#false} assume !(0 == (#t~mem78.base + #t~mem78.offset) % 4294967296);havoc #t~mem78.base, #t~mem78.offset; {4190#false} is VALID [2022-04-07 16:10:57,744 INFO L290 TraceCheckUtils]: 23: Hoare triple {4190#false} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {4190#false} is VALID [2022-04-07 16:10:57,744 INFO L290 TraceCheckUtils]: 24: Hoare triple {4190#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-07 16:10:57,744 INFO L290 TraceCheckUtils]: 25: Hoare triple {4190#false} assume !(12292 != #t~mem81);havoc #t~mem81;call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem86 := read~int(#t~mem85.base, 76 + #t~mem85.offset, 4);call write~int(1 + #t~mem86, #t~mem85.base, 76 + #t~mem85.offset, 4);havoc #t~mem85.base, #t~mem85.offset;havoc #t~mem86;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-07 16:10:57,744 INFO L290 TraceCheckUtils]: 26: Hoare triple {4190#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {4190#false} is VALID [2022-04-07 16:10:57,744 INFO L290 TraceCheckUtils]: 27: Hoare triple {4190#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {4190#false} is VALID [2022-04-07 16:10:57,744 INFO L290 TraceCheckUtils]: 28: Hoare triple {4190#false} ~skip~0 := 0; {4190#false} is VALID [2022-04-07 16:10:57,744 INFO L290 TraceCheckUtils]: 29: Hoare triple {4190#false} assume !false; {4190#false} is VALID [2022-04-07 16:10:57,744 INFO L290 TraceCheckUtils]: 30: Hoare triple {4190#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-07 16:10:57,744 INFO L290 TraceCheckUtils]: 31: Hoare triple {4190#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-07 16:10:57,744 INFO L290 TraceCheckUtils]: 32: Hoare triple {4190#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-07 16:10:57,745 INFO L290 TraceCheckUtils]: 33: Hoare triple {4190#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-07 16:10:57,745 INFO L290 TraceCheckUtils]: 34: Hoare triple {4190#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-07 16:10:57,745 INFO L290 TraceCheckUtils]: 35: Hoare triple {4190#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-07 16:10:57,745 INFO L290 TraceCheckUtils]: 36: Hoare triple {4190#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-07 16:10:57,745 INFO L290 TraceCheckUtils]: 37: Hoare triple {4190#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-07 16:10:57,745 INFO L290 TraceCheckUtils]: 38: Hoare triple {4190#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-07 16:10:57,745 INFO L290 TraceCheckUtils]: 39: Hoare triple {4190#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-07 16:10:57,745 INFO L290 TraceCheckUtils]: 40: Hoare triple {4190#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-07 16:10:57,745 INFO L290 TraceCheckUtils]: 41: Hoare triple {4190#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-07 16:10:57,745 INFO L290 TraceCheckUtils]: 42: Hoare triple {4190#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-07 16:10:57,745 INFO L290 TraceCheckUtils]: 43: Hoare triple {4190#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-07 16:10:57,745 INFO L290 TraceCheckUtils]: 44: Hoare triple {4190#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-07 16:10:57,745 INFO L290 TraceCheckUtils]: 45: Hoare triple {4190#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-07 16:10:57,745 INFO L290 TraceCheckUtils]: 46: Hoare triple {4190#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-07 16:10:57,745 INFO L290 TraceCheckUtils]: 47: Hoare triple {4190#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-07 16:10:57,745 INFO L290 TraceCheckUtils]: 48: Hoare triple {4190#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-07 16:10:57,746 INFO L290 TraceCheckUtils]: 49: Hoare triple {4190#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-07 16:10:57,746 INFO L290 TraceCheckUtils]: 50: Hoare triple {4190#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-07 16:10:57,746 INFO L290 TraceCheckUtils]: 51: Hoare triple {4190#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-07 16:10:57,746 INFO L290 TraceCheckUtils]: 52: Hoare triple {4190#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-07 16:10:57,746 INFO L290 TraceCheckUtils]: 53: Hoare triple {4190#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-07 16:10:57,746 INFO L290 TraceCheckUtils]: 54: Hoare triple {4190#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-07 16:10:57,746 INFO L290 TraceCheckUtils]: 55: Hoare triple {4190#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-07 16:10:57,746 INFO L290 TraceCheckUtils]: 56: Hoare triple {4190#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-07 16:10:57,746 INFO L290 TraceCheckUtils]: 57: Hoare triple {4190#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-07 16:10:57,746 INFO L290 TraceCheckUtils]: 58: Hoare triple {4190#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-07 16:10:57,746 INFO L290 TraceCheckUtils]: 59: Hoare triple {4190#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-07 16:10:57,746 INFO L290 TraceCheckUtils]: 60: Hoare triple {4190#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-07 16:10:57,746 INFO L290 TraceCheckUtils]: 61: Hoare triple {4190#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-07 16:10:57,746 INFO L290 TraceCheckUtils]: 62: Hoare triple {4190#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {4190#false} is VALID [2022-04-07 16:10:57,746 INFO L290 TraceCheckUtils]: 63: Hoare triple {4190#false} assume 8672 == #t~mem74;havoc #t~mem74; {4190#false} is VALID [2022-04-07 16:10:57,746 INFO L290 TraceCheckUtils]: 64: Hoare triple {4190#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {4190#false} is VALID [2022-04-07 16:10:57,747 INFO L290 TraceCheckUtils]: 65: Hoare triple {4190#false} assume 4 == ~blastFlag~0; {4190#false} is VALID [2022-04-07 16:10:57,747 INFO L290 TraceCheckUtils]: 66: Hoare triple {4190#false} assume !false; {4190#false} is VALID [2022-04-07 16:10:57,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:10:57,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:10:57,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988085220] [2022-04-07 16:10:57,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988085220] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:10:57,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:10:57,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:10:57,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141296462] [2022-04-07 16:10:57,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:10:57,763 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-07 16:10:57,764 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:10:57,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:57,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:10:57,803 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:10:57,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:10:57,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:10:57,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:10:57,804 INFO L87 Difference]: Start difference. First operand 166 states and 250 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:59,821 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-07 16:11:00,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:00,685 INFO L93 Difference]: Finished difference Result 319 states and 482 transitions. [2022-04-07 16:11:00,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:11:00,686 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-07 16:11:00,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:11:00,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:00,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 430 transitions. [2022-04-07 16:11:00,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:00,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 430 transitions. [2022-04-07 16:11:00,705 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 430 transitions. [2022-04-07 16:11:00,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 430 edges. 430 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:11:00,985 INFO L225 Difference]: With dead ends: 319 [2022-04-07 16:11:00,985 INFO L226 Difference]: Without dead ends: 179 [2022-04-07 16:11:00,985 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-07 16:11:00,986 INFO L913 BasicCegarLoop]: 184 mSDtfsCounter, 26 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-07 16:11:00,986 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 470 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 345 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-07 16:11:00,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-04-07 16:11:00,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 166. [2022-04-07 16:11:00,991 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:11:00,991 INFO L82 GeneralOperation]: Start isEquivalent. First operand 179 states. Second operand has 166 states, 161 states have (on average 1.5217391304347827) internal successors, (245), 161 states have internal predecessors, (245), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:00,991 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand has 166 states, 161 states have (on average 1.5217391304347827) internal successors, (245), 161 states have internal predecessors, (245), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:00,992 INFO L87 Difference]: Start difference. First operand 179 states. Second operand has 166 states, 161 states have (on average 1.5217391304347827) internal successors, (245), 161 states have internal predecessors, (245), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:00,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:00,994 INFO L93 Difference]: Finished difference Result 179 states and 266 transitions. [2022-04-07 16:11:00,994 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 266 transitions. [2022-04-07 16:11:00,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:00,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:00,995 INFO L74 IsIncluded]: Start isIncluded. First operand has 166 states, 161 states have (on average 1.5217391304347827) internal successors, (245), 161 states have internal predecessors, (245), 3 states have call successors, (3), 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 179 states. [2022-04-07 16:11:00,995 INFO L87 Difference]: Start difference. First operand has 166 states, 161 states have (on average 1.5217391304347827) internal successors, (245), 161 states have internal predecessors, (245), 3 states have call successors, (3), 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 179 states. [2022-04-07 16:11:00,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:00,997 INFO L93 Difference]: Finished difference Result 179 states and 266 transitions. [2022-04-07 16:11:00,997 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 266 transitions. [2022-04-07 16:11:00,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:00,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:00,997 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:11:00,997 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:11:00,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 161 states have (on average 1.5217391304347827) internal successors, (245), 161 states have internal predecessors, (245), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:01,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 249 transitions. [2022-04-07 16:11:01,000 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 249 transitions. Word has length 67 [2022-04-07 16:11:01,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:11:01,000 INFO L478 AbstractCegarLoop]: Abstraction has 166 states and 249 transitions. [2022-04-07 16:11:01,000 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:01,000 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 249 transitions. [2022-04-07 16:11:01,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-07 16:11:01,001 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:11:01,001 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:11:01,001 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-07 16:11:01,001 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:11:01,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:11:01,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1877545714, now seen corresponding path program 1 times [2022-04-07 16:11:01,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:11:01,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570513182] [2022-04-07 16:11:01,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:11:01,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:11:01,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:01,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:11:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:01,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {5142#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {5135#true} is VALID [2022-04-07 16:11:01,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {5135#true} assume true; {5135#true} is VALID [2022-04-07 16:11:01,095 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5135#true} {5135#true} #664#return; {5135#true} is VALID [2022-04-07 16:11:01,095 INFO L272 TraceCheckUtils]: 0: Hoare triple {5135#true} call ULTIMATE.init(); {5142#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:11:01,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {5142#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {5135#true} is VALID [2022-04-07 16:11:01,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {5135#true} assume true; {5135#true} is VALID [2022-04-07 16:11:01,096 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5135#true} {5135#true} #664#return; {5135#true} is VALID [2022-04-07 16:11:01,096 INFO L272 TraceCheckUtils]: 4: Hoare triple {5135#true} call #t~ret162 := main(); {5135#true} is VALID [2022-04-07 16:11:01,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {5135#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 52 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {5135#true} is VALID [2022-04-07 16:11:01,096 INFO L290 TraceCheckUtils]: 6: Hoare triple {5135#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {5135#true} is VALID [2022-04-07 16:11:01,096 INFO L272 TraceCheckUtils]: 7: Hoare triple {5135#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {5135#true} is VALID [2022-04-07 16:11:01,097 INFO L290 TraceCheckUtils]: 8: Hoare triple {5135#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {5140#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:01,098 INFO L290 TraceCheckUtils]: 9: Hoare triple {5140#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {5140#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:01,098 INFO L290 TraceCheckUtils]: 10: Hoare triple {5140#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {5140#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:01,099 INFO L290 TraceCheckUtils]: 11: Hoare triple {5140#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {5140#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:01,099 INFO L290 TraceCheckUtils]: 12: Hoare triple {5140#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {5140#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:01,099 INFO L290 TraceCheckUtils]: 13: Hoare triple {5140#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {5140#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:01,100 INFO L290 TraceCheckUtils]: 14: Hoare triple {5140#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {5140#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:01,100 INFO L290 TraceCheckUtils]: 15: Hoare triple {5140#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {5140#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:01,100 INFO L290 TraceCheckUtils]: 16: Hoare triple {5140#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {5141#(not (= |ssl3_accept_#t~mem43| 16384))} is VALID [2022-04-07 16:11:01,101 INFO L290 TraceCheckUtils]: 17: Hoare triple {5141#(not (= |ssl3_accept_#t~mem43| 16384))} assume 16384 == #t~mem43;havoc #t~mem43; {5136#false} is VALID [2022-04-07 16:11:01,101 INFO L290 TraceCheckUtils]: 18: Hoare triple {5136#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {5136#false} is VALID [2022-04-07 16:11:01,101 INFO L290 TraceCheckUtils]: 19: Hoare triple {5136#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {5136#false} is VALID [2022-04-07 16:11:01,101 INFO L290 TraceCheckUtils]: 20: Hoare triple {5136#false} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {5136#false} is VALID [2022-04-07 16:11:01,101 INFO L290 TraceCheckUtils]: 21: Hoare triple {5136#false} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {5136#false} is VALID [2022-04-07 16:11:01,101 INFO L290 TraceCheckUtils]: 22: Hoare triple {5136#false} assume !(0 == (#t~mem78.base + #t~mem78.offset) % 4294967296);havoc #t~mem78.base, #t~mem78.offset; {5136#false} is VALID [2022-04-07 16:11:01,101 INFO L290 TraceCheckUtils]: 23: Hoare triple {5136#false} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {5136#false} is VALID [2022-04-07 16:11:01,101 INFO L290 TraceCheckUtils]: 24: Hoare triple {5136#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-07 16:11:01,101 INFO L290 TraceCheckUtils]: 25: Hoare triple {5136#false} assume !(12292 != #t~mem81);havoc #t~mem81;call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem86 := read~int(#t~mem85.base, 76 + #t~mem85.offset, 4);call write~int(1 + #t~mem86, #t~mem85.base, 76 + #t~mem85.offset, 4);havoc #t~mem85.base, #t~mem85.offset;havoc #t~mem86;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-07 16:11:01,101 INFO L290 TraceCheckUtils]: 26: Hoare triple {5136#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {5136#false} is VALID [2022-04-07 16:11:01,101 INFO L290 TraceCheckUtils]: 27: Hoare triple {5136#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {5136#false} is VALID [2022-04-07 16:11:01,101 INFO L290 TraceCheckUtils]: 28: Hoare triple {5136#false} ~skip~0 := 0; {5136#false} is VALID [2022-04-07 16:11:01,101 INFO L290 TraceCheckUtils]: 29: Hoare triple {5136#false} assume !false; {5136#false} is VALID [2022-04-07 16:11:01,102 INFO L290 TraceCheckUtils]: 30: Hoare triple {5136#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-07 16:11:01,102 INFO L290 TraceCheckUtils]: 31: Hoare triple {5136#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-07 16:11:01,102 INFO L290 TraceCheckUtils]: 32: Hoare triple {5136#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-07 16:11:01,102 INFO L290 TraceCheckUtils]: 33: Hoare triple {5136#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-07 16:11:01,102 INFO L290 TraceCheckUtils]: 34: Hoare triple {5136#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-07 16:11:01,102 INFO L290 TraceCheckUtils]: 35: Hoare triple {5136#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-07 16:11:01,102 INFO L290 TraceCheckUtils]: 36: Hoare triple {5136#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-07 16:11:01,102 INFO L290 TraceCheckUtils]: 37: Hoare triple {5136#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-07 16:11:01,102 INFO L290 TraceCheckUtils]: 38: Hoare triple {5136#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-07 16:11:01,102 INFO L290 TraceCheckUtils]: 39: Hoare triple {5136#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-07 16:11:01,102 INFO L290 TraceCheckUtils]: 40: Hoare triple {5136#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-07 16:11:01,102 INFO L290 TraceCheckUtils]: 41: Hoare triple {5136#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-07 16:11:01,102 INFO L290 TraceCheckUtils]: 42: Hoare triple {5136#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-07 16:11:01,102 INFO L290 TraceCheckUtils]: 43: Hoare triple {5136#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-07 16:11:01,102 INFO L290 TraceCheckUtils]: 44: Hoare triple {5136#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-07 16:11:01,102 INFO L290 TraceCheckUtils]: 45: Hoare triple {5136#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-07 16:11:01,103 INFO L290 TraceCheckUtils]: 46: Hoare triple {5136#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-07 16:11:01,103 INFO L290 TraceCheckUtils]: 47: Hoare triple {5136#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-07 16:11:01,103 INFO L290 TraceCheckUtils]: 48: Hoare triple {5136#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-07 16:11:01,103 INFO L290 TraceCheckUtils]: 49: Hoare triple {5136#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-07 16:11:01,103 INFO L290 TraceCheckUtils]: 50: Hoare triple {5136#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-07 16:11:01,103 INFO L290 TraceCheckUtils]: 51: Hoare triple {5136#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-07 16:11:01,103 INFO L290 TraceCheckUtils]: 52: Hoare triple {5136#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-07 16:11:01,103 INFO L290 TraceCheckUtils]: 53: Hoare triple {5136#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-07 16:11:01,103 INFO L290 TraceCheckUtils]: 54: Hoare triple {5136#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-07 16:11:01,103 INFO L290 TraceCheckUtils]: 55: Hoare triple {5136#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-07 16:11:01,103 INFO L290 TraceCheckUtils]: 56: Hoare triple {5136#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-07 16:11:01,103 INFO L290 TraceCheckUtils]: 57: Hoare triple {5136#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-07 16:11:01,103 INFO L290 TraceCheckUtils]: 58: Hoare triple {5136#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-07 16:11:01,103 INFO L290 TraceCheckUtils]: 59: Hoare triple {5136#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-07 16:11:01,103 INFO L290 TraceCheckUtils]: 60: Hoare triple {5136#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-07 16:11:01,104 INFO L290 TraceCheckUtils]: 61: Hoare triple {5136#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-07 16:11:01,104 INFO L290 TraceCheckUtils]: 62: Hoare triple {5136#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {5136#false} is VALID [2022-04-07 16:11:01,104 INFO L290 TraceCheckUtils]: 63: Hoare triple {5136#false} assume 8672 == #t~mem74;havoc #t~mem74; {5136#false} is VALID [2022-04-07 16:11:01,104 INFO L290 TraceCheckUtils]: 64: Hoare triple {5136#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {5136#false} is VALID [2022-04-07 16:11:01,104 INFO L290 TraceCheckUtils]: 65: Hoare triple {5136#false} assume 4 == ~blastFlag~0; {5136#false} is VALID [2022-04-07 16:11:01,104 INFO L290 TraceCheckUtils]: 66: Hoare triple {5136#false} assume !false; {5136#false} is VALID [2022-04-07 16:11:01,104 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:11:01,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:11:01,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570513182] [2022-04-07 16:11:01,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570513182] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:11:01,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:11:01,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:11:01,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636455705] [2022-04-07 16:11:01,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:11:01,105 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-07 16:11:01,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:11:01,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:01,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:11:01,156 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:11:01,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:11:01,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:11:01,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:11:01,156 INFO L87 Difference]: Start difference. First operand 166 states and 249 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:03,178 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-07 16:11:04,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:04,303 INFO L93 Difference]: Finished difference Result 422 states and 643 transitions. [2022-04-07 16:11:04,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:11:04,303 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-07 16:11:04,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:11:04,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:04,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2022-04-07 16:11:04,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:04,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2022-04-07 16:11:04,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 576 transitions. [2022-04-07 16:11:04,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 576 edges. 576 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:11:04,707 INFO L225 Difference]: With dead ends: 422 [2022-04-07 16:11:04,707 INFO L226 Difference]: Without dead ends: 282 [2022-04-07 16:11:04,707 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-07 16:11:04,710 INFO L913 BasicCegarLoop]: 110 mSDtfsCounter, 144 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-07 16:11:04,710 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 321 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 466 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-07 16:11:04,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-04-07 16:11:04,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 178. [2022-04-07 16:11:04,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:11:04,714 INFO L82 GeneralOperation]: Start isEquivalent. First operand 282 states. Second operand has 178 states, 173 states have (on average 1.5086705202312138) internal successors, (261), 173 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:04,714 INFO L74 IsIncluded]: Start isIncluded. First operand 282 states. Second operand has 178 states, 173 states have (on average 1.5086705202312138) internal successors, (261), 173 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:04,715 INFO L87 Difference]: Start difference. First operand 282 states. Second operand has 178 states, 173 states have (on average 1.5086705202312138) internal successors, (261), 173 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:04,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:04,719 INFO L93 Difference]: Finished difference Result 282 states and 425 transitions. [2022-04-07 16:11:04,719 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 425 transitions. [2022-04-07 16:11:04,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:04,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:04,720 INFO L74 IsIncluded]: Start isIncluded. First operand has 178 states, 173 states have (on average 1.5086705202312138) internal successors, (261), 173 states have internal predecessors, (261), 3 states have call successors, (3), 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 282 states. [2022-04-07 16:11:04,720 INFO L87 Difference]: Start difference. First operand has 178 states, 173 states have (on average 1.5086705202312138) internal successors, (261), 173 states have internal predecessors, (261), 3 states have call successors, (3), 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 282 states. [2022-04-07 16:11:04,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:04,725 INFO L93 Difference]: Finished difference Result 282 states and 425 transitions. [2022-04-07 16:11:04,725 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 425 transitions. [2022-04-07 16:11:04,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:04,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:04,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:11:04,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:11:04,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 173 states have (on average 1.5086705202312138) internal successors, (261), 173 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:04,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 265 transitions. [2022-04-07 16:11:04,728 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 265 transitions. Word has length 67 [2022-04-07 16:11:04,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:11:04,728 INFO L478 AbstractCegarLoop]: Abstraction has 178 states and 265 transitions. [2022-04-07 16:11:04,728 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:04,728 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 265 transitions. [2022-04-07 16:11:04,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-07 16:11:04,731 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:11:04,731 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:11:04,731 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-07 16:11:04,731 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:11:04,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:11:04,731 INFO L85 PathProgramCache]: Analyzing trace with hash -175906935, now seen corresponding path program 1 times [2022-04-07 16:11:04,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:11:04,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650679049] [2022-04-07 16:11:04,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:11:04,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:11:04,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:04,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:11:04,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:04,848 INFO L290 TraceCheckUtils]: 0: Hoare triple {6432#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {6425#true} is VALID [2022-04-07 16:11:04,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-07 16:11:04,848 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6425#true} {6425#true} #664#return; {6425#true} is VALID [2022-04-07 16:11:04,849 INFO L272 TraceCheckUtils]: 0: Hoare triple {6425#true} call ULTIMATE.init(); {6432#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:11:04,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {6432#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {6425#true} is VALID [2022-04-07 16:11:04,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-07 16:11:04,849 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6425#true} {6425#true} #664#return; {6425#true} is VALID [2022-04-07 16:11:04,849 INFO L272 TraceCheckUtils]: 4: Hoare triple {6425#true} call #t~ret162 := main(); {6425#true} is VALID [2022-04-07 16:11:04,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {6425#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 52 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {6425#true} is VALID [2022-04-07 16:11:04,849 INFO L290 TraceCheckUtils]: 6: Hoare triple {6425#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {6425#true} is VALID [2022-04-07 16:11:04,849 INFO L272 TraceCheckUtils]: 7: Hoare triple {6425#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {6425#true} is VALID [2022-04-07 16:11:04,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {6425#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {6430#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:04,851 INFO L290 TraceCheckUtils]: 9: Hoare triple {6430#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {6430#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:04,852 INFO L290 TraceCheckUtils]: 10: Hoare triple {6430#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {6430#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:04,853 INFO L290 TraceCheckUtils]: 11: Hoare triple {6430#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {6430#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:04,853 INFO L290 TraceCheckUtils]: 12: Hoare triple {6430#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {6430#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:04,854 INFO L290 TraceCheckUtils]: 13: Hoare triple {6430#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {6430#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:04,854 INFO L290 TraceCheckUtils]: 14: Hoare triple {6430#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {6430#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:04,854 INFO L290 TraceCheckUtils]: 15: Hoare triple {6430#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {6430#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:04,855 INFO L290 TraceCheckUtils]: 16: Hoare triple {6430#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {6430#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:04,855 INFO L290 TraceCheckUtils]: 17: Hoare triple {6430#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {6431#(= 8464 |ssl3_accept_#t~mem44|)} is VALID [2022-04-07 16:11:04,856 INFO L290 TraceCheckUtils]: 18: Hoare triple {6431#(= 8464 |ssl3_accept_#t~mem44|)} assume 8192 == #t~mem44;havoc #t~mem44; {6426#false} is VALID [2022-04-07 16:11:04,856 INFO L290 TraceCheckUtils]: 19: Hoare triple {6426#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {6426#false} is VALID [2022-04-07 16:11:04,856 INFO L290 TraceCheckUtils]: 20: Hoare triple {6426#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {6426#false} is VALID [2022-04-07 16:11:04,856 INFO L290 TraceCheckUtils]: 21: Hoare triple {6426#false} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {6426#false} is VALID [2022-04-07 16:11:04,856 INFO L290 TraceCheckUtils]: 22: Hoare triple {6426#false} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {6426#false} is VALID [2022-04-07 16:11:04,856 INFO L290 TraceCheckUtils]: 23: Hoare triple {6426#false} assume !(0 == (#t~mem78.base + #t~mem78.offset) % 4294967296);havoc #t~mem78.base, #t~mem78.offset; {6426#false} is VALID [2022-04-07 16:11:04,856 INFO L290 TraceCheckUtils]: 24: Hoare triple {6426#false} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {6426#false} is VALID [2022-04-07 16:11:04,857 INFO L290 TraceCheckUtils]: 25: Hoare triple {6426#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-07 16:11:04,857 INFO L290 TraceCheckUtils]: 26: Hoare triple {6426#false} assume !(12292 != #t~mem81);havoc #t~mem81;call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem86 := read~int(#t~mem85.base, 76 + #t~mem85.offset, 4);call write~int(1 + #t~mem86, #t~mem85.base, 76 + #t~mem85.offset, 4);havoc #t~mem85.base, #t~mem85.offset;havoc #t~mem86;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-07 16:11:04,857 INFO L290 TraceCheckUtils]: 27: Hoare triple {6426#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {6426#false} is VALID [2022-04-07 16:11:04,857 INFO L290 TraceCheckUtils]: 28: Hoare triple {6426#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {6426#false} is VALID [2022-04-07 16:11:04,857 INFO L290 TraceCheckUtils]: 29: Hoare triple {6426#false} ~skip~0 := 0; {6426#false} is VALID [2022-04-07 16:11:04,857 INFO L290 TraceCheckUtils]: 30: Hoare triple {6426#false} assume !false; {6426#false} is VALID [2022-04-07 16:11:04,857 INFO L290 TraceCheckUtils]: 31: Hoare triple {6426#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-07 16:11:04,857 INFO L290 TraceCheckUtils]: 32: Hoare triple {6426#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-07 16:11:04,857 INFO L290 TraceCheckUtils]: 33: Hoare triple {6426#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-07 16:11:04,857 INFO L290 TraceCheckUtils]: 34: Hoare triple {6426#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-07 16:11:04,857 INFO L290 TraceCheckUtils]: 35: Hoare triple {6426#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-07 16:11:04,857 INFO L290 TraceCheckUtils]: 36: Hoare triple {6426#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-07 16:11:04,857 INFO L290 TraceCheckUtils]: 37: Hoare triple {6426#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-07 16:11:04,857 INFO L290 TraceCheckUtils]: 38: Hoare triple {6426#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-07 16:11:04,857 INFO L290 TraceCheckUtils]: 39: Hoare triple {6426#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-07 16:11:04,857 INFO L290 TraceCheckUtils]: 40: Hoare triple {6426#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-07 16:11:04,857 INFO L290 TraceCheckUtils]: 41: Hoare triple {6426#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-07 16:11:04,858 INFO L290 TraceCheckUtils]: 42: Hoare triple {6426#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-07 16:11:04,858 INFO L290 TraceCheckUtils]: 43: Hoare triple {6426#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-07 16:11:04,858 INFO L290 TraceCheckUtils]: 44: Hoare triple {6426#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-07 16:11:04,858 INFO L290 TraceCheckUtils]: 45: Hoare triple {6426#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-07 16:11:04,858 INFO L290 TraceCheckUtils]: 46: Hoare triple {6426#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-07 16:11:04,858 INFO L290 TraceCheckUtils]: 47: Hoare triple {6426#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-07 16:11:04,858 INFO L290 TraceCheckUtils]: 48: Hoare triple {6426#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-07 16:11:04,858 INFO L290 TraceCheckUtils]: 49: Hoare triple {6426#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-07 16:11:04,858 INFO L290 TraceCheckUtils]: 50: Hoare triple {6426#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-07 16:11:04,858 INFO L290 TraceCheckUtils]: 51: Hoare triple {6426#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-07 16:11:04,858 INFO L290 TraceCheckUtils]: 52: Hoare triple {6426#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-07 16:11:04,858 INFO L290 TraceCheckUtils]: 53: Hoare triple {6426#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-07 16:11:04,858 INFO L290 TraceCheckUtils]: 54: Hoare triple {6426#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-07 16:11:04,858 INFO L290 TraceCheckUtils]: 55: Hoare triple {6426#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-07 16:11:04,858 INFO L290 TraceCheckUtils]: 56: Hoare triple {6426#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-07 16:11:04,859 INFO L290 TraceCheckUtils]: 57: Hoare triple {6426#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-07 16:11:04,859 INFO L290 TraceCheckUtils]: 58: Hoare triple {6426#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-07 16:11:04,859 INFO L290 TraceCheckUtils]: 59: Hoare triple {6426#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-07 16:11:04,859 INFO L290 TraceCheckUtils]: 60: Hoare triple {6426#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-07 16:11:04,859 INFO L290 TraceCheckUtils]: 61: Hoare triple {6426#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-07 16:11:04,859 INFO L290 TraceCheckUtils]: 62: Hoare triple {6426#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-07 16:11:04,859 INFO L290 TraceCheckUtils]: 63: Hoare triple {6426#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {6426#false} is VALID [2022-04-07 16:11:04,859 INFO L290 TraceCheckUtils]: 64: Hoare triple {6426#false} assume 8672 == #t~mem74;havoc #t~mem74; {6426#false} is VALID [2022-04-07 16:11:04,859 INFO L290 TraceCheckUtils]: 65: Hoare triple {6426#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {6426#false} is VALID [2022-04-07 16:11:04,859 INFO L290 TraceCheckUtils]: 66: Hoare triple {6426#false} assume 4 == ~blastFlag~0; {6426#false} is VALID [2022-04-07 16:11:04,859 INFO L290 TraceCheckUtils]: 67: Hoare triple {6426#false} assume !false; {6426#false} is VALID [2022-04-07 16:11:04,859 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:11:04,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:11:04,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650679049] [2022-04-07 16:11:04,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650679049] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:11:04,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:11:04,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:11:04,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109182185] [2022-04-07 16:11:04,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:11:04,861 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-07 16:11:04,861 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:11:04,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:04,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:11:04,930 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:11:04,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:11:04,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:11:04,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:11:04,931 INFO L87 Difference]: Start difference. First operand 178 states and 265 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:06,972 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-07 16:11:07,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:07,829 INFO L93 Difference]: Finished difference Result 343 states and 514 transitions. [2022-04-07 16:11:07,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:11:07,830 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-07 16:11:07,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:11:07,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:07,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 428 transitions. [2022-04-07 16:11:07,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:07,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 428 transitions. [2022-04-07 16:11:07,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 428 transitions. [2022-04-07 16:11:08,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 428 edges. 428 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:11:08,115 INFO L225 Difference]: With dead ends: 343 [2022-04-07 16:11:08,115 INFO L226 Difference]: Without dead ends: 191 [2022-04-07 16:11:08,116 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-07 16:11:08,116 INFO L913 BasicCegarLoop]: 184 mSDtfsCounter, 22 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-07 16:11:08,116 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 470 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 345 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-07 16:11:08,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-04-07 16:11:08,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 178. [2022-04-07 16:11:08,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:11:08,120 INFO L82 GeneralOperation]: Start isEquivalent. First operand 191 states. Second operand has 178 states, 173 states have (on average 1.5028901734104045) internal successors, (260), 173 states have internal predecessors, (260), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:08,120 INFO L74 IsIncluded]: Start isIncluded. First operand 191 states. Second operand has 178 states, 173 states have (on average 1.5028901734104045) internal successors, (260), 173 states have internal predecessors, (260), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:08,121 INFO L87 Difference]: Start difference. First operand 191 states. Second operand has 178 states, 173 states have (on average 1.5028901734104045) internal successors, (260), 173 states have internal predecessors, (260), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:08,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:08,124 INFO L93 Difference]: Finished difference Result 191 states and 281 transitions. [2022-04-07 16:11:08,124 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 281 transitions. [2022-04-07 16:11:08,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:08,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:08,125 INFO L74 IsIncluded]: Start isIncluded. First operand has 178 states, 173 states have (on average 1.5028901734104045) internal successors, (260), 173 states have internal predecessors, (260), 3 states have call successors, (3), 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 191 states. [2022-04-07 16:11:08,125 INFO L87 Difference]: Start difference. First operand has 178 states, 173 states have (on average 1.5028901734104045) internal successors, (260), 173 states have internal predecessors, (260), 3 states have call successors, (3), 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 191 states. [2022-04-07 16:11:08,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:08,128 INFO L93 Difference]: Finished difference Result 191 states and 281 transitions. [2022-04-07 16:11:08,128 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 281 transitions. [2022-04-07 16:11:08,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:08,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:08,128 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:11:08,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:11:08,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 173 states have (on average 1.5028901734104045) internal successors, (260), 173 states have internal predecessors, (260), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:08,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 264 transitions. [2022-04-07 16:11:08,132 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 264 transitions. Word has length 68 [2022-04-07 16:11:08,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:11:08,132 INFO L478 AbstractCegarLoop]: Abstraction has 178 states and 264 transitions. [2022-04-07 16:11:08,132 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:08,132 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 264 transitions. [2022-04-07 16:11:08,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-07 16:11:08,132 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:11:08,132 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:11:08,133 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-07 16:11:08,133 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:11:08,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:11:08,133 INFO L85 PathProgramCache]: Analyzing trace with hash -167412983, now seen corresponding path program 1 times [2022-04-07 16:11:08,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:11:08,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638634243] [2022-04-07 16:11:08,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:11:08,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:11:08,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:08,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:11:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:08,258 INFO L290 TraceCheckUtils]: 0: Hoare triple {7444#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {7437#true} is VALID [2022-04-07 16:11:08,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {7437#true} assume true; {7437#true} is VALID [2022-04-07 16:11:08,258 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7437#true} {7437#true} #664#return; {7437#true} is VALID [2022-04-07 16:11:08,259 INFO L272 TraceCheckUtils]: 0: Hoare triple {7437#true} call ULTIMATE.init(); {7444#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:11:08,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {7444#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {7437#true} is VALID [2022-04-07 16:11:08,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {7437#true} assume true; {7437#true} is VALID [2022-04-07 16:11:08,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7437#true} {7437#true} #664#return; {7437#true} is VALID [2022-04-07 16:11:08,259 INFO L272 TraceCheckUtils]: 4: Hoare triple {7437#true} call #t~ret162 := main(); {7437#true} is VALID [2022-04-07 16:11:08,259 INFO L290 TraceCheckUtils]: 5: Hoare triple {7437#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 52 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {7437#true} is VALID [2022-04-07 16:11:08,259 INFO L290 TraceCheckUtils]: 6: Hoare triple {7437#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {7437#true} is VALID [2022-04-07 16:11:08,260 INFO L272 TraceCheckUtils]: 7: Hoare triple {7437#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {7437#true} is VALID [2022-04-07 16:11:08,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {7437#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {7442#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:08,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {7442#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {7442#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:08,262 INFO L290 TraceCheckUtils]: 10: Hoare triple {7442#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {7442#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:08,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {7442#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {7442#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:08,263 INFO L290 TraceCheckUtils]: 12: Hoare triple {7442#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {7442#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:08,263 INFO L290 TraceCheckUtils]: 13: Hoare triple {7442#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {7442#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:08,263 INFO L290 TraceCheckUtils]: 14: Hoare triple {7442#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {7442#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:08,264 INFO L290 TraceCheckUtils]: 15: Hoare triple {7442#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {7442#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:08,264 INFO L290 TraceCheckUtils]: 16: Hoare triple {7442#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {7442#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:08,264 INFO L290 TraceCheckUtils]: 17: Hoare triple {7442#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {7442#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:08,265 INFO L290 TraceCheckUtils]: 18: Hoare triple {7442#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {7443#(= 8464 |ssl3_accept_#t~mem45|)} is VALID [2022-04-07 16:11:08,265 INFO L290 TraceCheckUtils]: 19: Hoare triple {7443#(= 8464 |ssl3_accept_#t~mem45|)} assume 24576 == #t~mem45;havoc #t~mem45; {7438#false} is VALID [2022-04-07 16:11:08,265 INFO L290 TraceCheckUtils]: 20: Hoare triple {7438#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {7438#false} is VALID [2022-04-07 16:11:08,265 INFO L290 TraceCheckUtils]: 21: Hoare triple {7438#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7438#false} is VALID [2022-04-07 16:11:08,265 INFO L290 TraceCheckUtils]: 22: Hoare triple {7438#false} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {7438#false} is VALID [2022-04-07 16:11:08,265 INFO L290 TraceCheckUtils]: 23: Hoare triple {7438#false} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {7438#false} is VALID [2022-04-07 16:11:08,265 INFO L290 TraceCheckUtils]: 24: Hoare triple {7438#false} assume !(0 == (#t~mem78.base + #t~mem78.offset) % 4294967296);havoc #t~mem78.base, #t~mem78.offset; {7438#false} is VALID [2022-04-07 16:11:08,265 INFO L290 TraceCheckUtils]: 25: Hoare triple {7438#false} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {7438#false} is VALID [2022-04-07 16:11:08,266 INFO L290 TraceCheckUtils]: 26: Hoare triple {7438#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-07 16:11:08,268 INFO L290 TraceCheckUtils]: 27: Hoare triple {7438#false} assume !(12292 != #t~mem81);havoc #t~mem81;call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem86 := read~int(#t~mem85.base, 76 + #t~mem85.offset, 4);call write~int(1 + #t~mem86, #t~mem85.base, 76 + #t~mem85.offset, 4);havoc #t~mem85.base, #t~mem85.offset;havoc #t~mem86;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-07 16:11:08,268 INFO L290 TraceCheckUtils]: 28: Hoare triple {7438#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {7438#false} is VALID [2022-04-07 16:11:08,268 INFO L290 TraceCheckUtils]: 29: Hoare triple {7438#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {7438#false} is VALID [2022-04-07 16:11:08,269 INFO L290 TraceCheckUtils]: 30: Hoare triple {7438#false} ~skip~0 := 0; {7438#false} is VALID [2022-04-07 16:11:08,269 INFO L290 TraceCheckUtils]: 31: Hoare triple {7438#false} assume !false; {7438#false} is VALID [2022-04-07 16:11:08,269 INFO L290 TraceCheckUtils]: 32: Hoare triple {7438#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-07 16:11:08,270 INFO L290 TraceCheckUtils]: 33: Hoare triple {7438#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-07 16:11:08,271 INFO L290 TraceCheckUtils]: 34: Hoare triple {7438#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-07 16:11:08,271 INFO L290 TraceCheckUtils]: 35: Hoare triple {7438#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-07 16:11:08,273 INFO L290 TraceCheckUtils]: 36: Hoare triple {7438#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-07 16:11:08,274 INFO L290 TraceCheckUtils]: 37: Hoare triple {7438#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-07 16:11:08,274 INFO L290 TraceCheckUtils]: 38: Hoare triple {7438#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-07 16:11:08,274 INFO L290 TraceCheckUtils]: 39: Hoare triple {7438#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-07 16:11:08,274 INFO L290 TraceCheckUtils]: 40: Hoare triple {7438#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-07 16:11:08,274 INFO L290 TraceCheckUtils]: 41: Hoare triple {7438#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-07 16:11:08,274 INFO L290 TraceCheckUtils]: 42: Hoare triple {7438#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-07 16:11:08,274 INFO L290 TraceCheckUtils]: 43: Hoare triple {7438#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-07 16:11:08,274 INFO L290 TraceCheckUtils]: 44: Hoare triple {7438#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-07 16:11:08,274 INFO L290 TraceCheckUtils]: 45: Hoare triple {7438#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-07 16:11:08,274 INFO L290 TraceCheckUtils]: 46: Hoare triple {7438#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-07 16:11:08,274 INFO L290 TraceCheckUtils]: 47: Hoare triple {7438#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-07 16:11:08,274 INFO L290 TraceCheckUtils]: 48: Hoare triple {7438#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-07 16:11:08,274 INFO L290 TraceCheckUtils]: 49: Hoare triple {7438#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-07 16:11:08,274 INFO L290 TraceCheckUtils]: 50: Hoare triple {7438#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-07 16:11:08,274 INFO L290 TraceCheckUtils]: 51: Hoare triple {7438#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-07 16:11:08,274 INFO L290 TraceCheckUtils]: 52: Hoare triple {7438#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-07 16:11:08,275 INFO L290 TraceCheckUtils]: 53: Hoare triple {7438#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-07 16:11:08,275 INFO L290 TraceCheckUtils]: 54: Hoare triple {7438#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-07 16:11:08,275 INFO L290 TraceCheckUtils]: 55: Hoare triple {7438#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-07 16:11:08,275 INFO L290 TraceCheckUtils]: 56: Hoare triple {7438#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-07 16:11:08,275 INFO L290 TraceCheckUtils]: 57: Hoare triple {7438#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-07 16:11:08,275 INFO L290 TraceCheckUtils]: 58: Hoare triple {7438#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-07 16:11:08,275 INFO L290 TraceCheckUtils]: 59: Hoare triple {7438#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-07 16:11:08,275 INFO L290 TraceCheckUtils]: 60: Hoare triple {7438#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-07 16:11:08,275 INFO L290 TraceCheckUtils]: 61: Hoare triple {7438#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-07 16:11:08,275 INFO L290 TraceCheckUtils]: 62: Hoare triple {7438#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-07 16:11:08,275 INFO L290 TraceCheckUtils]: 63: Hoare triple {7438#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-07 16:11:08,276 INFO L290 TraceCheckUtils]: 64: Hoare triple {7438#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {7438#false} is VALID [2022-04-07 16:11:08,276 INFO L290 TraceCheckUtils]: 65: Hoare triple {7438#false} assume 8672 == #t~mem74;havoc #t~mem74; {7438#false} is VALID [2022-04-07 16:11:08,276 INFO L290 TraceCheckUtils]: 66: Hoare triple {7438#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {7438#false} is VALID [2022-04-07 16:11:08,276 INFO L290 TraceCheckUtils]: 67: Hoare triple {7438#false} assume 4 == ~blastFlag~0; {7438#false} is VALID [2022-04-07 16:11:08,276 INFO L290 TraceCheckUtils]: 68: Hoare triple {7438#false} assume !false; {7438#false} is VALID [2022-04-07 16:11:08,276 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:11:08,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:11:08,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638634243] [2022-04-07 16:11:08,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638634243] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:11:08,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:11:08,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:11:08,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107104172] [2022-04-07 16:11:08,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:11:08,277 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-07 16:11:08,277 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:11:08,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:08,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:11:08,331 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:11:08,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:11:08,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:11:08,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:11:08,332 INFO L87 Difference]: Start difference. First operand 178 states and 264 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:12,004 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-07 16:11:14,008 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-07 16:11:16,036 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-07 16:11:18,056 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-07 16:11:19,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:19,019 INFO L93 Difference]: Finished difference Result 343 states and 513 transitions. [2022-04-07 16:11:19,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:11:19,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-07 16:11:19,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:11:19,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:19,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 427 transitions. [2022-04-07 16:11:19,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:19,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 427 transitions. [2022-04-07 16:11:19,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 427 transitions. [2022-04-07 16:11:19,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 427 edges. 427 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:11:19,321 INFO L225 Difference]: With dead ends: 343 [2022-04-07 16:11:19,321 INFO L226 Difference]: Without dead ends: 191 [2022-04-07 16:11:19,322 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-07 16:11:19,322 INFO L913 BasicCegarLoop]: 184 mSDtfsCounter, 20 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 8 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-04-07 16:11:19,322 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 470 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 346 Invalid, 3 Unknown, 0 Unchecked, 8.0s Time] [2022-04-07 16:11:19,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-04-07 16:11:19,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 178. [2022-04-07 16:11:19,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:11:19,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 191 states. Second operand has 178 states, 173 states have (on average 1.4971098265895955) internal successors, (259), 173 states have internal predecessors, (259), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:19,326 INFO L74 IsIncluded]: Start isIncluded. First operand 191 states. Second operand has 178 states, 173 states have (on average 1.4971098265895955) internal successors, (259), 173 states have internal predecessors, (259), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:19,326 INFO L87 Difference]: Start difference. First operand 191 states. Second operand has 178 states, 173 states have (on average 1.4971098265895955) internal successors, (259), 173 states have internal predecessors, (259), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:19,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:19,331 INFO L93 Difference]: Finished difference Result 191 states and 280 transitions. [2022-04-07 16:11:19,331 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 280 transitions. [2022-04-07 16:11:19,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:19,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:19,335 INFO L74 IsIncluded]: Start isIncluded. First operand has 178 states, 173 states have (on average 1.4971098265895955) internal successors, (259), 173 states have internal predecessors, (259), 3 states have call successors, (3), 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 191 states. [2022-04-07 16:11:19,336 INFO L87 Difference]: Start difference. First operand has 178 states, 173 states have (on average 1.4971098265895955) internal successors, (259), 173 states have internal predecessors, (259), 3 states have call successors, (3), 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 191 states. [2022-04-07 16:11:19,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:19,338 INFO L93 Difference]: Finished difference Result 191 states and 280 transitions. [2022-04-07 16:11:19,338 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 280 transitions. [2022-04-07 16:11:19,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:19,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:19,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:11:19,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:11:19,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 173 states have (on average 1.4971098265895955) internal successors, (259), 173 states have internal predecessors, (259), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:19,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 263 transitions. [2022-04-07 16:11:19,359 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 263 transitions. Word has length 69 [2022-04-07 16:11:19,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:11:19,359 INFO L478 AbstractCegarLoop]: Abstraction has 178 states and 263 transitions. [2022-04-07 16:11:19,359 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:19,359 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 263 transitions. [2022-04-07 16:11:19,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-07 16:11:19,363 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:11:19,363 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:11:19,363 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-07 16:11:19,363 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:11:19,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:11:19,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1642777843, now seen corresponding path program 1 times [2022-04-07 16:11:19,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:11:19,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144726251] [2022-04-07 16:11:19,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:11:19,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:11:19,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:19,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:11:19,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:19,474 INFO L290 TraceCheckUtils]: 0: Hoare triple {8456#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {8449#true} is VALID [2022-04-07 16:11:19,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {8449#true} assume true; {8449#true} is VALID [2022-04-07 16:11:19,474 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8449#true} {8449#true} #664#return; {8449#true} is VALID [2022-04-07 16:11:19,475 INFO L272 TraceCheckUtils]: 0: Hoare triple {8449#true} call ULTIMATE.init(); {8456#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:11:19,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {8456#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {8449#true} is VALID [2022-04-07 16:11:19,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {8449#true} assume true; {8449#true} is VALID [2022-04-07 16:11:19,475 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8449#true} {8449#true} #664#return; {8449#true} is VALID [2022-04-07 16:11:19,475 INFO L272 TraceCheckUtils]: 4: Hoare triple {8449#true} call #t~ret162 := main(); {8449#true} is VALID [2022-04-07 16:11:19,475 INFO L290 TraceCheckUtils]: 5: Hoare triple {8449#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 52 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {8449#true} is VALID [2022-04-07 16:11:19,475 INFO L290 TraceCheckUtils]: 6: Hoare triple {8449#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {8449#true} is VALID [2022-04-07 16:11:19,475 INFO L272 TraceCheckUtils]: 7: Hoare triple {8449#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {8449#true} is VALID [2022-04-07 16:11:19,475 INFO L290 TraceCheckUtils]: 8: Hoare triple {8449#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {8449#true} is VALID [2022-04-07 16:11:19,475 INFO L290 TraceCheckUtils]: 9: Hoare triple {8449#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {8449#true} is VALID [2022-04-07 16:11:19,475 INFO L290 TraceCheckUtils]: 10: Hoare triple {8449#true} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {8449#true} is VALID [2022-04-07 16:11:19,475 INFO L290 TraceCheckUtils]: 11: Hoare triple {8449#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {8449#true} is VALID [2022-04-07 16:11:19,475 INFO L290 TraceCheckUtils]: 12: Hoare triple {8449#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {8449#true} is VALID [2022-04-07 16:11:19,476 INFO L290 TraceCheckUtils]: 13: Hoare triple {8449#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {8449#true} is VALID [2022-04-07 16:11:19,476 INFO L290 TraceCheckUtils]: 14: Hoare triple {8449#true} assume !false; {8449#true} is VALID [2022-04-07 16:11:19,476 INFO L290 TraceCheckUtils]: 15: Hoare triple {8449#true} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {8449#true} is VALID [2022-04-07 16:11:19,476 INFO L290 TraceCheckUtils]: 16: Hoare triple {8449#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {8449#true} is VALID [2022-04-07 16:11:19,476 INFO L290 TraceCheckUtils]: 17: Hoare triple {8449#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {8449#true} is VALID [2022-04-07 16:11:19,476 INFO L290 TraceCheckUtils]: 18: Hoare triple {8449#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {8449#true} is VALID [2022-04-07 16:11:19,476 INFO L290 TraceCheckUtils]: 19: Hoare triple {8449#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {8449#true} is VALID [2022-04-07 16:11:19,476 INFO L290 TraceCheckUtils]: 20: Hoare triple {8449#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {8449#true} is VALID [2022-04-07 16:11:19,476 INFO L290 TraceCheckUtils]: 21: Hoare triple {8449#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {8449#true} is VALID [2022-04-07 16:11:19,476 INFO L290 TraceCheckUtils]: 22: Hoare triple {8449#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {8449#true} is VALID [2022-04-07 16:11:19,476 INFO L290 TraceCheckUtils]: 23: Hoare triple {8449#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {8449#true} is VALID [2022-04-07 16:11:19,476 INFO L290 TraceCheckUtils]: 24: Hoare triple {8449#true} assume 8464 == #t~mem50;havoc #t~mem50; {8449#true} is VALID [2022-04-07 16:11:19,476 INFO L290 TraceCheckUtils]: 25: Hoare triple {8449#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; {8449#true} is VALID [2022-04-07 16:11:19,476 INFO L290 TraceCheckUtils]: 26: Hoare triple {8449#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {8449#true} is VALID [2022-04-07 16:11:19,477 INFO L290 TraceCheckUtils]: 27: Hoare triple {8449#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:19,477 INFO L290 TraceCheckUtils]: 28: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:19,478 INFO L290 TraceCheckUtils]: 29: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:19,478 INFO L290 TraceCheckUtils]: 30: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:19,478 INFO L290 TraceCheckUtils]: 31: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:19,479 INFO L290 TraceCheckUtils]: 32: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:19,479 INFO L290 TraceCheckUtils]: 33: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:19,479 INFO L290 TraceCheckUtils]: 34: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:19,480 INFO L290 TraceCheckUtils]: 35: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:19,480 INFO L290 TraceCheckUtils]: 36: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:19,480 INFO L290 TraceCheckUtils]: 37: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:19,481 INFO L290 TraceCheckUtils]: 38: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:19,481 INFO L290 TraceCheckUtils]: 39: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:19,481 INFO L290 TraceCheckUtils]: 40: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:19,482 INFO L290 TraceCheckUtils]: 41: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:19,482 INFO L290 TraceCheckUtils]: 42: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:19,482 INFO L290 TraceCheckUtils]: 43: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:19,483 INFO L290 TraceCheckUtils]: 44: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:19,483 INFO L290 TraceCheckUtils]: 45: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:19,483 INFO L290 TraceCheckUtils]: 46: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:19,484 INFO L290 TraceCheckUtils]: 47: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:19,484 INFO L290 TraceCheckUtils]: 48: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:19,484 INFO L290 TraceCheckUtils]: 49: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:19,485 INFO L290 TraceCheckUtils]: 50: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:19,485 INFO L290 TraceCheckUtils]: 51: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:19,485 INFO L290 TraceCheckUtils]: 52: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:19,486 INFO L290 TraceCheckUtils]: 53: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:19,486 INFO L290 TraceCheckUtils]: 54: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:19,486 INFO L290 TraceCheckUtils]: 55: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:19,487 INFO L290 TraceCheckUtils]: 56: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:19,487 INFO L290 TraceCheckUtils]: 57: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:19,487 INFO L290 TraceCheckUtils]: 58: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:19,488 INFO L290 TraceCheckUtils]: 59: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:19,488 INFO L290 TraceCheckUtils]: 60: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:19,488 INFO L290 TraceCheckUtils]: 61: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:19,489 INFO L290 TraceCheckUtils]: 62: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:19,489 INFO L290 TraceCheckUtils]: 63: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:19,489 INFO L290 TraceCheckUtils]: 64: Hoare triple {8454#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {8455#(not (= |ssl3_accept_#t~mem74| 8672))} is VALID [2022-04-07 16:11:19,490 INFO L290 TraceCheckUtils]: 65: Hoare triple {8455#(not (= |ssl3_accept_#t~mem74| 8672))} assume 8672 == #t~mem74;havoc #t~mem74; {8450#false} is VALID [2022-04-07 16:11:19,490 INFO L290 TraceCheckUtils]: 66: Hoare triple {8450#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {8450#false} is VALID [2022-04-07 16:11:19,490 INFO L290 TraceCheckUtils]: 67: Hoare triple {8450#false} assume 4 == ~blastFlag~0; {8450#false} is VALID [2022-04-07 16:11:19,490 INFO L290 TraceCheckUtils]: 68: Hoare triple {8450#false} assume !false; {8450#false} is VALID [2022-04-07 16:11:19,490 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:11:19,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:11:19,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144726251] [2022-04-07 16:11:19,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144726251] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:11:19,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:11:19,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:11:19,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245609648] [2022-04-07 16:11:19,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:11:19,491 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-07 16:11:19,492 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:11:19,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:19,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:11:19,547 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:11:19,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:11:19,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:11:19,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:11:19,548 INFO L87 Difference]: Start difference. First operand 178 states and 263 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:21,607 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-07 16:11:22,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:22,764 INFO L93 Difference]: Finished difference Result 450 states and 680 transitions. [2022-04-07 16:11:22,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:11:22,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-07 16:11:22,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:11:22,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:22,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 575 transitions. [2022-04-07 16:11:22,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:22,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 575 transitions. [2022-04-07 16:11:22,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 575 transitions. [2022-04-07 16:11:23,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 575 edges. 575 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:11:23,183 INFO L225 Difference]: With dead ends: 450 [2022-04-07 16:11:23,183 INFO L226 Difference]: Without dead ends: 298 [2022-04-07 16:11:23,183 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-07 16:11:23,184 INFO L913 BasicCegarLoop]: 110 mSDtfsCounter, 112 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-07 16:11:23,184 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 322 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 467 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-07 16:11:23,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-04-07 16:11:23,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 225. [2022-04-07 16:11:23,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:11:23,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 298 states. Second operand has 225 states, 220 states have (on average 1.5681818181818181) internal successors, (345), 220 states have internal predecessors, (345), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:23,189 INFO L74 IsIncluded]: Start isIncluded. First operand 298 states. Second operand has 225 states, 220 states have (on average 1.5681818181818181) internal successors, (345), 220 states have internal predecessors, (345), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:23,189 INFO L87 Difference]: Start difference. First operand 298 states. Second operand has 225 states, 220 states have (on average 1.5681818181818181) internal successors, (345), 220 states have internal predecessors, (345), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:23,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:23,194 INFO L93 Difference]: Finished difference Result 298 states and 447 transitions. [2022-04-07 16:11:23,194 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 447 transitions. [2022-04-07 16:11:23,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:23,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:23,195 INFO L74 IsIncluded]: Start isIncluded. First operand has 225 states, 220 states have (on average 1.5681818181818181) internal successors, (345), 220 states have internal predecessors, (345), 3 states have call successors, (3), 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 298 states. [2022-04-07 16:11:23,195 INFO L87 Difference]: Start difference. First operand has 225 states, 220 states have (on average 1.5681818181818181) internal successors, (345), 220 states have internal predecessors, (345), 3 states have call successors, (3), 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 298 states. [2022-04-07 16:11:23,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:23,199 INFO L93 Difference]: Finished difference Result 298 states and 447 transitions. [2022-04-07 16:11:23,199 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 447 transitions. [2022-04-07 16:11:23,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:23,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:23,200 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:11:23,200 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:11:23,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 220 states have (on average 1.5681818181818181) internal successors, (345), 220 states have internal predecessors, (345), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:23,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 349 transitions. [2022-04-07 16:11:23,204 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 349 transitions. Word has length 69 [2022-04-07 16:11:23,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:11:23,204 INFO L478 AbstractCegarLoop]: Abstraction has 225 states and 349 transitions. [2022-04-07 16:11:23,204 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:23,204 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 349 transitions. [2022-04-07 16:11:23,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-07 16:11:23,204 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:11:23,204 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:11:23,204 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-07 16:11:23,205 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:11:23,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:11:23,205 INFO L85 PathProgramCache]: Analyzing trace with hash 606399189, now seen corresponding path program 1 times [2022-04-07 16:11:23,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:11:23,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989014413] [2022-04-07 16:11:23,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:11:23,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:11:23,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:23,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:11:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:23,307 INFO L290 TraceCheckUtils]: 0: Hoare triple {9859#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {9852#true} is VALID [2022-04-07 16:11:23,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {9852#true} assume true; {9852#true} is VALID [2022-04-07 16:11:23,307 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9852#true} {9852#true} #664#return; {9852#true} is VALID [2022-04-07 16:11:23,308 INFO L272 TraceCheckUtils]: 0: Hoare triple {9852#true} call ULTIMATE.init(); {9859#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:11:23,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {9859#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {9852#true} is VALID [2022-04-07 16:11:23,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {9852#true} assume true; {9852#true} is VALID [2022-04-07 16:11:23,308 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9852#true} {9852#true} #664#return; {9852#true} is VALID [2022-04-07 16:11:23,308 INFO L272 TraceCheckUtils]: 4: Hoare triple {9852#true} call #t~ret162 := main(); {9852#true} is VALID [2022-04-07 16:11:23,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {9852#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 52 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {9852#true} is VALID [2022-04-07 16:11:23,308 INFO L290 TraceCheckUtils]: 6: Hoare triple {9852#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {9852#true} is VALID [2022-04-07 16:11:23,308 INFO L272 TraceCheckUtils]: 7: Hoare triple {9852#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {9852#true} is VALID [2022-04-07 16:11:23,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {9852#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {9852#true} is VALID [2022-04-07 16:11:23,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {9852#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {9852#true} is VALID [2022-04-07 16:11:23,310 INFO L290 TraceCheckUtils]: 10: Hoare triple {9852#true} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {9852#true} is VALID [2022-04-07 16:11:23,310 INFO L290 TraceCheckUtils]: 11: Hoare triple {9852#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {9852#true} is VALID [2022-04-07 16:11:23,310 INFO L290 TraceCheckUtils]: 12: Hoare triple {9852#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {9852#true} is VALID [2022-04-07 16:11:23,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {9852#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {9852#true} is VALID [2022-04-07 16:11:23,311 INFO L290 TraceCheckUtils]: 14: Hoare triple {9852#true} assume !false; {9852#true} is VALID [2022-04-07 16:11:23,311 INFO L290 TraceCheckUtils]: 15: Hoare triple {9852#true} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {9852#true} is VALID [2022-04-07 16:11:23,311 INFO L290 TraceCheckUtils]: 16: Hoare triple {9852#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {9852#true} is VALID [2022-04-07 16:11:23,311 INFO L290 TraceCheckUtils]: 17: Hoare triple {9852#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {9852#true} is VALID [2022-04-07 16:11:23,311 INFO L290 TraceCheckUtils]: 18: Hoare triple {9852#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {9852#true} is VALID [2022-04-07 16:11:23,311 INFO L290 TraceCheckUtils]: 19: Hoare triple {9852#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {9852#true} is VALID [2022-04-07 16:11:23,311 INFO L290 TraceCheckUtils]: 20: Hoare triple {9852#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {9852#true} is VALID [2022-04-07 16:11:23,311 INFO L290 TraceCheckUtils]: 21: Hoare triple {9852#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {9852#true} is VALID [2022-04-07 16:11:23,311 INFO L290 TraceCheckUtils]: 22: Hoare triple {9852#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9852#true} is VALID [2022-04-07 16:11:23,311 INFO L290 TraceCheckUtils]: 23: Hoare triple {9852#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9852#true} is VALID [2022-04-07 16:11:23,311 INFO L290 TraceCheckUtils]: 24: Hoare triple {9852#true} assume 8464 == #t~mem50;havoc #t~mem50; {9852#true} is VALID [2022-04-07 16:11:23,311 INFO L290 TraceCheckUtils]: 25: Hoare triple {9852#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; {9852#true} is VALID [2022-04-07 16:11:23,311 INFO L290 TraceCheckUtils]: 26: Hoare triple {9852#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {9852#true} is VALID [2022-04-07 16:11:23,312 INFO L290 TraceCheckUtils]: 27: Hoare triple {9852#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:23,312 INFO L290 TraceCheckUtils]: 28: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:23,313 INFO L290 TraceCheckUtils]: 29: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:23,313 INFO L290 TraceCheckUtils]: 30: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:23,313 INFO L290 TraceCheckUtils]: 31: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:23,314 INFO L290 TraceCheckUtils]: 32: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:23,314 INFO L290 TraceCheckUtils]: 33: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:23,314 INFO L290 TraceCheckUtils]: 34: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:23,315 INFO L290 TraceCheckUtils]: 35: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:23,315 INFO L290 TraceCheckUtils]: 36: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:23,315 INFO L290 TraceCheckUtils]: 37: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:23,316 INFO L290 TraceCheckUtils]: 38: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:23,316 INFO L290 TraceCheckUtils]: 39: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:23,316 INFO L290 TraceCheckUtils]: 40: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:23,316 INFO L290 TraceCheckUtils]: 41: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:23,317 INFO L290 TraceCheckUtils]: 42: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:23,317 INFO L290 TraceCheckUtils]: 43: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:23,317 INFO L290 TraceCheckUtils]: 44: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:23,318 INFO L290 TraceCheckUtils]: 45: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:23,318 INFO L290 TraceCheckUtils]: 46: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:23,318 INFO L290 TraceCheckUtils]: 47: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:23,319 INFO L290 TraceCheckUtils]: 48: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:23,319 INFO L290 TraceCheckUtils]: 49: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:23,319 INFO L290 TraceCheckUtils]: 50: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:23,320 INFO L290 TraceCheckUtils]: 51: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:23,320 INFO L290 TraceCheckUtils]: 52: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:23,320 INFO L290 TraceCheckUtils]: 53: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:23,320 INFO L290 TraceCheckUtils]: 54: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:23,321 INFO L290 TraceCheckUtils]: 55: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:23,321 INFO L290 TraceCheckUtils]: 56: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:23,321 INFO L290 TraceCheckUtils]: 57: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:23,322 INFO L290 TraceCheckUtils]: 58: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:23,322 INFO L290 TraceCheckUtils]: 59: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:23,322 INFO L290 TraceCheckUtils]: 60: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:23,323 INFO L290 TraceCheckUtils]: 61: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:23,323 INFO L290 TraceCheckUtils]: 62: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:23,323 INFO L290 TraceCheckUtils]: 63: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:23,324 INFO L290 TraceCheckUtils]: 64: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:23,324 INFO L290 TraceCheckUtils]: 65: Hoare triple {9857#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8672 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {9858#(not (= |ssl3_accept_#t~mem75| 8673))} is VALID [2022-04-07 16:11:23,324 INFO L290 TraceCheckUtils]: 66: Hoare triple {9858#(not (= |ssl3_accept_#t~mem75| 8673))} assume 8673 == #t~mem75;havoc #t~mem75; {9853#false} is VALID [2022-04-07 16:11:23,326 INFO L290 TraceCheckUtils]: 67: Hoare triple {9853#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {9853#false} is VALID [2022-04-07 16:11:23,327 INFO L290 TraceCheckUtils]: 68: Hoare triple {9853#false} assume 4 == ~blastFlag~0; {9853#false} is VALID [2022-04-07 16:11:23,327 INFO L290 TraceCheckUtils]: 69: Hoare triple {9853#false} assume !false; {9853#false} is VALID [2022-04-07 16:11:23,327 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:11:23,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:11:23,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989014413] [2022-04-07 16:11:23,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989014413] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:11:23,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:11:23,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:11:23,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615905346] [2022-04-07 16:11:23,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:11:23,328 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2022-04-07 16:11:23,328 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:11:23,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:23,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:11:23,381 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:11:23,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:11:23,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:11:23,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:11:23,381 INFO L87 Difference]: Start difference. First operand 225 states and 349 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:25,404 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-07 16:11:26,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:26,574 INFO L93 Difference]: Finished difference Result 524 states and 819 transitions. [2022-04-07 16:11:26,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:11:26,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2022-04-07 16:11:26,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:11:26,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:26,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 575 transitions. [2022-04-07 16:11:26,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:26,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 575 transitions. [2022-04-07 16:11:26,580 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 575 transitions. [2022-04-07 16:11:26,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 575 edges. 575 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:11:26,982 INFO L225 Difference]: With dead ends: 524 [2022-04-07 16:11:26,982 INFO L226 Difference]: Without dead ends: 323 [2022-04-07 16:11:26,982 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-07 16:11:26,983 INFO L913 BasicCegarLoop]: 118 mSDtfsCounter, 113 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 62 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-07 16:11:26,983 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 337 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 474 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-07 16:11:26,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-04-07 16:11:26,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 251. [2022-04-07 16:11:26,987 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:11:26,988 INFO L82 GeneralOperation]: Start isEquivalent. First operand 323 states. Second operand has 251 states, 246 states have (on average 1.6097560975609757) internal successors, (396), 246 states have internal predecessors, (396), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:26,988 INFO L74 IsIncluded]: Start isIncluded. First operand 323 states. Second operand has 251 states, 246 states have (on average 1.6097560975609757) internal successors, (396), 246 states have internal predecessors, (396), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:27,008 INFO L87 Difference]: Start difference. First operand 323 states. Second operand has 251 states, 246 states have (on average 1.6097560975609757) internal successors, (396), 246 states have internal predecessors, (396), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:27,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:27,014 INFO L93 Difference]: Finished difference Result 323 states and 497 transitions. [2022-04-07 16:11:27,014 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 497 transitions. [2022-04-07 16:11:27,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:27,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:27,014 INFO L74 IsIncluded]: Start isIncluded. First operand has 251 states, 246 states have (on average 1.6097560975609757) internal successors, (396), 246 states have internal predecessors, (396), 3 states have call successors, (3), 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 323 states. [2022-04-07 16:11:27,015 INFO L87 Difference]: Start difference. First operand has 251 states, 246 states have (on average 1.6097560975609757) internal successors, (396), 246 states have internal predecessors, (396), 3 states have call successors, (3), 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 323 states. [2022-04-07 16:11:27,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:27,020 INFO L93 Difference]: Finished difference Result 323 states and 497 transitions. [2022-04-07 16:11:27,020 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 497 transitions. [2022-04-07 16:11:27,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:27,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:27,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:11:27,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:11:27,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 246 states have (on average 1.6097560975609757) internal successors, (396), 246 states have internal predecessors, (396), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:27,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 400 transitions. [2022-04-07 16:11:27,025 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 400 transitions. Word has length 70 [2022-04-07 16:11:27,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:11:27,025 INFO L478 AbstractCegarLoop]: Abstraction has 251 states and 400 transitions. [2022-04-07 16:11:27,026 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:27,026 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 400 transitions. [2022-04-07 16:11:27,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-07 16:11:27,026 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:11:27,026 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:11:27,026 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-07 16:11:27,027 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:11:27,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:11:27,027 INFO L85 PathProgramCache]: Analyzing trace with hash 2001849160, now seen corresponding path program 1 times [2022-04-07 16:11:27,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:11:27,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030227400] [2022-04-07 16:11:27,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:11:27,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:11:27,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:27,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:11:27,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:27,138 INFO L290 TraceCheckUtils]: 0: Hoare triple {11414#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {11407#true} is VALID [2022-04-07 16:11:27,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {11407#true} assume true; {11407#true} is VALID [2022-04-07 16:11:27,138 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11407#true} {11407#true} #664#return; {11407#true} is VALID [2022-04-07 16:11:27,139 INFO L272 TraceCheckUtils]: 0: Hoare triple {11407#true} call ULTIMATE.init(); {11414#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:11:27,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {11414#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {11407#true} is VALID [2022-04-07 16:11:27,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {11407#true} assume true; {11407#true} is VALID [2022-04-07 16:11:27,139 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11407#true} {11407#true} #664#return; {11407#true} is VALID [2022-04-07 16:11:27,139 INFO L272 TraceCheckUtils]: 4: Hoare triple {11407#true} call #t~ret162 := main(); {11407#true} is VALID [2022-04-07 16:11:27,139 INFO L290 TraceCheckUtils]: 5: Hoare triple {11407#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 52 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {11407#true} is VALID [2022-04-07 16:11:27,139 INFO L290 TraceCheckUtils]: 6: Hoare triple {11407#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {11407#true} is VALID [2022-04-07 16:11:27,139 INFO L272 TraceCheckUtils]: 7: Hoare triple {11407#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {11407#true} is VALID [2022-04-07 16:11:27,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {11407#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {11407#true} is VALID [2022-04-07 16:11:27,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {11407#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {11407#true} is VALID [2022-04-07 16:11:27,140 INFO L290 TraceCheckUtils]: 10: Hoare triple {11407#true} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {11407#true} is VALID [2022-04-07 16:11:27,140 INFO L290 TraceCheckUtils]: 11: Hoare triple {11407#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {11407#true} is VALID [2022-04-07 16:11:27,140 INFO L290 TraceCheckUtils]: 12: Hoare triple {11407#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {11407#true} is VALID [2022-04-07 16:11:27,140 INFO L290 TraceCheckUtils]: 13: Hoare triple {11407#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {11407#true} is VALID [2022-04-07 16:11:27,140 INFO L290 TraceCheckUtils]: 14: Hoare triple {11407#true} assume !false; {11407#true} is VALID [2022-04-07 16:11:27,140 INFO L290 TraceCheckUtils]: 15: Hoare triple {11407#true} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {11407#true} is VALID [2022-04-07 16:11:27,140 INFO L290 TraceCheckUtils]: 16: Hoare triple {11407#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {11407#true} is VALID [2022-04-07 16:11:27,140 INFO L290 TraceCheckUtils]: 17: Hoare triple {11407#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {11407#true} is VALID [2022-04-07 16:11:27,140 INFO L290 TraceCheckUtils]: 18: Hoare triple {11407#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {11407#true} is VALID [2022-04-07 16:11:27,140 INFO L290 TraceCheckUtils]: 19: Hoare triple {11407#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {11407#true} is VALID [2022-04-07 16:11:27,140 INFO L290 TraceCheckUtils]: 20: Hoare triple {11407#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {11407#true} is VALID [2022-04-07 16:11:27,153 INFO L290 TraceCheckUtils]: 21: Hoare triple {11407#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {11407#true} is VALID [2022-04-07 16:11:27,153 INFO L290 TraceCheckUtils]: 22: Hoare triple {11407#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11407#true} is VALID [2022-04-07 16:11:27,153 INFO L290 TraceCheckUtils]: 23: Hoare triple {11407#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11407#true} is VALID [2022-04-07 16:11:27,153 INFO L290 TraceCheckUtils]: 24: Hoare triple {11407#true} assume 8464 == #t~mem50;havoc #t~mem50; {11407#true} is VALID [2022-04-07 16:11:27,153 INFO L290 TraceCheckUtils]: 25: Hoare triple {11407#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; {11407#true} is VALID [2022-04-07 16:11:27,153 INFO L290 TraceCheckUtils]: 26: Hoare triple {11407#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {11407#true} is VALID [2022-04-07 16:11:27,165 INFO L290 TraceCheckUtils]: 27: Hoare triple {11407#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:27,165 INFO L290 TraceCheckUtils]: 28: Hoare triple {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:27,166 INFO L290 TraceCheckUtils]: 29: Hoare triple {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:27,166 INFO L290 TraceCheckUtils]: 30: Hoare triple {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:27,166 INFO L290 TraceCheckUtils]: 31: Hoare triple {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:27,167 INFO L290 TraceCheckUtils]: 32: Hoare triple {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:27,167 INFO L290 TraceCheckUtils]: 33: Hoare triple {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:27,167 INFO L290 TraceCheckUtils]: 34: Hoare triple {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:27,168 INFO L290 TraceCheckUtils]: 35: Hoare triple {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:27,168 INFO L290 TraceCheckUtils]: 36: Hoare triple {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:27,168 INFO L290 TraceCheckUtils]: 37: Hoare triple {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:27,169 INFO L290 TraceCheckUtils]: 38: Hoare triple {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:27,169 INFO L290 TraceCheckUtils]: 39: Hoare triple {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:27,169 INFO L290 TraceCheckUtils]: 40: Hoare triple {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:27,170 INFO L290 TraceCheckUtils]: 41: Hoare triple {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:27,170 INFO L290 TraceCheckUtils]: 42: Hoare triple {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:27,170 INFO L290 TraceCheckUtils]: 43: Hoare triple {11412#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11413#(= |ssl3_accept_#t~mem53| 8496)} is VALID [2022-04-07 16:11:27,171 INFO L290 TraceCheckUtils]: 44: Hoare triple {11413#(= |ssl3_accept_#t~mem53| 8496)} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-07 16:11:27,171 INFO L290 TraceCheckUtils]: 45: Hoare triple {11408#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-07 16:11:27,171 INFO L290 TraceCheckUtils]: 46: Hoare triple {11408#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-07 16:11:27,171 INFO L290 TraceCheckUtils]: 47: Hoare triple {11408#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-07 16:11:27,171 INFO L290 TraceCheckUtils]: 48: Hoare triple {11408#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-07 16:11:27,171 INFO L290 TraceCheckUtils]: 49: Hoare triple {11408#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-07 16:11:27,171 INFO L290 TraceCheckUtils]: 50: Hoare triple {11408#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-07 16:11:27,171 INFO L290 TraceCheckUtils]: 51: Hoare triple {11408#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-07 16:11:27,171 INFO L290 TraceCheckUtils]: 52: Hoare triple {11408#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-07 16:11:27,171 INFO L290 TraceCheckUtils]: 53: Hoare triple {11408#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-07 16:11:27,171 INFO L290 TraceCheckUtils]: 54: Hoare triple {11408#false} assume 8448 == #t~mem63;havoc #t~mem63; {11408#false} is VALID [2022-04-07 16:11:27,171 INFO L290 TraceCheckUtils]: 55: Hoare triple {11408#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~num1~0 := #t~nondet130;havoc #t~nondet130; {11408#false} is VALID [2022-04-07 16:11:27,171 INFO L290 TraceCheckUtils]: 56: Hoare triple {11408#false} assume !(~num1~0 > 0); {11408#false} is VALID [2022-04-07 16:11:27,171 INFO L290 TraceCheckUtils]: 57: Hoare triple {11408#false} call #t~mem131.base, #t~mem131.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem132 := read~int(#t~mem131.base, 844 + #t~mem131.offset, 4);call write~int(#t~mem132, ~s.base, 52 + ~s.offset, 4);havoc #t~mem131.base, #t~mem131.offset;havoc #t~mem132; {11408#false} is VALID [2022-04-07 16:11:27,172 INFO L290 TraceCheckUtils]: 58: Hoare triple {11408#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {11408#false} is VALID [2022-04-07 16:11:27,172 INFO L290 TraceCheckUtils]: 59: Hoare triple {11408#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {11408#false} is VALID [2022-04-07 16:11:27,172 INFO L290 TraceCheckUtils]: 60: Hoare triple {11408#false} ~skip~0 := 0; {11408#false} is VALID [2022-04-07 16:11:27,172 INFO L290 TraceCheckUtils]: 61: Hoare triple {11408#false} assume !false; {11408#false} is VALID [2022-04-07 16:11:27,172 INFO L290 TraceCheckUtils]: 62: Hoare triple {11408#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-07 16:11:27,172 INFO L290 TraceCheckUtils]: 63: Hoare triple {11408#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-07 16:11:27,172 INFO L290 TraceCheckUtils]: 64: Hoare triple {11408#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-07 16:11:27,172 INFO L290 TraceCheckUtils]: 65: Hoare triple {11408#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-07 16:11:27,172 INFO L290 TraceCheckUtils]: 66: Hoare triple {11408#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-07 16:11:27,172 INFO L290 TraceCheckUtils]: 67: Hoare triple {11408#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-07 16:11:27,172 INFO L290 TraceCheckUtils]: 68: Hoare triple {11408#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-07 16:11:27,172 INFO L290 TraceCheckUtils]: 69: Hoare triple {11408#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-07 16:11:27,172 INFO L290 TraceCheckUtils]: 70: Hoare triple {11408#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-07 16:11:27,172 INFO L290 TraceCheckUtils]: 71: Hoare triple {11408#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-07 16:11:27,172 INFO L290 TraceCheckUtils]: 72: Hoare triple {11408#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-07 16:11:27,172 INFO L290 TraceCheckUtils]: 73: Hoare triple {11408#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-07 16:11:27,172 INFO L290 TraceCheckUtils]: 74: Hoare triple {11408#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-07 16:11:27,172 INFO L290 TraceCheckUtils]: 75: Hoare triple {11408#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-07 16:11:27,172 INFO L290 TraceCheckUtils]: 76: Hoare triple {11408#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-07 16:11:27,172 INFO L290 TraceCheckUtils]: 77: Hoare triple {11408#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-07 16:11:27,172 INFO L290 TraceCheckUtils]: 78: Hoare triple {11408#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-07 16:11:27,173 INFO L290 TraceCheckUtils]: 79: Hoare triple {11408#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-07 16:11:27,173 INFO L290 TraceCheckUtils]: 80: Hoare triple {11408#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-07 16:11:27,173 INFO L290 TraceCheckUtils]: 81: Hoare triple {11408#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-07 16:11:27,173 INFO L290 TraceCheckUtils]: 82: Hoare triple {11408#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-07 16:11:27,173 INFO L290 TraceCheckUtils]: 83: Hoare triple {11408#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-07 16:11:27,173 INFO L290 TraceCheckUtils]: 84: Hoare triple {11408#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-07 16:11:27,173 INFO L290 TraceCheckUtils]: 85: Hoare triple {11408#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-07 16:11:27,173 INFO L290 TraceCheckUtils]: 86: Hoare triple {11408#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-07 16:11:27,173 INFO L290 TraceCheckUtils]: 87: Hoare triple {11408#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-07 16:11:27,173 INFO L290 TraceCheckUtils]: 88: Hoare triple {11408#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-07 16:11:27,173 INFO L290 TraceCheckUtils]: 89: Hoare triple {11408#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-07 16:11:27,173 INFO L290 TraceCheckUtils]: 90: Hoare triple {11408#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-07 16:11:27,173 INFO L290 TraceCheckUtils]: 91: Hoare triple {11408#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-07 16:11:27,173 INFO L290 TraceCheckUtils]: 92: Hoare triple {11408#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-07 16:11:27,173 INFO L290 TraceCheckUtils]: 93: Hoare triple {11408#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-07 16:11:27,173 INFO L290 TraceCheckUtils]: 94: Hoare triple {11408#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {11408#false} is VALID [2022-04-07 16:11:27,173 INFO L290 TraceCheckUtils]: 95: Hoare triple {11408#false} assume 8672 == #t~mem74;havoc #t~mem74; {11408#false} is VALID [2022-04-07 16:11:27,173 INFO L290 TraceCheckUtils]: 96: Hoare triple {11408#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {11408#false} is VALID [2022-04-07 16:11:27,173 INFO L290 TraceCheckUtils]: 97: Hoare triple {11408#false} assume 4 == ~blastFlag~0; {11408#false} is VALID [2022-04-07 16:11:27,173 INFO L290 TraceCheckUtils]: 98: Hoare triple {11408#false} assume !false; {11408#false} is VALID [2022-04-07 16:11:27,174 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-07 16:11:27,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:11:27,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030227400] [2022-04-07 16:11:27,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030227400] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:11:27,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:11:27,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:11:27,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867820861] [2022-04-07 16:11:27,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:11:27,175 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2022-04-07 16:11:27,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:11:27,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:27,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:11:27,240 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:11:27,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:11:27,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:11:27,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:11:27,240 INFO L87 Difference]: Start difference. First operand 251 states and 400 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:29,261 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-07 16:11:30,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:30,264 INFO L93 Difference]: Finished difference Result 519 states and 833 transitions. [2022-04-07 16:11:30,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:11:30,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2022-04-07 16:11:30,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:11:30,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:30,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-04-07 16:11:30,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:30,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-04-07 16:11:30,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 461 transitions. [2022-04-07 16:11:30,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 461 edges. 461 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:11:30,578 INFO L225 Difference]: With dead ends: 519 [2022-04-07 16:11:30,578 INFO L226 Difference]: Without dead ends: 294 [2022-04-07 16:11:30,579 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-07 16:11:30,579 INFO L913 BasicCegarLoop]: 203 mSDtfsCounter, 32 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-07 16:11:30,579 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 514 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 406 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-07 16:11:30,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-04-07 16:11:30,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 273. [2022-04-07 16:11:30,583 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:11:30,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 294 states. Second operand has 273 states, 268 states have (on average 1.6119402985074627) internal successors, (432), 268 states have internal predecessors, (432), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:30,584 INFO L74 IsIncluded]: Start isIncluded. First operand 294 states. Second operand has 273 states, 268 states have (on average 1.6119402985074627) internal successors, (432), 268 states have internal predecessors, (432), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:30,584 INFO L87 Difference]: Start difference. First operand 294 states. Second operand has 273 states, 268 states have (on average 1.6119402985074627) internal successors, (432), 268 states have internal predecessors, (432), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:30,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:30,589 INFO L93 Difference]: Finished difference Result 294 states and 463 transitions. [2022-04-07 16:11:30,589 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 463 transitions. [2022-04-07 16:11:30,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:30,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:30,589 INFO L74 IsIncluded]: Start isIncluded. First operand has 273 states, 268 states have (on average 1.6119402985074627) internal successors, (432), 268 states have internal predecessors, (432), 3 states have call successors, (3), 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 294 states. [2022-04-07 16:11:30,590 INFO L87 Difference]: Start difference. First operand has 273 states, 268 states have (on average 1.6119402985074627) internal successors, (432), 268 states have internal predecessors, (432), 3 states have call successors, (3), 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 294 states. [2022-04-07 16:11:30,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:30,594 INFO L93 Difference]: Finished difference Result 294 states and 463 transitions. [2022-04-07 16:11:30,594 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 463 transitions. [2022-04-07 16:11:30,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:30,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:30,594 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:11:30,594 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:11:30,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 268 states have (on average 1.6119402985074627) internal successors, (432), 268 states have internal predecessors, (432), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:30,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 436 transitions. [2022-04-07 16:11:30,598 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 436 transitions. Word has length 99 [2022-04-07 16:11:30,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:11:30,598 INFO L478 AbstractCegarLoop]: Abstraction has 273 states and 436 transitions. [2022-04-07 16:11:30,598 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:30,599 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 436 transitions. [2022-04-07 16:11:30,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-07 16:11:30,599 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:11:30,599 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:11:30,599 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-07 16:11:30,599 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:11:30,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:11:30,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1138549791, now seen corresponding path program 1 times [2022-04-07 16:11:30,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:11:30,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161518921] [2022-04-07 16:11:30,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:11:30,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:11:30,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:30,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:11:30,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:30,687 INFO L290 TraceCheckUtils]: 0: Hoare triple {12917#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {12910#true} is VALID [2022-04-07 16:11:30,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {12910#true} assume true; {12910#true} is VALID [2022-04-07 16:11:30,687 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12910#true} {12910#true} #664#return; {12910#true} is VALID [2022-04-07 16:11:30,688 INFO L272 TraceCheckUtils]: 0: Hoare triple {12910#true} call ULTIMATE.init(); {12917#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:11:30,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {12917#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {12910#true} is VALID [2022-04-07 16:11:30,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {12910#true} assume true; {12910#true} is VALID [2022-04-07 16:11:30,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12910#true} {12910#true} #664#return; {12910#true} is VALID [2022-04-07 16:11:30,688 INFO L272 TraceCheckUtils]: 4: Hoare triple {12910#true} call #t~ret162 := main(); {12910#true} is VALID [2022-04-07 16:11:30,688 INFO L290 TraceCheckUtils]: 5: Hoare triple {12910#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 52 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {12910#true} is VALID [2022-04-07 16:11:30,688 INFO L290 TraceCheckUtils]: 6: Hoare triple {12910#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {12910#true} is VALID [2022-04-07 16:11:30,688 INFO L272 TraceCheckUtils]: 7: Hoare triple {12910#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {12910#true} is VALID [2022-04-07 16:11:30,689 INFO L290 TraceCheckUtils]: 8: Hoare triple {12910#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {12915#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:30,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {12915#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {12915#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:30,690 INFO L290 TraceCheckUtils]: 10: Hoare triple {12915#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {12915#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:30,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {12915#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {12915#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:30,691 INFO L290 TraceCheckUtils]: 12: Hoare triple {12915#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {12915#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:30,691 INFO L290 TraceCheckUtils]: 13: Hoare triple {12915#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {12915#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:30,692 INFO L290 TraceCheckUtils]: 14: Hoare triple {12915#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {12915#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:30,692 INFO L290 TraceCheckUtils]: 15: Hoare triple {12915#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {12915#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:30,692 INFO L290 TraceCheckUtils]: 16: Hoare triple {12915#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {12915#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:30,692 INFO L290 TraceCheckUtils]: 17: Hoare triple {12915#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {12915#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:30,693 INFO L290 TraceCheckUtils]: 18: Hoare triple {12915#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {12915#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:30,693 INFO L290 TraceCheckUtils]: 19: Hoare triple {12915#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {12916#(not (= |ssl3_accept_#t~mem46| 8195))} is VALID [2022-04-07 16:11:30,693 INFO L290 TraceCheckUtils]: 20: Hoare triple {12916#(not (= |ssl3_accept_#t~mem46| 8195))} assume 8195 == #t~mem46;havoc #t~mem46; {12911#false} is VALID [2022-04-07 16:11:30,693 INFO L290 TraceCheckUtils]: 21: Hoare triple {12911#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,694 INFO L290 TraceCheckUtils]: 22: Hoare triple {12911#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {12911#false} is VALID [2022-04-07 16:11:30,694 INFO L290 TraceCheckUtils]: 23: Hoare triple {12911#false} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,694 INFO L290 TraceCheckUtils]: 24: Hoare triple {12911#false} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,694 INFO L290 TraceCheckUtils]: 25: Hoare triple {12911#false} assume !(0 == (#t~mem78.base + #t~mem78.offset) % 4294967296);havoc #t~mem78.base, #t~mem78.offset; {12911#false} is VALID [2022-04-07 16:11:30,694 INFO L290 TraceCheckUtils]: 26: Hoare triple {12911#false} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {12911#false} is VALID [2022-04-07 16:11:30,694 INFO L290 TraceCheckUtils]: 27: Hoare triple {12911#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,694 INFO L290 TraceCheckUtils]: 28: Hoare triple {12911#false} assume !(12292 != #t~mem81);havoc #t~mem81;call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem86 := read~int(#t~mem85.base, 76 + #t~mem85.offset, 4);call write~int(1 + #t~mem86, #t~mem85.base, 76 + #t~mem85.offset, 4);havoc #t~mem85.base, #t~mem85.offset;havoc #t~mem86;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,694 INFO L290 TraceCheckUtils]: 29: Hoare triple {12911#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,694 INFO L290 TraceCheckUtils]: 30: Hoare triple {12911#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {12911#false} is VALID [2022-04-07 16:11:30,694 INFO L290 TraceCheckUtils]: 31: Hoare triple {12911#false} ~skip~0 := 0; {12911#false} is VALID [2022-04-07 16:11:30,694 INFO L290 TraceCheckUtils]: 32: Hoare triple {12911#false} assume !false; {12911#false} is VALID [2022-04-07 16:11:30,694 INFO L290 TraceCheckUtils]: 33: Hoare triple {12911#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,694 INFO L290 TraceCheckUtils]: 34: Hoare triple {12911#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,694 INFO L290 TraceCheckUtils]: 35: Hoare triple {12911#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,694 INFO L290 TraceCheckUtils]: 36: Hoare triple {12911#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,694 INFO L290 TraceCheckUtils]: 37: Hoare triple {12911#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,694 INFO L290 TraceCheckUtils]: 38: Hoare triple {12911#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,694 INFO L290 TraceCheckUtils]: 39: Hoare triple {12911#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,694 INFO L290 TraceCheckUtils]: 40: Hoare triple {12911#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,694 INFO L290 TraceCheckUtils]: 41: Hoare triple {12911#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,695 INFO L290 TraceCheckUtils]: 42: Hoare triple {12911#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,695 INFO L290 TraceCheckUtils]: 43: Hoare triple {12911#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,695 INFO L290 TraceCheckUtils]: 44: Hoare triple {12911#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,695 INFO L290 TraceCheckUtils]: 45: Hoare triple {12911#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,695 INFO L290 TraceCheckUtils]: 46: Hoare triple {12911#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,695 INFO L290 TraceCheckUtils]: 47: Hoare triple {12911#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,695 INFO L290 TraceCheckUtils]: 48: Hoare triple {12911#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,695 INFO L290 TraceCheckUtils]: 49: Hoare triple {12911#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,695 INFO L290 TraceCheckUtils]: 50: Hoare triple {12911#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,695 INFO L290 TraceCheckUtils]: 51: Hoare triple {12911#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,695 INFO L290 TraceCheckUtils]: 52: Hoare triple {12911#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,695 INFO L290 TraceCheckUtils]: 53: Hoare triple {12911#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,695 INFO L290 TraceCheckUtils]: 54: Hoare triple {12911#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,695 INFO L290 TraceCheckUtils]: 55: Hoare triple {12911#false} assume 8448 == #t~mem63;havoc #t~mem63; {12911#false} is VALID [2022-04-07 16:11:30,695 INFO L290 TraceCheckUtils]: 56: Hoare triple {12911#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~num1~0 := #t~nondet130;havoc #t~nondet130; {12911#false} is VALID [2022-04-07 16:11:30,695 INFO L290 TraceCheckUtils]: 57: Hoare triple {12911#false} assume !(~num1~0 > 0); {12911#false} is VALID [2022-04-07 16:11:30,695 INFO L290 TraceCheckUtils]: 58: Hoare triple {12911#false} call #t~mem131.base, #t~mem131.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem132 := read~int(#t~mem131.base, 844 + #t~mem131.offset, 4);call write~int(#t~mem132, ~s.base, 52 + ~s.offset, 4);havoc #t~mem131.base, #t~mem131.offset;havoc #t~mem132; {12911#false} is VALID [2022-04-07 16:11:30,695 INFO L290 TraceCheckUtils]: 59: Hoare triple {12911#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,695 INFO L290 TraceCheckUtils]: 60: Hoare triple {12911#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {12911#false} is VALID [2022-04-07 16:11:30,695 INFO L290 TraceCheckUtils]: 61: Hoare triple {12911#false} ~skip~0 := 0; {12911#false} is VALID [2022-04-07 16:11:30,695 INFO L290 TraceCheckUtils]: 62: Hoare triple {12911#false} assume !false; {12911#false} is VALID [2022-04-07 16:11:30,696 INFO L290 TraceCheckUtils]: 63: Hoare triple {12911#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,696 INFO L290 TraceCheckUtils]: 64: Hoare triple {12911#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,696 INFO L290 TraceCheckUtils]: 65: Hoare triple {12911#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,696 INFO L290 TraceCheckUtils]: 66: Hoare triple {12911#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,696 INFO L290 TraceCheckUtils]: 67: Hoare triple {12911#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,696 INFO L290 TraceCheckUtils]: 68: Hoare triple {12911#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,696 INFO L290 TraceCheckUtils]: 69: Hoare triple {12911#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,696 INFO L290 TraceCheckUtils]: 70: Hoare triple {12911#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,696 INFO L290 TraceCheckUtils]: 71: Hoare triple {12911#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,696 INFO L290 TraceCheckUtils]: 72: Hoare triple {12911#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,696 INFO L290 TraceCheckUtils]: 73: Hoare triple {12911#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,696 INFO L290 TraceCheckUtils]: 74: Hoare triple {12911#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,696 INFO L290 TraceCheckUtils]: 75: Hoare triple {12911#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,696 INFO L290 TraceCheckUtils]: 76: Hoare triple {12911#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,696 INFO L290 TraceCheckUtils]: 77: Hoare triple {12911#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,696 INFO L290 TraceCheckUtils]: 78: Hoare triple {12911#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,696 INFO L290 TraceCheckUtils]: 79: Hoare triple {12911#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,696 INFO L290 TraceCheckUtils]: 80: Hoare triple {12911#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,696 INFO L290 TraceCheckUtils]: 81: Hoare triple {12911#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,696 INFO L290 TraceCheckUtils]: 82: Hoare triple {12911#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,697 INFO L290 TraceCheckUtils]: 83: Hoare triple {12911#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,697 INFO L290 TraceCheckUtils]: 84: Hoare triple {12911#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,697 INFO L290 TraceCheckUtils]: 85: Hoare triple {12911#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,697 INFO L290 TraceCheckUtils]: 86: Hoare triple {12911#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,697 INFO L290 TraceCheckUtils]: 87: Hoare triple {12911#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,697 INFO L290 TraceCheckUtils]: 88: Hoare triple {12911#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,697 INFO L290 TraceCheckUtils]: 89: Hoare triple {12911#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,697 INFO L290 TraceCheckUtils]: 90: Hoare triple {12911#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,697 INFO L290 TraceCheckUtils]: 91: Hoare triple {12911#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,697 INFO L290 TraceCheckUtils]: 92: Hoare triple {12911#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,697 INFO L290 TraceCheckUtils]: 93: Hoare triple {12911#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,697 INFO L290 TraceCheckUtils]: 94: Hoare triple {12911#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,697 INFO L290 TraceCheckUtils]: 95: Hoare triple {12911#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {12911#false} is VALID [2022-04-07 16:11:30,697 INFO L290 TraceCheckUtils]: 96: Hoare triple {12911#false} assume 8672 == #t~mem74;havoc #t~mem74; {12911#false} is VALID [2022-04-07 16:11:30,697 INFO L290 TraceCheckUtils]: 97: Hoare triple {12911#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {12911#false} is VALID [2022-04-07 16:11:30,697 INFO L290 TraceCheckUtils]: 98: Hoare triple {12911#false} assume 4 == ~blastFlag~0; {12911#false} is VALID [2022-04-07 16:11:30,697 INFO L290 TraceCheckUtils]: 99: Hoare triple {12911#false} assume !false; {12911#false} is VALID [2022-04-07 16:11:30,698 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-07 16:11:30,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:11:30,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161518921] [2022-04-07 16:11:30,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161518921] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:11:30,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:11:30,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:11:30,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882998822] [2022-04-07 16:11:30,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:11:30,698 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 100 [2022-04-07 16:11:30,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:11:30,699 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-07 16:11:30,752 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-07 16:11:30,752 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:11:30,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:11:30,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:11:30,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:11:30,753 INFO L87 Difference]: Start difference. First operand 273 states and 436 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-07 16:11:32,772 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-07 16:11:33,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:33,900 INFO L93 Difference]: Finished difference Result 592 states and 938 transitions. [2022-04-07 16:11:33,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:11:33,900 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 100 [2022-04-07 16:11:33,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:11:33,900 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-07 16:11:33,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 573 transitions. [2022-04-07 16:11:33,903 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-07 16:11:33,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 573 transitions. [2022-04-07 16:11:33,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 573 transitions. [2022-04-07 16:11:34,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 573 edges. 573 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:11:34,297 INFO L225 Difference]: With dead ends: 592 [2022-04-07 16:11:34,297 INFO L226 Difference]: Without dead ends: 345 [2022-04-07 16:11:34,297 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-07 16:11:34,298 INFO L913 BasicCegarLoop]: 120 mSDtfsCounter, 138 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-07 16:11:34,298 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 341 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 473 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-07 16:11:34,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-04-07 16:11:34,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 273. [2022-04-07 16:11:34,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:11:34,302 INFO L82 GeneralOperation]: Start isEquivalent. First operand 345 states. Second operand has 273 states, 268 states have (on average 1.5932835820895523) internal successors, (427), 268 states have internal predecessors, (427), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:34,303 INFO L74 IsIncluded]: Start isIncluded. First operand 345 states. Second operand has 273 states, 268 states have (on average 1.5932835820895523) internal successors, (427), 268 states have internal predecessors, (427), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:34,303 INFO L87 Difference]: Start difference. First operand 345 states. Second operand has 273 states, 268 states have (on average 1.5932835820895523) internal successors, (427), 268 states have internal predecessors, (427), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:34,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:34,308 INFO L93 Difference]: Finished difference Result 345 states and 528 transitions. [2022-04-07 16:11:34,308 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 528 transitions. [2022-04-07 16:11:34,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:34,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:34,308 INFO L74 IsIncluded]: Start isIncluded. First operand has 273 states, 268 states have (on average 1.5932835820895523) internal successors, (427), 268 states have internal predecessors, (427), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 345 states. [2022-04-07 16:11:34,309 INFO L87 Difference]: Start difference. First operand has 273 states, 268 states have (on average 1.5932835820895523) internal successors, (427), 268 states have internal predecessors, (427), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 345 states. [2022-04-07 16:11:34,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:34,313 INFO L93 Difference]: Finished difference Result 345 states and 528 transitions. [2022-04-07 16:11:34,313 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 528 transitions. [2022-04-07 16:11:34,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:34,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:34,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:11:34,314 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:11:34,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 268 states have (on average 1.5932835820895523) internal successors, (427), 268 states have internal predecessors, (427), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:34,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 431 transitions. [2022-04-07 16:11:34,318 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 431 transitions. Word has length 100 [2022-04-07 16:11:34,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:11:34,318 INFO L478 AbstractCegarLoop]: Abstraction has 273 states and 431 transitions. [2022-04-07 16:11:34,318 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-07 16:11:34,318 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 431 transitions. [2022-04-07 16:11:34,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-07 16:11:34,319 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:11:34,319 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:11:34,319 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-07 16:11:34,319 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:11:34,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:11:34,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1952330836, now seen corresponding path program 1 times [2022-04-07 16:11:34,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:11:34,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531332954] [2022-04-07 16:11:34,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:11:34,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:11:34,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:34,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:11:34,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:34,429 INFO L290 TraceCheckUtils]: 0: Hoare triple {14612#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {14605#true} is VALID [2022-04-07 16:11:34,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {14605#true} assume true; {14605#true} is VALID [2022-04-07 16:11:34,429 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14605#true} {14605#true} #664#return; {14605#true} is VALID [2022-04-07 16:11:34,430 INFO L272 TraceCheckUtils]: 0: Hoare triple {14605#true} call ULTIMATE.init(); {14612#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:11:34,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {14612#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {14605#true} is VALID [2022-04-07 16:11:34,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {14605#true} assume true; {14605#true} is VALID [2022-04-07 16:11:34,430 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14605#true} {14605#true} #664#return; {14605#true} is VALID [2022-04-07 16:11:34,430 INFO L272 TraceCheckUtils]: 4: Hoare triple {14605#true} call #t~ret162 := main(); {14605#true} is VALID [2022-04-07 16:11:34,430 INFO L290 TraceCheckUtils]: 5: Hoare triple {14605#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 52 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {14605#true} is VALID [2022-04-07 16:11:34,430 INFO L290 TraceCheckUtils]: 6: Hoare triple {14605#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {14605#true} is VALID [2022-04-07 16:11:34,430 INFO L272 TraceCheckUtils]: 7: Hoare triple {14605#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {14605#true} is VALID [2022-04-07 16:11:34,430 INFO L290 TraceCheckUtils]: 8: Hoare triple {14605#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {14605#true} is VALID [2022-04-07 16:11:34,430 INFO L290 TraceCheckUtils]: 9: Hoare triple {14605#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {14605#true} is VALID [2022-04-07 16:11:34,431 INFO L290 TraceCheckUtils]: 10: Hoare triple {14605#true} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {14605#true} is VALID [2022-04-07 16:11:34,431 INFO L290 TraceCheckUtils]: 11: Hoare triple {14605#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {14605#true} is VALID [2022-04-07 16:11:34,431 INFO L290 TraceCheckUtils]: 12: Hoare triple {14605#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {14605#true} is VALID [2022-04-07 16:11:34,431 INFO L290 TraceCheckUtils]: 13: Hoare triple {14605#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {14605#true} is VALID [2022-04-07 16:11:34,431 INFO L290 TraceCheckUtils]: 14: Hoare triple {14605#true} assume !false; {14605#true} is VALID [2022-04-07 16:11:34,431 INFO L290 TraceCheckUtils]: 15: Hoare triple {14605#true} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {14605#true} is VALID [2022-04-07 16:11:34,431 INFO L290 TraceCheckUtils]: 16: Hoare triple {14605#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {14605#true} is VALID [2022-04-07 16:11:34,431 INFO L290 TraceCheckUtils]: 17: Hoare triple {14605#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {14605#true} is VALID [2022-04-07 16:11:34,431 INFO L290 TraceCheckUtils]: 18: Hoare triple {14605#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {14605#true} is VALID [2022-04-07 16:11:34,431 INFO L290 TraceCheckUtils]: 19: Hoare triple {14605#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {14605#true} is VALID [2022-04-07 16:11:34,431 INFO L290 TraceCheckUtils]: 20: Hoare triple {14605#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {14605#true} is VALID [2022-04-07 16:11:34,431 INFO L290 TraceCheckUtils]: 21: Hoare triple {14605#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {14605#true} is VALID [2022-04-07 16:11:34,431 INFO L290 TraceCheckUtils]: 22: Hoare triple {14605#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {14605#true} is VALID [2022-04-07 16:11:34,431 INFO L290 TraceCheckUtils]: 23: Hoare triple {14605#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {14605#true} is VALID [2022-04-07 16:11:34,431 INFO L290 TraceCheckUtils]: 24: Hoare triple {14605#true} assume 8464 == #t~mem50;havoc #t~mem50; {14605#true} is VALID [2022-04-07 16:11:34,431 INFO L290 TraceCheckUtils]: 25: Hoare triple {14605#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; {14605#true} is VALID [2022-04-07 16:11:34,431 INFO L290 TraceCheckUtils]: 26: Hoare triple {14605#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {14605#true} is VALID [2022-04-07 16:11:34,432 INFO L290 TraceCheckUtils]: 27: Hoare triple {14605#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {14610#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-07 16:11:34,432 INFO L290 TraceCheckUtils]: 28: Hoare triple {14610#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {14610#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-07 16:11:34,433 INFO L290 TraceCheckUtils]: 29: Hoare triple {14610#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {14610#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-07 16:11:34,433 INFO L290 TraceCheckUtils]: 30: Hoare triple {14610#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} ~skip~0 := 0; {14610#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-07 16:11:34,433 INFO L290 TraceCheckUtils]: 31: Hoare triple {14610#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !false; {14610#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-07 16:11:34,434 INFO L290 TraceCheckUtils]: 32: Hoare triple {14610#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {14610#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-07 16:11:34,434 INFO L290 TraceCheckUtils]: 33: Hoare triple {14610#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {14610#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-07 16:11:34,434 INFO L290 TraceCheckUtils]: 34: Hoare triple {14610#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {14610#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-07 16:11:34,435 INFO L290 TraceCheckUtils]: 35: Hoare triple {14610#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {14610#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-07 16:11:34,435 INFO L290 TraceCheckUtils]: 36: Hoare triple {14610#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {14610#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-07 16:11:34,435 INFO L290 TraceCheckUtils]: 37: Hoare triple {14610#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {14610#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-07 16:11:34,436 INFO L290 TraceCheckUtils]: 38: Hoare triple {14610#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {14611#(not (= |ssl3_accept_#t~mem48| 8481))} is VALID [2022-04-07 16:11:34,436 INFO L290 TraceCheckUtils]: 39: Hoare triple {14611#(not (= |ssl3_accept_#t~mem48| 8481))} assume 8481 == #t~mem48;havoc #t~mem48; {14606#false} is VALID [2022-04-07 16:11:34,436 INFO L290 TraceCheckUtils]: 40: Hoare triple {14606#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet87 && #t~nondet87 <= 2147483647;~ret~0 := #t~nondet87;havoc #t~nondet87; {14606#false} is VALID [2022-04-07 16:11:34,436 INFO L290 TraceCheckUtils]: 41: Hoare triple {14606#false} assume !(~ret~0 <= 0);call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem88.base, 844 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,436 INFO L290 TraceCheckUtils]: 42: Hoare triple {14606#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,436 INFO L290 TraceCheckUtils]: 43: Hoare triple {14606#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {14606#false} is VALID [2022-04-07 16:11:34,436 INFO L290 TraceCheckUtils]: 44: Hoare triple {14606#false} ~skip~0 := 0; {14606#false} is VALID [2022-04-07 16:11:34,436 INFO L290 TraceCheckUtils]: 45: Hoare triple {14606#false} assume !false; {14606#false} is VALID [2022-04-07 16:11:34,436 INFO L290 TraceCheckUtils]: 46: Hoare triple {14606#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,436 INFO L290 TraceCheckUtils]: 47: Hoare triple {14606#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,436 INFO L290 TraceCheckUtils]: 48: Hoare triple {14606#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,436 INFO L290 TraceCheckUtils]: 49: Hoare triple {14606#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,436 INFO L290 TraceCheckUtils]: 50: Hoare triple {14606#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,436 INFO L290 TraceCheckUtils]: 51: Hoare triple {14606#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,436 INFO L290 TraceCheckUtils]: 52: Hoare triple {14606#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,437 INFO L290 TraceCheckUtils]: 53: Hoare triple {14606#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,437 INFO L290 TraceCheckUtils]: 54: Hoare triple {14606#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,437 INFO L290 TraceCheckUtils]: 55: Hoare triple {14606#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,437 INFO L290 TraceCheckUtils]: 56: Hoare triple {14606#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,437 INFO L290 TraceCheckUtils]: 57: Hoare triple {14606#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,437 INFO L290 TraceCheckUtils]: 58: Hoare triple {14606#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,437 INFO L290 TraceCheckUtils]: 59: Hoare triple {14606#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,437 INFO L290 TraceCheckUtils]: 60: Hoare triple {14606#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,437 INFO L290 TraceCheckUtils]: 61: Hoare triple {14606#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,437 INFO L290 TraceCheckUtils]: 62: Hoare triple {14606#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,437 INFO L290 TraceCheckUtils]: 63: Hoare triple {14606#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,437 INFO L290 TraceCheckUtils]: 64: Hoare triple {14606#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,437 INFO L290 TraceCheckUtils]: 65: Hoare triple {14606#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,437 INFO L290 TraceCheckUtils]: 66: Hoare triple {14606#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,437 INFO L290 TraceCheckUtils]: 67: Hoare triple {14606#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,437 INFO L290 TraceCheckUtils]: 68: Hoare triple {14606#false} assume 8448 == #t~mem63;havoc #t~mem63; {14606#false} is VALID [2022-04-07 16:11:34,437 INFO L290 TraceCheckUtils]: 69: Hoare triple {14606#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~num1~0 := #t~nondet130;havoc #t~nondet130; {14606#false} is VALID [2022-04-07 16:11:34,437 INFO L290 TraceCheckUtils]: 70: Hoare triple {14606#false} assume !(~num1~0 > 0); {14606#false} is VALID [2022-04-07 16:11:34,437 INFO L290 TraceCheckUtils]: 71: Hoare triple {14606#false} call #t~mem131.base, #t~mem131.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem132 := read~int(#t~mem131.base, 844 + #t~mem131.offset, 4);call write~int(#t~mem132, ~s.base, 52 + ~s.offset, 4);havoc #t~mem131.base, #t~mem131.offset;havoc #t~mem132; {14606#false} is VALID [2022-04-07 16:11:34,437 INFO L290 TraceCheckUtils]: 72: Hoare triple {14606#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,437 INFO L290 TraceCheckUtils]: 73: Hoare triple {14606#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {14606#false} is VALID [2022-04-07 16:11:34,438 INFO L290 TraceCheckUtils]: 74: Hoare triple {14606#false} ~skip~0 := 0; {14606#false} is VALID [2022-04-07 16:11:34,438 INFO L290 TraceCheckUtils]: 75: Hoare triple {14606#false} assume !false; {14606#false} is VALID [2022-04-07 16:11:34,438 INFO L290 TraceCheckUtils]: 76: Hoare triple {14606#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,438 INFO L290 TraceCheckUtils]: 77: Hoare triple {14606#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,438 INFO L290 TraceCheckUtils]: 78: Hoare triple {14606#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,438 INFO L290 TraceCheckUtils]: 79: Hoare triple {14606#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,438 INFO L290 TraceCheckUtils]: 80: Hoare triple {14606#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,438 INFO L290 TraceCheckUtils]: 81: Hoare triple {14606#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,438 INFO L290 TraceCheckUtils]: 82: Hoare triple {14606#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,438 INFO L290 TraceCheckUtils]: 83: Hoare triple {14606#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,438 INFO L290 TraceCheckUtils]: 84: Hoare triple {14606#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,438 INFO L290 TraceCheckUtils]: 85: Hoare triple {14606#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,438 INFO L290 TraceCheckUtils]: 86: Hoare triple {14606#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,438 INFO L290 TraceCheckUtils]: 87: Hoare triple {14606#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,438 INFO L290 TraceCheckUtils]: 88: Hoare triple {14606#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,438 INFO L290 TraceCheckUtils]: 89: Hoare triple {14606#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,438 INFO L290 TraceCheckUtils]: 90: Hoare triple {14606#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,438 INFO L290 TraceCheckUtils]: 91: Hoare triple {14606#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,438 INFO L290 TraceCheckUtils]: 92: Hoare triple {14606#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,438 INFO L290 TraceCheckUtils]: 93: Hoare triple {14606#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,439 INFO L290 TraceCheckUtils]: 94: Hoare triple {14606#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,439 INFO L290 TraceCheckUtils]: 95: Hoare triple {14606#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,439 INFO L290 TraceCheckUtils]: 96: Hoare triple {14606#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,439 INFO L290 TraceCheckUtils]: 97: Hoare triple {14606#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,439 INFO L290 TraceCheckUtils]: 98: Hoare triple {14606#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,439 INFO L290 TraceCheckUtils]: 99: Hoare triple {14606#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,439 INFO L290 TraceCheckUtils]: 100: Hoare triple {14606#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,439 INFO L290 TraceCheckUtils]: 101: Hoare triple {14606#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,439 INFO L290 TraceCheckUtils]: 102: Hoare triple {14606#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,439 INFO L290 TraceCheckUtils]: 103: Hoare triple {14606#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,439 INFO L290 TraceCheckUtils]: 104: Hoare triple {14606#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,439 INFO L290 TraceCheckUtils]: 105: Hoare triple {14606#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,439 INFO L290 TraceCheckUtils]: 106: Hoare triple {14606#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,439 INFO L290 TraceCheckUtils]: 107: Hoare triple {14606#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,439 INFO L290 TraceCheckUtils]: 108: Hoare triple {14606#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {14606#false} is VALID [2022-04-07 16:11:34,439 INFO L290 TraceCheckUtils]: 109: Hoare triple {14606#false} assume 8672 == #t~mem74;havoc #t~mem74; {14606#false} is VALID [2022-04-07 16:11:34,439 INFO L290 TraceCheckUtils]: 110: Hoare triple {14606#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {14606#false} is VALID [2022-04-07 16:11:34,439 INFO L290 TraceCheckUtils]: 111: Hoare triple {14606#false} assume 4 == ~blastFlag~0; {14606#false} is VALID [2022-04-07 16:11:34,439 INFO L290 TraceCheckUtils]: 112: Hoare triple {14606#false} assume !false; {14606#false} is VALID [2022-04-07 16:11:34,440 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-07 16:11:34,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:11:34,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531332954] [2022-04-07 16:11:34,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531332954] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:11:34,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:11:34,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:11:34,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646482497] [2022-04-07 16:11:34,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:11:34,440 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2022-04-07 16:11:34,441 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:11:34,441 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:34,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:11:34,502 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:11:34,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:11:34,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:11:34,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:11:34,503 INFO L87 Difference]: Start difference. First operand 273 states and 431 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:36,522 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-07 16:11:37,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:37,521 INFO L93 Difference]: Finished difference Result 592 states and 929 transitions. [2022-04-07 16:11:37,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:11:37,521 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2022-04-07 16:11:37,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:11:37,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:37,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 572 transitions. [2022-04-07 16:11:37,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:37,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 572 transitions. [2022-04-07 16:11:37,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 572 transitions. [2022-04-07 16:11:37,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 572 edges. 572 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:11:37,913 INFO L225 Difference]: With dead ends: 592 [2022-04-07 16:11:37,913 INFO L226 Difference]: Without dead ends: 345 [2022-04-07 16:11:37,913 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-07 16:11:37,914 INFO L913 BasicCegarLoop]: 120 mSDtfsCounter, 136 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-07 16:11:37,915 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 341 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 473 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-07 16:11:37,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-04-07 16:11:37,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 273. [2022-04-07 16:11:37,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:11:37,924 INFO L82 GeneralOperation]: Start isEquivalent. First operand 345 states. Second operand has 273 states, 268 states have (on average 1.5820895522388059) internal successors, (424), 268 states have internal predecessors, (424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:37,924 INFO L74 IsIncluded]: Start isIncluded. First operand 345 states. Second operand has 273 states, 268 states have (on average 1.5820895522388059) internal successors, (424), 268 states have internal predecessors, (424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:37,924 INFO L87 Difference]: Start difference. First operand 345 states. Second operand has 273 states, 268 states have (on average 1.5820895522388059) internal successors, (424), 268 states have internal predecessors, (424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:37,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:37,929 INFO L93 Difference]: Finished difference Result 345 states and 525 transitions. [2022-04-07 16:11:37,929 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 525 transitions. [2022-04-07 16:11:37,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:37,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:37,929 INFO L74 IsIncluded]: Start isIncluded. First operand has 273 states, 268 states have (on average 1.5820895522388059) internal successors, (424), 268 states have internal predecessors, (424), 3 states have call successors, (3), 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 345 states. [2022-04-07 16:11:37,929 INFO L87 Difference]: Start difference. First operand has 273 states, 268 states have (on average 1.5820895522388059) internal successors, (424), 268 states have internal predecessors, (424), 3 states have call successors, (3), 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 345 states. [2022-04-07 16:11:37,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:37,934 INFO L93 Difference]: Finished difference Result 345 states and 525 transitions. [2022-04-07 16:11:37,934 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 525 transitions. [2022-04-07 16:11:37,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:37,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:37,935 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:11:37,935 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:11:37,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 268 states have (on average 1.5820895522388059) internal successors, (424), 268 states have internal predecessors, (424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:37,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 428 transitions. [2022-04-07 16:11:37,938 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 428 transitions. Word has length 113 [2022-04-07 16:11:37,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:11:37,938 INFO L478 AbstractCegarLoop]: Abstraction has 273 states and 428 transitions. [2022-04-07 16:11:37,939 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:37,939 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 428 transitions. [2022-04-07 16:11:37,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-07 16:11:37,939 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:11:37,939 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:11:37,939 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-07 16:11:37,940 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:11:37,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:11:37,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1683189401, now seen corresponding path program 1 times [2022-04-07 16:11:37,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:11:37,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816254757] [2022-04-07 16:11:37,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:11:37,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:11:37,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:38,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:11:38,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:38,030 INFO L290 TraceCheckUtils]: 0: Hoare triple {16307#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {16300#true} is VALID [2022-04-07 16:11:38,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {16300#true} assume true; {16300#true} is VALID [2022-04-07 16:11:38,031 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16300#true} {16300#true} #664#return; {16300#true} is VALID [2022-04-07 16:11:38,031 INFO L272 TraceCheckUtils]: 0: Hoare triple {16300#true} call ULTIMATE.init(); {16307#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:11:38,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {16307#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {16300#true} is VALID [2022-04-07 16:11:38,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {16300#true} assume true; {16300#true} is VALID [2022-04-07 16:11:38,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16300#true} {16300#true} #664#return; {16300#true} is VALID [2022-04-07 16:11:38,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {16300#true} call #t~ret162 := main(); {16300#true} is VALID [2022-04-07 16:11:38,032 INFO L290 TraceCheckUtils]: 5: Hoare triple {16300#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 52 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {16300#true} is VALID [2022-04-07 16:11:38,032 INFO L290 TraceCheckUtils]: 6: Hoare triple {16300#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {16300#true} is VALID [2022-04-07 16:11:38,032 INFO L272 TraceCheckUtils]: 7: Hoare triple {16300#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {16300#true} is VALID [2022-04-07 16:11:38,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {16300#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {16300#true} is VALID [2022-04-07 16:11:38,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {16300#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {16300#true} is VALID [2022-04-07 16:11:38,032 INFO L290 TraceCheckUtils]: 10: Hoare triple {16300#true} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {16300#true} is VALID [2022-04-07 16:11:38,032 INFO L290 TraceCheckUtils]: 11: Hoare triple {16300#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {16300#true} is VALID [2022-04-07 16:11:38,032 INFO L290 TraceCheckUtils]: 12: Hoare triple {16300#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {16300#true} is VALID [2022-04-07 16:11:38,032 INFO L290 TraceCheckUtils]: 13: Hoare triple {16300#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {16300#true} is VALID [2022-04-07 16:11:38,032 INFO L290 TraceCheckUtils]: 14: Hoare triple {16300#true} assume !false; {16300#true} is VALID [2022-04-07 16:11:38,032 INFO L290 TraceCheckUtils]: 15: Hoare triple {16300#true} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {16300#true} is VALID [2022-04-07 16:11:38,032 INFO L290 TraceCheckUtils]: 16: Hoare triple {16300#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {16300#true} is VALID [2022-04-07 16:11:38,032 INFO L290 TraceCheckUtils]: 17: Hoare triple {16300#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {16300#true} is VALID [2022-04-07 16:11:38,032 INFO L290 TraceCheckUtils]: 18: Hoare triple {16300#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {16300#true} is VALID [2022-04-07 16:11:38,032 INFO L290 TraceCheckUtils]: 19: Hoare triple {16300#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {16300#true} is VALID [2022-04-07 16:11:38,032 INFO L290 TraceCheckUtils]: 20: Hoare triple {16300#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {16300#true} is VALID [2022-04-07 16:11:38,032 INFO L290 TraceCheckUtils]: 21: Hoare triple {16300#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {16300#true} is VALID [2022-04-07 16:11:38,032 INFO L290 TraceCheckUtils]: 22: Hoare triple {16300#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {16300#true} is VALID [2022-04-07 16:11:38,032 INFO L290 TraceCheckUtils]: 23: Hoare triple {16300#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {16300#true} is VALID [2022-04-07 16:11:38,032 INFO L290 TraceCheckUtils]: 24: Hoare triple {16300#true} assume 8464 == #t~mem50;havoc #t~mem50; {16300#true} is VALID [2022-04-07 16:11:38,032 INFO L290 TraceCheckUtils]: 25: Hoare triple {16300#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; {16300#true} is VALID [2022-04-07 16:11:38,033 INFO L290 TraceCheckUtils]: 26: Hoare triple {16300#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {16300#true} is VALID [2022-04-07 16:11:38,033 INFO L290 TraceCheckUtils]: 27: Hoare triple {16300#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {16305#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:38,034 INFO L290 TraceCheckUtils]: 28: Hoare triple {16305#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {16305#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:38,034 INFO L290 TraceCheckUtils]: 29: Hoare triple {16305#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {16305#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:38,034 INFO L290 TraceCheckUtils]: 30: Hoare triple {16305#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {16305#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:38,035 INFO L290 TraceCheckUtils]: 31: Hoare triple {16305#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {16305#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:38,035 INFO L290 TraceCheckUtils]: 32: Hoare triple {16305#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {16305#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:38,035 INFO L290 TraceCheckUtils]: 33: Hoare triple {16305#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {16305#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:38,036 INFO L290 TraceCheckUtils]: 34: Hoare triple {16305#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {16305#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:38,036 INFO L290 TraceCheckUtils]: 35: Hoare triple {16305#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {16305#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:38,036 INFO L290 TraceCheckUtils]: 36: Hoare triple {16305#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {16305#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:38,036 INFO L290 TraceCheckUtils]: 37: Hoare triple {16305#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {16305#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:38,037 INFO L290 TraceCheckUtils]: 38: Hoare triple {16305#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {16305#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:38,037 INFO L290 TraceCheckUtils]: 39: Hoare triple {16305#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {16306#(not (= |ssl3_accept_#t~mem49| 8482))} is VALID [2022-04-07 16:11:38,037 INFO L290 TraceCheckUtils]: 40: Hoare triple {16306#(not (= |ssl3_accept_#t~mem49| 8482))} assume 8482 == #t~mem49;havoc #t~mem49; {16301#false} is VALID [2022-04-07 16:11:38,037 INFO L290 TraceCheckUtils]: 41: Hoare triple {16301#false} call write~int(3, ~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,037 INFO L290 TraceCheckUtils]: 42: Hoare triple {16301#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,038 INFO L290 TraceCheckUtils]: 43: Hoare triple {16301#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {16301#false} is VALID [2022-04-07 16:11:38,038 INFO L290 TraceCheckUtils]: 44: Hoare triple {16301#false} ~skip~0 := 0; {16301#false} is VALID [2022-04-07 16:11:38,038 INFO L290 TraceCheckUtils]: 45: Hoare triple {16301#false} assume !false; {16301#false} is VALID [2022-04-07 16:11:38,038 INFO L290 TraceCheckUtils]: 46: Hoare triple {16301#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,038 INFO L290 TraceCheckUtils]: 47: Hoare triple {16301#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,038 INFO L290 TraceCheckUtils]: 48: Hoare triple {16301#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,038 INFO L290 TraceCheckUtils]: 49: Hoare triple {16301#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,038 INFO L290 TraceCheckUtils]: 50: Hoare triple {16301#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,038 INFO L290 TraceCheckUtils]: 51: Hoare triple {16301#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,038 INFO L290 TraceCheckUtils]: 52: Hoare triple {16301#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,038 INFO L290 TraceCheckUtils]: 53: Hoare triple {16301#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,038 INFO L290 TraceCheckUtils]: 54: Hoare triple {16301#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,038 INFO L290 TraceCheckUtils]: 55: Hoare triple {16301#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,038 INFO L290 TraceCheckUtils]: 56: Hoare triple {16301#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,038 INFO L290 TraceCheckUtils]: 57: Hoare triple {16301#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,038 INFO L290 TraceCheckUtils]: 58: Hoare triple {16301#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,038 INFO L290 TraceCheckUtils]: 59: Hoare triple {16301#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,038 INFO L290 TraceCheckUtils]: 60: Hoare triple {16301#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,038 INFO L290 TraceCheckUtils]: 61: Hoare triple {16301#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,038 INFO L290 TraceCheckUtils]: 62: Hoare triple {16301#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,038 INFO L290 TraceCheckUtils]: 63: Hoare triple {16301#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,039 INFO L290 TraceCheckUtils]: 64: Hoare triple {16301#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,039 INFO L290 TraceCheckUtils]: 65: Hoare triple {16301#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,039 INFO L290 TraceCheckUtils]: 66: Hoare triple {16301#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,039 INFO L290 TraceCheckUtils]: 67: Hoare triple {16301#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,039 INFO L290 TraceCheckUtils]: 68: Hoare triple {16301#false} assume 8448 == #t~mem63;havoc #t~mem63; {16301#false} is VALID [2022-04-07 16:11:38,039 INFO L290 TraceCheckUtils]: 69: Hoare triple {16301#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~num1~0 := #t~nondet130;havoc #t~nondet130; {16301#false} is VALID [2022-04-07 16:11:38,039 INFO L290 TraceCheckUtils]: 70: Hoare triple {16301#false} assume !(~num1~0 > 0); {16301#false} is VALID [2022-04-07 16:11:38,039 INFO L290 TraceCheckUtils]: 71: Hoare triple {16301#false} call #t~mem131.base, #t~mem131.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem132 := read~int(#t~mem131.base, 844 + #t~mem131.offset, 4);call write~int(#t~mem132, ~s.base, 52 + ~s.offset, 4);havoc #t~mem131.base, #t~mem131.offset;havoc #t~mem132; {16301#false} is VALID [2022-04-07 16:11:38,039 INFO L290 TraceCheckUtils]: 72: Hoare triple {16301#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,039 INFO L290 TraceCheckUtils]: 73: Hoare triple {16301#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {16301#false} is VALID [2022-04-07 16:11:38,039 INFO L290 TraceCheckUtils]: 74: Hoare triple {16301#false} ~skip~0 := 0; {16301#false} is VALID [2022-04-07 16:11:38,039 INFO L290 TraceCheckUtils]: 75: Hoare triple {16301#false} assume !false; {16301#false} is VALID [2022-04-07 16:11:38,039 INFO L290 TraceCheckUtils]: 76: Hoare triple {16301#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,039 INFO L290 TraceCheckUtils]: 77: Hoare triple {16301#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,039 INFO L290 TraceCheckUtils]: 78: Hoare triple {16301#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,039 INFO L290 TraceCheckUtils]: 79: Hoare triple {16301#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,039 INFO L290 TraceCheckUtils]: 80: Hoare triple {16301#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,039 INFO L290 TraceCheckUtils]: 81: Hoare triple {16301#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,039 INFO L290 TraceCheckUtils]: 82: Hoare triple {16301#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,039 INFO L290 TraceCheckUtils]: 83: Hoare triple {16301#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,039 INFO L290 TraceCheckUtils]: 84: Hoare triple {16301#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,040 INFO L290 TraceCheckUtils]: 85: Hoare triple {16301#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,040 INFO L290 TraceCheckUtils]: 86: Hoare triple {16301#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,040 INFO L290 TraceCheckUtils]: 87: Hoare triple {16301#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,040 INFO L290 TraceCheckUtils]: 88: Hoare triple {16301#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,040 INFO L290 TraceCheckUtils]: 89: Hoare triple {16301#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,040 INFO L290 TraceCheckUtils]: 90: Hoare triple {16301#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,040 INFO L290 TraceCheckUtils]: 91: Hoare triple {16301#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,040 INFO L290 TraceCheckUtils]: 92: Hoare triple {16301#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,040 INFO L290 TraceCheckUtils]: 93: Hoare triple {16301#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,040 INFO L290 TraceCheckUtils]: 94: Hoare triple {16301#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,040 INFO L290 TraceCheckUtils]: 95: Hoare triple {16301#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,040 INFO L290 TraceCheckUtils]: 96: Hoare triple {16301#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,040 INFO L290 TraceCheckUtils]: 97: Hoare triple {16301#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,040 INFO L290 TraceCheckUtils]: 98: Hoare triple {16301#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,040 INFO L290 TraceCheckUtils]: 99: Hoare triple {16301#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,040 INFO L290 TraceCheckUtils]: 100: Hoare triple {16301#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,040 INFO L290 TraceCheckUtils]: 101: Hoare triple {16301#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,040 INFO L290 TraceCheckUtils]: 102: Hoare triple {16301#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,040 INFO L290 TraceCheckUtils]: 103: Hoare triple {16301#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,040 INFO L290 TraceCheckUtils]: 104: Hoare triple {16301#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,040 INFO L290 TraceCheckUtils]: 105: Hoare triple {16301#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,041 INFO L290 TraceCheckUtils]: 106: Hoare triple {16301#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,041 INFO L290 TraceCheckUtils]: 107: Hoare triple {16301#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,041 INFO L290 TraceCheckUtils]: 108: Hoare triple {16301#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {16301#false} is VALID [2022-04-07 16:11:38,041 INFO L290 TraceCheckUtils]: 109: Hoare triple {16301#false} assume 8672 == #t~mem74;havoc #t~mem74; {16301#false} is VALID [2022-04-07 16:11:38,041 INFO L290 TraceCheckUtils]: 110: Hoare triple {16301#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {16301#false} is VALID [2022-04-07 16:11:38,041 INFO L290 TraceCheckUtils]: 111: Hoare triple {16301#false} assume 4 == ~blastFlag~0; {16301#false} is VALID [2022-04-07 16:11:38,041 INFO L290 TraceCheckUtils]: 112: Hoare triple {16301#false} assume !false; {16301#false} is VALID [2022-04-07 16:11:38,041 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-07 16:11:38,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:11:38,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816254757] [2022-04-07 16:11:38,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816254757] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:11:38,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:11:38,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:11:38,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700930667] [2022-04-07 16:11:38,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:11:38,042 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2022-04-07 16:11:38,042 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:11:38,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:38,102 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:11:38,103 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:11:38,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:11:38,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:11:38,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:11:38,103 INFO L87 Difference]: Start difference. First operand 273 states and 428 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:40,122 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-07 16:11:41,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:41,196 INFO L93 Difference]: Finished difference Result 591 states and 922 transitions. [2022-04-07 16:11:41,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:11:41,196 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2022-04-07 16:11:41,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:11:41,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:41,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 570 transitions. [2022-04-07 16:11:41,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:41,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 570 transitions. [2022-04-07 16:11:41,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 570 transitions. [2022-04-07 16:11:41,581 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 570 edges. 570 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:11:41,586 INFO L225 Difference]: With dead ends: 591 [2022-04-07 16:11:41,586 INFO L226 Difference]: Without dead ends: 344 [2022-04-07 16:11:41,586 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-07 16:11:41,587 INFO L913 BasicCegarLoop]: 121 mSDtfsCounter, 134 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 62 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-07 16:11:41,587 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 343 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 471 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-07 16:11:41,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2022-04-07 16:11:41,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 273. [2022-04-07 16:11:41,591 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:11:41,591 INFO L82 GeneralOperation]: Start isEquivalent. First operand 344 states. Second operand has 273 states, 268 states have (on average 1.5708955223880596) internal successors, (421), 268 states have internal predecessors, (421), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:41,592 INFO L74 IsIncluded]: Start isIncluded. First operand 344 states. Second operand has 273 states, 268 states have (on average 1.5708955223880596) internal successors, (421), 268 states have internal predecessors, (421), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:41,592 INFO L87 Difference]: Start difference. First operand 344 states. Second operand has 273 states, 268 states have (on average 1.5708955223880596) internal successors, (421), 268 states have internal predecessors, (421), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:41,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:41,596 INFO L93 Difference]: Finished difference Result 344 states and 521 transitions. [2022-04-07 16:11:41,596 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 521 transitions. [2022-04-07 16:11:41,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:41,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:41,597 INFO L74 IsIncluded]: Start isIncluded. First operand has 273 states, 268 states have (on average 1.5708955223880596) internal successors, (421), 268 states have internal predecessors, (421), 3 states have call successors, (3), 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 344 states. [2022-04-07 16:11:41,597 INFO L87 Difference]: Start difference. First operand has 273 states, 268 states have (on average 1.5708955223880596) internal successors, (421), 268 states have internal predecessors, (421), 3 states have call successors, (3), 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 344 states. [2022-04-07 16:11:41,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:41,602 INFO L93 Difference]: Finished difference Result 344 states and 521 transitions. [2022-04-07 16:11:41,602 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 521 transitions. [2022-04-07 16:11:41,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:41,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:41,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:11:41,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:11:41,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 268 states have (on average 1.5708955223880596) internal successors, (421), 268 states have internal predecessors, (421), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:41,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 425 transitions. [2022-04-07 16:11:41,622 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 425 transitions. Word has length 113 [2022-04-07 16:11:41,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:11:41,622 INFO L478 AbstractCegarLoop]: Abstraction has 273 states and 425 transitions. [2022-04-07 16:11:41,622 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:41,622 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 425 transitions. [2022-04-07 16:11:41,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-07 16:11:41,623 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:11:41,623 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:11:41,623 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-07 16:11:41,623 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:11:41,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:11:41,624 INFO L85 PathProgramCache]: Analyzing trace with hash -2133756623, now seen corresponding path program 1 times [2022-04-07 16:11:41,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:11:41,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337086390] [2022-04-07 16:11:41,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:11:41,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:11:41,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:41,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:11:41,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:41,718 INFO L290 TraceCheckUtils]: 0: Hoare triple {17998#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {17991#true} is VALID [2022-04-07 16:11:41,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {17991#true} assume true; {17991#true} is VALID [2022-04-07 16:11:41,718 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17991#true} {17991#true} #664#return; {17991#true} is VALID [2022-04-07 16:11:41,719 INFO L272 TraceCheckUtils]: 0: Hoare triple {17991#true} call ULTIMATE.init(); {17998#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:11:41,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {17998#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {17991#true} is VALID [2022-04-07 16:11:41,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {17991#true} assume true; {17991#true} is VALID [2022-04-07 16:11:41,719 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17991#true} {17991#true} #664#return; {17991#true} is VALID [2022-04-07 16:11:41,719 INFO L272 TraceCheckUtils]: 4: Hoare triple {17991#true} call #t~ret162 := main(); {17991#true} is VALID [2022-04-07 16:11:41,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {17991#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 52 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {17991#true} is VALID [2022-04-07 16:11:41,719 INFO L290 TraceCheckUtils]: 6: Hoare triple {17991#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {17991#true} is VALID [2022-04-07 16:11:41,719 INFO L272 TraceCheckUtils]: 7: Hoare triple {17991#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {17991#true} is VALID [2022-04-07 16:11:41,719 INFO L290 TraceCheckUtils]: 8: Hoare triple {17991#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {17991#true} is VALID [2022-04-07 16:11:41,719 INFO L290 TraceCheckUtils]: 9: Hoare triple {17991#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {17991#true} is VALID [2022-04-07 16:11:41,719 INFO L290 TraceCheckUtils]: 10: Hoare triple {17991#true} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {17991#true} is VALID [2022-04-07 16:11:41,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {17991#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {17991#true} is VALID [2022-04-07 16:11:41,719 INFO L290 TraceCheckUtils]: 12: Hoare triple {17991#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {17991#true} is VALID [2022-04-07 16:11:41,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {17991#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {17991#true} is VALID [2022-04-07 16:11:41,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {17991#true} assume !false; {17991#true} is VALID [2022-04-07 16:11:41,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {17991#true} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {17991#true} is VALID [2022-04-07 16:11:41,719 INFO L290 TraceCheckUtils]: 16: Hoare triple {17991#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {17991#true} is VALID [2022-04-07 16:11:41,720 INFO L290 TraceCheckUtils]: 17: Hoare triple {17991#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {17991#true} is VALID [2022-04-07 16:11:41,720 INFO L290 TraceCheckUtils]: 18: Hoare triple {17991#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {17991#true} is VALID [2022-04-07 16:11:41,720 INFO L290 TraceCheckUtils]: 19: Hoare triple {17991#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {17991#true} is VALID [2022-04-07 16:11:41,720 INFO L290 TraceCheckUtils]: 20: Hoare triple {17991#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {17991#true} is VALID [2022-04-07 16:11:41,720 INFO L290 TraceCheckUtils]: 21: Hoare triple {17991#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {17991#true} is VALID [2022-04-07 16:11:41,720 INFO L290 TraceCheckUtils]: 22: Hoare triple {17991#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {17991#true} is VALID [2022-04-07 16:11:41,720 INFO L290 TraceCheckUtils]: 23: Hoare triple {17991#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {17991#true} is VALID [2022-04-07 16:11:41,720 INFO L290 TraceCheckUtils]: 24: Hoare triple {17991#true} assume 8464 == #t~mem50;havoc #t~mem50; {17991#true} is VALID [2022-04-07 16:11:41,720 INFO L290 TraceCheckUtils]: 25: Hoare triple {17991#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; {17991#true} is VALID [2022-04-07 16:11:41,720 INFO L290 TraceCheckUtils]: 26: Hoare triple {17991#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {17991#true} is VALID [2022-04-07 16:11:41,720 INFO L290 TraceCheckUtils]: 27: Hoare triple {17991#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {17991#true} is VALID [2022-04-07 16:11:41,720 INFO L290 TraceCheckUtils]: 28: Hoare triple {17991#true} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {17991#true} is VALID [2022-04-07 16:11:41,720 INFO L290 TraceCheckUtils]: 29: Hoare triple {17991#true} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {17991#true} is VALID [2022-04-07 16:11:41,720 INFO L290 TraceCheckUtils]: 30: Hoare triple {17991#true} ~skip~0 := 0; {17991#true} is VALID [2022-04-07 16:11:41,720 INFO L290 TraceCheckUtils]: 31: Hoare triple {17991#true} assume !false; {17991#true} is VALID [2022-04-07 16:11:41,720 INFO L290 TraceCheckUtils]: 32: Hoare triple {17991#true} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {17991#true} is VALID [2022-04-07 16:11:41,720 INFO L290 TraceCheckUtils]: 33: Hoare triple {17991#true} assume 12292 == #t~mem42;havoc #t~mem42; {17991#true} is VALID [2022-04-07 16:11:41,720 INFO L290 TraceCheckUtils]: 34: Hoare triple {17991#true} call write~int(1, ~s.base, 40 + ~s.offset, 4); {17991#true} is VALID [2022-04-07 16:11:41,720 INFO L290 TraceCheckUtils]: 35: Hoare triple {17991#true} call write~int(1, ~s.base, 36 + ~s.offset, 4); {17991#true} is VALID [2022-04-07 16:11:41,720 INFO L290 TraceCheckUtils]: 36: Hoare triple {17991#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {17991#true} is VALID [2022-04-07 16:11:41,720 INFO L290 TraceCheckUtils]: 37: Hoare triple {17991#true} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {17991#true} is VALID [2022-04-07 16:11:41,721 INFO L290 TraceCheckUtils]: 38: Hoare triple {17991#true} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {17991#true} is VALID [2022-04-07 16:11:41,721 INFO L290 TraceCheckUtils]: 39: Hoare triple {17991#true} assume !(0 == (#t~mem78.base + #t~mem78.offset) % 4294967296);havoc #t~mem78.base, #t~mem78.offset; {17991#true} is VALID [2022-04-07 16:11:41,721 INFO L290 TraceCheckUtils]: 40: Hoare triple {17991#true} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {17991#true} is VALID [2022-04-07 16:11:41,721 INFO L290 TraceCheckUtils]: 41: Hoare triple {17991#true} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 52 + ~s.offset, 4); {17991#true} is VALID [2022-04-07 16:11:41,721 INFO L290 TraceCheckUtils]: 42: Hoare triple {17991#true} assume !(12292 != #t~mem81);havoc #t~mem81;call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem86 := read~int(#t~mem85.base, 76 + #t~mem85.offset, 4);call write~int(1 + #t~mem86, #t~mem85.base, 76 + #t~mem85.offset, 4);havoc #t~mem85.base, #t~mem85.offset;havoc #t~mem86;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {17996#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:41,722 INFO L290 TraceCheckUtils]: 43: Hoare triple {17996#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {17996#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:41,722 INFO L290 TraceCheckUtils]: 44: Hoare triple {17996#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {17996#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:41,722 INFO L290 TraceCheckUtils]: 45: Hoare triple {17996#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {17996#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:41,723 INFO L290 TraceCheckUtils]: 46: Hoare triple {17996#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {17996#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:41,723 INFO L290 TraceCheckUtils]: 47: Hoare triple {17996#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {17996#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:41,723 INFO L290 TraceCheckUtils]: 48: Hoare triple {17996#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {17996#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:41,724 INFO L290 TraceCheckUtils]: 49: Hoare triple {17996#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {17996#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:41,724 INFO L290 TraceCheckUtils]: 50: Hoare triple {17996#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {17996#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:41,724 INFO L290 TraceCheckUtils]: 51: Hoare triple {17996#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {17996#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:41,725 INFO L290 TraceCheckUtils]: 52: Hoare triple {17996#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {17997#(= |ssl3_accept_#t~mem47| 8480)} is VALID [2022-04-07 16:11:41,725 INFO L290 TraceCheckUtils]: 53: Hoare triple {17997#(= |ssl3_accept_#t~mem47| 8480)} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-07 16:11:41,725 INFO L290 TraceCheckUtils]: 54: Hoare triple {17992#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-07 16:11:41,725 INFO L290 TraceCheckUtils]: 55: Hoare triple {17992#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-07 16:11:41,725 INFO L290 TraceCheckUtils]: 56: Hoare triple {17992#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-07 16:11:41,725 INFO L290 TraceCheckUtils]: 57: Hoare triple {17992#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-07 16:11:41,725 INFO L290 TraceCheckUtils]: 58: Hoare triple {17992#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-07 16:11:41,725 INFO L290 TraceCheckUtils]: 59: Hoare triple {17992#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-07 16:11:41,725 INFO L290 TraceCheckUtils]: 60: Hoare triple {17992#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-07 16:11:41,725 INFO L290 TraceCheckUtils]: 61: Hoare triple {17992#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-07 16:11:41,725 INFO L290 TraceCheckUtils]: 62: Hoare triple {17992#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-07 16:11:41,725 INFO L290 TraceCheckUtils]: 63: Hoare triple {17992#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-07 16:11:41,725 INFO L290 TraceCheckUtils]: 64: Hoare triple {17992#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-07 16:11:41,725 INFO L290 TraceCheckUtils]: 65: Hoare triple {17992#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-07 16:11:41,725 INFO L290 TraceCheckUtils]: 66: Hoare triple {17992#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-07 16:11:41,725 INFO L290 TraceCheckUtils]: 67: Hoare triple {17992#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-07 16:11:41,726 INFO L290 TraceCheckUtils]: 68: Hoare triple {17992#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-07 16:11:41,726 INFO L290 TraceCheckUtils]: 69: Hoare triple {17992#false} assume 8448 == #t~mem63;havoc #t~mem63; {17992#false} is VALID [2022-04-07 16:11:41,726 INFO L290 TraceCheckUtils]: 70: Hoare triple {17992#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~num1~0 := #t~nondet130;havoc #t~nondet130; {17992#false} is VALID [2022-04-07 16:11:41,726 INFO L290 TraceCheckUtils]: 71: Hoare triple {17992#false} assume !(~num1~0 > 0); {17992#false} is VALID [2022-04-07 16:11:41,726 INFO L290 TraceCheckUtils]: 72: Hoare triple {17992#false} call #t~mem131.base, #t~mem131.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem132 := read~int(#t~mem131.base, 844 + #t~mem131.offset, 4);call write~int(#t~mem132, ~s.base, 52 + ~s.offset, 4);havoc #t~mem131.base, #t~mem131.offset;havoc #t~mem132; {17992#false} is VALID [2022-04-07 16:11:41,726 INFO L290 TraceCheckUtils]: 73: Hoare triple {17992#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {17992#false} is VALID [2022-04-07 16:11:41,726 INFO L290 TraceCheckUtils]: 74: Hoare triple {17992#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {17992#false} is VALID [2022-04-07 16:11:41,726 INFO L290 TraceCheckUtils]: 75: Hoare triple {17992#false} ~skip~0 := 0; {17992#false} is VALID [2022-04-07 16:11:41,726 INFO L290 TraceCheckUtils]: 76: Hoare triple {17992#false} assume !false; {17992#false} is VALID [2022-04-07 16:11:41,726 INFO L290 TraceCheckUtils]: 77: Hoare triple {17992#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-07 16:11:41,726 INFO L290 TraceCheckUtils]: 78: Hoare triple {17992#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-07 16:11:41,726 INFO L290 TraceCheckUtils]: 79: Hoare triple {17992#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-07 16:11:41,726 INFO L290 TraceCheckUtils]: 80: Hoare triple {17992#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-07 16:11:41,726 INFO L290 TraceCheckUtils]: 81: Hoare triple {17992#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-07 16:11:41,726 INFO L290 TraceCheckUtils]: 82: Hoare triple {17992#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-07 16:11:41,726 INFO L290 TraceCheckUtils]: 83: Hoare triple {17992#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-07 16:11:41,726 INFO L290 TraceCheckUtils]: 84: Hoare triple {17992#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-07 16:11:41,726 INFO L290 TraceCheckUtils]: 85: Hoare triple {17992#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-07 16:11:41,726 INFO L290 TraceCheckUtils]: 86: Hoare triple {17992#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-07 16:11:41,726 INFO L290 TraceCheckUtils]: 87: Hoare triple {17992#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-07 16:11:41,726 INFO L290 TraceCheckUtils]: 88: Hoare triple {17992#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-07 16:11:41,727 INFO L290 TraceCheckUtils]: 89: Hoare triple {17992#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-07 16:11:41,727 INFO L290 TraceCheckUtils]: 90: Hoare triple {17992#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-07 16:11:41,727 INFO L290 TraceCheckUtils]: 91: Hoare triple {17992#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-07 16:11:41,727 INFO L290 TraceCheckUtils]: 92: Hoare triple {17992#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-07 16:11:41,727 INFO L290 TraceCheckUtils]: 93: Hoare triple {17992#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-07 16:11:41,727 INFO L290 TraceCheckUtils]: 94: Hoare triple {17992#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-07 16:11:41,727 INFO L290 TraceCheckUtils]: 95: Hoare triple {17992#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-07 16:11:41,727 INFO L290 TraceCheckUtils]: 96: Hoare triple {17992#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-07 16:11:41,727 INFO L290 TraceCheckUtils]: 97: Hoare triple {17992#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-07 16:11:41,727 INFO L290 TraceCheckUtils]: 98: Hoare triple {17992#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-07 16:11:41,727 INFO L290 TraceCheckUtils]: 99: Hoare triple {17992#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-07 16:11:41,727 INFO L290 TraceCheckUtils]: 100: Hoare triple {17992#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-07 16:11:41,727 INFO L290 TraceCheckUtils]: 101: Hoare triple {17992#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-07 16:11:41,727 INFO L290 TraceCheckUtils]: 102: Hoare triple {17992#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-07 16:11:41,727 INFO L290 TraceCheckUtils]: 103: Hoare triple {17992#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-07 16:11:41,727 INFO L290 TraceCheckUtils]: 104: Hoare triple {17992#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-07 16:11:41,727 INFO L290 TraceCheckUtils]: 105: Hoare triple {17992#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-07 16:11:41,727 INFO L290 TraceCheckUtils]: 106: Hoare triple {17992#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-07 16:11:41,727 INFO L290 TraceCheckUtils]: 107: Hoare triple {17992#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-07 16:11:41,727 INFO L290 TraceCheckUtils]: 108: Hoare triple {17992#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-07 16:11:41,727 INFO L290 TraceCheckUtils]: 109: Hoare triple {17992#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {17992#false} is VALID [2022-04-07 16:11:41,728 INFO L290 TraceCheckUtils]: 110: Hoare triple {17992#false} assume 8672 == #t~mem74;havoc #t~mem74; {17992#false} is VALID [2022-04-07 16:11:41,728 INFO L290 TraceCheckUtils]: 111: Hoare triple {17992#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {17992#false} is VALID [2022-04-07 16:11:41,728 INFO L290 TraceCheckUtils]: 112: Hoare triple {17992#false} assume 4 == ~blastFlag~0; {17992#false} is VALID [2022-04-07 16:11:41,728 INFO L290 TraceCheckUtils]: 113: Hoare triple {17992#false} assume !false; {17992#false} is VALID [2022-04-07 16:11:41,728 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-07 16:11:41,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:11:41,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337086390] [2022-04-07 16:11:41,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337086390] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:11:41,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:11:41,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:11:41,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225950709] [2022-04-07 16:11:41,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:11:41,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 114 [2022-04-07 16:11:41,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:11:41,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:41,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:11:41,792 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:11:41,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:11:41,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:11:41,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:11:41,793 INFO L87 Difference]: Start difference. First operand 273 states and 425 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:43,810 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-07 16:11:44,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:44,746 INFO L93 Difference]: Finished difference Result 533 states and 836 transitions. [2022-04-07 16:11:44,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:11:44,746 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 114 [2022-04-07 16:11:44,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:11:44,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:44,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 438 transitions. [2022-04-07 16:11:44,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:44,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 438 transitions. [2022-04-07 16:11:44,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 438 transitions. [2022-04-07 16:11:45,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 438 edges. 438 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:11:45,031 INFO L225 Difference]: With dead ends: 533 [2022-04-07 16:11:45,031 INFO L226 Difference]: Without dead ends: 286 [2022-04-07 16:11:45,032 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-07 16:11:45,032 INFO L913 BasicCegarLoop]: 221 mSDtfsCounter, 20 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-07 16:11:45,032 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 549 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 386 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-07 16:11:45,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-04-07 16:11:45,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 273. [2022-04-07 16:11:45,036 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:11:45,036 INFO L82 GeneralOperation]: Start isEquivalent. First operand 286 states. Second operand has 273 states, 268 states have (on average 1.5671641791044777) internal successors, (420), 268 states have internal predecessors, (420), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:45,036 INFO L74 IsIncluded]: Start isIncluded. First operand 286 states. Second operand has 273 states, 268 states have (on average 1.5671641791044777) internal successors, (420), 268 states have internal predecessors, (420), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:45,037 INFO L87 Difference]: Start difference. First operand 286 states. Second operand has 273 states, 268 states have (on average 1.5671641791044777) internal successors, (420), 268 states have internal predecessors, (420), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:45,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:45,040 INFO L93 Difference]: Finished difference Result 286 states and 440 transitions. [2022-04-07 16:11:45,040 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 440 transitions. [2022-04-07 16:11:45,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:45,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:45,041 INFO L74 IsIncluded]: Start isIncluded. First operand has 273 states, 268 states have (on average 1.5671641791044777) internal successors, (420), 268 states have internal predecessors, (420), 3 states have call successors, (3), 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 286 states. [2022-04-07 16:11:45,041 INFO L87 Difference]: Start difference. First operand has 273 states, 268 states have (on average 1.5671641791044777) internal successors, (420), 268 states have internal predecessors, (420), 3 states have call successors, (3), 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 286 states. [2022-04-07 16:11:45,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:45,044 INFO L93 Difference]: Finished difference Result 286 states and 440 transitions. [2022-04-07 16:11:45,044 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 440 transitions. [2022-04-07 16:11:45,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:45,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:45,045 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:11:45,045 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:11:45,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 268 states have (on average 1.5671641791044777) internal successors, (420), 268 states have internal predecessors, (420), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:45,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 424 transitions. [2022-04-07 16:11:45,048 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 424 transitions. Word has length 114 [2022-04-07 16:11:45,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:11:45,049 INFO L478 AbstractCegarLoop]: Abstraction has 273 states and 424 transitions. [2022-04-07 16:11:45,049 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:45,049 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 424 transitions. [2022-04-07 16:11:45,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-04-07 16:11:45,049 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:11:45,050 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:11:45,050 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-07 16:11:45,050 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:11:45,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:11:45,050 INFO L85 PathProgramCache]: Analyzing trace with hash -98519058, now seen corresponding path program 1 times [2022-04-07 16:11:45,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:11:45,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234652185] [2022-04-07 16:11:45,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:11:45,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:11:45,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:45,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:11:45,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:45,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {19499#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {19491#true} is VALID [2022-04-07 16:11:45,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {19491#true} assume true; {19491#true} is VALID [2022-04-07 16:11:45,155 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19491#true} {19491#true} #664#return; {19491#true} is VALID [2022-04-07 16:11:45,156 INFO L272 TraceCheckUtils]: 0: Hoare triple {19491#true} call ULTIMATE.init(); {19499#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:11:45,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {19499#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {19491#true} is VALID [2022-04-07 16:11:45,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {19491#true} assume true; {19491#true} is VALID [2022-04-07 16:11:45,156 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19491#true} {19491#true} #664#return; {19491#true} is VALID [2022-04-07 16:11:45,156 INFO L272 TraceCheckUtils]: 4: Hoare triple {19491#true} call #t~ret162 := main(); {19491#true} is VALID [2022-04-07 16:11:45,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {19491#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 52 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {19491#true} is VALID [2022-04-07 16:11:45,156 INFO L290 TraceCheckUtils]: 6: Hoare triple {19491#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {19491#true} is VALID [2022-04-07 16:11:45,156 INFO L272 TraceCheckUtils]: 7: Hoare triple {19491#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {19491#true} is VALID [2022-04-07 16:11:45,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {19491#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {19491#true} is VALID [2022-04-07 16:11:45,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {19491#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {19491#true} is VALID [2022-04-07 16:11:45,156 INFO L290 TraceCheckUtils]: 10: Hoare triple {19491#true} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {19491#true} is VALID [2022-04-07 16:11:45,156 INFO L290 TraceCheckUtils]: 11: Hoare triple {19491#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {19491#true} is VALID [2022-04-07 16:11:45,157 INFO L290 TraceCheckUtils]: 12: Hoare triple {19491#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {19491#true} is VALID [2022-04-07 16:11:45,157 INFO L290 TraceCheckUtils]: 13: Hoare triple {19491#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {19491#true} is VALID [2022-04-07 16:11:45,157 INFO L290 TraceCheckUtils]: 14: Hoare triple {19491#true} assume !false; {19491#true} is VALID [2022-04-07 16:11:45,157 INFO L290 TraceCheckUtils]: 15: Hoare triple {19491#true} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {19491#true} is VALID [2022-04-07 16:11:45,157 INFO L290 TraceCheckUtils]: 16: Hoare triple {19491#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {19491#true} is VALID [2022-04-07 16:11:45,157 INFO L290 TraceCheckUtils]: 17: Hoare triple {19491#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {19491#true} is VALID [2022-04-07 16:11:45,157 INFO L290 TraceCheckUtils]: 18: Hoare triple {19491#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {19491#true} is VALID [2022-04-07 16:11:45,157 INFO L290 TraceCheckUtils]: 19: Hoare triple {19491#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {19491#true} is VALID [2022-04-07 16:11:45,157 INFO L290 TraceCheckUtils]: 20: Hoare triple {19491#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {19491#true} is VALID [2022-04-07 16:11:45,157 INFO L290 TraceCheckUtils]: 21: Hoare triple {19491#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {19491#true} is VALID [2022-04-07 16:11:45,157 INFO L290 TraceCheckUtils]: 22: Hoare triple {19491#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {19491#true} is VALID [2022-04-07 16:11:45,157 INFO L290 TraceCheckUtils]: 23: Hoare triple {19491#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {19491#true} is VALID [2022-04-07 16:11:45,157 INFO L290 TraceCheckUtils]: 24: Hoare triple {19491#true} assume 8464 == #t~mem50;havoc #t~mem50; {19491#true} is VALID [2022-04-07 16:11:45,157 INFO L290 TraceCheckUtils]: 25: Hoare triple {19491#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; {19491#true} is VALID [2022-04-07 16:11:45,157 INFO L290 TraceCheckUtils]: 26: Hoare triple {19491#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {19491#true} is VALID [2022-04-07 16:11:45,157 INFO L290 TraceCheckUtils]: 27: Hoare triple {19491#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {19491#true} is VALID [2022-04-07 16:11:45,157 INFO L290 TraceCheckUtils]: 28: Hoare triple {19491#true} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {19491#true} is VALID [2022-04-07 16:11:45,157 INFO L290 TraceCheckUtils]: 29: Hoare triple {19491#true} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {19491#true} is VALID [2022-04-07 16:11:45,157 INFO L290 TraceCheckUtils]: 30: Hoare triple {19491#true} ~skip~0 := 0; {19491#true} is VALID [2022-04-07 16:11:45,157 INFO L290 TraceCheckUtils]: 31: Hoare triple {19491#true} assume !false; {19491#true} is VALID [2022-04-07 16:11:45,158 INFO L290 TraceCheckUtils]: 32: Hoare triple {19491#true} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {19496#(= |ssl3_accept_#t~mem42| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:45,158 INFO L290 TraceCheckUtils]: 33: Hoare triple {19496#(= |ssl3_accept_#t~mem42| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 12292 == #t~mem42;havoc #t~mem42; {19497#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:45,159 INFO L290 TraceCheckUtils]: 34: Hoare triple {19497#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(1, ~s.base, 40 + ~s.offset, 4); {19497#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:45,159 INFO L290 TraceCheckUtils]: 35: Hoare triple {19497#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(1, ~s.base, 36 + ~s.offset, 4); {19497#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:45,159 INFO L290 TraceCheckUtils]: 36: Hoare triple {19497#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {19497#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:45,160 INFO L290 TraceCheckUtils]: 37: Hoare triple {19497#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {19497#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:45,160 INFO L290 TraceCheckUtils]: 38: Hoare triple {19497#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {19497#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:45,161 INFO L290 TraceCheckUtils]: 39: Hoare triple {19497#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem78.base + #t~mem78.offset) % 4294967296);havoc #t~mem78.base, #t~mem78.offset; {19497#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:45,161 INFO L290 TraceCheckUtils]: 40: Hoare triple {19497#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {19497#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:45,162 INFO L290 TraceCheckUtils]: 41: Hoare triple {19497#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 52 + ~s.offset, 4); {19498#(= 12292 |ssl3_accept_#t~mem81|)} is VALID [2022-04-07 16:11:45,162 INFO L290 TraceCheckUtils]: 42: Hoare triple {19498#(= 12292 |ssl3_accept_#t~mem81|)} assume 12292 != #t~mem81;havoc #t~mem81;assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {19492#false} is VALID [2022-04-07 16:11:45,162 INFO L290 TraceCheckUtils]: 43: Hoare triple {19492#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 72 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 72 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84; {19492#false} is VALID [2022-04-07 16:11:45,162 INFO L290 TraceCheckUtils]: 44: Hoare triple {19492#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,162 INFO L290 TraceCheckUtils]: 45: Hoare triple {19492#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {19492#false} is VALID [2022-04-07 16:11:45,162 INFO L290 TraceCheckUtils]: 46: Hoare triple {19492#false} ~skip~0 := 0; {19492#false} is VALID [2022-04-07 16:11:45,162 INFO L290 TraceCheckUtils]: 47: Hoare triple {19492#false} assume !false; {19492#false} is VALID [2022-04-07 16:11:45,162 INFO L290 TraceCheckUtils]: 48: Hoare triple {19492#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,162 INFO L290 TraceCheckUtils]: 49: Hoare triple {19492#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,162 INFO L290 TraceCheckUtils]: 50: Hoare triple {19492#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,163 INFO L290 TraceCheckUtils]: 51: Hoare triple {19492#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,163 INFO L290 TraceCheckUtils]: 52: Hoare triple {19492#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,163 INFO L290 TraceCheckUtils]: 53: Hoare triple {19492#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,163 INFO L290 TraceCheckUtils]: 54: Hoare triple {19492#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,163 INFO L290 TraceCheckUtils]: 55: Hoare triple {19492#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,163 INFO L290 TraceCheckUtils]: 56: Hoare triple {19492#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,163 INFO L290 TraceCheckUtils]: 57: Hoare triple {19492#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,163 INFO L290 TraceCheckUtils]: 58: Hoare triple {19492#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,163 INFO L290 TraceCheckUtils]: 59: Hoare triple {19492#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,163 INFO L290 TraceCheckUtils]: 60: Hoare triple {19492#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,163 INFO L290 TraceCheckUtils]: 61: Hoare triple {19492#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,163 INFO L290 TraceCheckUtils]: 62: Hoare triple {19492#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,163 INFO L290 TraceCheckUtils]: 63: Hoare triple {19492#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,163 INFO L290 TraceCheckUtils]: 64: Hoare triple {19492#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,163 INFO L290 TraceCheckUtils]: 65: Hoare triple {19492#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,163 INFO L290 TraceCheckUtils]: 66: Hoare triple {19492#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,163 INFO L290 TraceCheckUtils]: 67: Hoare triple {19492#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,163 INFO L290 TraceCheckUtils]: 68: Hoare triple {19492#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,163 INFO L290 TraceCheckUtils]: 69: Hoare triple {19492#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,163 INFO L290 TraceCheckUtils]: 70: Hoare triple {19492#false} assume 8448 == #t~mem63;havoc #t~mem63; {19492#false} is VALID [2022-04-07 16:11:45,163 INFO L290 TraceCheckUtils]: 71: Hoare triple {19492#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~num1~0 := #t~nondet130;havoc #t~nondet130; {19492#false} is VALID [2022-04-07 16:11:45,164 INFO L290 TraceCheckUtils]: 72: Hoare triple {19492#false} assume !(~num1~0 > 0); {19492#false} is VALID [2022-04-07 16:11:45,164 INFO L290 TraceCheckUtils]: 73: Hoare triple {19492#false} call #t~mem131.base, #t~mem131.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem132 := read~int(#t~mem131.base, 844 + #t~mem131.offset, 4);call write~int(#t~mem132, ~s.base, 52 + ~s.offset, 4);havoc #t~mem131.base, #t~mem131.offset;havoc #t~mem132; {19492#false} is VALID [2022-04-07 16:11:45,164 INFO L290 TraceCheckUtils]: 74: Hoare triple {19492#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,164 INFO L290 TraceCheckUtils]: 75: Hoare triple {19492#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {19492#false} is VALID [2022-04-07 16:11:45,164 INFO L290 TraceCheckUtils]: 76: Hoare triple {19492#false} ~skip~0 := 0; {19492#false} is VALID [2022-04-07 16:11:45,164 INFO L290 TraceCheckUtils]: 77: Hoare triple {19492#false} assume !false; {19492#false} is VALID [2022-04-07 16:11:45,164 INFO L290 TraceCheckUtils]: 78: Hoare triple {19492#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,164 INFO L290 TraceCheckUtils]: 79: Hoare triple {19492#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,164 INFO L290 TraceCheckUtils]: 80: Hoare triple {19492#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,164 INFO L290 TraceCheckUtils]: 81: Hoare triple {19492#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,164 INFO L290 TraceCheckUtils]: 82: Hoare triple {19492#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,164 INFO L290 TraceCheckUtils]: 83: Hoare triple {19492#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,164 INFO L290 TraceCheckUtils]: 84: Hoare triple {19492#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,164 INFO L290 TraceCheckUtils]: 85: Hoare triple {19492#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,164 INFO L290 TraceCheckUtils]: 86: Hoare triple {19492#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,164 INFO L290 TraceCheckUtils]: 87: Hoare triple {19492#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,164 INFO L290 TraceCheckUtils]: 88: Hoare triple {19492#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,164 INFO L290 TraceCheckUtils]: 89: Hoare triple {19492#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,164 INFO L290 TraceCheckUtils]: 90: Hoare triple {19492#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,164 INFO L290 TraceCheckUtils]: 91: Hoare triple {19492#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,164 INFO L290 TraceCheckUtils]: 92: Hoare triple {19492#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,165 INFO L290 TraceCheckUtils]: 93: Hoare triple {19492#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,165 INFO L290 TraceCheckUtils]: 94: Hoare triple {19492#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,165 INFO L290 TraceCheckUtils]: 95: Hoare triple {19492#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,165 INFO L290 TraceCheckUtils]: 96: Hoare triple {19492#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,165 INFO L290 TraceCheckUtils]: 97: Hoare triple {19492#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,165 INFO L290 TraceCheckUtils]: 98: Hoare triple {19492#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,165 INFO L290 TraceCheckUtils]: 99: Hoare triple {19492#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,165 INFO L290 TraceCheckUtils]: 100: Hoare triple {19492#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,165 INFO L290 TraceCheckUtils]: 101: Hoare triple {19492#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,165 INFO L290 TraceCheckUtils]: 102: Hoare triple {19492#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,165 INFO L290 TraceCheckUtils]: 103: Hoare triple {19492#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,165 INFO L290 TraceCheckUtils]: 104: Hoare triple {19492#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,165 INFO L290 TraceCheckUtils]: 105: Hoare triple {19492#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,165 INFO L290 TraceCheckUtils]: 106: Hoare triple {19492#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,165 INFO L290 TraceCheckUtils]: 107: Hoare triple {19492#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,165 INFO L290 TraceCheckUtils]: 108: Hoare triple {19492#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,165 INFO L290 TraceCheckUtils]: 109: Hoare triple {19492#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,165 INFO L290 TraceCheckUtils]: 110: Hoare triple {19492#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {19492#false} is VALID [2022-04-07 16:11:45,165 INFO L290 TraceCheckUtils]: 111: Hoare triple {19492#false} assume 8672 == #t~mem74;havoc #t~mem74; {19492#false} is VALID [2022-04-07 16:11:45,165 INFO L290 TraceCheckUtils]: 112: Hoare triple {19492#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {19492#false} is VALID [2022-04-07 16:11:45,165 INFO L290 TraceCheckUtils]: 113: Hoare triple {19492#false} assume 4 == ~blastFlag~0; {19492#false} is VALID [2022-04-07 16:11:45,166 INFO L290 TraceCheckUtils]: 114: Hoare triple {19492#false} assume !false; {19492#false} is VALID [2022-04-07 16:11:45,166 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-07 16:11:45,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:11:45,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234652185] [2022-04-07 16:11:45,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234652185] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:11:45,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:11:45,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 16:11:45,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055865119] [2022-04-07 16:11:45,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:11:45,167 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 5 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2022-04-07 16:11:45,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:11:45,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 14.0) internal successors, (84), 5 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:45,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:11:45,226 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 16:11:45,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:11:45,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 16:11:45,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 16:11:45,227 INFO L87 Difference]: Start difference. First operand 273 states and 424 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 5 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:47,249 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-07 16:11:48,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:48,170 INFO L93 Difference]: Finished difference Result 529 states and 830 transitions. [2022-04-07 16:11:48,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 16:11:48,170 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 5 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2022-04-07 16:11:48,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:11:48,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 5 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:48,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 409 transitions. [2022-04-07 16:11:48,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 5 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:48,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 409 transitions. [2022-04-07 16:11:48,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 409 transitions. [2022-04-07 16:11:48,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 409 edges. 409 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:11:48,469 INFO L225 Difference]: With dead ends: 529 [2022-04-07 16:11:48,469 INFO L226 Difference]: Without dead ends: 282 [2022-04-07 16:11:48,469 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-07 16:11:48,470 INFO L913 BasicCegarLoop]: 196 mSDtfsCounter, 2 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-07 16:11:48,470 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 605 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 424 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-07 16:11:48,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-04-07 16:11:48,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2022-04-07 16:11:48,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:11:48,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 282 states. Second operand has 282 states, 277 states have (on average 1.555956678700361) internal successors, (431), 277 states have internal predecessors, (431), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:48,475 INFO L74 IsIncluded]: Start isIncluded. First operand 282 states. Second operand has 282 states, 277 states have (on average 1.555956678700361) internal successors, (431), 277 states have internal predecessors, (431), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:48,475 INFO L87 Difference]: Start difference. First operand 282 states. Second operand has 282 states, 277 states have (on average 1.555956678700361) internal successors, (431), 277 states have internal predecessors, (431), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:48,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:48,478 INFO L93 Difference]: Finished difference Result 282 states and 435 transitions. [2022-04-07 16:11:48,478 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 435 transitions. [2022-04-07 16:11:48,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:48,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:48,479 INFO L74 IsIncluded]: Start isIncluded. First operand has 282 states, 277 states have (on average 1.555956678700361) internal successors, (431), 277 states have internal predecessors, (431), 3 states have call successors, (3), 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 282 states. [2022-04-07 16:11:48,479 INFO L87 Difference]: Start difference. First operand has 282 states, 277 states have (on average 1.555956678700361) internal successors, (431), 277 states have internal predecessors, (431), 3 states have call successors, (3), 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 282 states. [2022-04-07 16:11:48,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:48,482 INFO L93 Difference]: Finished difference Result 282 states and 435 transitions. [2022-04-07 16:11:48,482 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 435 transitions. [2022-04-07 16:11:48,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:48,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:48,483 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:11:48,483 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:11:48,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 277 states have (on average 1.555956678700361) internal successors, (431), 277 states have internal predecessors, (431), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:48,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 435 transitions. [2022-04-07 16:11:48,486 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 435 transitions. Word has length 115 [2022-04-07 16:11:48,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:11:48,487 INFO L478 AbstractCegarLoop]: Abstraction has 282 states and 435 transitions. [2022-04-07 16:11:48,487 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 5 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:48,487 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 435 transitions. [2022-04-07 16:11:48,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-07 16:11:48,488 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:11:48,488 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:11:48,488 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-07 16:11:48,488 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:11:48,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:11:48,489 INFO L85 PathProgramCache]: Analyzing trace with hash 2075689295, now seen corresponding path program 1 times [2022-04-07 16:11:48,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:11:48,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800813135] [2022-04-07 16:11:48,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:11:48,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:11:48,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:48,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:11:48,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:48,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {20995#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {20988#true} is VALID [2022-04-07 16:11:48,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {20988#true} assume true; {20988#true} is VALID [2022-04-07 16:11:48,596 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20988#true} {20988#true} #664#return; {20988#true} is VALID [2022-04-07 16:11:48,596 INFO L272 TraceCheckUtils]: 0: Hoare triple {20988#true} call ULTIMATE.init(); {20995#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:11:48,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {20995#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {20988#true} is VALID [2022-04-07 16:11:48,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {20988#true} assume true; {20988#true} is VALID [2022-04-07 16:11:48,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20988#true} {20988#true} #664#return; {20988#true} is VALID [2022-04-07 16:11:48,597 INFO L272 TraceCheckUtils]: 4: Hoare triple {20988#true} call #t~ret162 := main(); {20988#true} is VALID [2022-04-07 16:11:48,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {20988#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 52 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {20988#true} is VALID [2022-04-07 16:11:48,597 INFO L290 TraceCheckUtils]: 6: Hoare triple {20988#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {20988#true} is VALID [2022-04-07 16:11:48,597 INFO L272 TraceCheckUtils]: 7: Hoare triple {20988#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {20988#true} is VALID [2022-04-07 16:11:48,597 INFO L290 TraceCheckUtils]: 8: Hoare triple {20988#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {20988#true} is VALID [2022-04-07 16:11:48,597 INFO L290 TraceCheckUtils]: 9: Hoare triple {20988#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {20988#true} is VALID [2022-04-07 16:11:48,597 INFO L290 TraceCheckUtils]: 10: Hoare triple {20988#true} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {20988#true} is VALID [2022-04-07 16:11:48,597 INFO L290 TraceCheckUtils]: 11: Hoare triple {20988#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {20988#true} is VALID [2022-04-07 16:11:48,597 INFO L290 TraceCheckUtils]: 12: Hoare triple {20988#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {20988#true} is VALID [2022-04-07 16:11:48,597 INFO L290 TraceCheckUtils]: 13: Hoare triple {20988#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {20988#true} is VALID [2022-04-07 16:11:48,597 INFO L290 TraceCheckUtils]: 14: Hoare triple {20988#true} assume !false; {20988#true} is VALID [2022-04-07 16:11:48,597 INFO L290 TraceCheckUtils]: 15: Hoare triple {20988#true} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {20988#true} is VALID [2022-04-07 16:11:48,597 INFO L290 TraceCheckUtils]: 16: Hoare triple {20988#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {20988#true} is VALID [2022-04-07 16:11:48,597 INFO L290 TraceCheckUtils]: 17: Hoare triple {20988#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {20988#true} is VALID [2022-04-07 16:11:48,597 INFO L290 TraceCheckUtils]: 18: Hoare triple {20988#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {20988#true} is VALID [2022-04-07 16:11:48,597 INFO L290 TraceCheckUtils]: 19: Hoare triple {20988#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {20988#true} is VALID [2022-04-07 16:11:48,597 INFO L290 TraceCheckUtils]: 20: Hoare triple {20988#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {20988#true} is VALID [2022-04-07 16:11:48,597 INFO L290 TraceCheckUtils]: 21: Hoare triple {20988#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {20988#true} is VALID [2022-04-07 16:11:48,597 INFO L290 TraceCheckUtils]: 22: Hoare triple {20988#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {20988#true} is VALID [2022-04-07 16:11:48,598 INFO L290 TraceCheckUtils]: 23: Hoare triple {20988#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {20988#true} is VALID [2022-04-07 16:11:48,598 INFO L290 TraceCheckUtils]: 24: Hoare triple {20988#true} assume 8464 == #t~mem50;havoc #t~mem50; {20988#true} is VALID [2022-04-07 16:11:48,598 INFO L290 TraceCheckUtils]: 25: Hoare triple {20988#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; {20988#true} is VALID [2022-04-07 16:11:48,598 INFO L290 TraceCheckUtils]: 26: Hoare triple {20988#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {20988#true} is VALID [2022-04-07 16:11:48,598 INFO L290 TraceCheckUtils]: 27: Hoare triple {20988#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {20993#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:48,599 INFO L290 TraceCheckUtils]: 28: Hoare triple {20993#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {20993#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:48,599 INFO L290 TraceCheckUtils]: 29: Hoare triple {20993#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {20993#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:48,599 INFO L290 TraceCheckUtils]: 30: Hoare triple {20993#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {20993#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:48,600 INFO L290 TraceCheckUtils]: 31: Hoare triple {20993#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {20993#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:48,600 INFO L290 TraceCheckUtils]: 32: Hoare triple {20993#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {20993#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:48,600 INFO L290 TraceCheckUtils]: 33: Hoare triple {20993#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {20993#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:48,601 INFO L290 TraceCheckUtils]: 34: Hoare triple {20993#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {20994#(= |ssl3_accept_#t~mem44| 8496)} is VALID [2022-04-07 16:11:48,601 INFO L290 TraceCheckUtils]: 35: Hoare triple {20994#(= |ssl3_accept_#t~mem44| 8496)} assume 8192 == #t~mem44;havoc #t~mem44; {20989#false} is VALID [2022-04-07 16:11:48,601 INFO L290 TraceCheckUtils]: 36: Hoare triple {20989#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,601 INFO L290 TraceCheckUtils]: 37: Hoare triple {20989#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {20989#false} is VALID [2022-04-07 16:11:48,601 INFO L290 TraceCheckUtils]: 38: Hoare triple {20989#false} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,601 INFO L290 TraceCheckUtils]: 39: Hoare triple {20989#false} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,601 INFO L290 TraceCheckUtils]: 40: Hoare triple {20989#false} assume !(0 == (#t~mem78.base + #t~mem78.offset) % 4294967296);havoc #t~mem78.base, #t~mem78.offset; {20989#false} is VALID [2022-04-07 16:11:48,601 INFO L290 TraceCheckUtils]: 41: Hoare triple {20989#false} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {20989#false} is VALID [2022-04-07 16:11:48,601 INFO L290 TraceCheckUtils]: 42: Hoare triple {20989#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,601 INFO L290 TraceCheckUtils]: 43: Hoare triple {20989#false} assume 12292 != #t~mem81;havoc #t~mem81;assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {20989#false} is VALID [2022-04-07 16:11:48,602 INFO L290 TraceCheckUtils]: 44: Hoare triple {20989#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 72 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 72 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84; {20989#false} is VALID [2022-04-07 16:11:48,602 INFO L290 TraceCheckUtils]: 45: Hoare triple {20989#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,602 INFO L290 TraceCheckUtils]: 46: Hoare triple {20989#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {20989#false} is VALID [2022-04-07 16:11:48,602 INFO L290 TraceCheckUtils]: 47: Hoare triple {20989#false} ~skip~0 := 0; {20989#false} is VALID [2022-04-07 16:11:48,602 INFO L290 TraceCheckUtils]: 48: Hoare triple {20989#false} assume !false; {20989#false} is VALID [2022-04-07 16:11:48,602 INFO L290 TraceCheckUtils]: 49: Hoare triple {20989#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,602 INFO L290 TraceCheckUtils]: 50: Hoare triple {20989#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,602 INFO L290 TraceCheckUtils]: 51: Hoare triple {20989#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,602 INFO L290 TraceCheckUtils]: 52: Hoare triple {20989#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,602 INFO L290 TraceCheckUtils]: 53: Hoare triple {20989#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,602 INFO L290 TraceCheckUtils]: 54: Hoare triple {20989#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,602 INFO L290 TraceCheckUtils]: 55: Hoare triple {20989#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,602 INFO L290 TraceCheckUtils]: 56: Hoare triple {20989#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,602 INFO L290 TraceCheckUtils]: 57: Hoare triple {20989#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,602 INFO L290 TraceCheckUtils]: 58: Hoare triple {20989#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,602 INFO L290 TraceCheckUtils]: 59: Hoare triple {20989#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,602 INFO L290 TraceCheckUtils]: 60: Hoare triple {20989#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,602 INFO L290 TraceCheckUtils]: 61: Hoare triple {20989#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,602 INFO L290 TraceCheckUtils]: 62: Hoare triple {20989#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,602 INFO L290 TraceCheckUtils]: 63: Hoare triple {20989#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,603 INFO L290 TraceCheckUtils]: 64: Hoare triple {20989#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,603 INFO L290 TraceCheckUtils]: 65: Hoare triple {20989#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,603 INFO L290 TraceCheckUtils]: 66: Hoare triple {20989#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,603 INFO L290 TraceCheckUtils]: 67: Hoare triple {20989#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,603 INFO L290 TraceCheckUtils]: 68: Hoare triple {20989#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,603 INFO L290 TraceCheckUtils]: 69: Hoare triple {20989#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,603 INFO L290 TraceCheckUtils]: 70: Hoare triple {20989#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,603 INFO L290 TraceCheckUtils]: 71: Hoare triple {20989#false} assume 8448 == #t~mem63;havoc #t~mem63; {20989#false} is VALID [2022-04-07 16:11:48,603 INFO L290 TraceCheckUtils]: 72: Hoare triple {20989#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~num1~0 := #t~nondet130;havoc #t~nondet130; {20989#false} is VALID [2022-04-07 16:11:48,603 INFO L290 TraceCheckUtils]: 73: Hoare triple {20989#false} assume !(~num1~0 > 0); {20989#false} is VALID [2022-04-07 16:11:48,603 INFO L290 TraceCheckUtils]: 74: Hoare triple {20989#false} call #t~mem131.base, #t~mem131.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem132 := read~int(#t~mem131.base, 844 + #t~mem131.offset, 4);call write~int(#t~mem132, ~s.base, 52 + ~s.offset, 4);havoc #t~mem131.base, #t~mem131.offset;havoc #t~mem132; {20989#false} is VALID [2022-04-07 16:11:48,603 INFO L290 TraceCheckUtils]: 75: Hoare triple {20989#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,603 INFO L290 TraceCheckUtils]: 76: Hoare triple {20989#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {20989#false} is VALID [2022-04-07 16:11:48,603 INFO L290 TraceCheckUtils]: 77: Hoare triple {20989#false} ~skip~0 := 0; {20989#false} is VALID [2022-04-07 16:11:48,603 INFO L290 TraceCheckUtils]: 78: Hoare triple {20989#false} assume !false; {20989#false} is VALID [2022-04-07 16:11:48,603 INFO L290 TraceCheckUtils]: 79: Hoare triple {20989#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,603 INFO L290 TraceCheckUtils]: 80: Hoare triple {20989#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,603 INFO L290 TraceCheckUtils]: 81: Hoare triple {20989#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,603 INFO L290 TraceCheckUtils]: 82: Hoare triple {20989#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,603 INFO L290 TraceCheckUtils]: 83: Hoare triple {20989#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,604 INFO L290 TraceCheckUtils]: 84: Hoare triple {20989#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,604 INFO L290 TraceCheckUtils]: 85: Hoare triple {20989#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,604 INFO L290 TraceCheckUtils]: 86: Hoare triple {20989#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,618 INFO L290 TraceCheckUtils]: 87: Hoare triple {20989#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,618 INFO L290 TraceCheckUtils]: 88: Hoare triple {20989#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,618 INFO L290 TraceCheckUtils]: 89: Hoare triple {20989#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,618 INFO L290 TraceCheckUtils]: 90: Hoare triple {20989#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,618 INFO L290 TraceCheckUtils]: 91: Hoare triple {20989#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,618 INFO L290 TraceCheckUtils]: 92: Hoare triple {20989#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,618 INFO L290 TraceCheckUtils]: 93: Hoare triple {20989#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,618 INFO L290 TraceCheckUtils]: 94: Hoare triple {20989#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,618 INFO L290 TraceCheckUtils]: 95: Hoare triple {20989#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,618 INFO L290 TraceCheckUtils]: 96: Hoare triple {20989#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,618 INFO L290 TraceCheckUtils]: 97: Hoare triple {20989#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,618 INFO L290 TraceCheckUtils]: 98: Hoare triple {20989#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,618 INFO L290 TraceCheckUtils]: 99: Hoare triple {20989#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,618 INFO L290 TraceCheckUtils]: 100: Hoare triple {20989#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,618 INFO L290 TraceCheckUtils]: 101: Hoare triple {20989#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,618 INFO L290 TraceCheckUtils]: 102: Hoare triple {20989#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,618 INFO L290 TraceCheckUtils]: 103: Hoare triple {20989#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,619 INFO L290 TraceCheckUtils]: 104: Hoare triple {20989#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,619 INFO L290 TraceCheckUtils]: 105: Hoare triple {20989#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,619 INFO L290 TraceCheckUtils]: 106: Hoare triple {20989#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,619 INFO L290 TraceCheckUtils]: 107: Hoare triple {20989#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,619 INFO L290 TraceCheckUtils]: 108: Hoare triple {20989#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,619 INFO L290 TraceCheckUtils]: 109: Hoare triple {20989#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,619 INFO L290 TraceCheckUtils]: 110: Hoare triple {20989#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,619 INFO L290 TraceCheckUtils]: 111: Hoare triple {20989#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {20989#false} is VALID [2022-04-07 16:11:48,619 INFO L290 TraceCheckUtils]: 112: Hoare triple {20989#false} assume 8672 == #t~mem74;havoc #t~mem74; {20989#false} is VALID [2022-04-07 16:11:48,619 INFO L290 TraceCheckUtils]: 113: Hoare triple {20989#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {20989#false} is VALID [2022-04-07 16:11:48,619 INFO L290 TraceCheckUtils]: 114: Hoare triple {20989#false} assume 4 == ~blastFlag~0; {20989#false} is VALID [2022-04-07 16:11:48,619 INFO L290 TraceCheckUtils]: 115: Hoare triple {20989#false} assume !false; {20989#false} is VALID [2022-04-07 16:11:48,619 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-07 16:11:48,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:11:48,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800813135] [2022-04-07 16:11:48,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800813135] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:11:48,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:11:48,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:11:48,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158888358] [2022-04-07 16:11:48,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:11:48,620 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 116 [2022-04-07 16:11:48,621 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:11:48,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:48,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:11:48,694 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:11:48,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:11:48,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:11:48,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:11:48,695 INFO L87 Difference]: Start difference. First operand 282 states and 435 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:50,723 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-07 16:11:51,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:51,620 INFO L93 Difference]: Finished difference Result 565 states and 875 transitions. [2022-04-07 16:11:51,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:11:51,620 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 116 [2022-04-07 16:11:51,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:11:51,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:51,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 454 transitions. [2022-04-07 16:11:51,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:51,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 454 transitions. [2022-04-07 16:11:51,642 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 454 transitions. [2022-04-07 16:11:51,895 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 454 edges. 454 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:11:51,908 INFO L225 Difference]: With dead ends: 565 [2022-04-07 16:11:51,908 INFO L226 Difference]: Without dead ends: 309 [2022-04-07 16:11:51,908 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-07 16:11:51,909 INFO L913 BasicCegarLoop]: 191 mSDtfsCounter, 37 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-07 16:11:51,909 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 488 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 380 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-07 16:11:51,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-04-07 16:11:51,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 282. [2022-04-07 16:11:51,914 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:11:51,914 INFO L82 GeneralOperation]: Start isEquivalent. First operand 309 states. Second operand has 282 states, 277 states have (on average 1.552346570397112) internal successors, (430), 277 states have internal predecessors, (430), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:51,914 INFO L74 IsIncluded]: Start isIncluded. First operand 309 states. Second operand has 282 states, 277 states have (on average 1.552346570397112) internal successors, (430), 277 states have internal predecessors, (430), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:51,915 INFO L87 Difference]: Start difference. First operand 309 states. Second operand has 282 states, 277 states have (on average 1.552346570397112) internal successors, (430), 277 states have internal predecessors, (430), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:51,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:51,919 INFO L93 Difference]: Finished difference Result 309 states and 469 transitions. [2022-04-07 16:11:51,919 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 469 transitions. [2022-04-07 16:11:51,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:51,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:51,919 INFO L74 IsIncluded]: Start isIncluded. First operand has 282 states, 277 states have (on average 1.552346570397112) internal successors, (430), 277 states have internal predecessors, (430), 3 states have call successors, (3), 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 309 states. [2022-04-07 16:11:51,920 INFO L87 Difference]: Start difference. First operand has 282 states, 277 states have (on average 1.552346570397112) internal successors, (430), 277 states have internal predecessors, (430), 3 states have call successors, (3), 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 309 states. [2022-04-07 16:11:51,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:51,928 INFO L93 Difference]: Finished difference Result 309 states and 469 transitions. [2022-04-07 16:11:51,928 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 469 transitions. [2022-04-07 16:11:51,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:51,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:51,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:11:51,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:11:51,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 277 states have (on average 1.552346570397112) internal successors, (430), 277 states have internal predecessors, (430), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:51,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 434 transitions. [2022-04-07 16:11:51,933 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 434 transitions. Word has length 116 [2022-04-07 16:11:51,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:11:51,934 INFO L478 AbstractCegarLoop]: Abstraction has 282 states and 434 transitions. [2022-04-07 16:11:51,934 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:51,934 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 434 transitions. [2022-04-07 16:11:51,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-04-07 16:11:51,953 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:11:51,953 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:11:51,954 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-07 16:11:51,954 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:11:51,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:11:51,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1112626983, now seen corresponding path program 1 times [2022-04-07 16:11:51,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:11:51,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525886004] [2022-04-07 16:11:51,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:11:51,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:11:52,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:52,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:11:52,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:52,051 INFO L290 TraceCheckUtils]: 0: Hoare triple {22587#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {22580#true} is VALID [2022-04-07 16:11:52,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {22580#true} assume true; {22580#true} is VALID [2022-04-07 16:11:52,051 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22580#true} {22580#true} #664#return; {22580#true} is VALID [2022-04-07 16:11:52,052 INFO L272 TraceCheckUtils]: 0: Hoare triple {22580#true} call ULTIMATE.init(); {22587#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:11:52,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {22587#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {22580#true} is VALID [2022-04-07 16:11:52,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {22580#true} assume true; {22580#true} is VALID [2022-04-07 16:11:52,052 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22580#true} {22580#true} #664#return; {22580#true} is VALID [2022-04-07 16:11:52,052 INFO L272 TraceCheckUtils]: 4: Hoare triple {22580#true} call #t~ret162 := main(); {22580#true} is VALID [2022-04-07 16:11:52,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {22580#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 52 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {22580#true} is VALID [2022-04-07 16:11:52,052 INFO L290 TraceCheckUtils]: 6: Hoare triple {22580#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {22580#true} is VALID [2022-04-07 16:11:52,052 INFO L272 TraceCheckUtils]: 7: Hoare triple {22580#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {22580#true} is VALID [2022-04-07 16:11:52,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {22580#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {22580#true} is VALID [2022-04-07 16:11:52,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {22580#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {22580#true} is VALID [2022-04-07 16:11:52,052 INFO L290 TraceCheckUtils]: 10: Hoare triple {22580#true} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {22580#true} is VALID [2022-04-07 16:11:52,052 INFO L290 TraceCheckUtils]: 11: Hoare triple {22580#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {22580#true} is VALID [2022-04-07 16:11:52,052 INFO L290 TraceCheckUtils]: 12: Hoare triple {22580#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {22580#true} is VALID [2022-04-07 16:11:52,052 INFO L290 TraceCheckUtils]: 13: Hoare triple {22580#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {22580#true} is VALID [2022-04-07 16:11:52,052 INFO L290 TraceCheckUtils]: 14: Hoare triple {22580#true} assume !false; {22580#true} is VALID [2022-04-07 16:11:52,052 INFO L290 TraceCheckUtils]: 15: Hoare triple {22580#true} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {22580#true} is VALID [2022-04-07 16:11:52,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {22580#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {22580#true} is VALID [2022-04-07 16:11:52,052 INFO L290 TraceCheckUtils]: 17: Hoare triple {22580#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {22580#true} is VALID [2022-04-07 16:11:52,052 INFO L290 TraceCheckUtils]: 18: Hoare triple {22580#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {22580#true} is VALID [2022-04-07 16:11:52,053 INFO L290 TraceCheckUtils]: 19: Hoare triple {22580#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {22580#true} is VALID [2022-04-07 16:11:52,053 INFO L290 TraceCheckUtils]: 20: Hoare triple {22580#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {22580#true} is VALID [2022-04-07 16:11:52,053 INFO L290 TraceCheckUtils]: 21: Hoare triple {22580#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {22580#true} is VALID [2022-04-07 16:11:52,053 INFO L290 TraceCheckUtils]: 22: Hoare triple {22580#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {22580#true} is VALID [2022-04-07 16:11:52,053 INFO L290 TraceCheckUtils]: 23: Hoare triple {22580#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {22580#true} is VALID [2022-04-07 16:11:52,053 INFO L290 TraceCheckUtils]: 24: Hoare triple {22580#true} assume 8464 == #t~mem50;havoc #t~mem50; {22580#true} is VALID [2022-04-07 16:11:52,053 INFO L290 TraceCheckUtils]: 25: Hoare triple {22580#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; {22580#true} is VALID [2022-04-07 16:11:52,053 INFO L290 TraceCheckUtils]: 26: Hoare triple {22580#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {22580#true} is VALID [2022-04-07 16:11:52,054 INFO L290 TraceCheckUtils]: 27: Hoare triple {22580#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {22585#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:52,054 INFO L290 TraceCheckUtils]: 28: Hoare triple {22585#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {22585#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:52,054 INFO L290 TraceCheckUtils]: 29: Hoare triple {22585#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {22585#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:52,055 INFO L290 TraceCheckUtils]: 30: Hoare triple {22585#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {22585#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:52,055 INFO L290 TraceCheckUtils]: 31: Hoare triple {22585#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {22585#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:52,055 INFO L290 TraceCheckUtils]: 32: Hoare triple {22585#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {22585#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:52,056 INFO L290 TraceCheckUtils]: 33: Hoare triple {22585#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {22585#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:52,056 INFO L290 TraceCheckUtils]: 34: Hoare triple {22585#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {22585#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:52,056 INFO L290 TraceCheckUtils]: 35: Hoare triple {22585#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {22586#(= |ssl3_accept_#t~mem45| 8496)} is VALID [2022-04-07 16:11:52,056 INFO L290 TraceCheckUtils]: 36: Hoare triple {22586#(= |ssl3_accept_#t~mem45| 8496)} assume 24576 == #t~mem45;havoc #t~mem45; {22581#false} is VALID [2022-04-07 16:11:52,057 INFO L290 TraceCheckUtils]: 37: Hoare triple {22581#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,057 INFO L290 TraceCheckUtils]: 38: Hoare triple {22581#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {22581#false} is VALID [2022-04-07 16:11:52,057 INFO L290 TraceCheckUtils]: 39: Hoare triple {22581#false} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,057 INFO L290 TraceCheckUtils]: 40: Hoare triple {22581#false} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,057 INFO L290 TraceCheckUtils]: 41: Hoare triple {22581#false} assume !(0 == (#t~mem78.base + #t~mem78.offset) % 4294967296);havoc #t~mem78.base, #t~mem78.offset; {22581#false} is VALID [2022-04-07 16:11:52,057 INFO L290 TraceCheckUtils]: 42: Hoare triple {22581#false} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {22581#false} is VALID [2022-04-07 16:11:52,057 INFO L290 TraceCheckUtils]: 43: Hoare triple {22581#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,057 INFO L290 TraceCheckUtils]: 44: Hoare triple {22581#false} assume 12292 != #t~mem81;havoc #t~mem81;assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {22581#false} is VALID [2022-04-07 16:11:52,057 INFO L290 TraceCheckUtils]: 45: Hoare triple {22581#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 72 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 72 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84; {22581#false} is VALID [2022-04-07 16:11:52,057 INFO L290 TraceCheckUtils]: 46: Hoare triple {22581#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,057 INFO L290 TraceCheckUtils]: 47: Hoare triple {22581#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {22581#false} is VALID [2022-04-07 16:11:52,057 INFO L290 TraceCheckUtils]: 48: Hoare triple {22581#false} ~skip~0 := 0; {22581#false} is VALID [2022-04-07 16:11:52,057 INFO L290 TraceCheckUtils]: 49: Hoare triple {22581#false} assume !false; {22581#false} is VALID [2022-04-07 16:11:52,057 INFO L290 TraceCheckUtils]: 50: Hoare triple {22581#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,057 INFO L290 TraceCheckUtils]: 51: Hoare triple {22581#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,057 INFO L290 TraceCheckUtils]: 52: Hoare triple {22581#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,057 INFO L290 TraceCheckUtils]: 53: Hoare triple {22581#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,057 INFO L290 TraceCheckUtils]: 54: Hoare triple {22581#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,057 INFO L290 TraceCheckUtils]: 55: Hoare triple {22581#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,057 INFO L290 TraceCheckUtils]: 56: Hoare triple {22581#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,057 INFO L290 TraceCheckUtils]: 57: Hoare triple {22581#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,058 INFO L290 TraceCheckUtils]: 58: Hoare triple {22581#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,058 INFO L290 TraceCheckUtils]: 59: Hoare triple {22581#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,058 INFO L290 TraceCheckUtils]: 60: Hoare triple {22581#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,058 INFO L290 TraceCheckUtils]: 61: Hoare triple {22581#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,058 INFO L290 TraceCheckUtils]: 62: Hoare triple {22581#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,058 INFO L290 TraceCheckUtils]: 63: Hoare triple {22581#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,058 INFO L290 TraceCheckUtils]: 64: Hoare triple {22581#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,058 INFO L290 TraceCheckUtils]: 65: Hoare triple {22581#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,058 INFO L290 TraceCheckUtils]: 66: Hoare triple {22581#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,058 INFO L290 TraceCheckUtils]: 67: Hoare triple {22581#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,058 INFO L290 TraceCheckUtils]: 68: Hoare triple {22581#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,058 INFO L290 TraceCheckUtils]: 69: Hoare triple {22581#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,058 INFO L290 TraceCheckUtils]: 70: Hoare triple {22581#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,058 INFO L290 TraceCheckUtils]: 71: Hoare triple {22581#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,058 INFO L290 TraceCheckUtils]: 72: Hoare triple {22581#false} assume 8448 == #t~mem63;havoc #t~mem63; {22581#false} is VALID [2022-04-07 16:11:52,058 INFO L290 TraceCheckUtils]: 73: Hoare triple {22581#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~num1~0 := #t~nondet130;havoc #t~nondet130; {22581#false} is VALID [2022-04-07 16:11:52,058 INFO L290 TraceCheckUtils]: 74: Hoare triple {22581#false} assume !(~num1~0 > 0); {22581#false} is VALID [2022-04-07 16:11:52,058 INFO L290 TraceCheckUtils]: 75: Hoare triple {22581#false} call #t~mem131.base, #t~mem131.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem132 := read~int(#t~mem131.base, 844 + #t~mem131.offset, 4);call write~int(#t~mem132, ~s.base, 52 + ~s.offset, 4);havoc #t~mem131.base, #t~mem131.offset;havoc #t~mem132; {22581#false} is VALID [2022-04-07 16:11:52,058 INFO L290 TraceCheckUtils]: 76: Hoare triple {22581#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,058 INFO L290 TraceCheckUtils]: 77: Hoare triple {22581#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {22581#false} is VALID [2022-04-07 16:11:52,059 INFO L290 TraceCheckUtils]: 78: Hoare triple {22581#false} ~skip~0 := 0; {22581#false} is VALID [2022-04-07 16:11:52,059 INFO L290 TraceCheckUtils]: 79: Hoare triple {22581#false} assume !false; {22581#false} is VALID [2022-04-07 16:11:52,059 INFO L290 TraceCheckUtils]: 80: Hoare triple {22581#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,059 INFO L290 TraceCheckUtils]: 81: Hoare triple {22581#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,059 INFO L290 TraceCheckUtils]: 82: Hoare triple {22581#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,059 INFO L290 TraceCheckUtils]: 83: Hoare triple {22581#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,059 INFO L290 TraceCheckUtils]: 84: Hoare triple {22581#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,059 INFO L290 TraceCheckUtils]: 85: Hoare triple {22581#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,059 INFO L290 TraceCheckUtils]: 86: Hoare triple {22581#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,059 INFO L290 TraceCheckUtils]: 87: Hoare triple {22581#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,059 INFO L290 TraceCheckUtils]: 88: Hoare triple {22581#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,059 INFO L290 TraceCheckUtils]: 89: Hoare triple {22581#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,059 INFO L290 TraceCheckUtils]: 90: Hoare triple {22581#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,059 INFO L290 TraceCheckUtils]: 91: Hoare triple {22581#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,059 INFO L290 TraceCheckUtils]: 92: Hoare triple {22581#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,059 INFO L290 TraceCheckUtils]: 93: Hoare triple {22581#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,059 INFO L290 TraceCheckUtils]: 94: Hoare triple {22581#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,059 INFO L290 TraceCheckUtils]: 95: Hoare triple {22581#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,059 INFO L290 TraceCheckUtils]: 96: Hoare triple {22581#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,059 INFO L290 TraceCheckUtils]: 97: Hoare triple {22581#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,059 INFO L290 TraceCheckUtils]: 98: Hoare triple {22581#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,060 INFO L290 TraceCheckUtils]: 99: Hoare triple {22581#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,060 INFO L290 TraceCheckUtils]: 100: Hoare triple {22581#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,060 INFO L290 TraceCheckUtils]: 101: Hoare triple {22581#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,060 INFO L290 TraceCheckUtils]: 102: Hoare triple {22581#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,060 INFO L290 TraceCheckUtils]: 103: Hoare triple {22581#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,060 INFO L290 TraceCheckUtils]: 104: Hoare triple {22581#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,060 INFO L290 TraceCheckUtils]: 105: Hoare triple {22581#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,060 INFO L290 TraceCheckUtils]: 106: Hoare triple {22581#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,060 INFO L290 TraceCheckUtils]: 107: Hoare triple {22581#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,060 INFO L290 TraceCheckUtils]: 108: Hoare triple {22581#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,060 INFO L290 TraceCheckUtils]: 109: Hoare triple {22581#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,060 INFO L290 TraceCheckUtils]: 110: Hoare triple {22581#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,060 INFO L290 TraceCheckUtils]: 111: Hoare triple {22581#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,060 INFO L290 TraceCheckUtils]: 112: Hoare triple {22581#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {22581#false} is VALID [2022-04-07 16:11:52,060 INFO L290 TraceCheckUtils]: 113: Hoare triple {22581#false} assume 8672 == #t~mem74;havoc #t~mem74; {22581#false} is VALID [2022-04-07 16:11:52,060 INFO L290 TraceCheckUtils]: 114: Hoare triple {22581#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {22581#false} is VALID [2022-04-07 16:11:52,060 INFO L290 TraceCheckUtils]: 115: Hoare triple {22581#false} assume 4 == ~blastFlag~0; {22581#false} is VALID [2022-04-07 16:11:52,060 INFO L290 TraceCheckUtils]: 116: Hoare triple {22581#false} assume !false; {22581#false} is VALID [2022-04-07 16:11:52,061 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-07 16:11:52,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:11:52,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525886004] [2022-04-07 16:11:52,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525886004] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:11:52,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:11:52,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:11:52,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998412679] [2022-04-07 16:11:52,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:11:52,061 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 117 [2022-04-07 16:11:52,062 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:11:52,062 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:52,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:11:52,123 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:11:52,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:11:52,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:11:52,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:11:52,124 INFO L87 Difference]: Start difference. First operand 282 states and 434 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:54,144 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-07 16:11:54,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:54,966 INFO L93 Difference]: Finished difference Result 555 states and 860 transitions. [2022-04-07 16:11:54,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:11:54,967 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 117 [2022-04-07 16:11:54,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:11:54,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:54,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2022-04-07 16:11:54,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:54,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2022-04-07 16:11:54,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 451 transitions. [2022-04-07 16:11:55,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 451 edges. 451 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:11:55,249 INFO L225 Difference]: With dead ends: 555 [2022-04-07 16:11:55,249 INFO L226 Difference]: Without dead ends: 299 [2022-04-07 16:11:55,249 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-07 16:11:55,250 INFO L913 BasicCegarLoop]: 192 mSDtfsCounter, 34 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-07 16:11:55,250 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 490 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 378 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-07 16:11:55,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-04-07 16:11:55,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 282. [2022-04-07 16:11:55,254 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:11:55,255 INFO L82 GeneralOperation]: Start isEquivalent. First operand 299 states. Second operand has 282 states, 277 states have (on average 1.5487364620938628) internal successors, (429), 277 states have internal predecessors, (429), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:55,261 INFO L74 IsIncluded]: Start isIncluded. First operand 299 states. Second operand has 282 states, 277 states have (on average 1.5487364620938628) internal successors, (429), 277 states have internal predecessors, (429), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:55,262 INFO L87 Difference]: Start difference. First operand 299 states. Second operand has 282 states, 277 states have (on average 1.5487364620938628) internal successors, (429), 277 states have internal predecessors, (429), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:55,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:55,265 INFO L93 Difference]: Finished difference Result 299 states and 455 transitions. [2022-04-07 16:11:55,265 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 455 transitions. [2022-04-07 16:11:55,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:55,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:55,266 INFO L74 IsIncluded]: Start isIncluded. First operand has 282 states, 277 states have (on average 1.5487364620938628) internal successors, (429), 277 states have internal predecessors, (429), 3 states have call successors, (3), 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 299 states. [2022-04-07 16:11:55,266 INFO L87 Difference]: Start difference. First operand has 282 states, 277 states have (on average 1.5487364620938628) internal successors, (429), 277 states have internal predecessors, (429), 3 states have call successors, (3), 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 299 states. [2022-04-07 16:11:55,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:55,270 INFO L93 Difference]: Finished difference Result 299 states and 455 transitions. [2022-04-07 16:11:55,270 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 455 transitions. [2022-04-07 16:11:55,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:55,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:55,270 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:11:55,270 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:11:55,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 277 states have (on average 1.5487364620938628) internal successors, (429), 277 states have internal predecessors, (429), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:55,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 433 transitions. [2022-04-07 16:11:55,274 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 433 transitions. Word has length 117 [2022-04-07 16:11:55,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:11:55,274 INFO L478 AbstractCegarLoop]: Abstraction has 282 states and 433 transitions. [2022-04-07 16:11:55,274 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:55,274 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 433 transitions. [2022-04-07 16:11:55,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-07 16:11:55,275 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:11:55,275 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:11:55,275 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-07 16:11:55,275 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:11:55,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:11:55,276 INFO L85 PathProgramCache]: Analyzing trace with hash 502133768, now seen corresponding path program 1 times [2022-04-07 16:11:55,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:11:55,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019164141] [2022-04-07 16:11:55,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:11:55,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:11:55,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:55,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:11:55,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:55,374 INFO L290 TraceCheckUtils]: 0: Hoare triple {24148#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {24141#true} is VALID [2022-04-07 16:11:55,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {24141#true} assume true; {24141#true} is VALID [2022-04-07 16:11:55,374 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24141#true} {24141#true} #664#return; {24141#true} is VALID [2022-04-07 16:11:55,375 INFO L272 TraceCheckUtils]: 0: Hoare triple {24141#true} call ULTIMATE.init(); {24148#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:11:55,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {24148#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {24141#true} is VALID [2022-04-07 16:11:55,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {24141#true} assume true; {24141#true} is VALID [2022-04-07 16:11:55,375 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24141#true} {24141#true} #664#return; {24141#true} is VALID [2022-04-07 16:11:55,375 INFO L272 TraceCheckUtils]: 4: Hoare triple {24141#true} call #t~ret162 := main(); {24141#true} is VALID [2022-04-07 16:11:55,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {24141#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 52 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {24141#true} is VALID [2022-04-07 16:11:55,375 INFO L290 TraceCheckUtils]: 6: Hoare triple {24141#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {24141#true} is VALID [2022-04-07 16:11:55,375 INFO L272 TraceCheckUtils]: 7: Hoare triple {24141#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {24141#true} is VALID [2022-04-07 16:11:55,375 INFO L290 TraceCheckUtils]: 8: Hoare triple {24141#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {24141#true} is VALID [2022-04-07 16:11:55,375 INFO L290 TraceCheckUtils]: 9: Hoare triple {24141#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {24141#true} is VALID [2022-04-07 16:11:55,375 INFO L290 TraceCheckUtils]: 10: Hoare triple {24141#true} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {24141#true} is VALID [2022-04-07 16:11:55,375 INFO L290 TraceCheckUtils]: 11: Hoare triple {24141#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {24141#true} is VALID [2022-04-07 16:11:55,375 INFO L290 TraceCheckUtils]: 12: Hoare triple {24141#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {24141#true} is VALID [2022-04-07 16:11:55,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {24141#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {24141#true} is VALID [2022-04-07 16:11:55,375 INFO L290 TraceCheckUtils]: 14: Hoare triple {24141#true} assume !false; {24141#true} is VALID [2022-04-07 16:11:55,375 INFO L290 TraceCheckUtils]: 15: Hoare triple {24141#true} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {24141#true} is VALID [2022-04-07 16:11:55,375 INFO L290 TraceCheckUtils]: 16: Hoare triple {24141#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {24141#true} is VALID [2022-04-07 16:11:55,375 INFO L290 TraceCheckUtils]: 17: Hoare triple {24141#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {24141#true} is VALID [2022-04-07 16:11:55,376 INFO L290 TraceCheckUtils]: 18: Hoare triple {24141#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {24141#true} is VALID [2022-04-07 16:11:55,376 INFO L290 TraceCheckUtils]: 19: Hoare triple {24141#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {24141#true} is VALID [2022-04-07 16:11:55,376 INFO L290 TraceCheckUtils]: 20: Hoare triple {24141#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {24141#true} is VALID [2022-04-07 16:11:55,376 INFO L290 TraceCheckUtils]: 21: Hoare triple {24141#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {24141#true} is VALID [2022-04-07 16:11:55,376 INFO L290 TraceCheckUtils]: 22: Hoare triple {24141#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {24141#true} is VALID [2022-04-07 16:11:55,376 INFO L290 TraceCheckUtils]: 23: Hoare triple {24141#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {24141#true} is VALID [2022-04-07 16:11:55,376 INFO L290 TraceCheckUtils]: 24: Hoare triple {24141#true} assume 8464 == #t~mem50;havoc #t~mem50; {24141#true} is VALID [2022-04-07 16:11:55,376 INFO L290 TraceCheckUtils]: 25: Hoare triple {24141#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; {24141#true} is VALID [2022-04-07 16:11:55,376 INFO L290 TraceCheckUtils]: 26: Hoare triple {24141#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {24141#true} is VALID [2022-04-07 16:11:55,376 INFO L290 TraceCheckUtils]: 27: Hoare triple {24141#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {24141#true} is VALID [2022-04-07 16:11:55,376 INFO L290 TraceCheckUtils]: 28: Hoare triple {24141#true} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {24141#true} is VALID [2022-04-07 16:11:55,376 INFO L290 TraceCheckUtils]: 29: Hoare triple {24141#true} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {24141#true} is VALID [2022-04-07 16:11:55,376 INFO L290 TraceCheckUtils]: 30: Hoare triple {24141#true} ~skip~0 := 0; {24141#true} is VALID [2022-04-07 16:11:55,376 INFO L290 TraceCheckUtils]: 31: Hoare triple {24141#true} assume !false; {24141#true} is VALID [2022-04-07 16:11:55,376 INFO L290 TraceCheckUtils]: 32: Hoare triple {24141#true} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {24141#true} is VALID [2022-04-07 16:11:55,376 INFO L290 TraceCheckUtils]: 33: Hoare triple {24141#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {24141#true} is VALID [2022-04-07 16:11:55,376 INFO L290 TraceCheckUtils]: 34: Hoare triple {24141#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {24141#true} is VALID [2022-04-07 16:11:55,376 INFO L290 TraceCheckUtils]: 35: Hoare triple {24141#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {24141#true} is VALID [2022-04-07 16:11:55,376 INFO L290 TraceCheckUtils]: 36: Hoare triple {24141#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {24141#true} is VALID [2022-04-07 16:11:55,376 INFO L290 TraceCheckUtils]: 37: Hoare triple {24141#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {24141#true} is VALID [2022-04-07 16:11:55,376 INFO L290 TraceCheckUtils]: 38: Hoare triple {24141#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {24141#true} is VALID [2022-04-07 16:11:55,377 INFO L290 TraceCheckUtils]: 39: Hoare triple {24141#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {24141#true} is VALID [2022-04-07 16:11:55,377 INFO L290 TraceCheckUtils]: 40: Hoare triple {24141#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {24141#true} is VALID [2022-04-07 16:11:55,377 INFO L290 TraceCheckUtils]: 41: Hoare triple {24141#true} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {24141#true} is VALID [2022-04-07 16:11:55,377 INFO L290 TraceCheckUtils]: 42: Hoare triple {24141#true} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {24141#true} is VALID [2022-04-07 16:11:55,377 INFO L290 TraceCheckUtils]: 43: Hoare triple {24141#true} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {24141#true} is VALID [2022-04-07 16:11:55,377 INFO L290 TraceCheckUtils]: 44: Hoare triple {24141#true} assume 8496 == #t~mem53;havoc #t~mem53; {24141#true} is VALID [2022-04-07 16:11:55,377 INFO L290 TraceCheckUtils]: 45: Hoare triple {24141#true} assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {24141#true} is VALID [2022-04-07 16:11:55,377 INFO L290 TraceCheckUtils]: 46: Hoare triple {24141#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {24141#true} is VALID [2022-04-07 16:11:55,377 INFO L290 TraceCheckUtils]: 47: Hoare triple {24141#true} assume !(~ret~0 <= 0);call #t~mem91 := read~int(~s.base, 92 + ~s.offset, 4); {24141#true} is VALID [2022-04-07 16:11:55,378 INFO L290 TraceCheckUtils]: 48: Hoare triple {24141#true} assume 0 != #t~mem91;havoc #t~mem91;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:55,378 INFO L290 TraceCheckUtils]: 49: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:55,378 INFO L290 TraceCheckUtils]: 50: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:55,379 INFO L290 TraceCheckUtils]: 51: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:55,379 INFO L290 TraceCheckUtils]: 52: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:55,379 INFO L290 TraceCheckUtils]: 53: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:55,380 INFO L290 TraceCheckUtils]: 54: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:55,380 INFO L290 TraceCheckUtils]: 55: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:55,380 INFO L290 TraceCheckUtils]: 56: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:55,381 INFO L290 TraceCheckUtils]: 57: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:55,381 INFO L290 TraceCheckUtils]: 58: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:55,381 INFO L290 TraceCheckUtils]: 59: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:55,382 INFO L290 TraceCheckUtils]: 60: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:55,382 INFO L290 TraceCheckUtils]: 61: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:55,382 INFO L290 TraceCheckUtils]: 62: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:55,382 INFO L290 TraceCheckUtils]: 63: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:55,383 INFO L290 TraceCheckUtils]: 64: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:55,383 INFO L290 TraceCheckUtils]: 65: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:55,383 INFO L290 TraceCheckUtils]: 66: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:55,384 INFO L290 TraceCheckUtils]: 67: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:55,384 INFO L290 TraceCheckUtils]: 68: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:55,384 INFO L290 TraceCheckUtils]: 69: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:55,385 INFO L290 TraceCheckUtils]: 70: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:55,385 INFO L290 TraceCheckUtils]: 71: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:55,385 INFO L290 TraceCheckUtils]: 72: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:55,386 INFO L290 TraceCheckUtils]: 73: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:55,386 INFO L290 TraceCheckUtils]: 74: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-07 16:11:55,386 INFO L290 TraceCheckUtils]: 75: Hoare triple {24146#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {24147#(not (= 8448 |ssl3_accept_#t~mem63|))} is VALID [2022-04-07 16:11:55,386 INFO L290 TraceCheckUtils]: 76: Hoare triple {24147#(not (= 8448 |ssl3_accept_#t~mem63|))} assume 8448 == #t~mem63;havoc #t~mem63; {24142#false} is VALID [2022-04-07 16:11:55,387 INFO L290 TraceCheckUtils]: 77: Hoare triple {24142#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~num1~0 := #t~nondet130;havoc #t~nondet130; {24142#false} is VALID [2022-04-07 16:11:55,387 INFO L290 TraceCheckUtils]: 78: Hoare triple {24142#false} assume !(~num1~0 > 0); {24142#false} is VALID [2022-04-07 16:11:55,387 INFO L290 TraceCheckUtils]: 79: Hoare triple {24142#false} call #t~mem131.base, #t~mem131.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem132 := read~int(#t~mem131.base, 844 + #t~mem131.offset, 4);call write~int(#t~mem132, ~s.base, 52 + ~s.offset, 4);havoc #t~mem131.base, #t~mem131.offset;havoc #t~mem132; {24142#false} is VALID [2022-04-07 16:11:55,387 INFO L290 TraceCheckUtils]: 80: Hoare triple {24142#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {24142#false} is VALID [2022-04-07 16:11:55,387 INFO L290 TraceCheckUtils]: 81: Hoare triple {24142#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {24142#false} is VALID [2022-04-07 16:11:55,387 INFO L290 TraceCheckUtils]: 82: Hoare triple {24142#false} ~skip~0 := 0; {24142#false} is VALID [2022-04-07 16:11:55,387 INFO L290 TraceCheckUtils]: 83: Hoare triple {24142#false} assume !false; {24142#false} is VALID [2022-04-07 16:11:55,387 INFO L290 TraceCheckUtils]: 84: Hoare triple {24142#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-07 16:11:55,387 INFO L290 TraceCheckUtils]: 85: Hoare triple {24142#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-07 16:11:55,387 INFO L290 TraceCheckUtils]: 86: Hoare triple {24142#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-07 16:11:55,387 INFO L290 TraceCheckUtils]: 87: Hoare triple {24142#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-07 16:11:55,387 INFO L290 TraceCheckUtils]: 88: Hoare triple {24142#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-07 16:11:55,387 INFO L290 TraceCheckUtils]: 89: Hoare triple {24142#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-07 16:11:55,387 INFO L290 TraceCheckUtils]: 90: Hoare triple {24142#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-07 16:11:55,387 INFO L290 TraceCheckUtils]: 91: Hoare triple {24142#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-07 16:11:55,387 INFO L290 TraceCheckUtils]: 92: Hoare triple {24142#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-07 16:11:55,387 INFO L290 TraceCheckUtils]: 93: Hoare triple {24142#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-07 16:11:55,387 INFO L290 TraceCheckUtils]: 94: Hoare triple {24142#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-07 16:11:55,387 INFO L290 TraceCheckUtils]: 95: Hoare triple {24142#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-07 16:11:55,387 INFO L290 TraceCheckUtils]: 96: Hoare triple {24142#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-07 16:11:55,387 INFO L290 TraceCheckUtils]: 97: Hoare triple {24142#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-07 16:11:55,388 INFO L290 TraceCheckUtils]: 98: Hoare triple {24142#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-07 16:11:55,388 INFO L290 TraceCheckUtils]: 99: Hoare triple {24142#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-07 16:11:55,388 INFO L290 TraceCheckUtils]: 100: Hoare triple {24142#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-07 16:11:55,388 INFO L290 TraceCheckUtils]: 101: Hoare triple {24142#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-07 16:11:55,388 INFO L290 TraceCheckUtils]: 102: Hoare triple {24142#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-07 16:11:55,388 INFO L290 TraceCheckUtils]: 103: Hoare triple {24142#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-07 16:11:55,388 INFO L290 TraceCheckUtils]: 104: Hoare triple {24142#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-07 16:11:55,388 INFO L290 TraceCheckUtils]: 105: Hoare triple {24142#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-07 16:11:55,388 INFO L290 TraceCheckUtils]: 106: Hoare triple {24142#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-07 16:11:55,388 INFO L290 TraceCheckUtils]: 107: Hoare triple {24142#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-07 16:11:55,388 INFO L290 TraceCheckUtils]: 108: Hoare triple {24142#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-07 16:11:55,388 INFO L290 TraceCheckUtils]: 109: Hoare triple {24142#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-07 16:11:55,388 INFO L290 TraceCheckUtils]: 110: Hoare triple {24142#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-07 16:11:55,388 INFO L290 TraceCheckUtils]: 111: Hoare triple {24142#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-07 16:11:55,388 INFO L290 TraceCheckUtils]: 112: Hoare triple {24142#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-07 16:11:55,388 INFO L290 TraceCheckUtils]: 113: Hoare triple {24142#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-07 16:11:55,388 INFO L290 TraceCheckUtils]: 114: Hoare triple {24142#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-07 16:11:55,388 INFO L290 TraceCheckUtils]: 115: Hoare triple {24142#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-07 16:11:55,388 INFO L290 TraceCheckUtils]: 116: Hoare triple {24142#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {24142#false} is VALID [2022-04-07 16:11:55,388 INFO L290 TraceCheckUtils]: 117: Hoare triple {24142#false} assume 8672 == #t~mem74;havoc #t~mem74; {24142#false} is VALID [2022-04-07 16:11:55,389 INFO L290 TraceCheckUtils]: 118: Hoare triple {24142#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {24142#false} is VALID [2022-04-07 16:11:55,389 INFO L290 TraceCheckUtils]: 119: Hoare triple {24142#false} assume 4 == ~blastFlag~0; {24142#false} is VALID [2022-04-07 16:11:55,389 INFO L290 TraceCheckUtils]: 120: Hoare triple {24142#false} assume !false; {24142#false} is VALID [2022-04-07 16:11:55,389 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-07 16:11:55,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:11:55,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019164141] [2022-04-07 16:11:55,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019164141] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:11:55,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:11:55,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:11:55,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038601012] [2022-04-07 16:11:55,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:11:55,390 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2022-04-07 16:11:55,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:11:55,390 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:55,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:11:55,466 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:11:55,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:11:55,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:11:55,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:11:55,466 INFO L87 Difference]: Start difference. First operand 282 states and 433 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:57,485 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-07 16:11:58,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:58,489 INFO L93 Difference]: Finished difference Result 656 states and 1011 transitions. [2022-04-07 16:11:58,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:11:58,489 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2022-04-07 16:11:58,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:11:58,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:58,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 564 transitions. [2022-04-07 16:11:58,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:58,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 564 transitions. [2022-04-07 16:11:58,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 564 transitions. [2022-04-07 16:11:58,858 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 564 edges. 564 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:11:58,865 INFO L225 Difference]: With dead ends: 656 [2022-04-07 16:11:58,865 INFO L226 Difference]: Without dead ends: 400 [2022-04-07 16:11:58,865 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-07 16:11:58,866 INFO L913 BasicCegarLoop]: 127 mSDtfsCounter, 117 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 49 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-07 16:11:58,866 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 355 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 467 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-07 16:11:58,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-04-07 16:11:58,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 314. [2022-04-07 16:11:58,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:11:58,886 INFO L82 GeneralOperation]: Start isEquivalent. First operand 400 states. Second operand has 314 states, 309 states have (on average 1.5566343042071198) internal successors, (481), 309 states have internal predecessors, (481), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:58,886 INFO L74 IsIncluded]: Start isIncluded. First operand 400 states. Second operand has 314 states, 309 states have (on average 1.5566343042071198) internal successors, (481), 309 states have internal predecessors, (481), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:58,887 INFO L87 Difference]: Start difference. First operand 400 states. Second operand has 314 states, 309 states have (on average 1.5566343042071198) internal successors, (481), 309 states have internal predecessors, (481), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:58,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:58,893 INFO L93 Difference]: Finished difference Result 400 states and 606 transitions. [2022-04-07 16:11:58,893 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 606 transitions. [2022-04-07 16:11:58,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:58,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:58,894 INFO L74 IsIncluded]: Start isIncluded. First operand has 314 states, 309 states have (on average 1.5566343042071198) internal successors, (481), 309 states have internal predecessors, (481), 3 states have call successors, (3), 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 400 states. [2022-04-07 16:11:58,894 INFO L87 Difference]: Start difference. First operand has 314 states, 309 states have (on average 1.5566343042071198) internal successors, (481), 309 states have internal predecessors, (481), 3 states have call successors, (3), 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 400 states. [2022-04-07 16:11:58,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:11:58,920 INFO L93 Difference]: Finished difference Result 400 states and 606 transitions. [2022-04-07 16:11:58,920 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 606 transitions. [2022-04-07 16:11:58,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:11:58,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:11:58,920 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:11:58,920 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:11:58,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 309 states have (on average 1.5566343042071198) internal successors, (481), 309 states have internal predecessors, (481), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:58,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 485 transitions. [2022-04-07 16:11:58,926 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 485 transitions. Word has length 121 [2022-04-07 16:11:58,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:11:58,926 INFO L478 AbstractCegarLoop]: Abstraction has 314 states and 485 transitions. [2022-04-07 16:11:58,943 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:58,943 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 485 transitions. [2022-04-07 16:11:58,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-07 16:11:58,948 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:11:58,948 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:11:58,948 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-07 16:11:58,948 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:11:58,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:11:58,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1513581320, now seen corresponding path program 1 times [2022-04-07 16:11:58,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:11:58,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830994165] [2022-04-07 16:11:58,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:11:58,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:11:59,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:59,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:11:59,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:11:59,143 INFO L290 TraceCheckUtils]: 0: Hoare triple {26064#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {26057#true} is VALID [2022-04-07 16:11:59,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {26057#true} assume true; {26057#true} is VALID [2022-04-07 16:11:59,143 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26057#true} {26057#true} #664#return; {26057#true} is VALID [2022-04-07 16:11:59,160 INFO L272 TraceCheckUtils]: 0: Hoare triple {26057#true} call ULTIMATE.init(); {26064#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:11:59,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {26064#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {26057#true} is VALID [2022-04-07 16:11:59,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {26057#true} assume true; {26057#true} is VALID [2022-04-07 16:11:59,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26057#true} {26057#true} #664#return; {26057#true} is VALID [2022-04-07 16:11:59,160 INFO L272 TraceCheckUtils]: 4: Hoare triple {26057#true} call #t~ret162 := main(); {26057#true} is VALID [2022-04-07 16:11:59,160 INFO L290 TraceCheckUtils]: 5: Hoare triple {26057#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 52 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {26057#true} is VALID [2022-04-07 16:11:59,160 INFO L290 TraceCheckUtils]: 6: Hoare triple {26057#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {26057#true} is VALID [2022-04-07 16:11:59,160 INFO L272 TraceCheckUtils]: 7: Hoare triple {26057#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {26057#true} is VALID [2022-04-07 16:11:59,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {26057#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {26057#true} is VALID [2022-04-07 16:11:59,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {26057#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {26057#true} is VALID [2022-04-07 16:11:59,160 INFO L290 TraceCheckUtils]: 10: Hoare triple {26057#true} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {26057#true} is VALID [2022-04-07 16:11:59,160 INFO L290 TraceCheckUtils]: 11: Hoare triple {26057#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {26057#true} is VALID [2022-04-07 16:11:59,160 INFO L290 TraceCheckUtils]: 12: Hoare triple {26057#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {26057#true} is VALID [2022-04-07 16:11:59,160 INFO L290 TraceCheckUtils]: 13: Hoare triple {26057#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {26057#true} is VALID [2022-04-07 16:11:59,161 INFO L290 TraceCheckUtils]: 14: Hoare triple {26057#true} assume !false; {26057#true} is VALID [2022-04-07 16:11:59,161 INFO L290 TraceCheckUtils]: 15: Hoare triple {26057#true} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {26057#true} is VALID [2022-04-07 16:11:59,161 INFO L290 TraceCheckUtils]: 16: Hoare triple {26057#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {26057#true} is VALID [2022-04-07 16:11:59,161 INFO L290 TraceCheckUtils]: 17: Hoare triple {26057#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {26057#true} is VALID [2022-04-07 16:11:59,161 INFO L290 TraceCheckUtils]: 18: Hoare triple {26057#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {26057#true} is VALID [2022-04-07 16:11:59,161 INFO L290 TraceCheckUtils]: 19: Hoare triple {26057#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {26057#true} is VALID [2022-04-07 16:11:59,161 INFO L290 TraceCheckUtils]: 20: Hoare triple {26057#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {26057#true} is VALID [2022-04-07 16:11:59,161 INFO L290 TraceCheckUtils]: 21: Hoare triple {26057#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {26057#true} is VALID [2022-04-07 16:11:59,161 INFO L290 TraceCheckUtils]: 22: Hoare triple {26057#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26057#true} is VALID [2022-04-07 16:11:59,161 INFO L290 TraceCheckUtils]: 23: Hoare triple {26057#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26057#true} is VALID [2022-04-07 16:11:59,161 INFO L290 TraceCheckUtils]: 24: Hoare triple {26057#true} assume 8464 == #t~mem50;havoc #t~mem50; {26057#true} is VALID [2022-04-07 16:11:59,161 INFO L290 TraceCheckUtils]: 25: Hoare triple {26057#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; {26057#true} is VALID [2022-04-07 16:11:59,161 INFO L290 TraceCheckUtils]: 26: Hoare triple {26057#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {26057#true} is VALID [2022-04-07 16:11:59,162 INFO L290 TraceCheckUtils]: 27: Hoare triple {26057#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {26062#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:59,162 INFO L290 TraceCheckUtils]: 28: Hoare triple {26062#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {26062#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:59,163 INFO L290 TraceCheckUtils]: 29: Hoare triple {26062#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {26062#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:59,163 INFO L290 TraceCheckUtils]: 30: Hoare triple {26062#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {26062#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:59,163 INFO L290 TraceCheckUtils]: 31: Hoare triple {26062#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {26062#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-07 16:11:59,164 INFO L290 TraceCheckUtils]: 32: Hoare triple {26062#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {26063#(= |ssl3_accept_#t~mem42| 8496)} is VALID [2022-04-07 16:11:59,164 INFO L290 TraceCheckUtils]: 33: Hoare triple {26063#(= |ssl3_accept_#t~mem42| 8496)} assume 12292 == #t~mem42;havoc #t~mem42; {26058#false} is VALID [2022-04-07 16:11:59,164 INFO L290 TraceCheckUtils]: 34: Hoare triple {26058#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,164 INFO L290 TraceCheckUtils]: 35: Hoare triple {26058#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,164 INFO L290 TraceCheckUtils]: 36: Hoare triple {26058#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {26058#false} is VALID [2022-04-07 16:11:59,164 INFO L290 TraceCheckUtils]: 37: Hoare triple {26058#false} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,164 INFO L290 TraceCheckUtils]: 38: Hoare triple {26058#false} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,164 INFO L290 TraceCheckUtils]: 39: Hoare triple {26058#false} assume !(0 == (#t~mem78.base + #t~mem78.offset) % 4294967296);havoc #t~mem78.base, #t~mem78.offset; {26058#false} is VALID [2022-04-07 16:11:59,164 INFO L290 TraceCheckUtils]: 40: Hoare triple {26058#false} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {26058#false} is VALID [2022-04-07 16:11:59,164 INFO L290 TraceCheckUtils]: 41: Hoare triple {26058#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,164 INFO L290 TraceCheckUtils]: 42: Hoare triple {26058#false} assume !(12292 != #t~mem81);havoc #t~mem81;call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem86 := read~int(#t~mem85.base, 76 + #t~mem85.offset, 4);call write~int(1 + #t~mem86, #t~mem85.base, 76 + #t~mem85.offset, 4);havoc #t~mem85.base, #t~mem85.offset;havoc #t~mem86;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,164 INFO L290 TraceCheckUtils]: 43: Hoare triple {26058#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,164 INFO L290 TraceCheckUtils]: 44: Hoare triple {26058#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {26058#false} is VALID [2022-04-07 16:11:59,164 INFO L290 TraceCheckUtils]: 45: Hoare triple {26058#false} ~skip~0 := 0; {26058#false} is VALID [2022-04-07 16:11:59,164 INFO L290 TraceCheckUtils]: 46: Hoare triple {26058#false} assume !false; {26058#false} is VALID [2022-04-07 16:11:59,165 INFO L290 TraceCheckUtils]: 47: Hoare triple {26058#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,165 INFO L290 TraceCheckUtils]: 48: Hoare triple {26058#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,165 INFO L290 TraceCheckUtils]: 49: Hoare triple {26058#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,165 INFO L290 TraceCheckUtils]: 50: Hoare triple {26058#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,165 INFO L290 TraceCheckUtils]: 51: Hoare triple {26058#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,165 INFO L290 TraceCheckUtils]: 52: Hoare triple {26058#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,165 INFO L290 TraceCheckUtils]: 53: Hoare triple {26058#false} assume 8480 == #t~mem47;havoc #t~mem47; {26058#false} is VALID [2022-04-07 16:11:59,165 INFO L290 TraceCheckUtils]: 54: Hoare triple {26058#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet87 && #t~nondet87 <= 2147483647;~ret~0 := #t~nondet87;havoc #t~nondet87; {26058#false} is VALID [2022-04-07 16:11:59,165 INFO L290 TraceCheckUtils]: 55: Hoare triple {26058#false} assume !(~ret~0 <= 0);call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem88.base, 844 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,165 INFO L290 TraceCheckUtils]: 56: Hoare triple {26058#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,165 INFO L290 TraceCheckUtils]: 57: Hoare triple {26058#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {26058#false} is VALID [2022-04-07 16:11:59,165 INFO L290 TraceCheckUtils]: 58: Hoare triple {26058#false} ~skip~0 := 0; {26058#false} is VALID [2022-04-07 16:11:59,165 INFO L290 TraceCheckUtils]: 59: Hoare triple {26058#false} assume !false; {26058#false} is VALID [2022-04-07 16:11:59,165 INFO L290 TraceCheckUtils]: 60: Hoare triple {26058#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,165 INFO L290 TraceCheckUtils]: 61: Hoare triple {26058#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,165 INFO L290 TraceCheckUtils]: 62: Hoare triple {26058#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,165 INFO L290 TraceCheckUtils]: 63: Hoare triple {26058#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,165 INFO L290 TraceCheckUtils]: 64: Hoare triple {26058#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,165 INFO L290 TraceCheckUtils]: 65: Hoare triple {26058#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,165 INFO L290 TraceCheckUtils]: 66: Hoare triple {26058#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,165 INFO L290 TraceCheckUtils]: 67: Hoare triple {26058#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,166 INFO L290 TraceCheckUtils]: 68: Hoare triple {26058#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,166 INFO L290 TraceCheckUtils]: 69: Hoare triple {26058#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,166 INFO L290 TraceCheckUtils]: 70: Hoare triple {26058#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,166 INFO L290 TraceCheckUtils]: 71: Hoare triple {26058#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,166 INFO L290 TraceCheckUtils]: 72: Hoare triple {26058#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,166 INFO L290 TraceCheckUtils]: 73: Hoare triple {26058#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,166 INFO L290 TraceCheckUtils]: 74: Hoare triple {26058#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,166 INFO L290 TraceCheckUtils]: 75: Hoare triple {26058#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,166 INFO L290 TraceCheckUtils]: 76: Hoare triple {26058#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,166 INFO L290 TraceCheckUtils]: 77: Hoare triple {26058#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,166 INFO L290 TraceCheckUtils]: 78: Hoare triple {26058#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,166 INFO L290 TraceCheckUtils]: 79: Hoare triple {26058#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,166 INFO L290 TraceCheckUtils]: 80: Hoare triple {26058#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,166 INFO L290 TraceCheckUtils]: 81: Hoare triple {26058#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,166 INFO L290 TraceCheckUtils]: 82: Hoare triple {26058#false} assume 8448 == #t~mem63;havoc #t~mem63; {26058#false} is VALID [2022-04-07 16:11:59,166 INFO L290 TraceCheckUtils]: 83: Hoare triple {26058#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~num1~0 := #t~nondet130;havoc #t~nondet130; {26058#false} is VALID [2022-04-07 16:11:59,166 INFO L290 TraceCheckUtils]: 84: Hoare triple {26058#false} assume !(~num1~0 > 0); {26058#false} is VALID [2022-04-07 16:11:59,166 INFO L290 TraceCheckUtils]: 85: Hoare triple {26058#false} call #t~mem131.base, #t~mem131.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem132 := read~int(#t~mem131.base, 844 + #t~mem131.offset, 4);call write~int(#t~mem132, ~s.base, 52 + ~s.offset, 4);havoc #t~mem131.base, #t~mem131.offset;havoc #t~mem132; {26058#false} is VALID [2022-04-07 16:11:59,166 INFO L290 TraceCheckUtils]: 86: Hoare triple {26058#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,166 INFO L290 TraceCheckUtils]: 87: Hoare triple {26058#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {26058#false} is VALID [2022-04-07 16:11:59,166 INFO L290 TraceCheckUtils]: 88: Hoare triple {26058#false} ~skip~0 := 0; {26058#false} is VALID [2022-04-07 16:11:59,167 INFO L290 TraceCheckUtils]: 89: Hoare triple {26058#false} assume !false; {26058#false} is VALID [2022-04-07 16:11:59,167 INFO L290 TraceCheckUtils]: 90: Hoare triple {26058#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,167 INFO L290 TraceCheckUtils]: 91: Hoare triple {26058#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,167 INFO L290 TraceCheckUtils]: 92: Hoare triple {26058#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,167 INFO L290 TraceCheckUtils]: 93: Hoare triple {26058#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,167 INFO L290 TraceCheckUtils]: 94: Hoare triple {26058#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,167 INFO L290 TraceCheckUtils]: 95: Hoare triple {26058#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,167 INFO L290 TraceCheckUtils]: 96: Hoare triple {26058#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,167 INFO L290 TraceCheckUtils]: 97: Hoare triple {26058#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,167 INFO L290 TraceCheckUtils]: 98: Hoare triple {26058#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,167 INFO L290 TraceCheckUtils]: 99: Hoare triple {26058#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,167 INFO L290 TraceCheckUtils]: 100: Hoare triple {26058#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,167 INFO L290 TraceCheckUtils]: 101: Hoare triple {26058#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,167 INFO L290 TraceCheckUtils]: 102: Hoare triple {26058#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,167 INFO L290 TraceCheckUtils]: 103: Hoare triple {26058#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,167 INFO L290 TraceCheckUtils]: 104: Hoare triple {26058#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,167 INFO L290 TraceCheckUtils]: 105: Hoare triple {26058#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,167 INFO L290 TraceCheckUtils]: 106: Hoare triple {26058#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,167 INFO L290 TraceCheckUtils]: 107: Hoare triple {26058#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,167 INFO L290 TraceCheckUtils]: 108: Hoare triple {26058#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,167 INFO L290 TraceCheckUtils]: 109: Hoare triple {26058#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,168 INFO L290 TraceCheckUtils]: 110: Hoare triple {26058#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,168 INFO L290 TraceCheckUtils]: 111: Hoare triple {26058#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,168 INFO L290 TraceCheckUtils]: 112: Hoare triple {26058#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,168 INFO L290 TraceCheckUtils]: 113: Hoare triple {26058#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,168 INFO L290 TraceCheckUtils]: 114: Hoare triple {26058#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,168 INFO L290 TraceCheckUtils]: 115: Hoare triple {26058#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,168 INFO L290 TraceCheckUtils]: 116: Hoare triple {26058#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,168 INFO L290 TraceCheckUtils]: 117: Hoare triple {26058#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,168 INFO L290 TraceCheckUtils]: 118: Hoare triple {26058#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,168 INFO L290 TraceCheckUtils]: 119: Hoare triple {26058#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,168 INFO L290 TraceCheckUtils]: 120: Hoare triple {26058#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,168 INFO L290 TraceCheckUtils]: 121: Hoare triple {26058#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,168 INFO L290 TraceCheckUtils]: 122: Hoare triple {26058#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {26058#false} is VALID [2022-04-07 16:11:59,168 INFO L290 TraceCheckUtils]: 123: Hoare triple {26058#false} assume 8672 == #t~mem74;havoc #t~mem74; {26058#false} is VALID [2022-04-07 16:11:59,168 INFO L290 TraceCheckUtils]: 124: Hoare triple {26058#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {26058#false} is VALID [2022-04-07 16:11:59,168 INFO L290 TraceCheckUtils]: 125: Hoare triple {26058#false} assume 4 == ~blastFlag~0; {26058#false} is VALID [2022-04-07 16:11:59,168 INFO L290 TraceCheckUtils]: 126: Hoare triple {26058#false} assume !false; {26058#false} is VALID [2022-04-07 16:11:59,169 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-04-07 16:11:59,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:11:59,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830994165] [2022-04-07 16:11:59,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830994165] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:11:59,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:11:59,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:11:59,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313790246] [2022-04-07 16:11:59,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:11:59,169 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 127 [2022-04-07 16:11:59,170 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:11:59,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:11:59,259 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:11:59,260 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:11:59,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:11:59,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:11:59,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:11:59,262 INFO L87 Difference]: Start difference. First operand 314 states and 485 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:01,286 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-07 16:12:02,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:12:02,192 INFO L93 Difference]: Finished difference Result 609 states and 950 transitions. [2022-04-07 16:12:02,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:12:02,192 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 127 [2022-04-07 16:12:02,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:12:02,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:02,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 438 transitions. [2022-04-07 16:12:02,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:02,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 438 transitions. [2022-04-07 16:12:02,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 438 transitions. [2022-04-07 16:12:02,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 438 edges. 438 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:12:02,451 INFO L225 Difference]: With dead ends: 609 [2022-04-07 16:12:02,451 INFO L226 Difference]: Without dead ends: 321 [2022-04-07 16:12:02,453 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-07 16:12:02,454 INFO L913 BasicCegarLoop]: 199 mSDtfsCounter, 30 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-07 16:12:02,454 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 504 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 364 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-07 16:12:02,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-04-07 16:12:02,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 314. [2022-04-07 16:12:02,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:12:02,463 INFO L82 GeneralOperation]: Start isEquivalent. First operand 321 states. Second operand has 314 states, 309 states have (on average 1.5533980582524272) internal successors, (480), 309 states have internal predecessors, (480), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:02,464 INFO L74 IsIncluded]: Start isIncluded. First operand 321 states. Second operand has 314 states, 309 states have (on average 1.5533980582524272) internal successors, (480), 309 states have internal predecessors, (480), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:02,464 INFO L87 Difference]: Start difference. First operand 321 states. Second operand has 314 states, 309 states have (on average 1.5533980582524272) internal successors, (480), 309 states have internal predecessors, (480), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:02,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:12:02,468 INFO L93 Difference]: Finished difference Result 321 states and 494 transitions. [2022-04-07 16:12:02,468 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 494 transitions. [2022-04-07 16:12:02,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:12:02,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:12:02,469 INFO L74 IsIncluded]: Start isIncluded. First operand has 314 states, 309 states have (on average 1.5533980582524272) internal successors, (480), 309 states have internal predecessors, (480), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 321 states. [2022-04-07 16:12:02,469 INFO L87 Difference]: Start difference. First operand has 314 states, 309 states have (on average 1.5533980582524272) internal successors, (480), 309 states have internal predecessors, (480), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 321 states. [2022-04-07 16:12:02,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:12:02,473 INFO L93 Difference]: Finished difference Result 321 states and 494 transitions. [2022-04-07 16:12:02,473 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 494 transitions. [2022-04-07 16:12:02,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:12:02,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:12:02,474 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:12:02,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:12:02,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 309 states have (on average 1.5533980582524272) internal successors, (480), 309 states have internal predecessors, (480), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:02,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 484 transitions. [2022-04-07 16:12:02,480 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 484 transitions. Word has length 127 [2022-04-07 16:12:02,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:12:02,480 INFO L478 AbstractCegarLoop]: Abstraction has 314 states and 484 transitions. [2022-04-07 16:12:02,480 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:02,480 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 484 transitions. [2022-04-07 16:12:02,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-07 16:12:02,481 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:12:02,481 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:12:02,481 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-07 16:12:02,481 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:12:02,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:12:02,481 INFO L85 PathProgramCache]: Analyzing trace with hash 773095969, now seen corresponding path program 1 times [2022-04-07 16:12:02,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:12:02,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696715432] [2022-04-07 16:12:02,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:12:02,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:12:02,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:12:02,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:12:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:12:02,590 INFO L290 TraceCheckUtils]: 0: Hoare triple {27758#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {27752#true} is VALID [2022-04-07 16:12:02,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {27752#true} assume true; {27752#true} is VALID [2022-04-07 16:12:02,590 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27752#true} {27752#true} #664#return; {27752#true} is VALID [2022-04-07 16:12:02,591 INFO L272 TraceCheckUtils]: 0: Hoare triple {27752#true} call ULTIMATE.init(); {27758#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:12:02,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {27758#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {27752#true} is VALID [2022-04-07 16:12:02,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {27752#true} assume true; {27752#true} is VALID [2022-04-07 16:12:02,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27752#true} {27752#true} #664#return; {27752#true} is VALID [2022-04-07 16:12:02,591 INFO L272 TraceCheckUtils]: 4: Hoare triple {27752#true} call #t~ret162 := main(); {27752#true} is VALID [2022-04-07 16:12:02,591 INFO L290 TraceCheckUtils]: 5: Hoare triple {27752#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 52 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {27752#true} is VALID [2022-04-07 16:12:02,591 INFO L290 TraceCheckUtils]: 6: Hoare triple {27752#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,591 INFO L272 TraceCheckUtils]: 7: Hoare triple {27752#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {27752#true} is VALID [2022-04-07 16:12:02,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {27752#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,592 INFO L290 TraceCheckUtils]: 9: Hoare triple {27752#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {27752#true} is VALID [2022-04-07 16:12:02,592 INFO L290 TraceCheckUtils]: 10: Hoare triple {27752#true} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {27752#true} is VALID [2022-04-07 16:12:02,592 INFO L290 TraceCheckUtils]: 11: Hoare triple {27752#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {27752#true} is VALID [2022-04-07 16:12:02,592 INFO L290 TraceCheckUtils]: 12: Hoare triple {27752#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,592 INFO L290 TraceCheckUtils]: 13: Hoare triple {27752#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {27752#true} is VALID [2022-04-07 16:12:02,592 INFO L290 TraceCheckUtils]: 14: Hoare triple {27752#true} assume !false; {27752#true} is VALID [2022-04-07 16:12:02,592 INFO L290 TraceCheckUtils]: 15: Hoare triple {27752#true} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,592 INFO L290 TraceCheckUtils]: 16: Hoare triple {27752#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,592 INFO L290 TraceCheckUtils]: 17: Hoare triple {27752#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,592 INFO L290 TraceCheckUtils]: 18: Hoare triple {27752#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,592 INFO L290 TraceCheckUtils]: 19: Hoare triple {27752#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,592 INFO L290 TraceCheckUtils]: 20: Hoare triple {27752#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,592 INFO L290 TraceCheckUtils]: 21: Hoare triple {27752#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,592 INFO L290 TraceCheckUtils]: 22: Hoare triple {27752#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,592 INFO L290 TraceCheckUtils]: 23: Hoare triple {27752#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,592 INFO L290 TraceCheckUtils]: 24: Hoare triple {27752#true} assume 8464 == #t~mem50;havoc #t~mem50; {27752#true} is VALID [2022-04-07 16:12:02,592 INFO L290 TraceCheckUtils]: 25: Hoare triple {27752#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; {27752#true} is VALID [2022-04-07 16:12:02,592 INFO L290 TraceCheckUtils]: 26: Hoare triple {27752#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {27752#true} is VALID [2022-04-07 16:12:02,592 INFO L290 TraceCheckUtils]: 27: Hoare triple {27752#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,592 INFO L290 TraceCheckUtils]: 28: Hoare triple {27752#true} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,592 INFO L290 TraceCheckUtils]: 29: Hoare triple {27752#true} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {27752#true} is VALID [2022-04-07 16:12:02,593 INFO L290 TraceCheckUtils]: 30: Hoare triple {27752#true} ~skip~0 := 0; {27752#true} is VALID [2022-04-07 16:12:02,593 INFO L290 TraceCheckUtils]: 31: Hoare triple {27752#true} assume !false; {27752#true} is VALID [2022-04-07 16:12:02,593 INFO L290 TraceCheckUtils]: 32: Hoare triple {27752#true} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,593 INFO L290 TraceCheckUtils]: 33: Hoare triple {27752#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,593 INFO L290 TraceCheckUtils]: 34: Hoare triple {27752#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,593 INFO L290 TraceCheckUtils]: 35: Hoare triple {27752#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,593 INFO L290 TraceCheckUtils]: 36: Hoare triple {27752#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,593 INFO L290 TraceCheckUtils]: 37: Hoare triple {27752#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,593 INFO L290 TraceCheckUtils]: 38: Hoare triple {27752#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,593 INFO L290 TraceCheckUtils]: 39: Hoare triple {27752#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,593 INFO L290 TraceCheckUtils]: 40: Hoare triple {27752#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,593 INFO L290 TraceCheckUtils]: 41: Hoare triple {27752#true} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,593 INFO L290 TraceCheckUtils]: 42: Hoare triple {27752#true} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,593 INFO L290 TraceCheckUtils]: 43: Hoare triple {27752#true} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,593 INFO L290 TraceCheckUtils]: 44: Hoare triple {27752#true} assume 8496 == #t~mem53;havoc #t~mem53; {27752#true} is VALID [2022-04-07 16:12:02,593 INFO L290 TraceCheckUtils]: 45: Hoare triple {27752#true} assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {27752#true} is VALID [2022-04-07 16:12:02,593 INFO L290 TraceCheckUtils]: 46: Hoare triple {27752#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {27752#true} is VALID [2022-04-07 16:12:02,593 INFO L290 TraceCheckUtils]: 47: Hoare triple {27752#true} assume !(~ret~0 <= 0);call #t~mem91 := read~int(~s.base, 92 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,593 INFO L290 TraceCheckUtils]: 48: Hoare triple {27752#true} assume 0 != #t~mem91;havoc #t~mem91;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,593 INFO L290 TraceCheckUtils]: 49: Hoare triple {27752#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,593 INFO L290 TraceCheckUtils]: 50: Hoare triple {27752#true} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,594 INFO L290 TraceCheckUtils]: 51: Hoare triple {27752#true} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {27752#true} is VALID [2022-04-07 16:12:02,594 INFO L290 TraceCheckUtils]: 52: Hoare triple {27752#true} ~skip~0 := 0; {27752#true} is VALID [2022-04-07 16:12:02,594 INFO L290 TraceCheckUtils]: 53: Hoare triple {27752#true} assume !false; {27752#true} is VALID [2022-04-07 16:12:02,594 INFO L290 TraceCheckUtils]: 54: Hoare triple {27752#true} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,594 INFO L290 TraceCheckUtils]: 55: Hoare triple {27752#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,594 INFO L290 TraceCheckUtils]: 56: Hoare triple {27752#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,594 INFO L290 TraceCheckUtils]: 57: Hoare triple {27752#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,594 INFO L290 TraceCheckUtils]: 58: Hoare triple {27752#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,594 INFO L290 TraceCheckUtils]: 59: Hoare triple {27752#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,594 INFO L290 TraceCheckUtils]: 60: Hoare triple {27752#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,594 INFO L290 TraceCheckUtils]: 61: Hoare triple {27752#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,594 INFO L290 TraceCheckUtils]: 62: Hoare triple {27752#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,594 INFO L290 TraceCheckUtils]: 63: Hoare triple {27752#true} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,594 INFO L290 TraceCheckUtils]: 64: Hoare triple {27752#true} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,594 INFO L290 TraceCheckUtils]: 65: Hoare triple {27752#true} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,594 INFO L290 TraceCheckUtils]: 66: Hoare triple {27752#true} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,594 INFO L290 TraceCheckUtils]: 67: Hoare triple {27752#true} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,594 INFO L290 TraceCheckUtils]: 68: Hoare triple {27752#true} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,594 INFO L290 TraceCheckUtils]: 69: Hoare triple {27752#true} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,594 INFO L290 TraceCheckUtils]: 70: Hoare triple {27752#true} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,594 INFO L290 TraceCheckUtils]: 71: Hoare triple {27752#true} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,595 INFO L290 TraceCheckUtils]: 72: Hoare triple {27752#true} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,595 INFO L290 TraceCheckUtils]: 73: Hoare triple {27752#true} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,595 INFO L290 TraceCheckUtils]: 74: Hoare triple {27752#true} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,595 INFO L290 TraceCheckUtils]: 75: Hoare triple {27752#true} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,595 INFO L290 TraceCheckUtils]: 76: Hoare triple {27752#true} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,595 INFO L290 TraceCheckUtils]: 77: Hoare triple {27752#true} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,595 INFO L290 TraceCheckUtils]: 78: Hoare triple {27752#true} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,595 INFO L290 TraceCheckUtils]: 79: Hoare triple {27752#true} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,595 INFO L290 TraceCheckUtils]: 80: Hoare triple {27752#true} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,595 INFO L290 TraceCheckUtils]: 81: Hoare triple {27752#true} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,595 INFO L290 TraceCheckUtils]: 82: Hoare triple {27752#true} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,595 INFO L290 TraceCheckUtils]: 83: Hoare triple {27752#true} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,595 INFO L290 TraceCheckUtils]: 84: Hoare triple {27752#true} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {27752#true} is VALID [2022-04-07 16:12:02,595 INFO L290 TraceCheckUtils]: 85: Hoare triple {27752#true} assume 8656 == #t~mem72;havoc #t~mem72; {27752#true} is VALID [2022-04-07 16:12:02,595 INFO L290 TraceCheckUtils]: 86: Hoare triple {27752#true} call #t~mem139.base, #t~mem139.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(#t~mem140.base, 836 + #t~mem140.offset, 4);call write~$Pointer$(#t~mem141.base, #t~mem141.offset, #t~mem139.base, 172 + #t~mem139.offset, 4);havoc #t~mem139.base, #t~mem139.offset;havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;assume -2147483648 <= #t~nondet142 && #t~nondet142 <= 2147483647;~tmp___9~0 := #t~nondet142;havoc #t~nondet142; {27752#true} is VALID [2022-04-07 16:12:02,595 INFO L290 TraceCheckUtils]: 87: Hoare triple {27752#true} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {27752#true} is VALID [2022-04-07 16:12:02,596 INFO L290 TraceCheckUtils]: 88: Hoare triple {27752#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 5; {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:02,596 INFO L290 TraceCheckUtils]: 89: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~tmp___10~0 := #t~nondet144;havoc #t~nondet144; {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:02,596 INFO L290 TraceCheckUtils]: 90: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(0 == ~tmp___10~0); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:02,597 INFO L290 TraceCheckUtils]: 91: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:02,597 INFO L290 TraceCheckUtils]: 92: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:02,597 INFO L290 TraceCheckUtils]: 93: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:02,597 INFO L290 TraceCheckUtils]: 94: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !false; {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:02,597 INFO L290 TraceCheckUtils]: 95: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:02,598 INFO L290 TraceCheckUtils]: 96: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:02,598 INFO L290 TraceCheckUtils]: 97: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:02,598 INFO L290 TraceCheckUtils]: 98: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:02,598 INFO L290 TraceCheckUtils]: 99: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:02,599 INFO L290 TraceCheckUtils]: 100: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:02,599 INFO L290 TraceCheckUtils]: 101: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:02,599 INFO L290 TraceCheckUtils]: 102: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:02,599 INFO L290 TraceCheckUtils]: 103: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:02,600 INFO L290 TraceCheckUtils]: 104: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:02,600 INFO L290 TraceCheckUtils]: 105: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:02,600 INFO L290 TraceCheckUtils]: 106: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:02,600 INFO L290 TraceCheckUtils]: 107: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:02,601 INFO L290 TraceCheckUtils]: 108: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:02,601 INFO L290 TraceCheckUtils]: 109: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:02,601 INFO L290 TraceCheckUtils]: 110: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:02,601 INFO L290 TraceCheckUtils]: 111: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:02,602 INFO L290 TraceCheckUtils]: 112: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:02,602 INFO L290 TraceCheckUtils]: 113: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:02,602 INFO L290 TraceCheckUtils]: 114: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:02,602 INFO L290 TraceCheckUtils]: 115: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:02,603 INFO L290 TraceCheckUtils]: 116: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:02,603 INFO L290 TraceCheckUtils]: 117: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:02,603 INFO L290 TraceCheckUtils]: 118: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:02,603 INFO L290 TraceCheckUtils]: 119: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:02,604 INFO L290 TraceCheckUtils]: 120: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:02,604 INFO L290 TraceCheckUtils]: 121: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:02,604 INFO L290 TraceCheckUtils]: 122: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:02,604 INFO L290 TraceCheckUtils]: 123: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:02,605 INFO L290 TraceCheckUtils]: 124: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:02,605 INFO L290 TraceCheckUtils]: 125: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:02,605 INFO L290 TraceCheckUtils]: 126: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:02,605 INFO L290 TraceCheckUtils]: 127: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:02,606 INFO L290 TraceCheckUtils]: 128: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume 8672 == #t~mem74;havoc #t~mem74; {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:02,606 INFO L290 TraceCheckUtils]: 129: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {27757#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:02,606 INFO L290 TraceCheckUtils]: 130: Hoare triple {27757#(<= 5 ssl3_accept_~blastFlag~0)} assume 4 == ~blastFlag~0; {27753#false} is VALID [2022-04-07 16:12:02,606 INFO L290 TraceCheckUtils]: 131: Hoare triple {27753#false} assume !false; {27753#false} is VALID [2022-04-07 16:12:02,607 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-07 16:12:02,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:12:02,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696715432] [2022-04-07 16:12:02,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696715432] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:12:02,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:12:02,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 16:12:02,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454839172] [2022-04-07 16:12:02,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:12:02,608 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 132 [2022-04-07 16:12:02,608 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:12:02,608 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:02,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:12:02,699 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 16:12:02,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:12:02,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 16:12:02,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 16:12:02,699 INFO L87 Difference]: Start difference. First operand 314 states and 484 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:04,715 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-07 16:12:05,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:12:05,706 INFO L93 Difference]: Finished difference Result 890 states and 1392 transitions. [2022-04-07 16:12:05,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 16:12:05,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 132 [2022-04-07 16:12:05,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:12:05,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:05,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 586 transitions. [2022-04-07 16:12:05,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:05,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 586 transitions. [2022-04-07 16:12:05,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 586 transitions. [2022-04-07 16:12:06,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 586 edges. 586 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:12:06,033 INFO L225 Difference]: With dead ends: 890 [2022-04-07 16:12:06,033 INFO L226 Difference]: Without dead ends: 602 [2022-04-07 16:12:06,034 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-07 16:12:06,034 INFO L913 BasicCegarLoop]: 370 mSDtfsCounter, 143 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-07 16:12:06,035 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 565 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 395 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-07 16:12:06,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2022-04-07 16:12:06,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2022-04-07 16:12:06,071 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:12:06,072 INFO L82 GeneralOperation]: Start isEquivalent. First operand 602 states. Second operand has 600 states, 595 states have (on average 1.5596638655462185) internal successors, (928), 595 states have internal predecessors, (928), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:06,072 INFO L74 IsIncluded]: Start isIncluded. First operand 602 states. Second operand has 600 states, 595 states have (on average 1.5596638655462185) internal successors, (928), 595 states have internal predecessors, (928), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:06,073 INFO L87 Difference]: Start difference. First operand 602 states. Second operand has 600 states, 595 states have (on average 1.5596638655462185) internal successors, (928), 595 states have internal predecessors, (928), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:06,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:12:06,084 INFO L93 Difference]: Finished difference Result 602 states and 933 transitions. [2022-04-07 16:12:06,084 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 933 transitions. [2022-04-07 16:12:06,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:12:06,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:12:06,086 INFO L74 IsIncluded]: Start isIncluded. First operand has 600 states, 595 states have (on average 1.5596638655462185) internal successors, (928), 595 states have internal predecessors, (928), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 602 states. [2022-04-07 16:12:06,086 INFO L87 Difference]: Start difference. First operand has 600 states, 595 states have (on average 1.5596638655462185) internal successors, (928), 595 states have internal predecessors, (928), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 602 states. [2022-04-07 16:12:06,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:12:06,097 INFO L93 Difference]: Finished difference Result 602 states and 933 transitions. [2022-04-07 16:12:06,097 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 933 transitions. [2022-04-07 16:12:06,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:12:06,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:12:06,098 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:12:06,098 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:12:06,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 595 states have (on average 1.5596638655462185) internal successors, (928), 595 states have internal predecessors, (928), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:06,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 932 transitions. [2022-04-07 16:12:06,111 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 932 transitions. Word has length 132 [2022-04-07 16:12:06,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:12:06,112 INFO L478 AbstractCegarLoop]: Abstraction has 600 states and 932 transitions. [2022-04-07 16:12:06,112 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:06,112 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 932 transitions. [2022-04-07 16:12:06,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-07 16:12:06,113 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:12:06,113 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:12:06,113 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-07 16:12:06,113 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:12:06,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:12:06,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1276291873, now seen corresponding path program 1 times [2022-04-07 16:12:06,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:12:06,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251334349] [2022-04-07 16:12:06,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:12:06,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:12:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:12:06,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:12:06,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:12:06,248 INFO L290 TraceCheckUtils]: 0: Hoare triple {30644#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {30638#true} is VALID [2022-04-07 16:12:06,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {30638#true} assume true; {30638#true} is VALID [2022-04-07 16:12:06,249 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30638#true} {30638#true} #664#return; {30638#true} is VALID [2022-04-07 16:12:06,249 INFO L272 TraceCheckUtils]: 0: Hoare triple {30638#true} call ULTIMATE.init(); {30644#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:12:06,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {30644#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {30638#true} is VALID [2022-04-07 16:12:06,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {30638#true} assume true; {30638#true} is VALID [2022-04-07 16:12:06,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30638#true} {30638#true} #664#return; {30638#true} is VALID [2022-04-07 16:12:06,249 INFO L272 TraceCheckUtils]: 4: Hoare triple {30638#true} call #t~ret162 := main(); {30638#true} is VALID [2022-04-07 16:12:06,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {30638#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 52 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {30638#true} is VALID [2022-04-07 16:12:06,250 INFO L290 TraceCheckUtils]: 6: Hoare triple {30638#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {30638#true} is VALID [2022-04-07 16:12:06,250 INFO L272 TraceCheckUtils]: 7: Hoare triple {30638#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {30638#true} is VALID [2022-04-07 16:12:06,250 INFO L290 TraceCheckUtils]: 8: Hoare triple {30638#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {30638#true} is VALID [2022-04-07 16:12:06,250 INFO L290 TraceCheckUtils]: 9: Hoare triple {30638#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {30638#true} is VALID [2022-04-07 16:12:06,250 INFO L290 TraceCheckUtils]: 10: Hoare triple {30638#true} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {30638#true} is VALID [2022-04-07 16:12:06,250 INFO L290 TraceCheckUtils]: 11: Hoare triple {30638#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {30638#true} is VALID [2022-04-07 16:12:06,250 INFO L290 TraceCheckUtils]: 12: Hoare triple {30638#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {30638#true} is VALID [2022-04-07 16:12:06,250 INFO L290 TraceCheckUtils]: 13: Hoare triple {30638#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {30638#true} is VALID [2022-04-07 16:12:06,250 INFO L290 TraceCheckUtils]: 14: Hoare triple {30638#true} assume !false; {30638#true} is VALID [2022-04-07 16:12:06,250 INFO L290 TraceCheckUtils]: 15: Hoare triple {30638#true} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {30638#true} is VALID [2022-04-07 16:12:06,250 INFO L290 TraceCheckUtils]: 16: Hoare triple {30638#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {30638#true} is VALID [2022-04-07 16:12:06,250 INFO L290 TraceCheckUtils]: 17: Hoare triple {30638#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {30638#true} is VALID [2022-04-07 16:12:06,250 INFO L290 TraceCheckUtils]: 18: Hoare triple {30638#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {30638#true} is VALID [2022-04-07 16:12:06,250 INFO L290 TraceCheckUtils]: 19: Hoare triple {30638#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {30638#true} is VALID [2022-04-07 16:12:06,250 INFO L290 TraceCheckUtils]: 20: Hoare triple {30638#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {30638#true} is VALID [2022-04-07 16:12:06,250 INFO L290 TraceCheckUtils]: 21: Hoare triple {30638#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {30638#true} is VALID [2022-04-07 16:12:06,250 INFO L290 TraceCheckUtils]: 22: Hoare triple {30638#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30638#true} is VALID [2022-04-07 16:12:06,250 INFO L290 TraceCheckUtils]: 23: Hoare triple {30638#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30638#true} is VALID [2022-04-07 16:12:06,250 INFO L290 TraceCheckUtils]: 24: Hoare triple {30638#true} assume 8464 == #t~mem50;havoc #t~mem50; {30638#true} is VALID [2022-04-07 16:12:06,250 INFO L290 TraceCheckUtils]: 25: Hoare triple {30638#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; {30638#true} is VALID [2022-04-07 16:12:06,251 INFO L290 TraceCheckUtils]: 26: Hoare triple {30638#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {30638#true} is VALID [2022-04-07 16:12:06,251 INFO L290 TraceCheckUtils]: 27: Hoare triple {30638#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {30638#true} is VALID [2022-04-07 16:12:06,251 INFO L290 TraceCheckUtils]: 28: Hoare triple {30638#true} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {30638#true} is VALID [2022-04-07 16:12:06,251 INFO L290 TraceCheckUtils]: 29: Hoare triple {30638#true} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {30638#true} is VALID [2022-04-07 16:12:06,251 INFO L290 TraceCheckUtils]: 30: Hoare triple {30638#true} ~skip~0 := 0; {30638#true} is VALID [2022-04-07 16:12:06,251 INFO L290 TraceCheckUtils]: 31: Hoare triple {30638#true} assume !false; {30638#true} is VALID [2022-04-07 16:12:06,251 INFO L290 TraceCheckUtils]: 32: Hoare triple {30638#true} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {30638#true} is VALID [2022-04-07 16:12:06,251 INFO L290 TraceCheckUtils]: 33: Hoare triple {30638#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {30638#true} is VALID [2022-04-07 16:12:06,251 INFO L290 TraceCheckUtils]: 34: Hoare triple {30638#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {30638#true} is VALID [2022-04-07 16:12:06,251 INFO L290 TraceCheckUtils]: 35: Hoare triple {30638#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {30638#true} is VALID [2022-04-07 16:12:06,251 INFO L290 TraceCheckUtils]: 36: Hoare triple {30638#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {30638#true} is VALID [2022-04-07 16:12:06,251 INFO L290 TraceCheckUtils]: 37: Hoare triple {30638#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {30638#true} is VALID [2022-04-07 16:12:06,251 INFO L290 TraceCheckUtils]: 38: Hoare triple {30638#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {30638#true} is VALID [2022-04-07 16:12:06,251 INFO L290 TraceCheckUtils]: 39: Hoare triple {30638#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30638#true} is VALID [2022-04-07 16:12:06,251 INFO L290 TraceCheckUtils]: 40: Hoare triple {30638#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30638#true} is VALID [2022-04-07 16:12:06,251 INFO L290 TraceCheckUtils]: 41: Hoare triple {30638#true} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30638#true} is VALID [2022-04-07 16:12:06,251 INFO L290 TraceCheckUtils]: 42: Hoare triple {30638#true} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30638#true} is VALID [2022-04-07 16:12:06,251 INFO L290 TraceCheckUtils]: 43: Hoare triple {30638#true} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30638#true} is VALID [2022-04-07 16:12:06,251 INFO L290 TraceCheckUtils]: 44: Hoare triple {30638#true} assume 8496 == #t~mem53;havoc #t~mem53; {30638#true} is VALID [2022-04-07 16:12:06,251 INFO L290 TraceCheckUtils]: 45: Hoare triple {30638#true} assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {30638#true} is VALID [2022-04-07 16:12:06,252 INFO L290 TraceCheckUtils]: 46: Hoare triple {30638#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:06,252 INFO L290 TraceCheckUtils]: 47: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem91 := read~int(~s.base, 92 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:06,252 INFO L290 TraceCheckUtils]: 48: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume 0 != #t~mem91;havoc #t~mem91;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:06,252 INFO L290 TraceCheckUtils]: 49: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:06,253 INFO L290 TraceCheckUtils]: 50: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:06,253 INFO L290 TraceCheckUtils]: 51: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:06,253 INFO L290 TraceCheckUtils]: 52: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:06,253 INFO L290 TraceCheckUtils]: 53: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:06,253 INFO L290 TraceCheckUtils]: 54: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:06,254 INFO L290 TraceCheckUtils]: 55: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:06,254 INFO L290 TraceCheckUtils]: 56: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:06,254 INFO L290 TraceCheckUtils]: 57: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:06,254 INFO L290 TraceCheckUtils]: 58: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:06,255 INFO L290 TraceCheckUtils]: 59: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:06,255 INFO L290 TraceCheckUtils]: 60: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:06,255 INFO L290 TraceCheckUtils]: 61: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:06,255 INFO L290 TraceCheckUtils]: 62: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:06,255 INFO L290 TraceCheckUtils]: 63: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:06,256 INFO L290 TraceCheckUtils]: 64: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:06,256 INFO L290 TraceCheckUtils]: 65: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:06,256 INFO L290 TraceCheckUtils]: 66: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:06,256 INFO L290 TraceCheckUtils]: 67: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:06,257 INFO L290 TraceCheckUtils]: 68: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:06,257 INFO L290 TraceCheckUtils]: 69: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:06,257 INFO L290 TraceCheckUtils]: 70: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:06,257 INFO L290 TraceCheckUtils]: 71: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:06,257 INFO L290 TraceCheckUtils]: 72: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:06,258 INFO L290 TraceCheckUtils]: 73: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:06,258 INFO L290 TraceCheckUtils]: 74: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:06,258 INFO L290 TraceCheckUtils]: 75: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:06,258 INFO L290 TraceCheckUtils]: 76: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:06,258 INFO L290 TraceCheckUtils]: 77: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:06,259 INFO L290 TraceCheckUtils]: 78: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:06,259 INFO L290 TraceCheckUtils]: 79: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:06,259 INFO L290 TraceCheckUtils]: 80: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:06,259 INFO L290 TraceCheckUtils]: 81: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:06,260 INFO L290 TraceCheckUtils]: 82: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:06,260 INFO L290 TraceCheckUtils]: 83: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:06,260 INFO L290 TraceCheckUtils]: 84: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:06,260 INFO L290 TraceCheckUtils]: 85: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume 8656 == #t~mem72;havoc #t~mem72; {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:06,260 INFO L290 TraceCheckUtils]: 86: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem139.base, #t~mem139.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(#t~mem140.base, 836 + #t~mem140.offset, 4);call write~$Pointer$(#t~mem141.base, #t~mem141.offset, #t~mem139.base, 172 + #t~mem139.offset, 4);havoc #t~mem139.base, #t~mem139.offset;havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;assume -2147483648 <= #t~nondet142 && #t~nondet142 <= 2147483647;~tmp___9~0 := #t~nondet142;havoc #t~nondet142; {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:06,261 INFO L290 TraceCheckUtils]: 87: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {30643#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-07 16:12:06,261 INFO L290 TraceCheckUtils]: 88: Hoare triple {30643#(= 2 ssl3_accept_~blastFlag~0)} assume !(2 == ~blastFlag~0); {30639#false} is VALID [2022-04-07 16:12:06,261 INFO L290 TraceCheckUtils]: 89: Hoare triple {30639#false} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~tmp___10~0 := #t~nondet144;havoc #t~nondet144; {30639#false} is VALID [2022-04-07 16:12:06,261 INFO L290 TraceCheckUtils]: 90: Hoare triple {30639#false} assume !(0 == ~tmp___10~0); {30639#false} is VALID [2022-04-07 16:12:06,261 INFO L290 TraceCheckUtils]: 91: Hoare triple {30639#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {30639#false} is VALID [2022-04-07 16:12:06,261 INFO L290 TraceCheckUtils]: 92: Hoare triple {30639#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {30639#false} is VALID [2022-04-07 16:12:06,261 INFO L290 TraceCheckUtils]: 93: Hoare triple {30639#false} ~skip~0 := 0; {30639#false} is VALID [2022-04-07 16:12:06,261 INFO L290 TraceCheckUtils]: 94: Hoare triple {30639#false} assume !false; {30639#false} is VALID [2022-04-07 16:12:06,261 INFO L290 TraceCheckUtils]: 95: Hoare triple {30639#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-07 16:12:06,261 INFO L290 TraceCheckUtils]: 96: Hoare triple {30639#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-07 16:12:06,261 INFO L290 TraceCheckUtils]: 97: Hoare triple {30639#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-07 16:12:06,261 INFO L290 TraceCheckUtils]: 98: Hoare triple {30639#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-07 16:12:06,261 INFO L290 TraceCheckUtils]: 99: Hoare triple {30639#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-07 16:12:06,262 INFO L290 TraceCheckUtils]: 100: Hoare triple {30639#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-07 16:12:06,262 INFO L290 TraceCheckUtils]: 101: Hoare triple {30639#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-07 16:12:06,262 INFO L290 TraceCheckUtils]: 102: Hoare triple {30639#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-07 16:12:06,262 INFO L290 TraceCheckUtils]: 103: Hoare triple {30639#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-07 16:12:06,262 INFO L290 TraceCheckUtils]: 104: Hoare triple {30639#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-07 16:12:06,262 INFO L290 TraceCheckUtils]: 105: Hoare triple {30639#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-07 16:12:06,262 INFO L290 TraceCheckUtils]: 106: Hoare triple {30639#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-07 16:12:06,262 INFO L290 TraceCheckUtils]: 107: Hoare triple {30639#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-07 16:12:06,262 INFO L290 TraceCheckUtils]: 108: Hoare triple {30639#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-07 16:12:06,262 INFO L290 TraceCheckUtils]: 109: Hoare triple {30639#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-07 16:12:06,262 INFO L290 TraceCheckUtils]: 110: Hoare triple {30639#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-07 16:12:06,262 INFO L290 TraceCheckUtils]: 111: Hoare triple {30639#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-07 16:12:06,262 INFO L290 TraceCheckUtils]: 112: Hoare triple {30639#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-07 16:12:06,262 INFO L290 TraceCheckUtils]: 113: Hoare triple {30639#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-07 16:12:06,262 INFO L290 TraceCheckUtils]: 114: Hoare triple {30639#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-07 16:12:06,262 INFO L290 TraceCheckUtils]: 115: Hoare triple {30639#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-07 16:12:06,262 INFO L290 TraceCheckUtils]: 116: Hoare triple {30639#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-07 16:12:06,262 INFO L290 TraceCheckUtils]: 117: Hoare triple {30639#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-07 16:12:06,262 INFO L290 TraceCheckUtils]: 118: Hoare triple {30639#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-07 16:12:06,262 INFO L290 TraceCheckUtils]: 119: Hoare triple {30639#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-07 16:12:06,262 INFO L290 TraceCheckUtils]: 120: Hoare triple {30639#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-07 16:12:06,262 INFO L290 TraceCheckUtils]: 121: Hoare triple {30639#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-07 16:12:06,263 INFO L290 TraceCheckUtils]: 122: Hoare triple {30639#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-07 16:12:06,263 INFO L290 TraceCheckUtils]: 123: Hoare triple {30639#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-07 16:12:06,263 INFO L290 TraceCheckUtils]: 124: Hoare triple {30639#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-07 16:12:06,263 INFO L290 TraceCheckUtils]: 125: Hoare triple {30639#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-07 16:12:06,263 INFO L290 TraceCheckUtils]: 126: Hoare triple {30639#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-07 16:12:06,263 INFO L290 TraceCheckUtils]: 127: Hoare triple {30639#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {30639#false} is VALID [2022-04-07 16:12:06,263 INFO L290 TraceCheckUtils]: 128: Hoare triple {30639#false} assume 8672 == #t~mem74;havoc #t~mem74; {30639#false} is VALID [2022-04-07 16:12:06,263 INFO L290 TraceCheckUtils]: 129: Hoare triple {30639#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {30639#false} is VALID [2022-04-07 16:12:06,263 INFO L290 TraceCheckUtils]: 130: Hoare triple {30639#false} assume 4 == ~blastFlag~0; {30639#false} is VALID [2022-04-07 16:12:06,263 INFO L290 TraceCheckUtils]: 131: Hoare triple {30639#false} assume !false; {30639#false} is VALID [2022-04-07 16:12:06,263 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-07 16:12:06,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:12:06,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251334349] [2022-04-07 16:12:06,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251334349] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:12:06,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:12:06,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 16:12:06,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121973135] [2022-04-07 16:12:06,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:12:06,265 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 132 [2022-04-07 16:12:06,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:12:06,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:06,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:12:06,364 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 16:12:06,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:12:06,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 16:12:06,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 16:12:06,365 INFO L87 Difference]: Start difference. First operand 600 states and 932 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:08,384 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-07 16:12:09,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:12:09,113 INFO L93 Difference]: Finished difference Result 1415 states and 2211 transitions. [2022-04-07 16:12:09,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 16:12:09,113 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 132 [2022-04-07 16:12:09,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:12:09,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:09,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 583 transitions. [2022-04-07 16:12:09,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:09,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 583 transitions. [2022-04-07 16:12:09,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 583 transitions. [2022-04-07 16:12:09,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 583 edges. 583 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:12:09,467 INFO L225 Difference]: With dead ends: 1415 [2022-04-07 16:12:09,467 INFO L226 Difference]: Without dead ends: 841 [2022-04-07 16:12:09,484 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-07 16:12:09,485 INFO L913 BasicCegarLoop]: 243 mSDtfsCounter, 138 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-07 16:12:09,485 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 438 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 267 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-07 16:12:09,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2022-04-07 16:12:09,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 841. [2022-04-07 16:12:09,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:12:09,525 INFO L82 GeneralOperation]: Start isEquivalent. First operand 841 states. Second operand has 841 states, 836 states have (on average 1.5538277511961722) internal successors, (1299), 836 states have internal predecessors, (1299), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:09,525 INFO L74 IsIncluded]: Start isIncluded. First operand 841 states. Second operand has 841 states, 836 states have (on average 1.5538277511961722) internal successors, (1299), 836 states have internal predecessors, (1299), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:09,526 INFO L87 Difference]: Start difference. First operand 841 states. Second operand has 841 states, 836 states have (on average 1.5538277511961722) internal successors, (1299), 836 states have internal predecessors, (1299), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:09,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:12:09,547 INFO L93 Difference]: Finished difference Result 841 states and 1303 transitions. [2022-04-07 16:12:09,547 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1303 transitions. [2022-04-07 16:12:09,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:12:09,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:12:09,549 INFO L74 IsIncluded]: Start isIncluded. First operand has 841 states, 836 states have (on average 1.5538277511961722) internal successors, (1299), 836 states have internal predecessors, (1299), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 841 states. [2022-04-07 16:12:09,549 INFO L87 Difference]: Start difference. First operand has 841 states, 836 states have (on average 1.5538277511961722) internal successors, (1299), 836 states have internal predecessors, (1299), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 841 states. [2022-04-07 16:12:09,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:12:09,571 INFO L93 Difference]: Finished difference Result 841 states and 1303 transitions. [2022-04-07 16:12:09,571 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1303 transitions. [2022-04-07 16:12:09,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:12:09,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:12:09,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:12:09,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:12:09,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 836 states have (on average 1.5538277511961722) internal successors, (1299), 836 states have internal predecessors, (1299), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:09,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1303 transitions. [2022-04-07 16:12:09,596 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1303 transitions. Word has length 132 [2022-04-07 16:12:09,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:12:09,596 INFO L478 AbstractCegarLoop]: Abstraction has 841 states and 1303 transitions. [2022-04-07 16:12:09,596 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:09,596 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1303 transitions. [2022-04-07 16:12:09,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-07 16:12:09,598 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:12:09,598 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:12:09,598 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-07 16:12:09,598 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:12:09,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:12:09,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1060100637, now seen corresponding path program 1 times [2022-04-07 16:12:09,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:12:09,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202654026] [2022-04-07 16:12:09,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:12:09,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:12:09,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:12:09,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:12:09,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:12:09,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {34868#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {34862#true} is VALID [2022-04-07 16:12:09,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {34862#true} assume true; {34862#true} is VALID [2022-04-07 16:12:09,688 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34862#true} {34862#true} #664#return; {34862#true} is VALID [2022-04-07 16:12:09,689 INFO L272 TraceCheckUtils]: 0: Hoare triple {34862#true} call ULTIMATE.init(); {34868#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:12:09,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {34868#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {34862#true} is VALID [2022-04-07 16:12:09,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {34862#true} assume true; {34862#true} is VALID [2022-04-07 16:12:09,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34862#true} {34862#true} #664#return; {34862#true} is VALID [2022-04-07 16:12:09,689 INFO L272 TraceCheckUtils]: 4: Hoare triple {34862#true} call #t~ret162 := main(); {34862#true} is VALID [2022-04-07 16:12:09,689 INFO L290 TraceCheckUtils]: 5: Hoare triple {34862#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 52 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {34862#true} is VALID [2022-04-07 16:12:09,689 INFO L290 TraceCheckUtils]: 6: Hoare triple {34862#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {34862#true} is VALID [2022-04-07 16:12:09,689 INFO L272 TraceCheckUtils]: 7: Hoare triple {34862#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {34862#true} is VALID [2022-04-07 16:12:09,689 INFO L290 TraceCheckUtils]: 8: Hoare triple {34862#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {34862#true} is VALID [2022-04-07 16:12:09,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {34862#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {34862#true} is VALID [2022-04-07 16:12:09,689 INFO L290 TraceCheckUtils]: 10: Hoare triple {34862#true} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {34862#true} is VALID [2022-04-07 16:12:09,689 INFO L290 TraceCheckUtils]: 11: Hoare triple {34862#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {34862#true} is VALID [2022-04-07 16:12:09,689 INFO L290 TraceCheckUtils]: 12: Hoare triple {34862#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {34862#true} is VALID [2022-04-07 16:12:09,689 INFO L290 TraceCheckUtils]: 13: Hoare triple {34862#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {34862#true} is VALID [2022-04-07 16:12:09,689 INFO L290 TraceCheckUtils]: 14: Hoare triple {34862#true} assume !false; {34862#true} is VALID [2022-04-07 16:12:09,689 INFO L290 TraceCheckUtils]: 15: Hoare triple {34862#true} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {34862#true} is VALID [2022-04-07 16:12:09,689 INFO L290 TraceCheckUtils]: 16: Hoare triple {34862#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {34862#true} is VALID [2022-04-07 16:12:09,689 INFO L290 TraceCheckUtils]: 17: Hoare triple {34862#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {34862#true} is VALID [2022-04-07 16:12:09,690 INFO L290 TraceCheckUtils]: 18: Hoare triple {34862#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {34862#true} is VALID [2022-04-07 16:12:09,690 INFO L290 TraceCheckUtils]: 19: Hoare triple {34862#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {34862#true} is VALID [2022-04-07 16:12:09,690 INFO L290 TraceCheckUtils]: 20: Hoare triple {34862#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {34862#true} is VALID [2022-04-07 16:12:09,690 INFO L290 TraceCheckUtils]: 21: Hoare triple {34862#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {34862#true} is VALID [2022-04-07 16:12:09,690 INFO L290 TraceCheckUtils]: 22: Hoare triple {34862#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {34862#true} is VALID [2022-04-07 16:12:09,690 INFO L290 TraceCheckUtils]: 23: Hoare triple {34862#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {34862#true} is VALID [2022-04-07 16:12:09,690 INFO L290 TraceCheckUtils]: 24: Hoare triple {34862#true} assume 8464 == #t~mem50;havoc #t~mem50; {34862#true} is VALID [2022-04-07 16:12:09,690 INFO L290 TraceCheckUtils]: 25: Hoare triple {34862#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; {34862#true} is VALID [2022-04-07 16:12:09,690 INFO L290 TraceCheckUtils]: 26: Hoare triple {34862#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {34867#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-07 16:12:09,690 INFO L290 TraceCheckUtils]: 27: Hoare triple {34867#(= ssl3_accept_~blastFlag~0 1)} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {34867#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-07 16:12:09,691 INFO L290 TraceCheckUtils]: 28: Hoare triple {34867#(= ssl3_accept_~blastFlag~0 1)} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {34867#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-07 16:12:09,691 INFO L290 TraceCheckUtils]: 29: Hoare triple {34867#(= ssl3_accept_~blastFlag~0 1)} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {34867#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-07 16:12:09,691 INFO L290 TraceCheckUtils]: 30: Hoare triple {34867#(= ssl3_accept_~blastFlag~0 1)} ~skip~0 := 0; {34867#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-07 16:12:09,691 INFO L290 TraceCheckUtils]: 31: Hoare triple {34867#(= ssl3_accept_~blastFlag~0 1)} assume !false; {34867#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-07 16:12:09,692 INFO L290 TraceCheckUtils]: 32: Hoare triple {34867#(= ssl3_accept_~blastFlag~0 1)} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {34867#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-07 16:12:09,692 INFO L290 TraceCheckUtils]: 33: Hoare triple {34867#(= ssl3_accept_~blastFlag~0 1)} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {34867#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-07 16:12:09,692 INFO L290 TraceCheckUtils]: 34: Hoare triple {34867#(= ssl3_accept_~blastFlag~0 1)} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {34867#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-07 16:12:09,692 INFO L290 TraceCheckUtils]: 35: Hoare triple {34867#(= ssl3_accept_~blastFlag~0 1)} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {34867#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-07 16:12:09,692 INFO L290 TraceCheckUtils]: 36: Hoare triple {34867#(= ssl3_accept_~blastFlag~0 1)} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {34867#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-07 16:12:09,693 INFO L290 TraceCheckUtils]: 37: Hoare triple {34867#(= ssl3_accept_~blastFlag~0 1)} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {34867#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-07 16:12:09,693 INFO L290 TraceCheckUtils]: 38: Hoare triple {34867#(= ssl3_accept_~blastFlag~0 1)} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {34867#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-07 16:12:09,693 INFO L290 TraceCheckUtils]: 39: Hoare triple {34867#(= ssl3_accept_~blastFlag~0 1)} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {34867#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-07 16:12:09,693 INFO L290 TraceCheckUtils]: 40: Hoare triple {34867#(= ssl3_accept_~blastFlag~0 1)} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {34867#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-07 16:12:09,694 INFO L290 TraceCheckUtils]: 41: Hoare triple {34867#(= ssl3_accept_~blastFlag~0 1)} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {34867#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-07 16:12:09,694 INFO L290 TraceCheckUtils]: 42: Hoare triple {34867#(= ssl3_accept_~blastFlag~0 1)} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {34867#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-07 16:12:09,694 INFO L290 TraceCheckUtils]: 43: Hoare triple {34867#(= ssl3_accept_~blastFlag~0 1)} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {34867#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-07 16:12:09,694 INFO L290 TraceCheckUtils]: 44: Hoare triple {34867#(= ssl3_accept_~blastFlag~0 1)} assume 8496 == #t~mem53;havoc #t~mem53; {34867#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-07 16:12:09,695 INFO L290 TraceCheckUtils]: 45: Hoare triple {34867#(= ssl3_accept_~blastFlag~0 1)} assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {34867#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-07 16:12:09,695 INFO L290 TraceCheckUtils]: 46: Hoare triple {34867#(= ssl3_accept_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {34863#false} is VALID [2022-04-07 16:12:09,695 INFO L290 TraceCheckUtils]: 47: Hoare triple {34863#false} assume !(~ret~0 <= 0);call #t~mem91 := read~int(~s.base, 92 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,695 INFO L290 TraceCheckUtils]: 48: Hoare triple {34863#false} assume 0 != #t~mem91;havoc #t~mem91;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,695 INFO L290 TraceCheckUtils]: 49: Hoare triple {34863#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,695 INFO L290 TraceCheckUtils]: 50: Hoare triple {34863#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,695 INFO L290 TraceCheckUtils]: 51: Hoare triple {34863#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {34863#false} is VALID [2022-04-07 16:12:09,695 INFO L290 TraceCheckUtils]: 52: Hoare triple {34863#false} ~skip~0 := 0; {34863#false} is VALID [2022-04-07 16:12:09,695 INFO L290 TraceCheckUtils]: 53: Hoare triple {34863#false} assume !false; {34863#false} is VALID [2022-04-07 16:12:09,695 INFO L290 TraceCheckUtils]: 54: Hoare triple {34863#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,695 INFO L290 TraceCheckUtils]: 55: Hoare triple {34863#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,695 INFO L290 TraceCheckUtils]: 56: Hoare triple {34863#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,695 INFO L290 TraceCheckUtils]: 57: Hoare triple {34863#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,695 INFO L290 TraceCheckUtils]: 58: Hoare triple {34863#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,695 INFO L290 TraceCheckUtils]: 59: Hoare triple {34863#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,696 INFO L290 TraceCheckUtils]: 60: Hoare triple {34863#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,696 INFO L290 TraceCheckUtils]: 61: Hoare triple {34863#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,696 INFO L290 TraceCheckUtils]: 62: Hoare triple {34863#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,696 INFO L290 TraceCheckUtils]: 63: Hoare triple {34863#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,696 INFO L290 TraceCheckUtils]: 64: Hoare triple {34863#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,696 INFO L290 TraceCheckUtils]: 65: Hoare triple {34863#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,696 INFO L290 TraceCheckUtils]: 66: Hoare triple {34863#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,696 INFO L290 TraceCheckUtils]: 67: Hoare triple {34863#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,696 INFO L290 TraceCheckUtils]: 68: Hoare triple {34863#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,696 INFO L290 TraceCheckUtils]: 69: Hoare triple {34863#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,696 INFO L290 TraceCheckUtils]: 70: Hoare triple {34863#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,696 INFO L290 TraceCheckUtils]: 71: Hoare triple {34863#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,696 INFO L290 TraceCheckUtils]: 72: Hoare triple {34863#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,696 INFO L290 TraceCheckUtils]: 73: Hoare triple {34863#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,696 INFO L290 TraceCheckUtils]: 74: Hoare triple {34863#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,696 INFO L290 TraceCheckUtils]: 75: Hoare triple {34863#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,696 INFO L290 TraceCheckUtils]: 76: Hoare triple {34863#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,696 INFO L290 TraceCheckUtils]: 77: Hoare triple {34863#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,696 INFO L290 TraceCheckUtils]: 78: Hoare triple {34863#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,696 INFO L290 TraceCheckUtils]: 79: Hoare triple {34863#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,696 INFO L290 TraceCheckUtils]: 80: Hoare triple {34863#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,696 INFO L290 TraceCheckUtils]: 81: Hoare triple {34863#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,697 INFO L290 TraceCheckUtils]: 82: Hoare triple {34863#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,697 INFO L290 TraceCheckUtils]: 83: Hoare triple {34863#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,697 INFO L290 TraceCheckUtils]: 84: Hoare triple {34863#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,697 INFO L290 TraceCheckUtils]: 85: Hoare triple {34863#false} assume 8656 == #t~mem72;havoc #t~mem72; {34863#false} is VALID [2022-04-07 16:12:09,697 INFO L290 TraceCheckUtils]: 86: Hoare triple {34863#false} call #t~mem139.base, #t~mem139.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(#t~mem140.base, 836 + #t~mem140.offset, 4);call write~$Pointer$(#t~mem141.base, #t~mem141.offset, #t~mem139.base, 172 + #t~mem139.offset, 4);havoc #t~mem139.base, #t~mem139.offset;havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;assume -2147483648 <= #t~nondet142 && #t~nondet142 <= 2147483647;~tmp___9~0 := #t~nondet142;havoc #t~nondet142; {34863#false} is VALID [2022-04-07 16:12:09,697 INFO L290 TraceCheckUtils]: 87: Hoare triple {34863#false} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {34863#false} is VALID [2022-04-07 16:12:09,697 INFO L290 TraceCheckUtils]: 88: Hoare triple {34863#false} assume !(2 == ~blastFlag~0); {34863#false} is VALID [2022-04-07 16:12:09,697 INFO L290 TraceCheckUtils]: 89: Hoare triple {34863#false} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~tmp___10~0 := #t~nondet144;havoc #t~nondet144; {34863#false} is VALID [2022-04-07 16:12:09,697 INFO L290 TraceCheckUtils]: 90: Hoare triple {34863#false} assume !(0 == ~tmp___10~0); {34863#false} is VALID [2022-04-07 16:12:09,697 INFO L290 TraceCheckUtils]: 91: Hoare triple {34863#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,697 INFO L290 TraceCheckUtils]: 92: Hoare triple {34863#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {34863#false} is VALID [2022-04-07 16:12:09,697 INFO L290 TraceCheckUtils]: 93: Hoare triple {34863#false} ~skip~0 := 0; {34863#false} is VALID [2022-04-07 16:12:09,697 INFO L290 TraceCheckUtils]: 94: Hoare triple {34863#false} assume !false; {34863#false} is VALID [2022-04-07 16:12:09,697 INFO L290 TraceCheckUtils]: 95: Hoare triple {34863#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,697 INFO L290 TraceCheckUtils]: 96: Hoare triple {34863#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,697 INFO L290 TraceCheckUtils]: 97: Hoare triple {34863#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,697 INFO L290 TraceCheckUtils]: 98: Hoare triple {34863#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,697 INFO L290 TraceCheckUtils]: 99: Hoare triple {34863#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,697 INFO L290 TraceCheckUtils]: 100: Hoare triple {34863#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,697 INFO L290 TraceCheckUtils]: 101: Hoare triple {34863#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,697 INFO L290 TraceCheckUtils]: 102: Hoare triple {34863#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,698 INFO L290 TraceCheckUtils]: 103: Hoare triple {34863#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,698 INFO L290 TraceCheckUtils]: 104: Hoare triple {34863#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,698 INFO L290 TraceCheckUtils]: 105: Hoare triple {34863#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,698 INFO L290 TraceCheckUtils]: 106: Hoare triple {34863#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,698 INFO L290 TraceCheckUtils]: 107: Hoare triple {34863#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,698 INFO L290 TraceCheckUtils]: 108: Hoare triple {34863#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,698 INFO L290 TraceCheckUtils]: 109: Hoare triple {34863#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,698 INFO L290 TraceCheckUtils]: 110: Hoare triple {34863#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,698 INFO L290 TraceCheckUtils]: 111: Hoare triple {34863#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,698 INFO L290 TraceCheckUtils]: 112: Hoare triple {34863#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,698 INFO L290 TraceCheckUtils]: 113: Hoare triple {34863#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,698 INFO L290 TraceCheckUtils]: 114: Hoare triple {34863#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,698 INFO L290 TraceCheckUtils]: 115: Hoare triple {34863#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,698 INFO L290 TraceCheckUtils]: 116: Hoare triple {34863#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,698 INFO L290 TraceCheckUtils]: 117: Hoare triple {34863#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,698 INFO L290 TraceCheckUtils]: 118: Hoare triple {34863#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,698 INFO L290 TraceCheckUtils]: 119: Hoare triple {34863#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,698 INFO L290 TraceCheckUtils]: 120: Hoare triple {34863#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,698 INFO L290 TraceCheckUtils]: 121: Hoare triple {34863#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,698 INFO L290 TraceCheckUtils]: 122: Hoare triple {34863#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,699 INFO L290 TraceCheckUtils]: 123: Hoare triple {34863#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,699 INFO L290 TraceCheckUtils]: 124: Hoare triple {34863#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,699 INFO L290 TraceCheckUtils]: 125: Hoare triple {34863#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,699 INFO L290 TraceCheckUtils]: 126: Hoare triple {34863#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,699 INFO L290 TraceCheckUtils]: 127: Hoare triple {34863#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {34863#false} is VALID [2022-04-07 16:12:09,699 INFO L290 TraceCheckUtils]: 128: Hoare triple {34863#false} assume 8672 == #t~mem74;havoc #t~mem74; {34863#false} is VALID [2022-04-07 16:12:09,699 INFO L290 TraceCheckUtils]: 129: Hoare triple {34863#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {34863#false} is VALID [2022-04-07 16:12:09,700 INFO L290 TraceCheckUtils]: 130: Hoare triple {34863#false} assume 4 == ~blastFlag~0; {34863#false} is VALID [2022-04-07 16:12:09,700 INFO L290 TraceCheckUtils]: 131: Hoare triple {34863#false} assume !false; {34863#false} is VALID [2022-04-07 16:12:09,700 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-07 16:12:09,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:12:09,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202654026] [2022-04-07 16:12:09,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202654026] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:12:09,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:12:09,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 16:12:09,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931682810] [2022-04-07 16:12:09,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:12:09,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 132 [2022-04-07 16:12:09,701 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:12:09,701 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:09,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:12:09,767 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 16:12:09,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:12:09,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 16:12:09,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 16:12:09,768 INFO L87 Difference]: Start difference. First operand 841 states and 1303 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:11,782 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-07 16:12:12,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:12:12,498 INFO L93 Difference]: Finished difference Result 1683 states and 2613 transitions. [2022-04-07 16:12:12,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 16:12:12,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 132 [2022-04-07 16:12:12,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:12:12,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:12,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 434 transitions. [2022-04-07 16:12:12,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:12,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 434 transitions. [2022-04-07 16:12:12,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 434 transitions. [2022-04-07 16:12:12,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 434 edges. 434 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:12:12,804 INFO L225 Difference]: With dead ends: 1683 [2022-04-07 16:12:12,805 INFO L226 Difference]: Without dead ends: 868 [2022-04-07 16:12:12,806 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-07 16:12:12,806 INFO L913 BasicCegarLoop]: 216 mSDtfsCounter, 15 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-07 16:12:12,806 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 411 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 232 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-07 16:12:12,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2022-04-07 16:12:12,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 868. [2022-04-07 16:12:12,829 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:12:12,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 868 states. Second operand has 868 states, 863 states have (on average 1.5457705677867903) internal successors, (1334), 863 states have internal predecessors, (1334), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:12,831 INFO L74 IsIncluded]: Start isIncluded. First operand 868 states. Second operand has 868 states, 863 states have (on average 1.5457705677867903) internal successors, (1334), 863 states have internal predecessors, (1334), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:12,831 INFO L87 Difference]: Start difference. First operand 868 states. Second operand has 868 states, 863 states have (on average 1.5457705677867903) internal successors, (1334), 863 states have internal predecessors, (1334), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:12,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:12:12,853 INFO L93 Difference]: Finished difference Result 868 states and 1338 transitions. [2022-04-07 16:12:12,853 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1338 transitions. [2022-04-07 16:12:12,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:12:12,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:12:12,855 INFO L74 IsIncluded]: Start isIncluded. First operand has 868 states, 863 states have (on average 1.5457705677867903) internal successors, (1334), 863 states have internal predecessors, (1334), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 868 states. [2022-04-07 16:12:12,856 INFO L87 Difference]: Start difference. First operand has 868 states, 863 states have (on average 1.5457705677867903) internal successors, (1334), 863 states have internal predecessors, (1334), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 868 states. [2022-04-07 16:12:12,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:12:12,879 INFO L93 Difference]: Finished difference Result 868 states and 1338 transitions. [2022-04-07 16:12:12,879 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1338 transitions. [2022-04-07 16:12:12,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:12:12,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:12:12,880 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:12:12,880 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:12:12,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 863 states have (on average 1.5457705677867903) internal successors, (1334), 863 states have internal predecessors, (1334), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:12,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1338 transitions. [2022-04-07 16:12:12,905 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1338 transitions. Word has length 132 [2022-04-07 16:12:12,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:12:12,905 INFO L478 AbstractCegarLoop]: Abstraction has 868 states and 1338 transitions. [2022-04-07 16:12:12,906 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:12,906 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1338 transitions. [2022-04-07 16:12:12,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-07 16:12:12,907 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:12:12,907 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:12:12,907 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-07 16:12:12,907 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:12:12,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:12:12,907 INFO L85 PathProgramCache]: Analyzing trace with hash 436819035, now seen corresponding path program 1 times [2022-04-07 16:12:12,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:12:12,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654841792] [2022-04-07 16:12:12,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:12:12,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:12:12,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:12:12,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:12:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:12:13,009 INFO L290 TraceCheckUtils]: 0: Hoare triple {39480#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {39474#true} is VALID [2022-04-07 16:12:13,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {39474#true} assume true; {39474#true} is VALID [2022-04-07 16:12:13,010 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39474#true} {39474#true} #664#return; {39474#true} is VALID [2022-04-07 16:12:13,010 INFO L272 TraceCheckUtils]: 0: Hoare triple {39474#true} call ULTIMATE.init(); {39480#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:12:13,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {39480#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {39474#true} is VALID [2022-04-07 16:12:13,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {39474#true} assume true; {39474#true} is VALID [2022-04-07 16:12:13,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39474#true} {39474#true} #664#return; {39474#true} is VALID [2022-04-07 16:12:13,011 INFO L272 TraceCheckUtils]: 4: Hoare triple {39474#true} call #t~ret162 := main(); {39474#true} is VALID [2022-04-07 16:12:13,011 INFO L290 TraceCheckUtils]: 5: Hoare triple {39474#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 52 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {39474#true} is VALID [2022-04-07 16:12:13,011 INFO L290 TraceCheckUtils]: 6: Hoare triple {39474#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {39474#true} is VALID [2022-04-07 16:12:13,011 INFO L272 TraceCheckUtils]: 7: Hoare triple {39474#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {39474#true} is VALID [2022-04-07 16:12:13,011 INFO L290 TraceCheckUtils]: 8: Hoare triple {39474#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {39479#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-07 16:12:13,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {39479#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {39479#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-07 16:12:13,011 INFO L290 TraceCheckUtils]: 10: Hoare triple {39479#(= ssl3_accept_~blastFlag~0 0)} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {39479#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-07 16:12:13,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {39479#(= ssl3_accept_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {39479#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-07 16:12:13,012 INFO L290 TraceCheckUtils]: 12: Hoare triple {39479#(= ssl3_accept_~blastFlag~0 0)} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {39479#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-07 16:12:13,012 INFO L290 TraceCheckUtils]: 13: Hoare triple {39479#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {39479#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-07 16:12:13,012 INFO L290 TraceCheckUtils]: 14: Hoare triple {39479#(= ssl3_accept_~blastFlag~0 0)} assume !false; {39479#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-07 16:12:13,013 INFO L290 TraceCheckUtils]: 15: Hoare triple {39479#(= ssl3_accept_~blastFlag~0 0)} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {39479#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-07 16:12:13,013 INFO L290 TraceCheckUtils]: 16: Hoare triple {39479#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {39479#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-07 16:12:13,013 INFO L290 TraceCheckUtils]: 17: Hoare triple {39479#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {39479#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-07 16:12:13,013 INFO L290 TraceCheckUtils]: 18: Hoare triple {39479#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {39479#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-07 16:12:13,014 INFO L290 TraceCheckUtils]: 19: Hoare triple {39479#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {39479#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-07 16:12:13,014 INFO L290 TraceCheckUtils]: 20: Hoare triple {39479#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {39479#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-07 16:12:13,014 INFO L290 TraceCheckUtils]: 21: Hoare triple {39479#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {39479#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-07 16:12:13,014 INFO L290 TraceCheckUtils]: 22: Hoare triple {39479#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {39479#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-07 16:12:13,015 INFO L290 TraceCheckUtils]: 23: Hoare triple {39479#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {39479#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-07 16:12:13,015 INFO L290 TraceCheckUtils]: 24: Hoare triple {39479#(= ssl3_accept_~blastFlag~0 0)} assume 8464 == #t~mem50;havoc #t~mem50; {39479#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-07 16:12:13,015 INFO L290 TraceCheckUtils]: 25: Hoare triple {39479#(= ssl3_accept_~blastFlag~0 0)} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {39479#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-07 16:12:13,016 INFO L290 TraceCheckUtils]: 26: Hoare triple {39479#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == ~blastFlag~0); {39475#false} is VALID [2022-04-07 16:12:13,016 INFO L290 TraceCheckUtils]: 27: Hoare triple {39475#false} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,016 INFO L290 TraceCheckUtils]: 28: Hoare triple {39475#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,016 INFO L290 TraceCheckUtils]: 29: Hoare triple {39475#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {39475#false} is VALID [2022-04-07 16:12:13,016 INFO L290 TraceCheckUtils]: 30: Hoare triple {39475#false} ~skip~0 := 0; {39475#false} is VALID [2022-04-07 16:12:13,016 INFO L290 TraceCheckUtils]: 31: Hoare triple {39475#false} assume !false; {39475#false} is VALID [2022-04-07 16:12:13,016 INFO L290 TraceCheckUtils]: 32: Hoare triple {39475#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,016 INFO L290 TraceCheckUtils]: 33: Hoare triple {39475#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,016 INFO L290 TraceCheckUtils]: 34: Hoare triple {39475#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,016 INFO L290 TraceCheckUtils]: 35: Hoare triple {39475#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,016 INFO L290 TraceCheckUtils]: 36: Hoare triple {39475#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,016 INFO L290 TraceCheckUtils]: 37: Hoare triple {39475#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,016 INFO L290 TraceCheckUtils]: 38: Hoare triple {39475#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,016 INFO L290 TraceCheckUtils]: 39: Hoare triple {39475#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,016 INFO L290 TraceCheckUtils]: 40: Hoare triple {39475#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,016 INFO L290 TraceCheckUtils]: 41: Hoare triple {39475#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,016 INFO L290 TraceCheckUtils]: 42: Hoare triple {39475#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,017 INFO L290 TraceCheckUtils]: 43: Hoare triple {39475#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,017 INFO L290 TraceCheckUtils]: 44: Hoare triple {39475#false} assume 8496 == #t~mem53;havoc #t~mem53; {39475#false} is VALID [2022-04-07 16:12:13,017 INFO L290 TraceCheckUtils]: 45: Hoare triple {39475#false} assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {39475#false} is VALID [2022-04-07 16:12:13,017 INFO L290 TraceCheckUtils]: 46: Hoare triple {39475#false} assume !(1 == ~blastFlag~0); {39475#false} is VALID [2022-04-07 16:12:13,017 INFO L290 TraceCheckUtils]: 47: Hoare triple {39475#false} assume !(~ret~0 <= 0);call #t~mem91 := read~int(~s.base, 92 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,017 INFO L290 TraceCheckUtils]: 48: Hoare triple {39475#false} assume 0 != #t~mem91;havoc #t~mem91;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,017 INFO L290 TraceCheckUtils]: 49: Hoare triple {39475#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,017 INFO L290 TraceCheckUtils]: 50: Hoare triple {39475#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,017 INFO L290 TraceCheckUtils]: 51: Hoare triple {39475#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {39475#false} is VALID [2022-04-07 16:12:13,017 INFO L290 TraceCheckUtils]: 52: Hoare triple {39475#false} ~skip~0 := 0; {39475#false} is VALID [2022-04-07 16:12:13,017 INFO L290 TraceCheckUtils]: 53: Hoare triple {39475#false} assume !false; {39475#false} is VALID [2022-04-07 16:12:13,017 INFO L290 TraceCheckUtils]: 54: Hoare triple {39475#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,017 INFO L290 TraceCheckUtils]: 55: Hoare triple {39475#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,017 INFO L290 TraceCheckUtils]: 56: Hoare triple {39475#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,017 INFO L290 TraceCheckUtils]: 57: Hoare triple {39475#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,017 INFO L290 TraceCheckUtils]: 58: Hoare triple {39475#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,017 INFO L290 TraceCheckUtils]: 59: Hoare triple {39475#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,017 INFO L290 TraceCheckUtils]: 60: Hoare triple {39475#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,017 INFO L290 TraceCheckUtils]: 61: Hoare triple {39475#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,017 INFO L290 TraceCheckUtils]: 62: Hoare triple {39475#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,018 INFO L290 TraceCheckUtils]: 63: Hoare triple {39475#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,018 INFO L290 TraceCheckUtils]: 64: Hoare triple {39475#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,018 INFO L290 TraceCheckUtils]: 65: Hoare triple {39475#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,018 INFO L290 TraceCheckUtils]: 66: Hoare triple {39475#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,018 INFO L290 TraceCheckUtils]: 67: Hoare triple {39475#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,018 INFO L290 TraceCheckUtils]: 68: Hoare triple {39475#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,018 INFO L290 TraceCheckUtils]: 69: Hoare triple {39475#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,018 INFO L290 TraceCheckUtils]: 70: Hoare triple {39475#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,018 INFO L290 TraceCheckUtils]: 71: Hoare triple {39475#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,018 INFO L290 TraceCheckUtils]: 72: Hoare triple {39475#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,018 INFO L290 TraceCheckUtils]: 73: Hoare triple {39475#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,018 INFO L290 TraceCheckUtils]: 74: Hoare triple {39475#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,018 INFO L290 TraceCheckUtils]: 75: Hoare triple {39475#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,018 INFO L290 TraceCheckUtils]: 76: Hoare triple {39475#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,018 INFO L290 TraceCheckUtils]: 77: Hoare triple {39475#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,018 INFO L290 TraceCheckUtils]: 78: Hoare triple {39475#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,018 INFO L290 TraceCheckUtils]: 79: Hoare triple {39475#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,018 INFO L290 TraceCheckUtils]: 80: Hoare triple {39475#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,018 INFO L290 TraceCheckUtils]: 81: Hoare triple {39475#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,018 INFO L290 TraceCheckUtils]: 82: Hoare triple {39475#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,018 INFO L290 TraceCheckUtils]: 83: Hoare triple {39475#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,019 INFO L290 TraceCheckUtils]: 84: Hoare triple {39475#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,019 INFO L290 TraceCheckUtils]: 85: Hoare triple {39475#false} assume 8656 == #t~mem72;havoc #t~mem72; {39475#false} is VALID [2022-04-07 16:12:13,019 INFO L290 TraceCheckUtils]: 86: Hoare triple {39475#false} call #t~mem139.base, #t~mem139.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(#t~mem140.base, 836 + #t~mem140.offset, 4);call write~$Pointer$(#t~mem141.base, #t~mem141.offset, #t~mem139.base, 172 + #t~mem139.offset, 4);havoc #t~mem139.base, #t~mem139.offset;havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;assume -2147483648 <= #t~nondet142 && #t~nondet142 <= 2147483647;~tmp___9~0 := #t~nondet142;havoc #t~nondet142; {39475#false} is VALID [2022-04-07 16:12:13,019 INFO L290 TraceCheckUtils]: 87: Hoare triple {39475#false} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {39475#false} is VALID [2022-04-07 16:12:13,019 INFO L290 TraceCheckUtils]: 88: Hoare triple {39475#false} assume !(2 == ~blastFlag~0); {39475#false} is VALID [2022-04-07 16:12:13,019 INFO L290 TraceCheckUtils]: 89: Hoare triple {39475#false} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~tmp___10~0 := #t~nondet144;havoc #t~nondet144; {39475#false} is VALID [2022-04-07 16:12:13,019 INFO L290 TraceCheckUtils]: 90: Hoare triple {39475#false} assume !(0 == ~tmp___10~0); {39475#false} is VALID [2022-04-07 16:12:13,019 INFO L290 TraceCheckUtils]: 91: Hoare triple {39475#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,019 INFO L290 TraceCheckUtils]: 92: Hoare triple {39475#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {39475#false} is VALID [2022-04-07 16:12:13,019 INFO L290 TraceCheckUtils]: 93: Hoare triple {39475#false} ~skip~0 := 0; {39475#false} is VALID [2022-04-07 16:12:13,019 INFO L290 TraceCheckUtils]: 94: Hoare triple {39475#false} assume !false; {39475#false} is VALID [2022-04-07 16:12:13,019 INFO L290 TraceCheckUtils]: 95: Hoare triple {39475#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,019 INFO L290 TraceCheckUtils]: 96: Hoare triple {39475#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,019 INFO L290 TraceCheckUtils]: 97: Hoare triple {39475#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,019 INFO L290 TraceCheckUtils]: 98: Hoare triple {39475#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,019 INFO L290 TraceCheckUtils]: 99: Hoare triple {39475#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,019 INFO L290 TraceCheckUtils]: 100: Hoare triple {39475#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,019 INFO L290 TraceCheckUtils]: 101: Hoare triple {39475#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,019 INFO L290 TraceCheckUtils]: 102: Hoare triple {39475#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,019 INFO L290 TraceCheckUtils]: 103: Hoare triple {39475#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,020 INFO L290 TraceCheckUtils]: 104: Hoare triple {39475#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,020 INFO L290 TraceCheckUtils]: 105: Hoare triple {39475#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,020 INFO L290 TraceCheckUtils]: 106: Hoare triple {39475#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,020 INFO L290 TraceCheckUtils]: 107: Hoare triple {39475#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,020 INFO L290 TraceCheckUtils]: 108: Hoare triple {39475#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,020 INFO L290 TraceCheckUtils]: 109: Hoare triple {39475#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,020 INFO L290 TraceCheckUtils]: 110: Hoare triple {39475#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,020 INFO L290 TraceCheckUtils]: 111: Hoare triple {39475#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,020 INFO L290 TraceCheckUtils]: 112: Hoare triple {39475#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,020 INFO L290 TraceCheckUtils]: 113: Hoare triple {39475#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,020 INFO L290 TraceCheckUtils]: 114: Hoare triple {39475#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,020 INFO L290 TraceCheckUtils]: 115: Hoare triple {39475#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,020 INFO L290 TraceCheckUtils]: 116: Hoare triple {39475#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,020 INFO L290 TraceCheckUtils]: 117: Hoare triple {39475#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,020 INFO L290 TraceCheckUtils]: 118: Hoare triple {39475#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,020 INFO L290 TraceCheckUtils]: 119: Hoare triple {39475#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,020 INFO L290 TraceCheckUtils]: 120: Hoare triple {39475#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,020 INFO L290 TraceCheckUtils]: 121: Hoare triple {39475#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,020 INFO L290 TraceCheckUtils]: 122: Hoare triple {39475#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,020 INFO L290 TraceCheckUtils]: 123: Hoare triple {39475#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,020 INFO L290 TraceCheckUtils]: 124: Hoare triple {39475#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,021 INFO L290 TraceCheckUtils]: 125: Hoare triple {39475#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,021 INFO L290 TraceCheckUtils]: 126: Hoare triple {39475#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,021 INFO L290 TraceCheckUtils]: 127: Hoare triple {39475#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {39475#false} is VALID [2022-04-07 16:12:13,021 INFO L290 TraceCheckUtils]: 128: Hoare triple {39475#false} assume 8672 == #t~mem74;havoc #t~mem74; {39475#false} is VALID [2022-04-07 16:12:13,021 INFO L290 TraceCheckUtils]: 129: Hoare triple {39475#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {39475#false} is VALID [2022-04-07 16:12:13,021 INFO L290 TraceCheckUtils]: 130: Hoare triple {39475#false} assume 4 == ~blastFlag~0; {39475#false} is VALID [2022-04-07 16:12:13,021 INFO L290 TraceCheckUtils]: 131: Hoare triple {39475#false} assume !false; {39475#false} is VALID [2022-04-07 16:12:13,021 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-04-07 16:12:13,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:12:13,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654841792] [2022-04-07 16:12:13,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654841792] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:12:13,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:12:13,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 16:12:13,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443346074] [2022-04-07 16:12:13,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:12:13,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 132 [2022-04-07 16:12:13,023 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:12:13,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:13,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:12:13,089 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 16:12:13,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:12:13,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 16:12:13,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 16:12:13,090 INFO L87 Difference]: Start difference. First operand 868 states and 1338 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:15,104 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-07 16:12:15,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:12:15,697 INFO L93 Difference]: Finished difference Result 1426 states and 2196 transitions. [2022-04-07 16:12:15,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 16:12:15,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 132 [2022-04-07 16:12:15,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:12:15,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:15,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 408 transitions. [2022-04-07 16:12:15,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:15,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 408 transitions. [2022-04-07 16:12:15,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 408 transitions. [2022-04-07 16:12:15,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 408 edges. 408 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:12:15,925 INFO L225 Difference]: With dead ends: 1426 [2022-04-07 16:12:15,925 INFO L226 Difference]: Without dead ends: 584 [2022-04-07 16:12:15,926 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-07 16:12:15,926 INFO L913 BasicCegarLoop]: 202 mSDtfsCounter, 4 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-07 16:12:15,927 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 388 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 214 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-07 16:12:15,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2022-04-07 16:12:15,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2022-04-07 16:12:15,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:12:15,957 INFO L82 GeneralOperation]: Start isEquivalent. First operand 584 states. Second operand has 584 states, 579 states have (on average 1.5250431778929188) internal successors, (883), 579 states have internal predecessors, (883), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:15,958 INFO L74 IsIncluded]: Start isIncluded. First operand 584 states. Second operand has 584 states, 579 states have (on average 1.5250431778929188) internal successors, (883), 579 states have internal predecessors, (883), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:15,958 INFO L87 Difference]: Start difference. First operand 584 states. Second operand has 584 states, 579 states have (on average 1.5250431778929188) internal successors, (883), 579 states have internal predecessors, (883), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:15,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:12:15,970 INFO L93 Difference]: Finished difference Result 584 states and 887 transitions. [2022-04-07 16:12:15,970 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 887 transitions. [2022-04-07 16:12:15,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:12:15,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:12:15,971 INFO L74 IsIncluded]: Start isIncluded. First operand has 584 states, 579 states have (on average 1.5250431778929188) internal successors, (883), 579 states have internal predecessors, (883), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 584 states. [2022-04-07 16:12:15,971 INFO L87 Difference]: Start difference. First operand has 584 states, 579 states have (on average 1.5250431778929188) internal successors, (883), 579 states have internal predecessors, (883), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 584 states. [2022-04-07 16:12:15,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:12:15,981 INFO L93 Difference]: Finished difference Result 584 states and 887 transitions. [2022-04-07 16:12:15,981 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 887 transitions. [2022-04-07 16:12:15,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:12:15,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:12:15,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:12:15,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:12:15,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 579 states have (on average 1.5250431778929188) internal successors, (883), 579 states have internal predecessors, (883), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:15,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 887 transitions. [2022-04-07 16:12:15,994 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 887 transitions. Word has length 132 [2022-04-07 16:12:15,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:12:15,994 INFO L478 AbstractCegarLoop]: Abstraction has 584 states and 887 transitions. [2022-04-07 16:12:15,994 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:15,994 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 887 transitions. [2022-04-07 16:12:15,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-07 16:12:15,995 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:12:15,995 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:12:15,995 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-07 16:12:15,995 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:12:15,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:12:15,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1803828749, now seen corresponding path program 1 times [2022-04-07 16:12:15,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:12:15,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497659295] [2022-04-07 16:12:15,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:12:15,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:12:16,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:12:16,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:12:16,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:12:16,350 INFO L290 TraceCheckUtils]: 0: Hoare triple {42926#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {42917#true} is VALID [2022-04-07 16:12:16,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {42917#true} assume true; {42917#true} is VALID [2022-04-07 16:12:16,350 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42917#true} {42917#true} #664#return; {42917#true} is VALID [2022-04-07 16:12:16,351 INFO L272 TraceCheckUtils]: 0: Hoare triple {42917#true} call ULTIMATE.init(); {42926#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:12:16,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {42926#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {42917#true} is VALID [2022-04-07 16:12:16,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {42917#true} assume true; {42917#true} is VALID [2022-04-07 16:12:16,351 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42917#true} {42917#true} #664#return; {42917#true} is VALID [2022-04-07 16:12:16,351 INFO L272 TraceCheckUtils]: 4: Hoare triple {42917#true} call #t~ret162 := main(); {42917#true} is VALID [2022-04-07 16:12:16,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {42917#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 52 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {42917#true} is VALID [2022-04-07 16:12:16,352 INFO L290 TraceCheckUtils]: 6: Hoare triple {42917#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {42922#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 136)) 0) (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 136)) 0))} is VALID [2022-04-07 16:12:16,352 INFO L272 TraceCheckUtils]: 7: Hoare triple {42922#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 136)) 0) (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 136)) 0))} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {42923#(and (= (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ |ssl3_accept_#in~s.offset| 136)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ |ssl3_accept_#in~s.offset| 136))))} is VALID [2022-04-07 16:12:16,354 INFO L290 TraceCheckUtils]: 8: Hoare triple {42923#(and (= (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ |ssl3_accept_#in~s.offset| 136)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ |ssl3_accept_#in~s.offset| 136))))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet31 % 4294967296 % 4294967296 else #t~nondet31 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {42924#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} is VALID [2022-04-07 16:12:16,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {42924#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 4294967296;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {42924#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} is VALID [2022-04-07 16:12:16,355 INFO L290 TraceCheckUtils]: 10: Hoare triple {42924#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} call #t~mem39 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 28 + ~s.offset, 4);havoc #t~mem39; {42924#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} is VALID [2022-04-07 16:12:16,356 INFO L290 TraceCheckUtils]: 11: Hoare triple {42924#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {42924#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} is VALID [2022-04-07 16:12:16,356 INFO L290 TraceCheckUtils]: 12: Hoare triple {42924#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {42925#(and (= |ssl3_accept_#t~mem40.base| 0) (= |ssl3_accept_#t~mem40.offset| 0))} is VALID [2022-04-07 16:12:16,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {42925#(and (= |ssl3_accept_#t~mem40.base| 0) (= |ssl3_accept_#t~mem40.offset| 0))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 4294967296);havoc #t~mem40.base, #t~mem40.offset; {42918#false} is VALID [2022-04-07 16:12:16,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {42918#false} assume !false; {42918#false} is VALID [2022-04-07 16:12:16,356 INFO L290 TraceCheckUtils]: 15: Hoare triple {42918#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,357 INFO L290 TraceCheckUtils]: 16: Hoare triple {42918#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,357 INFO L290 TraceCheckUtils]: 17: Hoare triple {42918#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,357 INFO L290 TraceCheckUtils]: 18: Hoare triple {42918#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,357 INFO L290 TraceCheckUtils]: 19: Hoare triple {42918#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,357 INFO L290 TraceCheckUtils]: 20: Hoare triple {42918#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,357 INFO L290 TraceCheckUtils]: 21: Hoare triple {42918#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,357 INFO L290 TraceCheckUtils]: 22: Hoare triple {42918#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,357 INFO L290 TraceCheckUtils]: 23: Hoare triple {42918#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,357 INFO L290 TraceCheckUtils]: 24: Hoare triple {42918#false} assume 8464 == #t~mem50;havoc #t~mem50; {42918#false} is VALID [2022-04-07 16:12:16,357 INFO L290 TraceCheckUtils]: 25: Hoare triple {42918#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {42918#false} is VALID [2022-04-07 16:12:16,357 INFO L290 TraceCheckUtils]: 26: Hoare triple {42918#false} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {42918#false} is VALID [2022-04-07 16:12:16,357 INFO L290 TraceCheckUtils]: 27: Hoare triple {42918#false} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,357 INFO L290 TraceCheckUtils]: 28: Hoare triple {42918#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,357 INFO L290 TraceCheckUtils]: 29: Hoare triple {42918#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {42918#false} is VALID [2022-04-07 16:12:16,357 INFO L290 TraceCheckUtils]: 30: Hoare triple {42918#false} ~skip~0 := 0; {42918#false} is VALID [2022-04-07 16:12:16,357 INFO L290 TraceCheckUtils]: 31: Hoare triple {42918#false} assume !false; {42918#false} is VALID [2022-04-07 16:12:16,357 INFO L290 TraceCheckUtils]: 32: Hoare triple {42918#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,357 INFO L290 TraceCheckUtils]: 33: Hoare triple {42918#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,357 INFO L290 TraceCheckUtils]: 34: Hoare triple {42918#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,357 INFO L290 TraceCheckUtils]: 35: Hoare triple {42918#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,357 INFO L290 TraceCheckUtils]: 36: Hoare triple {42918#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,358 INFO L290 TraceCheckUtils]: 37: Hoare triple {42918#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,358 INFO L290 TraceCheckUtils]: 38: Hoare triple {42918#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,358 INFO L290 TraceCheckUtils]: 39: Hoare triple {42918#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,358 INFO L290 TraceCheckUtils]: 40: Hoare triple {42918#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,358 INFO L290 TraceCheckUtils]: 41: Hoare triple {42918#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,358 INFO L290 TraceCheckUtils]: 42: Hoare triple {42918#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,358 INFO L290 TraceCheckUtils]: 43: Hoare triple {42918#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,358 INFO L290 TraceCheckUtils]: 44: Hoare triple {42918#false} assume 8496 == #t~mem53;havoc #t~mem53; {42918#false} is VALID [2022-04-07 16:12:16,358 INFO L290 TraceCheckUtils]: 45: Hoare triple {42918#false} assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {42918#false} is VALID [2022-04-07 16:12:16,358 INFO L290 TraceCheckUtils]: 46: Hoare triple {42918#false} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {42918#false} is VALID [2022-04-07 16:12:16,358 INFO L290 TraceCheckUtils]: 47: Hoare triple {42918#false} assume !(~ret~0 <= 0);call #t~mem91 := read~int(~s.base, 92 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,358 INFO L290 TraceCheckUtils]: 48: Hoare triple {42918#false} assume 0 != #t~mem91;havoc #t~mem91;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,358 INFO L290 TraceCheckUtils]: 49: Hoare triple {42918#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,358 INFO L290 TraceCheckUtils]: 50: Hoare triple {42918#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,358 INFO L290 TraceCheckUtils]: 51: Hoare triple {42918#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {42918#false} is VALID [2022-04-07 16:12:16,358 INFO L290 TraceCheckUtils]: 52: Hoare triple {42918#false} ~skip~0 := 0; {42918#false} is VALID [2022-04-07 16:12:16,358 INFO L290 TraceCheckUtils]: 53: Hoare triple {42918#false} assume !false; {42918#false} is VALID [2022-04-07 16:12:16,358 INFO L290 TraceCheckUtils]: 54: Hoare triple {42918#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,358 INFO L290 TraceCheckUtils]: 55: Hoare triple {42918#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,358 INFO L290 TraceCheckUtils]: 56: Hoare triple {42918#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,358 INFO L290 TraceCheckUtils]: 57: Hoare triple {42918#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,359 INFO L290 TraceCheckUtils]: 58: Hoare triple {42918#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,359 INFO L290 TraceCheckUtils]: 59: Hoare triple {42918#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,359 INFO L290 TraceCheckUtils]: 60: Hoare triple {42918#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,359 INFO L290 TraceCheckUtils]: 61: Hoare triple {42918#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,359 INFO L290 TraceCheckUtils]: 62: Hoare triple {42918#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,359 INFO L290 TraceCheckUtils]: 63: Hoare triple {42918#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,359 INFO L290 TraceCheckUtils]: 64: Hoare triple {42918#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,359 INFO L290 TraceCheckUtils]: 65: Hoare triple {42918#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,359 INFO L290 TraceCheckUtils]: 66: Hoare triple {42918#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,359 INFO L290 TraceCheckUtils]: 67: Hoare triple {42918#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,359 INFO L290 TraceCheckUtils]: 68: Hoare triple {42918#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,359 INFO L290 TraceCheckUtils]: 69: Hoare triple {42918#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,359 INFO L290 TraceCheckUtils]: 70: Hoare triple {42918#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,359 INFO L290 TraceCheckUtils]: 71: Hoare triple {42918#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,359 INFO L290 TraceCheckUtils]: 72: Hoare triple {42918#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,359 INFO L290 TraceCheckUtils]: 73: Hoare triple {42918#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,359 INFO L290 TraceCheckUtils]: 74: Hoare triple {42918#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,359 INFO L290 TraceCheckUtils]: 75: Hoare triple {42918#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,359 INFO L290 TraceCheckUtils]: 76: Hoare triple {42918#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,359 INFO L290 TraceCheckUtils]: 77: Hoare triple {42918#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,360 INFO L290 TraceCheckUtils]: 78: Hoare triple {42918#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,360 INFO L290 TraceCheckUtils]: 79: Hoare triple {42918#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,360 INFO L290 TraceCheckUtils]: 80: Hoare triple {42918#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,360 INFO L290 TraceCheckUtils]: 81: Hoare triple {42918#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,360 INFO L290 TraceCheckUtils]: 82: Hoare triple {42918#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,360 INFO L290 TraceCheckUtils]: 83: Hoare triple {42918#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,360 INFO L290 TraceCheckUtils]: 84: Hoare triple {42918#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,360 INFO L290 TraceCheckUtils]: 85: Hoare triple {42918#false} assume 8656 == #t~mem72;havoc #t~mem72; {42918#false} is VALID [2022-04-07 16:12:16,360 INFO L290 TraceCheckUtils]: 86: Hoare triple {42918#false} call #t~mem139.base, #t~mem139.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(#t~mem140.base, 836 + #t~mem140.offset, 4);call write~$Pointer$(#t~mem141.base, #t~mem141.offset, #t~mem139.base, 172 + #t~mem139.offset, 4);havoc #t~mem139.base, #t~mem139.offset;havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;assume -2147483648 <= #t~nondet142 && #t~nondet142 <= 2147483647;~tmp___9~0 := #t~nondet142;havoc #t~nondet142; {42918#false} is VALID [2022-04-07 16:12:16,360 INFO L290 TraceCheckUtils]: 87: Hoare triple {42918#false} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {42918#false} is VALID [2022-04-07 16:12:16,360 INFO L290 TraceCheckUtils]: 88: Hoare triple {42918#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 5; {42918#false} is VALID [2022-04-07 16:12:16,360 INFO L290 TraceCheckUtils]: 89: Hoare triple {42918#false} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~tmp___10~0 := #t~nondet144;havoc #t~nondet144; {42918#false} is VALID [2022-04-07 16:12:16,360 INFO L290 TraceCheckUtils]: 90: Hoare triple {42918#false} assume !(0 == ~tmp___10~0); {42918#false} is VALID [2022-04-07 16:12:16,360 INFO L290 TraceCheckUtils]: 91: Hoare triple {42918#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem152 := read~int(#t~mem151.base, 848 + #t~mem151.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,360 INFO L290 TraceCheckUtils]: 92: Hoare triple {42918#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {42918#false} is VALID [2022-04-07 16:12:16,360 INFO L290 TraceCheckUtils]: 93: Hoare triple {42918#false} ~skip~0 := 0; {42918#false} is VALID [2022-04-07 16:12:16,360 INFO L290 TraceCheckUtils]: 94: Hoare triple {42918#false} assume !false; {42918#false} is VALID [2022-04-07 16:12:16,360 INFO L290 TraceCheckUtils]: 95: Hoare triple {42918#false} call #t~mem41 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,360 INFO L290 TraceCheckUtils]: 96: Hoare triple {42918#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,360 INFO L290 TraceCheckUtils]: 97: Hoare triple {42918#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,360 INFO L290 TraceCheckUtils]: 98: Hoare triple {42918#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,361 INFO L290 TraceCheckUtils]: 99: Hoare triple {42918#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,361 INFO L290 TraceCheckUtils]: 100: Hoare triple {42918#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,361 INFO L290 TraceCheckUtils]: 101: Hoare triple {42918#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,361 INFO L290 TraceCheckUtils]: 102: Hoare triple {42918#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,361 INFO L290 TraceCheckUtils]: 103: Hoare triple {42918#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,361 INFO L290 TraceCheckUtils]: 104: Hoare triple {42918#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,361 INFO L290 TraceCheckUtils]: 105: Hoare triple {42918#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,361 INFO L290 TraceCheckUtils]: 106: Hoare triple {42918#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,361 INFO L290 TraceCheckUtils]: 107: Hoare triple {42918#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,361 INFO L290 TraceCheckUtils]: 108: Hoare triple {42918#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,361 INFO L290 TraceCheckUtils]: 109: Hoare triple {42918#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,361 INFO L290 TraceCheckUtils]: 110: Hoare triple {42918#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,361 INFO L290 TraceCheckUtils]: 111: Hoare triple {42918#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,361 INFO L290 TraceCheckUtils]: 112: Hoare triple {42918#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,361 INFO L290 TraceCheckUtils]: 113: Hoare triple {42918#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,361 INFO L290 TraceCheckUtils]: 114: Hoare triple {42918#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,361 INFO L290 TraceCheckUtils]: 115: Hoare triple {42918#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,361 INFO L290 TraceCheckUtils]: 116: Hoare triple {42918#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,361 INFO L290 TraceCheckUtils]: 117: Hoare triple {42918#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,361 INFO L290 TraceCheckUtils]: 118: Hoare triple {42918#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,361 INFO L290 TraceCheckUtils]: 119: Hoare triple {42918#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,362 INFO L290 TraceCheckUtils]: 120: Hoare triple {42918#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,362 INFO L290 TraceCheckUtils]: 121: Hoare triple {42918#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,362 INFO L290 TraceCheckUtils]: 122: Hoare triple {42918#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,362 INFO L290 TraceCheckUtils]: 123: Hoare triple {42918#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,362 INFO L290 TraceCheckUtils]: 124: Hoare triple {42918#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,362 INFO L290 TraceCheckUtils]: 125: Hoare triple {42918#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,362 INFO L290 TraceCheckUtils]: 126: Hoare triple {42918#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,362 INFO L290 TraceCheckUtils]: 127: Hoare triple {42918#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {42918#false} is VALID [2022-04-07 16:12:16,362 INFO L290 TraceCheckUtils]: 128: Hoare triple {42918#false} assume 8672 == #t~mem74;havoc #t~mem74; {42918#false} is VALID [2022-04-07 16:12:16,362 INFO L290 TraceCheckUtils]: 129: Hoare triple {42918#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {42918#false} is VALID [2022-04-07 16:12:16,362 INFO L290 TraceCheckUtils]: 130: Hoare triple {42918#false} assume !(4 == ~blastFlag~0); {42918#false} is VALID [2022-04-07 16:12:16,362 INFO L290 TraceCheckUtils]: 131: Hoare triple {42918#false} assume 5 == ~blastFlag~0; {42918#false} is VALID [2022-04-07 16:12:16,362 INFO L290 TraceCheckUtils]: 132: Hoare triple {42918#false} assume !false; {42918#false} is VALID [2022-04-07 16:12:16,362 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-04-07 16:12:16,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:12:16,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497659295] [2022-04-07 16:12:16,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497659295] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:12:16,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:12:16,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-07 16:12:16,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522832021] [2022-04-07 16:12:16,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:12:16,363 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 133 [2022-04-07 16:12:16,363 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:12:16,363 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:16,421 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-07 16:12:16,421 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 16:12:16,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:12:16,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 16:12:16,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-07 16:12:16,421 INFO L87 Difference]: Start difference. First operand 584 states and 887 transitions. Second operand has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:18,450 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-07 16:12:19,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:12:19,750 INFO L93 Difference]: Finished difference Result 1161 states and 1766 transitions. [2022-04-07 16:12:19,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 16:12:19,750 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 133 [2022-04-07 16:12:19,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:12:19,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:19,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 404 transitions. [2022-04-07 16:12:19,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:19,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 404 transitions. [2022-04-07 16:12:19,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 404 transitions. [2022-04-07 16:12:20,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 404 edges. 404 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:12:20,026 INFO L225 Difference]: With dead ends: 1161 [2022-04-07 16:12:20,026 INFO L226 Difference]: Without dead ends: 584 [2022-04-07 16:12:20,027 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-07 16:12:20,028 INFO L913 BasicCegarLoop]: 200 mSDtfsCounter, 7 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-07 16:12:20,028 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 796 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 430 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-07 16:12:20,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2022-04-07 16:12:20,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2022-04-07 16:12:20,072 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:12:20,073 INFO L82 GeneralOperation]: Start isEquivalent. First operand 584 states. Second operand has 584 states, 579 states have (on average 1.5233160621761659) internal successors, (882), 579 states have internal predecessors, (882), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:20,073 INFO L74 IsIncluded]: Start isIncluded. First operand 584 states. Second operand has 584 states, 579 states have (on average 1.5233160621761659) internal successors, (882), 579 states have internal predecessors, (882), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:20,074 INFO L87 Difference]: Start difference. First operand 584 states. Second operand has 584 states, 579 states have (on average 1.5233160621761659) internal successors, (882), 579 states have internal predecessors, (882), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:20,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:12:20,084 INFO L93 Difference]: Finished difference Result 584 states and 886 transitions. [2022-04-07 16:12:20,084 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 886 transitions. [2022-04-07 16:12:20,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:12:20,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:12:20,085 INFO L74 IsIncluded]: Start isIncluded. First operand has 584 states, 579 states have (on average 1.5233160621761659) internal successors, (882), 579 states have internal predecessors, (882), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 584 states. [2022-04-07 16:12:20,086 INFO L87 Difference]: Start difference. First operand has 584 states, 579 states have (on average 1.5233160621761659) internal successors, (882), 579 states have internal predecessors, (882), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 584 states. [2022-04-07 16:12:20,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:12:20,096 INFO L93 Difference]: Finished difference Result 584 states and 886 transitions. [2022-04-07 16:12:20,096 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 886 transitions. [2022-04-07 16:12:20,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:12:20,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:12:20,097 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:12:20,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:12:20,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 579 states have (on average 1.5233160621761659) internal successors, (882), 579 states have internal predecessors, (882), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:20,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 886 transitions. [2022-04-07 16:12:20,108 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 886 transitions. Word has length 133 [2022-04-07 16:12:20,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:12:20,109 INFO L478 AbstractCegarLoop]: Abstraction has 584 states and 886 transitions. [2022-04-07 16:12:20,109 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:12:20,109 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 886 transitions. [2022-04-07 16:12:20,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-07 16:12:20,110 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:12:20,110 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:12:20,110 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-07 16:12:20,111 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:12:20,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:12:20,111 INFO L85 PathProgramCache]: Analyzing trace with hash 2056632949, now seen corresponding path program 1 times [2022-04-07 16:12:20,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:12:20,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443082837] [2022-04-07 16:12:20,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:12:20,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:12:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-07 16:12:20,457 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-07 16:12:20,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-07 16:12:20,628 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-07 16:12:20,628 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-07 16:12:20,628 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 16:12:20,630 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-07 16:12:20,631 INFO L719 BasicCegarLoop]: Path program 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] [2022-04-07 16:12:20,633 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 16:12:20,728 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-07 16:12:20,728 WARN L170 areAnnotationChecker]: SSLv3_server_methodENTRY has no Hoare annotation [2022-04-07 16:12:20,728 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-07 16:12:20,728 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-07 16:12:20,728 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-07 16:12:20,728 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-07 16:12:20,728 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyENTRY has no Hoare annotation [2022-04-07 16:12:20,728 WARN L170 areAnnotationChecker]: sslv3_base_methodENTRY has no Hoare annotation [2022-04-07 16:12:20,729 WARN L170 areAnnotationChecker]: #Ultimate.meminitENTRY has no Hoare annotation [2022-04-07 16:12:20,729 WARN L170 areAnnotationChecker]: ssl3_acceptENTRY has no Hoare annotation [2022-04-07 16:12:20,729 WARN L170 areAnnotationChecker]: ssl3_get_server_methodENTRY has no Hoare annotation [2022-04-07 16:12:20,729 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-07 16:12:20,729 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-07 16:12:20,729 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-07 16:12:20,729 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 16:12:20,729 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-07 16:12:20,729 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-07 16:12:20,729 WARN L170 areAnnotationChecker]: L1096 has no Hoare annotation [2022-04-07 16:12:20,729 WARN L170 areAnnotationChecker]: L1096 has no Hoare annotation [2022-04-07 16:12:20,729 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-07 16:12:20,729 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-07 16:12:20,729 WARN L170 areAnnotationChecker]: L1747 has no Hoare annotation [2022-04-07 16:12:20,729 WARN L170 areAnnotationChecker]: L1747 has no Hoare annotation [2022-04-07 16:12:20,729 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2022-04-07 16:12:20,729 WARN L170 areAnnotationChecker]: L1145 has no Hoare annotation [2022-04-07 16:12:20,729 WARN L170 areAnnotationChecker]: L1145 has no Hoare annotation [2022-04-07 16:12:20,729 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-07 16:12:20,729 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-07 16:12:20,729 WARN L170 areAnnotationChecker]: L1063 has no Hoare annotation [2022-04-07 16:12:20,729 WARN L170 areAnnotationChecker]: L1063 has no Hoare annotation [2022-04-07 16:12:20,729 WARN L170 areAnnotationChecker]: L1061-2 has no Hoare annotation [2022-04-07 16:12:20,729 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-07 16:12:20,729 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 16:12:20,729 WARN L170 areAnnotationChecker]: L1096-2 has no Hoare annotation [2022-04-07 16:12:20,730 WARN L170 areAnnotationChecker]: L1096-2 has no Hoare annotation [2022-04-07 16:12:20,730 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-07 16:12:20,730 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-07 16:12:20,730 WARN L170 areAnnotationChecker]: L1747-1 has no Hoare annotation [2022-04-07 16:12:20,730 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2022-04-07 16:12:20,730 WARN L170 areAnnotationChecker]: L1145-2 has no Hoare annotation [2022-04-07 16:12:20,730 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-07 16:12:20,730 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-07 16:12:20,730 WARN L170 areAnnotationChecker]: ssl3_get_server_methodFINAL has no Hoare annotation [2022-04-07 16:12:20,730 WARN L170 areAnnotationChecker]: L1063-1 has no Hoare annotation [2022-04-07 16:12:20,730 WARN L170 areAnnotationChecker]: SSLv3_server_methodFINAL has no Hoare annotation [2022-04-07 16:12:20,730 WARN L170 areAnnotationChecker]: L1106 has no Hoare annotation [2022-04-07 16:12:20,730 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyFINAL has no Hoare annotation [2022-04-07 16:12:20,730 WARN L170 areAnnotationChecker]: sslv3_base_methodFINAL has no Hoare annotation [2022-04-07 16:12:20,730 WARN L170 areAnnotationChecker]: L1151 has no Hoare annotation [2022-04-07 16:12:20,730 WARN L170 areAnnotationChecker]: L1151 has no Hoare annotation [2022-04-07 16:12:20,730 WARN L170 areAnnotationChecker]: L1046-1 has no Hoare annotation [2022-04-07 16:12:20,730 WARN L170 areAnnotationChecker]: L1065 has no Hoare annotation [2022-04-07 16:12:20,730 WARN L170 areAnnotationChecker]: L1065 has no Hoare annotation [2022-04-07 16:12:20,730 WARN L170 areAnnotationChecker]: SSLv3_server_methodEXIT has no Hoare annotation [2022-04-07 16:12:20,730 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 16:12:20,730 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyEXIT has no Hoare annotation [2022-04-07 16:12:20,730 WARN L170 areAnnotationChecker]: sslv3_base_methodEXIT has no Hoare annotation [2022-04-07 16:12:20,730 WARN L170 areAnnotationChecker]: L1152 has no Hoare annotation [2022-04-07 16:12:20,730 WARN L170 areAnnotationChecker]: L1152 has no Hoare annotation [2022-04-07 16:12:20,730 WARN L170 areAnnotationChecker]: L1151-1 has no Hoare annotation [2022-04-07 16:12:20,730 WARN L170 areAnnotationChecker]: L1065-1 has no Hoare annotation [2022-04-07 16:12:20,730 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-07 16:12:20,730 WARN L170 areAnnotationChecker]: L1160 has no Hoare annotation [2022-04-07 16:12:20,730 WARN L170 areAnnotationChecker]: L1160 has no Hoare annotation [2022-04-07 16:12:20,730 WARN L170 areAnnotationChecker]: ssl3_acceptFINAL has no Hoare annotation [2022-04-07 16:12:20,730 WARN L170 areAnnotationChecker]: L1166-2 has no Hoare annotation [2022-04-07 16:12:20,730 WARN L170 areAnnotationChecker]: L1166-2 has no Hoare annotation [2022-04-07 16:12:20,731 WARN L170 areAnnotationChecker]: L1166-2 has no Hoare annotation [2022-04-07 16:12:20,731 WARN L170 areAnnotationChecker]: ssl3_acceptEXIT has no Hoare annotation [2022-04-07 16:12:20,731 WARN L170 areAnnotationChecker]: L1727 has no Hoare annotation [2022-04-07 16:12:20,731 WARN L170 areAnnotationChecker]: L1167 has no Hoare annotation [2022-04-07 16:12:20,731 WARN L170 areAnnotationChecker]: L1731 has no Hoare annotation [2022-04-07 16:12:20,731 WARN L170 areAnnotationChecker]: L1731 has no Hoare annotation [2022-04-07 16:12:20,731 WARN L170 areAnnotationChecker]: L1169 has no Hoare annotation [2022-04-07 16:12:20,731 WARN L170 areAnnotationChecker]: L1169 has no Hoare annotation [2022-04-07 16:12:20,731 WARN L170 areAnnotationChecker]: L1731-2 has no Hoare annotation [2022-04-07 16:12:20,731 WARN L170 areAnnotationChecker]: L1170 has no Hoare annotation [2022-04-07 16:12:20,731 WARN L170 areAnnotationChecker]: L1172 has no Hoare annotation [2022-04-07 16:12:20,731 WARN L170 areAnnotationChecker]: L1172 has no Hoare annotation [2022-04-07 16:12:20,731 WARN L170 areAnnotationChecker]: L1279 has no Hoare annotation [2022-04-07 16:12:20,731 WARN L170 areAnnotationChecker]: L1175 has no Hoare annotation [2022-04-07 16:12:20,731 WARN L170 areAnnotationChecker]: L1175 has no Hoare annotation [2022-04-07 16:12:20,731 WARN L170 areAnnotationChecker]: L1284 has no Hoare annotation [2022-04-07 16:12:20,731 WARN L170 areAnnotationChecker]: L1284 has no Hoare annotation [2022-04-07 16:12:20,731 WARN L170 areAnnotationChecker]: L1178 has no Hoare annotation [2022-04-07 16:12:20,731 WARN L170 areAnnotationChecker]: L1178 has no Hoare annotation [2022-04-07 16:12:20,731 WARN L170 areAnnotationChecker]: L1284-2 has no Hoare annotation [2022-04-07 16:12:20,731 WARN L170 areAnnotationChecker]: L1181 has no Hoare annotation [2022-04-07 16:12:20,731 WARN L170 areAnnotationChecker]: L1181 has no Hoare annotation [2022-04-07 16:12:20,731 WARN L170 areAnnotationChecker]: L1289 has no Hoare annotation [2022-04-07 16:12:20,731 WARN L170 areAnnotationChecker]: L1289 has no Hoare annotation [2022-04-07 16:12:20,731 WARN L170 areAnnotationChecker]: L1184 has no Hoare annotation [2022-04-07 16:12:20,731 WARN L170 areAnnotationChecker]: L1184 has no Hoare annotation [2022-04-07 16:12:20,731 WARN L170 areAnnotationChecker]: L1295 has no Hoare annotation [2022-04-07 16:12:20,731 WARN L170 areAnnotationChecker]: L1295 has no Hoare annotation [2022-04-07 16:12:20,731 WARN L170 areAnnotationChecker]: L1188 has no Hoare annotation [2022-04-07 16:12:20,731 WARN L170 areAnnotationChecker]: L1187 has no Hoare annotation [2022-04-07 16:12:20,731 WARN L170 areAnnotationChecker]: L1187 has no Hoare annotation [2022-04-07 16:12:20,731 WARN L170 areAnnotationChecker]: L1297 has no Hoare annotation [2022-04-07 16:12:20,731 WARN L170 areAnnotationChecker]: L1297 has no Hoare annotation [2022-04-07 16:12:20,731 WARN L170 areAnnotationChecker]: L1295-2 has no Hoare annotation [2022-04-07 16:12:20,731 WARN L170 areAnnotationChecker]: L1334 has no Hoare annotation [2022-04-07 16:12:20,732 WARN L170 areAnnotationChecker]: L1334 has no Hoare annotation [2022-04-07 16:12:20,732 WARN L170 areAnnotationChecker]: L1190 has no Hoare annotation [2022-04-07 16:12:20,732 WARN L170 areAnnotationChecker]: L1190 has no Hoare annotation [2022-04-07 16:12:20,732 WARN L170 areAnnotationChecker]: L1308 has no Hoare annotation [2022-04-07 16:12:20,732 WARN L170 areAnnotationChecker]: L1308 has no Hoare annotation [2022-04-07 16:12:20,732 WARN L170 areAnnotationChecker]: L1658 has no Hoare annotation [2022-04-07 16:12:20,732 WARN L170 areAnnotationChecker]: L1191 has no Hoare annotation [2022-04-07 16:12:20,732 WARN L170 areAnnotationChecker]: L1193 has no Hoare annotation [2022-04-07 16:12:20,732 WARN L170 areAnnotationChecker]: L1193 has no Hoare annotation [2022-04-07 16:12:20,732 WARN L170 areAnnotationChecker]: L1315 has no Hoare annotation [2022-04-07 16:12:20,732 WARN L170 areAnnotationChecker]: L1315 has no Hoare annotation [2022-04-07 16:12:20,732 WARN L170 areAnnotationChecker]: L1696 has no Hoare annotation [2022-04-07 16:12:20,732 WARN L170 areAnnotationChecker]: L1696 has no Hoare annotation [2022-04-07 16:12:20,732 WARN L170 areAnnotationChecker]: L1200 has no Hoare annotation [2022-04-07 16:12:20,732 WARN L170 areAnnotationChecker]: L1196 has no Hoare annotation [2022-04-07 16:12:20,732 WARN L170 areAnnotationChecker]: L1196 has no Hoare annotation [2022-04-07 16:12:20,732 WARN L170 areAnnotationChecker]: L1317 has no Hoare annotation [2022-04-07 16:12:20,732 WARN L170 areAnnotationChecker]: L1317 has no Hoare annotation [2022-04-07 16:12:20,732 WARN L170 areAnnotationChecker]: L1697 has no Hoare annotation [2022-04-07 16:12:20,732 WARN L170 areAnnotationChecker]: L1697 has no Hoare annotation [2022-04-07 16:12:20,732 WARN L170 areAnnotationChecker]: L1696-1 has no Hoare annotation [2022-04-07 16:12:20,732 WARN L170 areAnnotationChecker]: L1351 has no Hoare annotation [2022-04-07 16:12:20,732 WARN L170 areAnnotationChecker]: L1351 has no Hoare annotation [2022-04-07 16:12:20,732 WARN L170 areAnnotationChecker]: L1199 has no Hoare annotation [2022-04-07 16:12:20,732 WARN L170 areAnnotationChecker]: L1199 has no Hoare annotation [2022-04-07 16:12:20,732 WARN L170 areAnnotationChecker]: L1698 has no Hoare annotation [2022-04-07 16:12:20,732 WARN L170 areAnnotationChecker]: L1698 has no Hoare annotation [2022-04-07 16:12:20,732 WARN L170 areAnnotationChecker]: L1351-2 has no Hoare annotation [2022-04-07 16:12:20,732 WARN L170 areAnnotationChecker]: L1351-2 has no Hoare annotation [2022-04-07 16:12:20,732 WARN L170 areAnnotationChecker]: L1202 has no Hoare annotation [2022-04-07 16:12:20,732 WARN L170 areAnnotationChecker]: L1202 has no Hoare annotation [2022-04-07 16:12:20,732 WARN L170 areAnnotationChecker]: L1700 has no Hoare annotation [2022-04-07 16:12:20,732 WARN L170 areAnnotationChecker]: L1700 has no Hoare annotation [2022-04-07 16:12:20,732 WARN L170 areAnnotationChecker]: L1698-2 has no Hoare annotation [2022-04-07 16:12:20,732 WARN L170 areAnnotationChecker]: L1698-2 has no Hoare annotation [2022-04-07 16:12:20,733 WARN L170 areAnnotationChecker]: L1206 has no Hoare annotation [2022-04-07 16:12:20,733 WARN L170 areAnnotationChecker]: L1205 has no Hoare annotation [2022-04-07 16:12:20,733 WARN L170 areAnnotationChecker]: L1205 has no Hoare annotation [2022-04-07 16:12:20,733 WARN L170 areAnnotationChecker]: L1709 has no Hoare annotation [2022-04-07 16:12:20,733 WARN L170 areAnnotationChecker]: L1709 has no Hoare annotation [2022-04-07 16:12:20,733 WARN L170 areAnnotationChecker]: L1368 has no Hoare annotation [2022-04-07 16:12:20,733 WARN L170 areAnnotationChecker]: L1368 has no Hoare annotation [2022-04-07 16:12:20,733 WARN L170 areAnnotationChecker]: L1208 has no Hoare annotation [2022-04-07 16:12:20,733 WARN L170 areAnnotationChecker]: L1208 has no Hoare annotation [2022-04-07 16:12:20,733 WARN L170 areAnnotationChecker]: L1368-2 has no Hoare annotation [2022-04-07 16:12:20,733 WARN L170 areAnnotationChecker]: L1368-2 has no Hoare annotation [2022-04-07 16:12:20,733 WARN L170 areAnnotationChecker]: L1212 has no Hoare annotation [2022-04-07 16:12:20,733 WARN L170 areAnnotationChecker]: L1211 has no Hoare annotation [2022-04-07 16:12:20,733 WARN L170 areAnnotationChecker]: L1211 has no Hoare annotation [2022-04-07 16:12:20,733 WARN L170 areAnnotationChecker]: L1378 has no Hoare annotation [2022-04-07 16:12:20,733 WARN L170 areAnnotationChecker]: L1378 has no Hoare annotation [2022-04-07 16:12:20,733 WARN L170 areAnnotationChecker]: L1387 has no Hoare annotation [2022-04-07 16:12:20,733 WARN L170 areAnnotationChecker]: L1387 has no Hoare annotation [2022-04-07 16:12:20,733 WARN L170 areAnnotationChecker]: L1214 has no Hoare annotation [2022-04-07 16:12:20,733 WARN L170 areAnnotationChecker]: L1214 has no Hoare annotation [2022-04-07 16:12:20,733 WARN L170 areAnnotationChecker]: L1378-2 has no Hoare annotation [2022-04-07 16:12:20,733 WARN L170 areAnnotationChecker]: L1387-2 has no Hoare annotation [2022-04-07 16:12:20,733 WARN L170 areAnnotationChecker]: L1391 has no Hoare annotation [2022-04-07 16:12:20,733 WARN L170 areAnnotationChecker]: L1391 has no Hoare annotation [2022-04-07 16:12:20,733 WARN L170 areAnnotationChecker]: L1218 has no Hoare annotation [2022-04-07 16:12:20,733 WARN L170 areAnnotationChecker]: L1217 has no Hoare annotation [2022-04-07 16:12:20,733 WARN L170 areAnnotationChecker]: L1217 has no Hoare annotation [2022-04-07 16:12:20,733 WARN L170 areAnnotationChecker]: L1403 has no Hoare annotation [2022-04-07 16:12:20,733 WARN L170 areAnnotationChecker]: L1403 has no Hoare annotation [2022-04-07 16:12:20,733 WARN L170 areAnnotationChecker]: L1220 has no Hoare annotation [2022-04-07 16:12:20,733 WARN L170 areAnnotationChecker]: L1220 has no Hoare annotation [2022-04-07 16:12:20,733 WARN L170 areAnnotationChecker]: L1403-2 has no Hoare annotation [2022-04-07 16:12:20,733 WARN L170 areAnnotationChecker]: L1224 has no Hoare annotation [2022-04-07 16:12:20,733 WARN L170 areAnnotationChecker]: L1223 has no Hoare annotation [2022-04-07 16:12:20,733 WARN L170 areAnnotationChecker]: L1223 has no Hoare annotation [2022-04-07 16:12:20,734 WARN L170 areAnnotationChecker]: L1408 has no Hoare annotation [2022-04-07 16:12:20,734 WARN L170 areAnnotationChecker]: L1408 has no Hoare annotation [2022-04-07 16:12:20,734 WARN L170 areAnnotationChecker]: L1450 has no Hoare annotation [2022-04-07 16:12:20,734 WARN L170 areAnnotationChecker]: L1450 has no Hoare annotation [2022-04-07 16:12:20,734 WARN L170 areAnnotationChecker]: L1226 has no Hoare annotation [2022-04-07 16:12:20,734 WARN L170 areAnnotationChecker]: L1226 has no Hoare annotation [2022-04-07 16:12:20,734 WARN L170 areAnnotationChecker]: L1426 has no Hoare annotation [2022-04-07 16:12:20,734 WARN L170 areAnnotationChecker]: L1411 has no Hoare annotation [2022-04-07 16:12:20,734 WARN L170 areAnnotationChecker]: L1411 has no Hoare annotation [2022-04-07 16:12:20,734 WARN L170 areAnnotationChecker]: L1451 has no Hoare annotation [2022-04-07 16:12:20,734 WARN L170 areAnnotationChecker]: L1451 has no Hoare annotation [2022-04-07 16:12:20,734 WARN L170 areAnnotationChecker]: L1230 has no Hoare annotation [2022-04-07 16:12:20,734 WARN L170 areAnnotationChecker]: L1229 has no Hoare annotation [2022-04-07 16:12:20,734 WARN L170 areAnnotationChecker]: L1229 has no Hoare annotation [2022-04-07 16:12:20,734 WARN L170 areAnnotationChecker]: L1428 has no Hoare annotation [2022-04-07 16:12:20,734 WARN L170 areAnnotationChecker]: L1428 has no Hoare annotation [2022-04-07 16:12:20,734 WARN L170 areAnnotationChecker]: L1414 has no Hoare annotation [2022-04-07 16:12:20,734 WARN L170 areAnnotationChecker]: L1414 has no Hoare annotation [2022-04-07 16:12:20,734 WARN L170 areAnnotationChecker]: L1452 has no Hoare annotation [2022-04-07 16:12:20,734 WARN L170 areAnnotationChecker]: L1452 has no Hoare annotation [2022-04-07 16:12:20,734 WARN L170 areAnnotationChecker]: L1460 has no Hoare annotation [2022-04-07 16:12:20,734 WARN L170 areAnnotationChecker]: L1492 has no Hoare annotation [2022-04-07 16:12:20,734 WARN L170 areAnnotationChecker]: L1492 has no Hoare annotation [2022-04-07 16:12:20,734 WARN L170 areAnnotationChecker]: L1232 has no Hoare annotation [2022-04-07 16:12:20,734 WARN L170 areAnnotationChecker]: L1232 has no Hoare annotation [2022-04-07 16:12:20,734 WARN L170 areAnnotationChecker]: L1414-1 has no Hoare annotation [2022-04-07 16:12:20,734 WARN L170 areAnnotationChecker]: L1415 has no Hoare annotation [2022-04-07 16:12:20,734 WARN L170 areAnnotationChecker]: L1415 has no Hoare annotation [2022-04-07 16:12:20,734 WARN L170 areAnnotationChecker]: L1461 has no Hoare annotation [2022-04-07 16:12:20,734 WARN L170 areAnnotationChecker]: L1461 has no Hoare annotation [2022-04-07 16:12:20,734 WARN L170 areAnnotationChecker]: L1233 has no Hoare annotation [2022-04-07 16:12:20,734 WARN L170 areAnnotationChecker]: L1235 has no Hoare annotation [2022-04-07 16:12:20,734 WARN L170 areAnnotationChecker]: L1235 has no Hoare annotation [2022-04-07 16:12:20,734 WARN L170 areAnnotationChecker]: L1418 has no Hoare annotation [2022-04-07 16:12:20,734 WARN L170 areAnnotationChecker]: L1418 has no Hoare annotation [2022-04-07 16:12:20,735 WARN L170 areAnnotationChecker]: L1462 has no Hoare annotation [2022-04-07 16:12:20,735 WARN L170 areAnnotationChecker]: L1462 has no Hoare annotation [2022-04-07 16:12:20,735 WARN L170 areAnnotationChecker]: L1470 has no Hoare annotation [2022-04-07 16:12:20,735 WARN L170 areAnnotationChecker]: L1503 has no Hoare annotation [2022-04-07 16:12:20,735 WARN L170 areAnnotationChecker]: L1503 has no Hoare annotation [2022-04-07 16:12:20,735 WARN L170 areAnnotationChecker]: L1239 has no Hoare annotation [2022-04-07 16:12:20,735 WARN L170 areAnnotationChecker]: L1238 has no Hoare annotation [2022-04-07 16:12:20,735 WARN L170 areAnnotationChecker]: L1238 has no Hoare annotation [2022-04-07 16:12:20,735 WARN L170 areAnnotationChecker]: L1420 has no Hoare annotation [2022-04-07 16:12:20,735 WARN L170 areAnnotationChecker]: L1420 has no Hoare annotation [2022-04-07 16:12:20,735 WARN L170 areAnnotationChecker]: L1473 has no Hoare annotation [2022-04-07 16:12:20,735 WARN L170 areAnnotationChecker]: L1473 has no Hoare annotation [2022-04-07 16:12:20,735 WARN L170 areAnnotationChecker]: L1506 has no Hoare annotation [2022-04-07 16:12:20,735 WARN L170 areAnnotationChecker]: L1506 has no Hoare annotation [2022-04-07 16:12:20,735 WARN L170 areAnnotationChecker]: L1503-2 has no Hoare annotation [2022-04-07 16:12:20,735 WARN L170 areAnnotationChecker]: L1521 has no Hoare annotation [2022-04-07 16:12:20,735 WARN L170 areAnnotationChecker]: L1521 has no Hoare annotation [2022-04-07 16:12:20,735 WARN L170 areAnnotationChecker]: L1241 has no Hoare annotation [2022-04-07 16:12:20,735 WARN L170 areAnnotationChecker]: L1241 has no Hoare annotation [2022-04-07 16:12:20,735 WARN L170 areAnnotationChecker]: L1420-2 has no Hoare annotation [2022-04-07 16:12:20,735 WARN L170 areAnnotationChecker]: L1420-2 has no Hoare annotation [2022-04-07 16:12:20,735 WARN L170 areAnnotationChecker]: L1526 has no Hoare annotation [2022-04-07 16:12:20,735 WARN L170 areAnnotationChecker]: L1526 has no Hoare annotation [2022-04-07 16:12:20,735 WARN L170 areAnnotationChecker]: L1245 has no Hoare annotation [2022-04-07 16:12:20,735 WARN L170 areAnnotationChecker]: L1244 has no Hoare annotation [2022-04-07 16:12:20,735 WARN L170 areAnnotationChecker]: L1244 has no Hoare annotation [2022-04-07 16:12:20,735 WARN L170 areAnnotationChecker]: L1530 has no Hoare annotation [2022-04-07 16:12:20,735 WARN L170 areAnnotationChecker]: L1530 has no Hoare annotation [2022-04-07 16:12:20,735 WARN L170 areAnnotationChecker]: L1542 has no Hoare annotation [2022-04-07 16:12:20,736 WARN L170 areAnnotationChecker]: L1542 has no Hoare annotation [2022-04-07 16:12:20,736 WARN L170 areAnnotationChecker]: L1247 has no Hoare annotation [2022-04-07 16:12:20,736 WARN L170 areAnnotationChecker]: L1247 has no Hoare annotation [2022-04-07 16:12:20,736 WARN L170 areAnnotationChecker]: L1251 has no Hoare annotation [2022-04-07 16:12:20,736 WARN L170 areAnnotationChecker]: L1250 has no Hoare annotation [2022-04-07 16:12:20,736 WARN L170 areAnnotationChecker]: L1250 has no Hoare annotation [2022-04-07 16:12:20,736 WARN L170 areAnnotationChecker]: L1553 has no Hoare annotation [2022-04-07 16:12:20,736 WARN L170 areAnnotationChecker]: L1553 has no Hoare annotation [2022-04-07 16:12:20,736 WARN L170 areAnnotationChecker]: L1253 has no Hoare annotation [2022-04-07 16:12:20,736 WARN L170 areAnnotationChecker]: L1253 has no Hoare annotation [2022-04-07 16:12:20,736 WARN L170 areAnnotationChecker]: L1257 has no Hoare annotation [2022-04-07 16:12:20,736 WARN L170 areAnnotationChecker]: L1256 has no Hoare annotation [2022-04-07 16:12:20,736 WARN L170 areAnnotationChecker]: L1256 has no Hoare annotation [2022-04-07 16:12:20,736 WARN L170 areAnnotationChecker]: L1564 has no Hoare annotation [2022-04-07 16:12:20,736 WARN L170 areAnnotationChecker]: L1564 has no Hoare annotation [2022-04-07 16:12:20,736 WARN L170 areAnnotationChecker]: L1259 has no Hoare annotation [2022-04-07 16:12:20,736 WARN L170 areAnnotationChecker]: L1259 has no Hoare annotation [2022-04-07 16:12:20,736 WARN L170 areAnnotationChecker]: L1564-2 has no Hoare annotation [2022-04-07 16:12:20,736 WARN L170 areAnnotationChecker]: L1564-2 has no Hoare annotation [2022-04-07 16:12:20,737 WARN L170 areAnnotationChecker]: L1263 has no Hoare annotation [2022-04-07 16:12:20,737 WARN L170 areAnnotationChecker]: L1262 has no Hoare annotation [2022-04-07 16:12:20,737 WARN L170 areAnnotationChecker]: L1262 has no Hoare annotation [2022-04-07 16:12:20,737 WARN L170 areAnnotationChecker]: L1574 has no Hoare annotation [2022-04-07 16:12:20,737 WARN L170 areAnnotationChecker]: L1574 has no Hoare annotation [2022-04-07 16:12:20,737 WARN L170 areAnnotationChecker]: L1585 has no Hoare annotation [2022-04-07 16:12:20,737 WARN L170 areAnnotationChecker]: L1585 has no Hoare annotation [2022-04-07 16:12:20,737 WARN L170 areAnnotationChecker]: L1265 has no Hoare annotation [2022-04-07 16:12:20,737 WARN L170 areAnnotationChecker]: L1265 has no Hoare annotation [2022-04-07 16:12:20,737 WARN L170 areAnnotationChecker]: L1574-2 has no Hoare annotation [2022-04-07 16:12:20,737 WARN L170 areAnnotationChecker]: L1592 has no Hoare annotation [2022-04-07 16:12:20,737 WARN L170 areAnnotationChecker]: L1592 has no Hoare annotation [2022-04-07 16:12:20,737 WARN L170 areAnnotationChecker]: L1269 has no Hoare annotation [2022-04-07 16:12:20,737 WARN L170 areAnnotationChecker]: L1268 has no Hoare annotation [2022-04-07 16:12:20,737 WARN L170 areAnnotationChecker]: L1268 has no Hoare annotation [2022-04-07 16:12:20,737 WARN L170 areAnnotationChecker]: L1592-2 has no Hoare annotation [2022-04-07 16:12:20,737 WARN L170 areAnnotationChecker]: L1592-2 has no Hoare annotation [2022-04-07 16:12:20,737 WARN L170 areAnnotationChecker]: L1615 has no Hoare annotation [2022-04-07 16:12:20,737 WARN L170 areAnnotationChecker]: L1615 has no Hoare annotation [2022-04-07 16:12:20,737 WARN L170 areAnnotationChecker]: L1271 has no Hoare annotation [2022-04-07 16:12:20,737 WARN L170 areAnnotationChecker]: L1271 has no Hoare annotation [2022-04-07 16:12:20,737 WARN L170 areAnnotationChecker]: L1605 has no Hoare annotation [2022-04-07 16:12:20,737 WARN L170 areAnnotationChecker]: L1605 has no Hoare annotation [2022-04-07 16:12:20,737 WARN L170 areAnnotationChecker]: L1619 has no Hoare annotation [2022-04-07 16:12:20,738 WARN L170 areAnnotationChecker]: L1619 has no Hoare annotation [2022-04-07 16:12:20,738 WARN L170 areAnnotationChecker]: L1618 has no Hoare annotation [2022-04-07 16:12:20,738 WARN L170 areAnnotationChecker]: L1618 has no Hoare annotation [2022-04-07 16:12:20,738 WARN L170 areAnnotationChecker]: L1272 has no Hoare annotation [2022-04-07 16:12:20,738 WARN L170 areAnnotationChecker]: L1275 has no Hoare annotation [2022-04-07 16:12:20,738 WARN L170 areAnnotationChecker]: L1624 has no Hoare annotation [2022-04-07 16:12:20,738 WARN L170 areAnnotationChecker]: L1624 has no Hoare annotation [2022-04-07 16:12:20,738 WARN L170 areAnnotationChecker]: L1640 has no Hoare annotation [2022-04-07 16:12:20,738 WARN L170 areAnnotationChecker]: L1640 has no Hoare annotation [2022-04-07 16:12:20,738 WARN L170 areAnnotationChecker]: L1630 has no Hoare annotation [2022-04-07 16:12:20,738 WARN L170 areAnnotationChecker]: L1630 has no Hoare annotation [2022-04-07 16:12:20,738 WARN L170 areAnnotationChecker]: L1644 has no Hoare annotation [2022-04-07 16:12:20,738 WARN L170 areAnnotationChecker]: L1644 has no Hoare annotation [2022-04-07 16:12:20,738 WARN L170 areAnnotationChecker]: L1640-1 has no Hoare annotation [2022-04-07 16:12:20,738 WARN L170 areAnnotationChecker]: L1630-2 has no Hoare annotation [2022-04-07 16:12:20,738 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-07 16:12:20,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 04:12:20 BoogieIcfgContainer [2022-04-07 16:12:20,739 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 16:12:20,740 INFO L158 Benchmark]: Toolchain (without parser) took 101371.64ms. Allocated memory was 175.1MB in the beginning and 253.8MB in the end (delta: 78.6MB). Free memory was 152.6MB in the beginning and 92.7MB in the end (delta: 59.9MB). Peak memory consumption was 138.9MB. Max. memory is 8.0GB. [2022-04-07 16:12:20,740 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 175.1MB. Free memory is still 137.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 16:12:20,740 INFO L158 Benchmark]: CACSL2BoogieTranslator took 398.95ms. Allocated memory was 175.1MB in the beginning and 210.8MB in the end (delta: 35.7MB). Free memory was 152.6MB in the beginning and 163.3MB in the end (delta: -10.7MB). Peak memory consumption was 29.3MB. Max. memory is 8.0GB. [2022-04-07 16:12:20,741 INFO L158 Benchmark]: Boogie Preprocessor took 67.19ms. Allocated memory is still 210.8MB. Free memory was 163.3MB in the beginning and 153.5MB in the end (delta: 9.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-07 16:12:20,741 INFO L158 Benchmark]: RCFGBuilder took 2905.69ms. Allocated memory is still 210.8MB. Free memory was 153.5MB in the beginning and 143.0MB in the end (delta: 10.5MB). Peak memory consumption was 61.9MB. Max. memory is 8.0GB. [2022-04-07 16:12:20,742 INFO L158 Benchmark]: TraceAbstraction took 97989.01ms. Allocated memory was 210.8MB in the beginning and 253.8MB in the end (delta: 43.0MB). Free memory was 142.5MB in the beginning and 92.7MB in the end (delta: 49.9MB). Peak memory consumption was 93.4MB. Max. memory is 8.0GB. [2022-04-07 16:12:20,747 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.09ms. Allocated memory is still 175.1MB. Free memory is still 137.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 398.95ms. Allocated memory was 175.1MB in the beginning and 210.8MB in the end (delta: 35.7MB). Free memory was 152.6MB in the beginning and 163.3MB in the end (delta: -10.7MB). Peak memory consumption was 29.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 67.19ms. Allocated memory is still 210.8MB. Free memory was 163.3MB in the beginning and 153.5MB in the end (delta: 9.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * RCFGBuilder took 2905.69ms. Allocated memory is still 210.8MB. Free memory was 153.5MB in the beginning and 143.0MB in the end (delta: 10.5MB). Peak memory consumption was 61.9MB. Max. memory is 8.0GB. * TraceAbstraction took 97989.01ms. Allocated memory was 210.8MB in the beginning and 253.8MB in the end (delta: 43.0MB). Free memory was 142.5MB in the beginning and 92.7MB in the end (delta: 49.9MB). Peak memory consumption was 93.4MB. 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: 1737]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 1151. Possible FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_server_data ; VAL [\old(init)=4294967304, \old(SSLv3_server_data)=null, \old(SSLv3_server_data)=null, init=1, SSLv3_server_data={4:0}] [L1077] SSL *s ; [L1078] int tmp ; [L1082] s = malloc(sizeof(SSL)) [L1083] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1084] s->ctx = malloc(sizeof(SSL_CTX)) [L1085] s->session = malloc(sizeof(SSL_SESSION)) [L1086] s->state = 8464 [L1088] s->info_callback = (void (*) ()) __VERIFIER_nondet_ulong() [L1089] s->options = __VERIFIER_nondet_ulong() [L1090] s->verify_mode = __VERIFIER_nondet_int() [L1091] EXPR s->session [L1091] (s->session)->peer = (struct x509_st*) __VERIFIER_nondet_ulong() [L1092] EXPR s->s3 [L1092] (s->s3)->tmp.cert_request = __VERIFIER_nondet_int() [L1093] EXPR s->s3 [L1093] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1094] EXPR s->s3 [L1094] EXPR (s->s3)->tmp.new_cipher [L1094] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1095] EXPR s->s3 [L1095] EXPR (s->s3)->tmp.new_cipher [L1095] ((s->s3)->tmp.new_cipher)->algo_strength = __VERIFIER_nondet_ulong() [L1096] COND FALSE !(__VERIFIER_nondet_int()) [L1102] s->cert = malloc(sizeof(struct cert_st)) [L1103] EXPR s->cert [L1103] (s->cert)->pkeys[0].privatekey = (struct evp_pkey_st*) __VERIFIER_nondet_ulong() [L1106] CALL ssl3_accept(s) VAL [init=1, s={-8:0}, SSLv3_server_data={4:0}] [L1112] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1113] unsigned long l ; [L1114] unsigned long Time ; [L1115] unsigned long tmp = __VERIFIER_nondet_long() ; [L1116] void (*cb)() ; [L1117] long num1 ; [L1118] int ret ; [L1119] int new_state ; [L1120] int state ; [L1121] int skip ; [L1122] int got_new_session ; [L1123] int tmp___1 = __VERIFIER_nondet_int() ; [L1124] int tmp___2 = __VERIFIER_nondet_int() ; [L1125] int tmp___3 ; [L1126] int tmp___4 ; [L1127] int tmp___5 ; [L1128] int tmp___6 ; [L1129] int tmp___7 ; [L1130] long tmp___8 = __VERIFIER_nondet_long() ; [L1131] int tmp___9 ; [L1132] int tmp___10 ; [L1133] int blastFlag ; [L1137] blastFlag = 0 [L1138] s->hit=__VERIFIER_nondet_int () [L1139] s->state = 8464 [L1140] Time = tmp [L1141] cb = (void (*)())((void *)0) [L1142] ret = -1 [L1143] skip = 0 [L1144] got_new_session = 0 [L1145] EXPR s->info_callback VAL [={0:0}, blastFlag=0, buf={0:-2}, got_new_session=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->info_callback={0:11}, skip=0, SSLv3_server_data={4:0}, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1145] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1146] EXPR s->info_callback [L1146] cb = s->info_callback [L1150] EXPR s->in_handshake [L1150] s->in_handshake += 1 [L1151] COND FALSE !(tmp___1 & 12288) VAL [={0:11}, blastFlag=0, buf={0:-2}, got_new_session=0, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_server_data={4:0}, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1160] EXPR s->cert VAL [={0:11}, blastFlag=0, buf={0:-2}, got_new_session=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->cert={-4294967295:0}, skip=0, SSLv3_server_data={4:0}, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1160] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1166] COND TRUE 1 VAL [={0:11}, blastFlag=0, buf={0:-2}, got_new_session=0, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_server_data={4:0}, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:11}, blastFlag=0, buf={0:-2}, got_new_session=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:11}, blastFlag=0, buf={0:-2}, got_new_session=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:11}, blastFlag=0, buf={0:-2}, got_new_session=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:11}, blastFlag=0, buf={0:-2}, got_new_session=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:11}, blastFlag=0, buf={0:-2}, got_new_session=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:11}, blastFlag=0, buf={0:-2}, got_new_session=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:11}, blastFlag=0, buf={0:-2}, got_new_session=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:11}, blastFlag=0, buf={0:-2}, got_new_session=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:11}, blastFlag=0, buf={0:-2}, got_new_session=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1193] COND TRUE s->state == 8464 [L1349] s->shutdown = 0 [L1350] ret = __VERIFIER_nondet_int() [L1351] COND TRUE blastFlag == 0 [L1352] blastFlag = 1 VAL [={0:11}, blastFlag=1, buf={0:-2}, got_new_session=0, init=1, ret=10, s={-8:0}, s={-8:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1356] COND FALSE !(ret <= 0) [L1361] got_new_session = 1 [L1362] s->state = 8496 [L1363] s->init_num = 0 VAL [={0:11}, blastFlag=1, buf={0:-2}, got_new_session=1, init=1, ret=10, s={-8:0}, s={-8:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [={0:11}, (s->s3)->tmp.reuse_message=4294967331, blastFlag=1, buf={0:-2}, got_new_session=1, init=1, ret=10, s={-8:0}, s={-8:0}, s->s3={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [={0:11}, blastFlag=1, buf={0:-2}, got_new_session=1, init=1, ret=10, s={-8:0}, s={-8:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1166] COND TRUE 1 VAL [={0:11}, blastFlag=1, buf={0:-2}, got_new_session=1, init=1, ret=10, s={-8:0}, s={-8:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:11}, blastFlag=1, buf={0:-2}, got_new_session=1, init=1, ret=10, s={-8:0}, s={-8:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:11}, blastFlag=1, buf={0:-2}, got_new_session=1, init=1, ret=10, s={-8:0}, s={-8:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:11}, blastFlag=1, buf={0:-2}, got_new_session=1, init=1, ret=10, s={-8:0}, s={-8:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:11}, blastFlag=1, buf={0:-2}, got_new_session=1, init=1, ret=10, s={-8:0}, s={-8:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:11}, blastFlag=1, buf={0:-2}, got_new_session=1, init=1, ret=10, s={-8:0}, s={-8:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:11}, blastFlag=1, buf={0:-2}, got_new_session=1, init=1, ret=10, s={-8:0}, s={-8:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:11}, blastFlag=1, buf={0:-2}, got_new_session=1, init=1, ret=10, s={-8:0}, s={-8:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:11}, blastFlag=1, buf={0:-2}, got_new_session=1, init=1, ret=10, s={-8:0}, s={-8:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:11}, blastFlag=1, buf={0:-2}, got_new_session=1, init=1, ret=10, s={-8:0}, s={-8:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1193] COND FALSE !(s->state == 8464) [L1196] EXPR s->state VAL [={0:11}, blastFlag=1, buf={0:-2}, got_new_session=1, init=1, ret=10, s={-8:0}, s={-8:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1196] COND FALSE !(s->state == 8465) [L1199] EXPR s->state VAL [={0:11}, blastFlag=1, buf={0:-2}, got_new_session=1, init=1, ret=10, s={-8:0}, s={-8:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1199] COND FALSE !(s->state == 8466) [L1202] EXPR s->state VAL [={0:11}, blastFlag=1, buf={0:-2}, got_new_session=1, init=1, ret=10, s={-8:0}, s={-8:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1202] COND TRUE s->state == 8496 [L1367] ret = __VERIFIER_nondet_int() [L1368] COND TRUE blastFlag == 1 [L1369] blastFlag = 2 VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1373] COND FALSE !(ret <= 0) [L1378] s->hit VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->hit=6, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1378] COND TRUE s->hit [L1379] s->state = 8656 VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1383] s->init_num = 0 VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [={0:11}, (s->s3)->tmp.reuse_message=4294967331, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->s3={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1166] COND TRUE 1 VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1193] COND FALSE !(s->state == 8464) [L1196] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1196] COND FALSE !(s->state == 8465) [L1199] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1199] COND FALSE !(s->state == 8466) [L1202] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1202] COND FALSE !(s->state == 8496) [L1205] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1205] COND FALSE !(s->state == 8497) [L1208] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1208] COND FALSE !(s->state == 8512) [L1211] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1211] COND FALSE !(s->state == 8513) [L1214] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1214] COND FALSE !(s->state == 8528) [L1217] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1217] COND FALSE !(s->state == 8529) [L1220] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1220] COND FALSE !(s->state == 8544) [L1223] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1223] COND FALSE !(s->state == 8545) [L1226] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1226] COND FALSE !(s->state == 8560) [L1229] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1229] COND FALSE !(s->state == 8561) [L1232] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1232] COND FALSE !(s->state == 8448) [L1235] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1235] COND FALSE !(s->state == 8576) [L1238] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1238] COND FALSE !(s->state == 8577) [L1241] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1241] COND FALSE !(s->state == 8592) [L1244] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1244] COND FALSE !(s->state == 8593) [L1247] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1247] COND FALSE !(s->state == 8608) [L1250] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1250] COND FALSE !(s->state == 8609) [L1253] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1253] COND FALSE !(s->state == 8640) [L1256] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1256] COND FALSE !(s->state == 8641) [L1259] EXPR s->state VAL [={0:11}, blastFlag=2, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0] [L1259] COND TRUE s->state == 8656 [L1583] EXPR s->session [L1583] EXPR s->s3 [L1583] EXPR (s->s3)->tmp.new_cipher [L1583] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1584] tmp___9 = __VERIFIER_nondet_int() [L1585] COND FALSE !(! tmp___9) [L1591] ret = __VERIFIER_nondet_int() [L1592] COND TRUE blastFlag == 2 [L1593] blastFlag = 5 VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___2=0, tmp___8=0, tmp___9=-15] [L1597] COND FALSE !(ret <= 0) [L1602] s->state = 8672 [L1603] s->init_num = 0 [L1604] tmp___10 = __VERIFIER_nondet_int() [L1605] COND FALSE !(! tmp___10) VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [={0:11}, (s->s3)->tmp.reuse_message=4294967331, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->s3={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1166] COND TRUE 1 VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1193] COND FALSE !(s->state == 8464) [L1196] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1196] COND FALSE !(s->state == 8465) [L1199] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1199] COND FALSE !(s->state == 8466) [L1202] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1202] COND FALSE !(s->state == 8496) [L1205] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1205] COND FALSE !(s->state == 8497) [L1208] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1208] COND FALSE !(s->state == 8512) [L1211] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1211] COND FALSE !(s->state == 8513) [L1214] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1214] COND FALSE !(s->state == 8528) [L1217] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1217] COND FALSE !(s->state == 8529) [L1220] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1220] COND FALSE !(s->state == 8544) [L1223] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1223] COND FALSE !(s->state == 8545) [L1226] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1226] COND FALSE !(s->state == 8560) [L1229] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1229] COND FALSE !(s->state == 8561) [L1232] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1232] COND FALSE !(s->state == 8448) [L1235] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1235] COND FALSE !(s->state == 8576) [L1238] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1238] COND FALSE !(s->state == 8577) [L1241] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1241] COND FALSE !(s->state == 8592) [L1244] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1244] COND FALSE !(s->state == 8593) [L1247] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1247] COND FALSE !(s->state == 8608) [L1250] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1250] COND FALSE !(s->state == 8609) [L1253] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1253] COND FALSE !(s->state == 8640) [L1256] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1256] COND FALSE !(s->state == 8641) [L1259] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1259] COND FALSE !(s->state == 8656) [L1262] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1262] COND FALSE !(s->state == 8657) [L1265] EXPR s->state VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1265] COND TRUE s->state == 8672 [L1614] ret = __VERIFIER_nondet_int() [L1615] COND FALSE !(blastFlag == 4) VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=0, s={-8:0}, s={-8:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1618] COND TRUE blastFlag == 5 VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=0, s={-8:0}, s={-8:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] [L1737] reach_error() VAL [={0:11}, blastFlag=5, buf={0:-2}, got_new_session=1, init=1, ret=0, s={-8:0}, s={-8:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=7, tmp=7, tmp___1=1, tmp___10=17, tmp___2=0, tmp___8=0, tmp___9=-15] - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 186 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 97.8s, OverallIterations: 26, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 90.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 27 mSolverCounterUnknown, 1639 SdHoareTripleChecker+Valid, 64.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1639 mSDsluCounter, 11356 SdHoareTripleChecker+Invalid, 64.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6849 mSDsCounter, 614 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9769 IncrementalHoareTripleChecker+Invalid, 10410 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 614 mSolverCounterUnsat, 4507 mSDtfsCounter, 9769 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 186 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=868occurred in iteration=23, InterpolantAutomatonStates: 125, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 25 MinimizatonAttempts, 822 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 2588 NumberOfCodeBlocks, 2588 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2430 ConstructedInterpolants, 0 QuantifiedInterpolants, 5824 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 1304/1304 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-07 16:12:20,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...