/usr/bin/java -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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/openssl/s3_clnt.blast.01.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7968f31 [2022-03-17 23:22:28,130 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-17 23:22:28,133 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-17 23:22:28,184 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-17 23:22:28,184 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-17 23:22:28,186 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-17 23:22:28,188 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-17 23:22:28,191 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-17 23:22:28,193 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-17 23:22:28,197 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-17 23:22:28,198 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-17 23:22:28,200 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-17 23:22:28,200 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-17 23:22:28,202 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-17 23:22:28,203 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-17 23:22:28,206 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-17 23:22:28,206 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-17 23:22:28,207 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-17 23:22:28,209 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-17 23:22:28,215 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-17 23:22:28,217 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-17 23:22:28,218 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-17 23:22:28,219 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-17 23:22:28,219 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-17 23:22:28,221 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-17 23:22:28,225 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-17 23:22:28,225 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-17 23:22:28,226 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-17 23:22:28,227 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-17 23:22:28,227 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-17 23:22:28,228 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-17 23:22:28,228 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-17 23:22:28,230 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-17 23:22:28,231 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-17 23:22:28,231 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-17 23:22:28,232 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-17 23:22:28,232 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-17 23:22:28,233 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-17 23:22:28,233 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-17 23:22:28,233 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-17 23:22:28,234 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-17 23:22:28,235 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-17 23:22:28,236 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-03-17 23:22:28,265 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-17 23:22:28,266 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-17 23:22:28,266 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-17 23:22:28,267 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-17 23:22:28,268 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-17 23:22:28,268 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-17 23:22:28,268 INFO L138 SettingsManager]: * Use SBE=true [2022-03-17 23:22:28,268 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-17 23:22:28,268 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-17 23:22:28,269 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-17 23:22:28,269 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-17 23:22:28,269 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-17 23:22:28,269 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-17 23:22:28,270 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-17 23:22:28,270 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-17 23:22:28,270 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-17 23:22:28,270 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-17 23:22:28,270 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-17 23:22:28,270 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-17 23:22:28,270 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-17 23:22:28,270 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-17 23:22:28,271 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-17 23:22:28,271 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-17 23:22:28,271 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-17 23:22:28,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-17 23:22:28,271 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-17 23:22:28,271 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-03-17 23:22:28,271 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-03-17 23:22:28,273 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-03-17 23:22:28,273 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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-03-17 23:22:28,471 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-17 23:22:28,491 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-17 23:22:28,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-17 23:22:28,494 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-17 23:22:28,496 INFO L275 PluginConnector]: CDTParser initialized [2022-03-17 23:22:28,497 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_clnt.blast.01.i.cil-2.c [2022-03-17 23:22:28,551 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f715dfc18/b402fb39250645f8b9aca7d4bb230b2a/FLAG34d2a2998 [2022-03-17 23:22:29,061 INFO L306 CDTParser]: Found 1 translation units. [2022-03-17 23:22:29,061 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.01.i.cil-2.c [2022-03-17 23:22:29,094 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f715dfc18/b402fb39250645f8b9aca7d4bb230b2a/FLAG34d2a2998 [2022-03-17 23:22:29,349 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f715dfc18/b402fb39250645f8b9aca7d4bb230b2a [2022-03-17 23:22:29,351 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-17 23:22:29,352 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-17 23:22:29,353 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-17 23:22:29,353 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-17 23:22:29,357 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-17 23:22:29,357 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:22:29" (1/1) ... [2022-03-17 23:22:29,358 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a4af80e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:22:29, skipping insertion in model container [2022-03-17 23:22:29,358 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:22:29" (1/1) ... [2022-03-17 23:22:29,365 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-17 23:22:29,426 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-17 23:22:29,799 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.01.i.cil-2.c[65520,65533] [2022-03-17 23:22:29,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-17 23:22:29,836 INFO L203 MainTranslator]: Completed pre-run [2022-03-17 23:22:29,971 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.01.i.cil-2.c[65520,65533] [2022-03-17 23:22:29,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-17 23:22:29,987 INFO L208 MainTranslator]: Completed translation [2022-03-17 23:22:29,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:22:29 WrapperNode [2022-03-17 23:22:29,989 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-17 23:22:29,990 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-17 23:22:29,990 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-17 23:22:29,991 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-17 23:22:30,000 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:22:29" (1/1) ... [2022-03-17 23:22:30,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:22:29" (1/1) ... [2022-03-17 23:22:30,038 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:22:29" (1/1) ... [2022-03-17 23:22:30,038 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:22:29" (1/1) ... [2022-03-17 23:22:30,087 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:22:29" (1/1) ... [2022-03-17 23:22:30,092 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:22:29" (1/1) ... [2022-03-17 23:22:30,095 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:22:29" (1/1) ... [2022-03-17 23:22:30,100 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-17 23:22:30,101 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-17 23:22:30,101 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-17 23:22:30,101 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-17 23:22:30,105 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:22:29" (1/1) ... [2022-03-17 23:22:30,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-17 23:22:30,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 23:22:30,131 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-03-17 23:22:30,137 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-03-17 23:22:30,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-17 23:22:30,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-17 23:22:30,163 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-17 23:22:30,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2022-03-17 23:22:30,163 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2022-03-17 23:22:30,163 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-17 23:22:30,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2022-03-17 23:22:30,164 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-03-17 23:22:30,164 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-03-17 23:22:30,164 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-03-17 23:22:30,164 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-17 23:22:30,164 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-17 23:22:30,164 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-17 23:22:30,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-17 23:22:30,165 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-03-17 23:22:30,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-03-17 23:22:30,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-17 23:22:30,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-03-17 23:22:30,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-03-17 23:22:30,165 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-03-17 23:22:30,165 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2022-03-17 23:22:30,166 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-03-17 23:22:30,166 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2022-03-17 23:22:30,166 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2022-03-17 23:22:30,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-03-17 23:22:30,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-03-17 23:22:30,166 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-17 23:22:30,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-17 23:22:30,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-17 23:22:30,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-03-17 23:22:30,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-17 23:22:30,167 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-03-17 23:22:30,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-03-17 23:22:30,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-17 23:22:30,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-17 23:22:30,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-17 23:22:30,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-03-17 23:22:30,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-03-17 23:22:30,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-03-17 23:22:30,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-03-17 23:22:30,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-17 23:22:30,313 INFO L234 CfgBuilder]: Building ICFG [2022-03-17 23:22:30,315 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-17 23:22:31,735 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-17 23:22:32,134 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-03-17 23:22:32,134 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-03-17 23:22:32,152 INFO L275 CfgBuilder]: Performing block encoding [2022-03-17 23:22:32,179 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-17 23:22:32,180 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-03-17 23:22:32,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 11:22:32 BoogieIcfgContainer [2022-03-17 23:22:32,183 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-17 23:22:32,184 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-03-17 23:22:32,184 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-03-17 23:22:32,185 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-03-17 23:22:32,187 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 11:22:32" (1/1) ... [2022-03-17 23:22:32,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 17.03 11:22:32 BasicIcfg [2022-03-17 23:22:32,243 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-03-17 23:22:32,246 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-17 23:22:32,246 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-17 23:22:32,250 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-17 23:22:32,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:22:29" (1/4) ... [2022-03-17 23:22:32,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a7ad363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:22:32, skipping insertion in model container [2022-03-17 23:22:32,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:22:29" (2/4) ... [2022-03-17 23:22:32,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a7ad363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:22:32, skipping insertion in model container [2022-03-17 23:22:32,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 11:22:32" (3/4) ... [2022-03-17 23:22:32,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a7ad363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 11:22:32, skipping insertion in model container [2022-03-17 23:22:32,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 17.03 11:22:32" (4/4) ... [2022-03-17 23:22:32,254 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.01.i.cil-2.cqvasr [2022-03-17 23:22:32,261 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-17 23:22:32,262 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-17 23:22:32,316 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-17 23:22:32,330 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=FINITE_AUTOMATA, 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-03-17 23:22:32,330 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-17 23:22:32,349 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 132 states have (on average 1.6742424242424243) internal successors, (221), 133 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-17 23:22:32,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-17 23:22:32,354 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 23:22:32,354 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 23:22:32,355 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 23:22:32,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 23:22:32,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1407118819, now seen corresponding path program 1 times [2022-03-17 23:22:32,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 23:22:32,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585659538] [2022-03-17 23:22:32,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 23:22:32,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 23:22:32,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 23:22:32,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 23:22:32,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 23:22:32,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 23:22:32,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 23:22:32,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585659538] [2022-03-17 23:22:32,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585659538] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 23:22:32,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 23:22:32,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-17 23:22:32,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91479496] [2022-03-17 23:22:32,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 23:22:33,001 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-17 23:22:33,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 23:22:33,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-17 23:22:33,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-17 23:22:33,037 INFO L87 Difference]: Start difference. First operand has 140 states, 132 states have (on average 1.6742424242424243) internal successors, (221), 133 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 23:22:35,078 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-03-17 23:22:35,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 23:22:35,559 INFO L93 Difference]: Finished difference Result 271 states and 444 transitions. [2022-03-17 23:22:35,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-17 23:22:35,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-03-17 23:22:35,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 23:22:35,572 INFO L225 Difference]: With dead ends: 271 [2022-03-17 23:22:35,572 INFO L226 Difference]: Without dead ends: 124 [2022-03-17 23:22:35,576 INFO L911 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-03-17 23:22:35,579 INFO L912 BasicCegarLoop]: 214 mSDtfsCounter, 7 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-03-17 23:22:35,580 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 558 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 321 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-03-17 23:22:35,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-03-17 23:22:35,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2022-03-17 23:22:35,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 118 states have (on average 1.4915254237288136) internal successors, (176), 118 states have internal predecessors, (176), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 23:22:35,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 180 transitions. [2022-03-17 23:22:35,618 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 180 transitions. Word has length 30 [2022-03-17 23:22:35,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 23:22:35,619 INFO L478 AbstractCegarLoop]: Abstraction has 123 states and 180 transitions. [2022-03-17 23:22:35,619 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 23:22:35,619 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 180 transitions. [2022-03-17 23:22:35,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-17 23:22:35,620 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 23:22:35,621 INFO L500 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] [2022-03-17 23:22:35,621 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-17 23:22:35,621 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 23:22:35,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 23:22:35,622 INFO L85 PathProgramCache]: Analyzing trace with hash -765789009, now seen corresponding path program 1 times [2022-03-17 23:22:35,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 23:22:35,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432851985] [2022-03-17 23:22:35,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 23:22:35,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 23:22:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 23:22:35,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 23:22:35,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 23:22:35,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-17 23:22:35,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 23:22:35,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432851985] [2022-03-17 23:22:35,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432851985] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 23:22:35,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 23:22:35,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-17 23:22:35,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039990325] [2022-03-17 23:22:35,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 23:22:35,926 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-17 23:22:35,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 23:22:35,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-17 23:22:35,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-17 23:22:35,927 INFO L87 Difference]: Start difference. First operand 123 states and 180 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 23:22:37,946 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-03-17 23:22:38,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 23:22:38,290 INFO L93 Difference]: Finished difference Result 333 states and 496 transitions. [2022-03-17 23:22:38,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-17 23:22:38,290 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 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 45 [2022-03-17 23:22:38,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 23:22:38,293 INFO L225 Difference]: With dead ends: 333 [2022-03-17 23:22:38,293 INFO L226 Difference]: Without dead ends: 226 [2022-03-17 23:22:38,294 INFO L911 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-03-17 23:22:38,295 INFO L912 BasicCegarLoop]: 168 mSDtfsCounter, 125 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-17 23:22:38,295 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 323 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 192 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-03-17 23:22:38,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-03-17 23:22:38,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2022-03-17 23:22:38,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 221 states have (on average 1.4751131221719458) internal successors, (326), 221 states have internal predecessors, (326), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 23:22:38,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 330 transitions. [2022-03-17 23:22:38,310 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 330 transitions. Word has length 45 [2022-03-17 23:22:38,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 23:22:38,310 INFO L478 AbstractCegarLoop]: Abstraction has 226 states and 330 transitions. [2022-03-17 23:22:38,311 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 23:22:38,311 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 330 transitions. [2022-03-17 23:22:38,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-03-17 23:22:38,313 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 23:22:38,313 INFO L500 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 23:22:38,313 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-17 23:22:38,313 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 23:22:38,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 23:22:38,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1602004893, now seen corresponding path program 1 times [2022-03-17 23:22:38,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 23:22:38,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571339695] [2022-03-17 23:22:38,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 23:22:38,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 23:22:38,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 23:22:38,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 23:22:38,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 23:22:38,512 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-17 23:22:38,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 23:22:38,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571339695] [2022-03-17 23:22:38,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571339695] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 23:22:38,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 23:22:38,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-17 23:22:38,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8651893] [2022-03-17 23:22:38,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 23:22:38,514 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-17 23:22:38,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 23:22:38,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-17 23:22:38,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-17 23:22:38,515 INFO L87 Difference]: Start difference. First operand 226 states and 330 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 23:22:40,527 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-03-17 23:22:41,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 23:22:41,004 INFO L93 Difference]: Finished difference Result 368 states and 543 transitions. [2022-03-17 23:22:41,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-17 23:22:41,005 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2022-03-17 23:22:41,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 23:22:41,007 INFO L225 Difference]: With dead ends: 368 [2022-03-17 23:22:41,007 INFO L226 Difference]: Without dead ends: 261 [2022-03-17 23:22:41,008 INFO L911 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-03-17 23:22:41,009 INFO L912 BasicCegarLoop]: 200 mSDtfsCounter, 31 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-03-17 23:22:41,010 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 490 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 361 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-03-17 23:22:41,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-03-17 23:22:41,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 244. [2022-03-17 23:22:41,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 239 states have (on average 1.4895397489539748) internal successors, (356), 239 states have internal predecessors, (356), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 23:22:41,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 360 transitions. [2022-03-17 23:22:41,038 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 360 transitions. Word has length 60 [2022-03-17 23:22:41,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 23:22:41,039 INFO L478 AbstractCegarLoop]: Abstraction has 244 states and 360 transitions. [2022-03-17 23:22:41,040 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 23:22:41,040 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 360 transitions. [2022-03-17 23:22:41,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-03-17 23:22:41,045 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 23:22:41,045 INFO L500 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 23:22:41,045 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-17 23:22:41,046 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 23:22:41,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 23:22:41,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1286715183, now seen corresponding path program 2 times [2022-03-17 23:22:41,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 23:22:41,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200337802] [2022-03-17 23:22:41,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 23:22:41,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 23:22:41,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 23:22:41,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 23:22:41,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 23:22:41,280 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-17 23:22:41,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 23:22:41,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200337802] [2022-03-17 23:22:41,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200337802] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 23:22:41,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 23:22:41,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-17 23:22:41,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323373276] [2022-03-17 23:22:41,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 23:22:41,285 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-17 23:22:41,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 23:22:41,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-17 23:22:41,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-17 23:22:41,286 INFO L87 Difference]: Start difference. First operand 244 states and 360 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 23:22:43,297 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-03-17 23:22:43,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 23:22:43,783 INFO L93 Difference]: Finished difference Result 655 states and 976 transitions. [2022-03-17 23:22:43,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-17 23:22:43,783 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-03-17 23:22:43,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 23:22:43,786 INFO L225 Difference]: With dead ends: 655 [2022-03-17 23:22:43,786 INFO L226 Difference]: Without dead ends: 427 [2022-03-17 23:22:43,787 INFO L911 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-03-17 23:22:43,788 INFO L912 BasicCegarLoop]: 106 mSDtfsCounter, 113 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-03-17 23:22:43,789 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 302 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 381 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-03-17 23:22:43,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2022-03-17 23:22:43,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 266. [2022-03-17 23:22:43,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 261 states have (on average 1.4827586206896552) internal successors, (387), 261 states have internal predecessors, (387), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 23:22:43,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 391 transitions. [2022-03-17 23:22:43,807 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 391 transitions. Word has length 75 [2022-03-17 23:22:43,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 23:22:43,807 INFO L478 AbstractCegarLoop]: Abstraction has 266 states and 391 transitions. [2022-03-17 23:22:43,808 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 23:22:43,808 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 391 transitions. [2022-03-17 23:22:43,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-03-17 23:22:43,809 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 23:22:43,810 INFO L500 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 23:22:43,810 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-17 23:22:43,810 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 23:22:43,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 23:22:43,811 INFO L85 PathProgramCache]: Analyzing trace with hash -372588721, now seen corresponding path program 1 times [2022-03-17 23:22:43,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 23:22:43,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568775603] [2022-03-17 23:22:43,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 23:22:43,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 23:22:43,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 23:22:44,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 23:22:44,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 23:22:44,059 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-17 23:22:44,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 23:22:44,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568775603] [2022-03-17 23:22:44,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568775603] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 23:22:44,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 23:22:44,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-17 23:22:44,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889318656] [2022-03-17 23:22:44,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 23:22:44,060 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-17 23:22:44,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 23:22:44,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-17 23:22:44,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-17 23:22:44,061 INFO L87 Difference]: Start difference. First operand 266 states and 391 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 23:22:46,073 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-17 23:22:46,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 23:22:46,542 INFO L93 Difference]: Finished difference Result 678 states and 1005 transitions. [2022-03-17 23:22:46,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-17 23:22:46,543 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-03-17 23:22:46,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 23:22:46,546 INFO L225 Difference]: With dead ends: 678 [2022-03-17 23:22:46,546 INFO L226 Difference]: Without dead ends: 428 [2022-03-17 23:22:46,547 INFO L911 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-03-17 23:22:46,551 INFO L912 BasicCegarLoop]: 99 mSDtfsCounter, 120 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-17 23:22:46,552 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 284 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 384 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-03-17 23:22:46,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2022-03-17 23:22:46,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 268. [2022-03-17 23:22:46,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 263 states have (on average 1.4752851711026616) internal successors, (388), 263 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 23:22:46,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 392 transitions. [2022-03-17 23:22:46,564 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 392 transitions. Word has length 75 [2022-03-17 23:22:46,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 23:22:46,565 INFO L478 AbstractCegarLoop]: Abstraction has 268 states and 392 transitions. [2022-03-17 23:22:46,565 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 23:22:46,565 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 392 transitions. [2022-03-17 23:22:46,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-03-17 23:22:46,566 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 23:22:46,567 INFO L500 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 23:22:46,567 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-17 23:22:46,567 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 23:22:46,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 23:22:46,567 INFO L85 PathProgramCache]: Analyzing trace with hash -295589606, now seen corresponding path program 1 times [2022-03-17 23:22:46,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 23:22:46,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601819710] [2022-03-17 23:22:46,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 23:22:46,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 23:22:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 23:22:46,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 23:22:46,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 23:22:46,743 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-17 23:22:46,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 23:22:46,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601819710] [2022-03-17 23:22:46,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601819710] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 23:22:46,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 23:22:46,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-17 23:22:46,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543119578] [2022-03-17 23:22:46,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 23:22:46,745 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-17 23:22:46,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 23:22:46,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-17 23:22:46,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-17 23:22:46,746 INFO L87 Difference]: Start difference. First operand 268 states and 392 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-03-17 23:22:48,758 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-03-17 23:22:49,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 23:22:49,222 INFO L93 Difference]: Finished difference Result 680 states and 1003 transitions. [2022-03-17 23:22:49,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-17 23:22:49,222 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2022-03-17 23:22:49,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 23:22:49,239 INFO L225 Difference]: With dead ends: 680 [2022-03-17 23:22:49,240 INFO L226 Difference]: Without dead ends: 428 [2022-03-17 23:22:49,241 INFO L911 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-03-17 23:22:49,241 INFO L912 BasicCegarLoop]: 110 mSDtfsCounter, 118 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-17 23:22:49,242 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 306 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 396 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-03-17 23:22:49,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2022-03-17 23:22:49,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 270. [2022-03-17 23:22:49,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 265 states have (on average 1.4679245283018867) internal successors, (389), 265 states have internal predecessors, (389), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 23:22:49,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 393 transitions. [2022-03-17 23:22:49,252 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 393 transitions. Word has length 76 [2022-03-17 23:22:49,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 23:22:49,253 INFO L478 AbstractCegarLoop]: Abstraction has 270 states and 393 transitions. [2022-03-17 23:22:49,253 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-03-17 23:22:49,253 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 393 transitions. [2022-03-17 23:22:49,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-03-17 23:22:49,254 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 23:22:49,254 INFO L500 BasicCegarLoop]: trace histogram [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] [2022-03-17 23:22:49,255 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-17 23:22:49,255 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 23:22:49,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 23:22:49,256 INFO L85 PathProgramCache]: Analyzing trace with hash -800384589, now seen corresponding path program 1 times [2022-03-17 23:22:49,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 23:22:49,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775825096] [2022-03-17 23:22:49,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 23:22:49,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 23:22:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 23:22:49,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 23:22:49,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 23:22:49,485 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-17 23:22:49,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 23:22:49,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775825096] [2022-03-17 23:22:49,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775825096] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 23:22:49,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 23:22:49,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-17 23:22:49,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304321535] [2022-03-17 23:22:49,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 23:22:49,486 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-17 23:22:49,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 23:22:49,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-17 23:22:49,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-17 23:22:49,487 INFO L87 Difference]: Start difference. First operand 270 states and 393 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 23:22:51,499 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-03-17 23:22:51,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 23:22:51,977 INFO L93 Difference]: Finished difference Result 682 states and 1001 transitions. [2022-03-17 23:22:51,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-17 23:22:51,978 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-03-17 23:22:51,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 23:22:51,980 INFO L225 Difference]: With dead ends: 682 [2022-03-17 23:22:51,980 INFO L226 Difference]: Without dead ends: 428 [2022-03-17 23:22:51,981 INFO L911 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-03-17 23:22:51,981 INFO L912 BasicCegarLoop]: 99 mSDtfsCounter, 116 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-03-17 23:22:51,982 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 284 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 384 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-03-17 23:22:51,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2022-03-17 23:22:51,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 272. [2022-03-17 23:22:51,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 267 states have (on average 1.4606741573033708) internal successors, (390), 267 states have internal predecessors, (390), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 23:22:51,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 394 transitions. [2022-03-17 23:22:51,992 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 394 transitions. Word has length 77 [2022-03-17 23:22:51,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 23:22:51,993 INFO L478 AbstractCegarLoop]: Abstraction has 272 states and 394 transitions. [2022-03-17 23:22:51,993 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 23:22:51,993 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 394 transitions. [2022-03-17 23:22:51,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-03-17 23:22:51,994 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 23:22:51,994 INFO L500 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 23:22:51,994 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-17 23:22:51,994 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 23:22:51,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 23:22:51,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1411914628, now seen corresponding path program 1 times [2022-03-17 23:22:51,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 23:22:51,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900659253] [2022-03-17 23:22:51,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 23:22:51,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 23:22:52,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 23:22:52,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 23:22:52,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 23:22:52,185 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-03-17 23:22:52,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 23:22:52,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900659253] [2022-03-17 23:22:52,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900659253] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 23:22:52,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 23:22:52,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-17 23:22:52,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926416052] [2022-03-17 23:22:52,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 23:22:52,189 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-17 23:22:52,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 23:22:52,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-17 23:22:52,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-17 23:22:52,190 INFO L87 Difference]: Start difference. First operand 272 states and 394 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 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-03-17 23:22:54,202 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-03-17 23:22:54,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 23:22:54,693 INFO L93 Difference]: Finished difference Result 547 states and 802 transitions. [2022-03-17 23:22:54,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-17 23:22:54,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 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 78 [2022-03-17 23:22:54,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 23:22:54,696 INFO L225 Difference]: With dead ends: 547 [2022-03-17 23:22:54,696 INFO L226 Difference]: Without dead ends: 408 [2022-03-17 23:22:54,696 INFO L911 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-03-17 23:22:54,697 INFO L912 BasicCegarLoop]: 319 mSDtfsCounter, 128 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-03-17 23:22:54,697 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 483 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 343 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-03-17 23:22:54,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2022-03-17 23:22:54,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2022-03-17 23:22:54,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 403 states have (on average 1.456575682382134) internal successors, (587), 403 states have internal predecessors, (587), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 23:22:54,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 591 transitions. [2022-03-17 23:22:54,709 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 591 transitions. Word has length 78 [2022-03-17 23:22:54,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 23:22:54,709 INFO L478 AbstractCegarLoop]: Abstraction has 408 states and 591 transitions. [2022-03-17 23:22:54,710 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 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-03-17 23:22:54,710 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 591 transitions. [2022-03-17 23:22:54,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-03-17 23:22:54,711 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 23:22:54,711 INFO L500 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 23:22:54,711 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-17 23:22:54,711 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 23:22:54,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 23:22:54,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1442934435, now seen corresponding path program 1 times [2022-03-17 23:22:54,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 23:22:54,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755092428] [2022-03-17 23:22:54,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 23:22:54,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 23:22:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 23:22:54,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 23:22:54,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 23:22:54,853 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-17 23:22:54,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 23:22:54,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755092428] [2022-03-17 23:22:54,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755092428] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 23:22:54,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 23:22:54,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-17 23:22:54,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337841702] [2022-03-17 23:22:54,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 23:22:54,854 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-17 23:22:54,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 23:22:54,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-17 23:22:54,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-17 23:22:54,855 INFO L87 Difference]: Start difference. First operand 408 states and 591 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 23:22:56,868 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-03-17 23:22:57,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 23:22:57,314 INFO L93 Difference]: Finished difference Result 817 states and 1193 transitions. [2022-03-17 23:22:57,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-17 23:22:57,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2022-03-17 23:22:57,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 23:22:57,317 INFO L225 Difference]: With dead ends: 817 [2022-03-17 23:22:57,317 INFO L226 Difference]: Without dead ends: 542 [2022-03-17 23:22:57,318 INFO L911 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-03-17 23:22:57,319 INFO L912 BasicCegarLoop]: 312 mSDtfsCounter, 132 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-17 23:22:57,319 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 476 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 336 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-03-17 23:22:57,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2022-03-17 23:22:57,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 542. [2022-03-17 23:22:57,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 537 states have (on average 1.4543761638733705) internal successors, (781), 537 states have internal predecessors, (781), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 23:22:57,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 785 transitions. [2022-03-17 23:22:57,332 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 785 transitions. Word has length 78 [2022-03-17 23:22:57,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 23:22:57,332 INFO L478 AbstractCegarLoop]: Abstraction has 542 states and 785 transitions. [2022-03-17 23:22:57,333 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 23:22:57,333 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 785 transitions. [2022-03-17 23:22:57,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-03-17 23:22:57,334 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 23:22:57,334 INFO L500 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 23:22:57,334 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-17 23:22:57,335 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 23:22:57,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 23:22:57,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1560572353, now seen corresponding path program 1 times [2022-03-17 23:22:57,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 23:22:57,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142528792] [2022-03-17 23:22:57,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 23:22:57,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 23:22:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 23:22:57,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 23:22:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 23:22:57,537 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-03-17 23:22:57,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 23:22:57,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142528792] [2022-03-17 23:22:57,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142528792] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 23:22:57,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 23:22:57,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-17 23:22:57,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211310738] [2022-03-17 23:22:57,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 23:22:57,538 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-17 23:22:57,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 23:22:57,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-17 23:22:57,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-17 23:22:57,539 INFO L87 Difference]: Start difference. First operand 542 states and 785 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 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-03-17 23:22:59,549 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-03-17 23:22:59,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 23:22:59,997 INFO L93 Difference]: Finished difference Result 1086 states and 1583 transitions. [2022-03-17 23:22:59,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-17 23:22:59,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 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 98 [2022-03-17 23:22:59,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 23:23:00,000 INFO L225 Difference]: With dead ends: 1086 [2022-03-17 23:23:00,000 INFO L226 Difference]: Without dead ends: 677 [2022-03-17 23:23:00,001 INFO L911 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-03-17 23:23:00,002 INFO L912 BasicCegarLoop]: 318 mSDtfsCounter, 128 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-17 23:23:00,002 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 482 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 342 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-03-17 23:23:00,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2022-03-17 23:23:00,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 677. [2022-03-17 23:23:00,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 672 states have (on average 1.4538690476190477) internal successors, (977), 672 states have internal predecessors, (977), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 23:23:00,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 981 transitions. [2022-03-17 23:23:00,020 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 981 transitions. Word has length 98 [2022-03-17 23:23:00,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 23:23:00,020 INFO L478 AbstractCegarLoop]: Abstraction has 677 states and 981 transitions. [2022-03-17 23:23:00,020 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 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-03-17 23:23:00,021 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 981 transitions. [2022-03-17 23:23:00,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-03-17 23:23:00,022 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 23:23:00,022 INFO L500 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 23:23:00,023 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-17 23:23:00,023 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 23:23:00,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 23:23:00,023 INFO L85 PathProgramCache]: Analyzing trace with hash 951047844, now seen corresponding path program 1 times [2022-03-17 23:23:00,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 23:23:00,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095943246] [2022-03-17 23:23:00,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 23:23:00,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 23:23:00,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 23:23:00,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 23:23:00,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 23:23:00,197 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-03-17 23:23:00,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 23:23:00,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095943246] [2022-03-17 23:23:00,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095943246] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 23:23:00,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 23:23:00,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-17 23:23:00,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447967078] [2022-03-17 23:23:00,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 23:23:00,198 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-17 23:23:00,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 23:23:00,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-17 23:23:00,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-17 23:23:00,199 INFO L87 Difference]: Start difference. First operand 677 states and 981 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-03-17 23:23:02,210 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-03-17 23:23:02,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 23:23:02,682 INFO L93 Difference]: Finished difference Result 1218 states and 1769 transitions. [2022-03-17 23:23:02,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-17 23:23:02,682 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2022-03-17 23:23:02,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 23:23:02,685 INFO L225 Difference]: With dead ends: 1218 [2022-03-17 23:23:02,686 INFO L226 Difference]: Without dead ends: 674 [2022-03-17 23:23:02,687 INFO L911 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-03-17 23:23:02,688 INFO L912 BasicCegarLoop]: 315 mSDtfsCounter, 128 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-17 23:23:02,688 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 478 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 337 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-03-17 23:23:02,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2022-03-17 23:23:02,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2022-03-17 23:23:02,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 669 states have (on average 1.445440956651719) internal successors, (967), 669 states have internal predecessors, (967), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 23:23:02,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 971 transitions. [2022-03-17 23:23:02,707 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 971 transitions. Word has length 119 [2022-03-17 23:23:02,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 23:23:02,708 INFO L478 AbstractCegarLoop]: Abstraction has 674 states and 971 transitions. [2022-03-17 23:23:02,708 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-03-17 23:23:02,708 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 971 transitions. [2022-03-17 23:23:02,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-03-17 23:23:02,710 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 23:23:02,710 INFO L500 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 23:23:02,710 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-17 23:23:02,710 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 23:23:02,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 23:23:02,711 INFO L85 PathProgramCache]: Analyzing trace with hash -840493056, now seen corresponding path program 1 times [2022-03-17 23:23:02,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 23:23:02,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576913230] [2022-03-17 23:23:02,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 23:23:02,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 23:23:02,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 23:23:02,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 23:23:02,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 23:23:02,903 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-03-17 23:23:02,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 23:23:02,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576913230] [2022-03-17 23:23:02,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576913230] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 23:23:02,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 23:23:02,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-17 23:23:02,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959017] [2022-03-17 23:23:02,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 23:23:02,905 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-17 23:23:02,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 23:23:02,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-17 23:23:02,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-17 23:23:02,905 INFO L87 Difference]: Start difference. First operand 674 states and 971 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 23:23:04,916 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-03-17 23:23:05,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 23:23:05,374 INFO L93 Difference]: Finished difference Result 1773 states and 2555 transitions. [2022-03-17 23:23:05,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-17 23:23:05,374 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 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-03-17 23:23:05,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 23:23:05,379 INFO L225 Difference]: With dead ends: 1773 [2022-03-17 23:23:05,379 INFO L226 Difference]: Without dead ends: 1115 [2022-03-17 23:23:05,381 INFO L911 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-03-17 23:23:05,381 INFO L912 BasicCegarLoop]: 99 mSDtfsCounter, 109 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-17 23:23:05,381 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 283 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 386 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-03-17 23:23:05,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2022-03-17 23:23:05,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 764. [2022-03-17 23:23:05,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 759 states have (on average 1.4519104084321475) internal successors, (1102), 759 states have internal predecessors, (1102), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 23:23:05,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1106 transitions. [2022-03-17 23:23:05,405 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1106 transitions. Word has length 121 [2022-03-17 23:23:05,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 23:23:05,405 INFO L478 AbstractCegarLoop]: Abstraction has 764 states and 1106 transitions. [2022-03-17 23:23:05,405 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 23:23:05,405 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1106 transitions. [2022-03-17 23:23:05,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-03-17 23:23:05,407 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 23:23:05,407 INFO L500 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 23:23:05,408 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-17 23:23:05,408 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 23:23:05,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 23:23:05,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1448569919, now seen corresponding path program 1 times [2022-03-17 23:23:05,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 23:23:05,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455354274] [2022-03-17 23:23:05,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 23:23:05,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 23:23:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 23:23:05,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 23:23:05,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 23:23:05,594 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-03-17 23:23:05,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 23:23:05,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455354274] [2022-03-17 23:23:05,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455354274] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 23:23:05,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 23:23:05,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-17 23:23:05,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605358158] [2022-03-17 23:23:05,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 23:23:05,595 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-17 23:23:05,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 23:23:05,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-17 23:23:05,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-17 23:23:05,611 INFO L87 Difference]: Start difference. First operand 764 states and 1106 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 23:23:07,622 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-03-17 23:23:08,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 23:23:08,084 INFO L93 Difference]: Finished difference Result 1714 states and 2465 transitions. [2022-03-17 23:23:08,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-17 23:23:08,085 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2022-03-17 23:23:08,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 23:23:08,089 INFO L225 Difference]: With dead ends: 1714 [2022-03-17 23:23:08,089 INFO L226 Difference]: Without dead ends: 966 [2022-03-17 23:23:08,090 INFO L911 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-03-17 23:23:08,091 INFO L912 BasicCegarLoop]: 211 mSDtfsCounter, 41 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-17 23:23:08,092 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 512 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 401 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-03-17 23:23:08,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2022-03-17 23:23:08,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 860. [2022-03-17 23:23:08,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 855 states have (on average 1.4619883040935673) internal successors, (1250), 855 states have internal predecessors, (1250), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 23:23:08,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1254 transitions. [2022-03-17 23:23:08,117 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1254 transitions. Word has length 121 [2022-03-17 23:23:08,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 23:23:08,118 INFO L478 AbstractCegarLoop]: Abstraction has 860 states and 1254 transitions. [2022-03-17 23:23:08,118 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 23:23:08,118 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1254 transitions. [2022-03-17 23:23:08,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-03-17 23:23:08,120 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 23:23:08,121 INFO L500 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 23:23:08,121 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-17 23:23:08,121 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 23:23:08,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 23:23:08,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1142128455, now seen corresponding path program 1 times [2022-03-17 23:23:08,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 23:23:08,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790393854] [2022-03-17 23:23:08,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 23:23:08,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 23:23:08,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 23:23:08,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 23:23:08,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 23:23:08,392 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 157 proven. 1 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-03-17 23:23:08,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 23:23:08,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790393854] [2022-03-17 23:23:08,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790393854] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 23:23:08,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824117316] [2022-03-17 23:23:08,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 23:23:08,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 23:23:08,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 23:23:08,394 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 23:23:08,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-17 23:23:09,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 23:23:09,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 1368 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-17 23:23:09,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 23:23:09,326 INFO L356 Elim1Store]: treesize reduction 54, result has 44.3 percent of original size [2022-03-17 23:23:09,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 143 [2022-03-17 23:23:09,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 63 [2022-03-17 23:23:09,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-03-17 23:23:09,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-03-17 23:23:09,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2022-03-17 23:23:09,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-03-17 23:23:09,750 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-03-17 23:23:09,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2022-03-17 23:23:09,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-03-17 23:23:09,803 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-17 23:23:09,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-03-17 23:23:09,893 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-03-17 23:23:09,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-03-17 23:23:09,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-03-17 23:23:09,993 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 123 proven. 40 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-03-17 23:23:09,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 23:23:10,214 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-03-17 23:23:10,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824117316] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-17 23:23:10,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-17 23:23:10,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 11 [2022-03-17 23:23:10,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457216027] [2022-03-17 23:23:10,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 23:23:10,216 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-17 23:23:10,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 23:23:10,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-17 23:23:10,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-03-17 23:23:10,216 INFO L87 Difference]: Start difference. First operand 860 states and 1254 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 23:23:12,224 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-03-17 23:23:12,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 23:23:12,549 INFO L93 Difference]: Finished difference Result 2079 states and 3029 transitions. [2022-03-17 23:23:12,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-17 23:23:12,549 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 1 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 139 [2022-03-17 23:23:12,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 23:23:12,554 INFO L225 Difference]: With dead ends: 2079 [2022-03-17 23:23:12,554 INFO L226 Difference]: Without dead ends: 1235 [2022-03-17 23:23:12,556 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-03-17 23:23:12,557 INFO L912 BasicCegarLoop]: 103 mSDtfsCounter, 108 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-17 23:23:12,557 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 291 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 210 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-03-17 23:23:12,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2022-03-17 23:23:12,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 876. [2022-03-17 23:23:12,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 871 states have (on average 1.4569460390355913) internal successors, (1269), 871 states have internal predecessors, (1269), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 23:23:12,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1273 transitions. [2022-03-17 23:23:12,584 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1273 transitions. Word has length 139 [2022-03-17 23:23:12,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 23:23:12,584 INFO L478 AbstractCegarLoop]: Abstraction has 876 states and 1273 transitions. [2022-03-17 23:23:12,584 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 23:23:12,584 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1273 transitions. [2022-03-17 23:23:12,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-03-17 23:23:12,587 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 23:23:12,587 INFO L500 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 23:23:12,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-17 23:23:12,806 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-17 23:23:12,807 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 23:23:12,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 23:23:12,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1758197537, now seen corresponding path program 1 times [2022-03-17 23:23:12,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 23:23:12,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410733068] [2022-03-17 23:23:12,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 23:23:12,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 23:23:12,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 23:23:13,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 23:23:13,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 23:23:13,017 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-03-17 23:23:13,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 23:23:13,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410733068] [2022-03-17 23:23:13,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410733068] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 23:23:13,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 23:23:13,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-17 23:23:13,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244509824] [2022-03-17 23:23:13,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 23:23:13,018 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-17 23:23:13,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 23:23:13,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-17 23:23:13,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-17 23:23:13,019 INFO L87 Difference]: Start difference. First operand 876 states and 1273 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 23:23:15,029 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-17 23:23:15,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 23:23:15,507 INFO L93 Difference]: Finished difference Result 1887 states and 2732 transitions. [2022-03-17 23:23:15,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-17 23:23:15,507 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 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 139 [2022-03-17 23:23:15,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 23:23:15,511 INFO L225 Difference]: With dead ends: 1887 [2022-03-17 23:23:15,511 INFO L226 Difference]: Without dead ends: 1027 [2022-03-17 23:23:15,513 INFO L911 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-03-17 23:23:15,514 INFO L912 BasicCegarLoop]: 98 mSDtfsCounter, 113 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-17 23:23:15,514 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 280 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 383 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-03-17 23:23:15,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2022-03-17 23:23:15,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 736. [2022-03-17 23:23:15,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 731 states have (on average 1.4322845417236663) internal successors, (1047), 731 states have internal predecessors, (1047), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 23:23:15,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1051 transitions. [2022-03-17 23:23:15,535 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1051 transitions. Word has length 139 [2022-03-17 23:23:15,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 23:23:15,536 INFO L478 AbstractCegarLoop]: Abstraction has 736 states and 1051 transitions. [2022-03-17 23:23:15,536 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 23:23:15,536 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1051 transitions. [2022-03-17 23:23:15,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-03-17 23:23:15,538 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 23:23:15,538 INFO L500 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 23:23:15,538 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-17 23:23:15,538 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 23:23:15,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 23:23:15,539 INFO L85 PathProgramCache]: Analyzing trace with hash 961502508, now seen corresponding path program 1 times [2022-03-17 23:23:15,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 23:23:15,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809800735] [2022-03-17 23:23:15,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 23:23:15,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 23:23:15,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 23:23:15,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 23:23:15,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 23:23:15,744 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 158 proven. 1 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-03-17 23:23:15,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 23:23:15,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809800735] [2022-03-17 23:23:15,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809800735] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 23:23:15,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160163600] [2022-03-17 23:23:15,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 23:23:15,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 23:23:15,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 23:23:15,748 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 23:23:15,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-17 23:23:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 23:23:16,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 1371 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-17 23:23:16,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 23:23:16,583 INFO L356 Elim1Store]: treesize reduction 54, result has 44.3 percent of original size [2022-03-17 23:23:16,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 143 [2022-03-17 23:23:16,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 63 [2022-03-17 23:23:16,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-03-17 23:23:16,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-03-17 23:23:16,711 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-03-17 23:23:16,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-03-17 23:23:16,757 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-03-17 23:23:16,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-03-17 23:23:16,844 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-03-17 23:23:16,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-03-17 23:23:16,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-03-17 23:23:16,953 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 126 proven. 40 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-03-17 23:23:16,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 23:23:17,164 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-03-17 23:23:17,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160163600] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-17 23:23:17,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-17 23:23:17,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 11 [2022-03-17 23:23:17,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241402463] [2022-03-17 23:23:17,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 23:23:17,165 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-17 23:23:17,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 23:23:17,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-17 23:23:17,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-03-17 23:23:17,166 INFO L87 Difference]: Start difference. First operand 736 states and 1051 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 23:23:19,174 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-03-17 23:23:19,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 23:23:19,482 INFO L93 Difference]: Finished difference Result 1743 states and 2490 transitions. [2022-03-17 23:23:19,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-17 23:23:19,484 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 1 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 140 [2022-03-17 23:23:19,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 23:23:19,488 INFO L225 Difference]: With dead ends: 1743 [2022-03-17 23:23:19,488 INFO L226 Difference]: Without dead ends: 1023 [2022-03-17 23:23:19,490 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-03-17 23:23:19,490 INFO L912 BasicCegarLoop]: 102 mSDtfsCounter, 108 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-17 23:23:19,491 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 286 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-03-17 23:23:19,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2022-03-17 23:23:19,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 740. [2022-03-17 23:23:19,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 735 states have (on average 1.420408163265306) internal successors, (1044), 735 states have internal predecessors, (1044), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 23:23:19,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1048 transitions. [2022-03-17 23:23:19,520 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1048 transitions. Word has length 140 [2022-03-17 23:23:19,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 23:23:19,520 INFO L478 AbstractCegarLoop]: Abstraction has 740 states and 1048 transitions. [2022-03-17 23:23:19,520 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 23:23:19,521 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1048 transitions. [2022-03-17 23:23:19,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-03-17 23:23:19,523 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 23:23:19,523 INFO L500 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 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-03-17 23:23:19,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-17 23:23:19,751 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-17 23:23:19,752 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 23:23:19,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 23:23:19,752 INFO L85 PathProgramCache]: Analyzing trace with hash 772156782, now seen corresponding path program 1 times [2022-03-17 23:23:19,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 23:23:19,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401890164] [2022-03-17 23:23:19,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 23:23:19,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 23:23:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 23:23:19,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 23:23:19,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 23:23:19,954 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-03-17 23:23:19,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 23:23:19,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401890164] [2022-03-17 23:23:19,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401890164] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 23:23:19,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 23:23:19,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-17 23:23:19,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381742464] [2022-03-17 23:23:19,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 23:23:19,955 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-17 23:23:19,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 23:23:19,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-17 23:23:19,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-17 23:23:19,956 INFO L87 Difference]: Start difference. First operand 740 states and 1048 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 23:23:21,967 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-03-17 23:23:22,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 23:23:22,360 INFO L93 Difference]: Finished difference Result 1491 states and 2103 transitions. [2022-03-17 23:23:22,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-17 23:23:22,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 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 140 [2022-03-17 23:23:22,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 23:23:22,364 INFO L225 Difference]: With dead ends: 1491 [2022-03-17 23:23:22,364 INFO L226 Difference]: Without dead ends: 767 [2022-03-17 23:23:22,366 INFO L911 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-03-17 23:23:22,366 INFO L912 BasicCegarLoop]: 194 mSDtfsCounter, 23 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-17 23:23:22,367 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 478 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 347 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-03-17 23:23:22,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2022-03-17 23:23:22,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 740. [2022-03-17 23:23:22,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 735 states have (on average 1.416326530612245) internal successors, (1041), 735 states have internal predecessors, (1041), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 23:23:22,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1045 transitions. [2022-03-17 23:23:22,387 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1045 transitions. Word has length 140 [2022-03-17 23:23:22,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 23:23:22,388 INFO L478 AbstractCegarLoop]: Abstraction has 740 states and 1045 transitions. [2022-03-17 23:23:22,388 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 23:23:22,388 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1045 transitions. [2022-03-17 23:23:22,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-17 23:23:22,390 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 23:23:22,390 INFO L500 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 23:23:22,390 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-03-17 23:23:22,391 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 23:23:22,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 23:23:22,392 INFO L85 PathProgramCache]: Analyzing trace with hash 144716696, now seen corresponding path program 1 times [2022-03-17 23:23:22,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 23:23:22,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206675888] [2022-03-17 23:23:22,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 23:23:22,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 23:23:23,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-17 23:23:23,644 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-17 23:23:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-17 23:23:24,064 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-17 23:23:24,065 INFO L614 BasicCegarLoop]: Counterexample is feasible [2022-03-17 23:23:24,065 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-17 23:23:24,067 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-03-17 23:23:24,071 INFO L718 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 23:23:24,074 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-17 23:23:24,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 11:23:24 BasicIcfg [2022-03-17 23:23:24,185 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-17 23:23:24,185 INFO L158 Benchmark]: Toolchain (without parser) took 54833.23ms. Allocated memory was 184.5MB in the beginning and 281.0MB in the end (delta: 96.5MB). Free memory was 124.9MB in the beginning and 70.3MB in the end (delta: 54.7MB). Peak memory consumption was 151.7MB. Max. memory is 8.0GB. [2022-03-17 23:23:24,185 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 184.5MB. Free memory is still 143.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-17 23:23:24,186 INFO L158 Benchmark]: CACSL2BoogieTranslator took 635.94ms. Allocated memory was 184.5MB in the beginning and 233.8MB in the end (delta: 49.3MB). Free memory was 124.7MB in the beginning and 187.9MB in the end (delta: -63.2MB). Peak memory consumption was 18.1MB. Max. memory is 8.0GB. [2022-03-17 23:23:24,186 INFO L158 Benchmark]: Boogie Preprocessor took 110.33ms. Allocated memory is still 233.8MB. Free memory was 187.9MB in the beginning and 180.5MB in the end (delta: 7.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2022-03-17 23:23:24,186 INFO L158 Benchmark]: RCFGBuilder took 2081.80ms. Allocated memory is still 233.8MB. Free memory was 180.5MB in the beginning and 199.2MB in the end (delta: -18.7MB). Peak memory consumption was 97.2MB. Max. memory is 8.0GB. [2022-03-17 23:23:24,186 INFO L158 Benchmark]: IcfgTransformer took 59.79ms. Allocated memory is still 233.8MB. Free memory was 199.2MB in the beginning and 194.0MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-03-17 23:23:24,186 INFO L158 Benchmark]: TraceAbstraction took 51938.52ms. Allocated memory was 233.8MB in the beginning and 281.0MB in the end (delta: 47.2MB). Free memory was 193.4MB in the beginning and 70.3MB in the end (delta: 123.2MB). Peak memory consumption was 170.4MB. Max. memory is 8.0GB. [2022-03-17 23:23:24,204 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 184.5MB. Free memory is still 143.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 635.94ms. Allocated memory was 184.5MB in the beginning and 233.8MB in the end (delta: 49.3MB). Free memory was 124.7MB in the beginning and 187.9MB in the end (delta: -63.2MB). Peak memory consumption was 18.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 110.33ms. Allocated memory is still 233.8MB. Free memory was 187.9MB in the beginning and 180.5MB in the end (delta: 7.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * RCFGBuilder took 2081.80ms. Allocated memory is still 233.8MB. Free memory was 180.5MB in the beginning and 199.2MB in the end (delta: -18.7MB). Peak memory consumption was 97.2MB. Max. memory is 8.0GB. * IcfgTransformer took 59.79ms. Allocated memory is still 233.8MB. Free memory was 199.2MB in the beginning and 194.0MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * TraceAbstraction took 51938.52ms. Allocated memory was 233.8MB in the beginning and 281.0MB in the end (delta: 47.2MB). Free memory was 193.4MB in the beginning and 70.3MB in the end (delta: 123.2MB). Peak memory consumption was 170.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: 1668]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 1353. Possible FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_client_data ; VAL [\old(init)=18446744073709551625, \old(SSLv3_client_data)=null, \old(SSLv3_client_data)=null, init=1, SSLv3_client_data={4:0}] [L1077] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1081] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1082] s->ctx = malloc(sizeof(SSL_CTX)) [L1083] s->session = malloc(sizeof(SSL_SESSION)) [L1084] s->state = 12292 [L1085] s->version = __VERIFIER_nondet_int() [L1087] s->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1088] EXPR s->ctx [L1088] (s->ctx)->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1089] s->init_buf = (BUF_MEM *)__VERIFIER_nondet_ulong() [L1090] s->bbio = (BIO *) __VERIFIER_nondet_ulong() [L1091] s->wbio = (BIO *) __VERIFIER_nondet_ulong() [L1092] EXPR s->s3 [L1092] (s->s3)->flags = __VERIFIER_nondet_long() [L1093] EXPR s->s3 [L1093] (s->s3)->tmp.cert_req = __VERIFIER_nondet_int() [L1094] EXPR s->s3 [L1094] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1095] EXPR s->s3 [L1095] EXPR (s->s3)->tmp.new_cipher [L1095] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1096] EXPR s->s3 [L1096] (s->s3)->tmp.next_state = __VERIFIER_nondet_int() [L1098] CALL ssl3_connect(s) VAL [init=1, s={-21:0}, SSLv3_client_data={4:0}] [L1104] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1105] unsigned long tmp ; [L1106] unsigned long l ; [L1107] long num1 ; [L1108] void (*cb)() ; [L1109] int ret ; [L1110] int new_state ; [L1111] int state ; [L1112] int skip ; [L1113] int tmp___1 = __VERIFIER_nondet_int() ; [L1114] int tmp___2 = __VERIFIER_nondet_int() ; [L1115] int tmp___3 ; [L1116] int tmp___4 ; [L1117] int tmp___5 ; [L1118] int tmp___6 ; [L1119] int tmp___7 ; [L1120] int tmp___8 ; [L1121] long tmp___9 ; [L1123] int blastFlag ; [L1126] blastFlag = 0 [L1127] s->hit=__VERIFIER_nondet_int () [L1128] s->state = 12292 [L1129] tmp = __VERIFIER_nondet_int() [L1130] cb = (void (*)())((void *)0) [L1131] ret = -1 [L1132] skip = 0 [L1133] EXPR s->info_callback VAL [={0:0}, blastFlag=0, buf={0:-1}, init=1, ret=-1, s={-21:0}, s={-21:0}, s->info_callback={0:15}, skip=0, SSLv3_client_data={4:0}, tmp=7, tmp___1=1, tmp___2=0] [L1133] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1134] EXPR s->info_callback [L1134] cb = s->info_callback [L1142] EXPR s->in_handshake [L1142] s->in_handshake += 1 [L1143] COND FALSE !(tmp___1 & 12288) VAL [={0:15}, blastFlag=0, buf={0:-1}, init=1, ret=-1, s={-21:0}, s={-21:0}, skip=0, SSLv3_client_data={4:0}, tmp=7, tmp___1=1, tmp___2=0] [L1153] COND TRUE 1 VAL [={0:15}, blastFlag=0, buf={0:-1}, init=1, ret=-1, s={-21:0}, s={-21:0}, skip=0, SSLv3_client_data={4:0}, tmp=7, tmp___1=1, tmp___2=0] [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state VAL [={0:15}, blastFlag=0, buf={0:-1}, init=1, ret=-1, s={-21:0}, s={-21:0}, s->state=12292, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=7, tmp___1=1, tmp___2=0] [L1156] COND TRUE s->state == 12292 [L1259] s->new_session = 1 [L1260] s->state = 4096 [L1261] EXPR s->ctx [L1261] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1261] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1266] s->server = 0 VAL [={0:15}, blastFlag=0, buf={0:-1}, init=1, ret=-1, s={-21:0}, s={-21:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=7, tmp___1=1, tmp___2=0] [L1267] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={0:15}, blastFlag=0, buf={0:-1}, init=1, ret=-1, s={-21:0}, s={-21:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=7, tmp___1=1, tmp___2=0] [L1272] EXPR s->version VAL [={0:15}, blastFlag=0, buf={0:-1}, init=1, ret=-1, s={-21:0}, s={-21:0}, s->version=6, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=7, tmp___1=1, tmp___2=0] [L1272] COND FALSE !((s->version & 65280) != 768) [L1278] s->type = 4096 [L1279] EXPR s->init_buf VAL [={0:15}, blastFlag=0, buf={0:-1}, init=1, ret=-1, s={-21:0}, s={-21:0}, s->init_buf={0:-13}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=7, tmp___1=1, tmp___2=0] [L1279] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1291] tmp___4 = __VERIFIER_nondet_int() [L1292] COND FALSE !(! tmp___4) [L1298] tmp___5 = __VERIFIER_nondet_int() [L1299] COND FALSE !(! tmp___5) [L1305] s->state = 4368 [L1306] EXPR s->ctx [L1306] EXPR (s->ctx)->stats.sess_connect [L1306] (s->ctx)->stats.sess_connect += 1 [L1307] s->init_num = 0 VAL [={0:15}, blastFlag=0, buf={0:-1}, init=1, ret=-1, s={-21:0}, s={-21:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message VAL [={0:15}, (s->s3)->tmp.reuse_message=18446744073709551653, blastFlag=0, buf={0:-1}, init=1, ret=-1, s={-21:0}, s={-21:0}, s->s3={-7:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 VAL [={0:15}, blastFlag=0, buf={0:-1}, init=1, ret=-1, s={-21:0}, s={-21:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1153] COND TRUE 1 VAL [={0:15}, blastFlag=0, buf={0:-1}, init=1, ret=-1, s={-21:0}, s={-21:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state VAL [={0:15}, blastFlag=0, buf={0:-1}, init=1, ret=-1, s={-21:0}, s={-21:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state VAL [={0:15}, blastFlag=0, buf={0:-1}, init=1, ret=-1, s={-21:0}, s={-21:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state VAL [={0:15}, blastFlag=0, buf={0:-1}, init=1, ret=-1, s={-21:0}, s={-21:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state VAL [={0:15}, blastFlag=0, buf={0:-1}, init=1, ret=-1, s={-21:0}, s={-21:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state VAL [={0:15}, blastFlag=0, buf={0:-1}, init=1, ret=-1, s={-21:0}, s={-21:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state VAL [={0:15}, blastFlag=0, buf={0:-1}, init=1, ret=-1, s={-21:0}, s={-21:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1171] COND TRUE s->state == 4368 [L1311] s->shutdown = 0 [L1312] ret = __VERIFIER_nondet_int() [L1313] COND TRUE blastFlag == 0 [L1314] blastFlag = 1 VAL [={0:15}, blastFlag=1, buf={0:-1}, init=1, ret=19, s={-21:0}, s={-21:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1318] COND FALSE !(ret <= 0) [L1323] s->state = 4384 [L1324] s->init_num = 0 [L1325] EXPR s->bbio [L1325] EXPR s->wbio VAL [={0:15}, blastFlag=1, buf={0:-1}, init=1, ret=19, s={-21:0}, s={-21:0}, s->bbio={0:-12}, s->wbio={0:-11}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1325] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message VAL [={0:15}, (s->s3)->tmp.reuse_message=18446744073709551653, blastFlag=1, buf={0:-1}, init=1, ret=19, s={-21:0}, s={-21:0}, s->s3={-7:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 VAL [={0:15}, blastFlag=1, buf={0:-1}, init=1, ret=19, s={-21:0}, s={-21:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1153] COND TRUE 1 VAL [={0:15}, blastFlag=1, buf={0:-1}, init=1, ret=19, s={-21:0}, s={-21:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state VAL [={0:15}, blastFlag=1, buf={0:-1}, init=1, ret=19, s={-21:0}, s={-21:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state VAL [={0:15}, blastFlag=1, buf={0:-1}, init=1, ret=19, s={-21:0}, s={-21:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state VAL [={0:15}, blastFlag=1, buf={0:-1}, init=1, ret=19, s={-21:0}, s={-21:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state VAL [={0:15}, blastFlag=1, buf={0:-1}, init=1, ret=19, s={-21:0}, s={-21:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state VAL [={0:15}, blastFlag=1, buf={0:-1}, init=1, ret=19, s={-21:0}, s={-21:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state VAL [={0:15}, blastFlag=1, buf={0:-1}, init=1, ret=19, s={-21:0}, s={-21:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1171] COND FALSE !(s->state == 4368) [L1174] EXPR s->state VAL [={0:15}, blastFlag=1, buf={0:-1}, init=1, ret=19, s={-21:0}, s={-21:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1174] COND FALSE !(s->state == 4369) [L1177] EXPR s->state VAL [={0:15}, blastFlag=1, buf={0:-1}, init=1, ret=19, s={-21:0}, s={-21:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1177] COND TRUE s->state == 4384 [L1333] ret = __VERIFIER_nondet_int() [L1334] COND TRUE blastFlag == 1 [L1335] blastFlag = 2 VAL [={0:15}, blastFlag=2, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1339] COND FALSE !(ret <= 0) [L1344] s->hit VAL [={0:15}, blastFlag=2, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, s->hit=0, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1344] COND FALSE !(s->hit) [L1347] s->state = 4400 VAL [={0:15}, blastFlag=2, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1349] s->init_num = 0 VAL [={0:15}, blastFlag=2, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message VAL [={0:15}, (s->s3)->tmp.reuse_message=18446744073709551653, blastFlag=2, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, s->s3={-7:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 VAL [={0:15}, blastFlag=2, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1153] COND TRUE 1 VAL [={0:15}, blastFlag=2, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state VAL [={0:15}, blastFlag=2, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state VAL [={0:15}, blastFlag=2, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state VAL [={0:15}, blastFlag=2, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state VAL [={0:15}, blastFlag=2, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state VAL [={0:15}, blastFlag=2, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state VAL [={0:15}, blastFlag=2, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1171] COND FALSE !(s->state == 4368) [L1174] EXPR s->state VAL [={0:15}, blastFlag=2, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1174] COND FALSE !(s->state == 4369) [L1177] EXPR s->state VAL [={0:15}, blastFlag=2, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1177] COND FALSE !(s->state == 4384) [L1180] EXPR s->state VAL [={0:15}, blastFlag=2, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1180] COND FALSE !(s->state == 4385) [L1183] EXPR s->state VAL [={0:15}, blastFlag=2, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1183] COND TRUE s->state == 4400 [L1353] EXPR s->s3 [L1353] EXPR (s->s3)->tmp.new_cipher [L1353] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:15}, ((s->s3)->tmp.new_cipher)->algorithms=18446744073709551656, (s->s3)->tmp.new_cipher={-20:0}, blastFlag=2, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, s->s3={-7:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1353] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1356] ret = __VERIFIER_nondet_int() [L1357] COND TRUE blastFlag == 2 [L1358] blastFlag = 3 VAL [={0:15}, blastFlag=3, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1362] COND FALSE !(ret <= 0) VAL [={0:15}, blastFlag=3, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1368] s->state = 4416 [L1369] s->init_num = 0 VAL [={0:15}, blastFlag=3, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message VAL [={0:15}, (s->s3)->tmp.reuse_message=18446744073709551653, blastFlag=3, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, s->s3={-7:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 VAL [={0:15}, blastFlag=3, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1153] COND TRUE 1 VAL [={0:15}, blastFlag=3, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state VAL [={0:15}, blastFlag=3, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state VAL [={0:15}, blastFlag=3, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state VAL [={0:15}, blastFlag=3, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state VAL [={0:15}, blastFlag=3, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state VAL [={0:15}, blastFlag=3, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state VAL [={0:15}, blastFlag=3, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1171] COND FALSE !(s->state == 4368) [L1174] EXPR s->state VAL [={0:15}, blastFlag=3, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1174] COND FALSE !(s->state == 4369) [L1177] EXPR s->state VAL [={0:15}, blastFlag=3, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1177] COND FALSE !(s->state == 4384) [L1180] EXPR s->state VAL [={0:15}, blastFlag=3, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1180] COND FALSE !(s->state == 4385) [L1183] EXPR s->state VAL [={0:15}, blastFlag=3, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1183] COND FALSE !(s->state == 4400) [L1186] EXPR s->state VAL [={0:15}, blastFlag=3, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1186] COND FALSE !(s->state == 4401) [L1189] EXPR s->state VAL [={0:15}, blastFlag=3, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1189] COND TRUE s->state == 4416 [L1373] ret = __VERIFIER_nondet_int() [L1374] COND TRUE blastFlag == 3 [L1375] blastFlag = 4 VAL [={0:15}, blastFlag=4, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14] [L1379] COND FALSE !(ret <= 0) [L1384] s->state = 4432 [L1385] s->init_num = 0 [L1386] tmp___6 = __VERIFIER_nondet_int() [L1387] COND FALSE !(! tmp___6) VAL [={0:15}, blastFlag=4, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14, tmp___6=-17] [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message VAL [={0:15}, (s->s3)->tmp.reuse_message=18446744073709551653, blastFlag=4, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, s->s3={-7:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14, tmp___6=-17] [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 VAL [={0:15}, blastFlag=4, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14, tmp___6=-17] [L1153] COND TRUE 1 VAL [={0:15}, blastFlag=4, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14, tmp___6=-17] [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state VAL [={0:15}, blastFlag=4, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14, tmp___6=-17] [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state VAL [={0:15}, blastFlag=4, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14, tmp___6=-17] [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state VAL [={0:15}, blastFlag=4, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14, tmp___6=-17] [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state VAL [={0:15}, blastFlag=4, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14, tmp___6=-17] [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state VAL [={0:15}, blastFlag=4, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14, tmp___6=-17] [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state VAL [={0:15}, blastFlag=4, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14, tmp___6=-17] [L1171] COND FALSE !(s->state == 4368) [L1174] EXPR s->state VAL [={0:15}, blastFlag=4, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14, tmp___6=-17] [L1174] COND FALSE !(s->state == 4369) [L1177] EXPR s->state VAL [={0:15}, blastFlag=4, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14, tmp___6=-17] [L1177] COND FALSE !(s->state == 4384) [L1180] EXPR s->state VAL [={0:15}, blastFlag=4, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14, tmp___6=-17] [L1180] COND FALSE !(s->state == 4385) [L1183] EXPR s->state VAL [={0:15}, blastFlag=4, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14, tmp___6=-17] [L1183] COND FALSE !(s->state == 4400) [L1186] EXPR s->state VAL [={0:15}, blastFlag=4, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14, tmp___6=-17] [L1186] COND FALSE !(s->state == 4401) [L1189] EXPR s->state VAL [={0:15}, blastFlag=4, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14, tmp___6=-17] [L1189] COND FALSE !(s->state == 4416) [L1192] EXPR s->state VAL [={0:15}, blastFlag=4, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14, tmp___6=-17] [L1192] COND FALSE !(s->state == 4417) [L1195] EXPR s->state VAL [={0:15}, blastFlag=4, buf={0:-1}, init=1, ret=1, s={-21:0}, s={-21:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14, tmp___6=-17] [L1195] COND TRUE s->state == 4432 [L1396] ret = __VERIFIER_nondet_int() [L1397] COND FALSE !(blastFlag == 5) VAL [={0:15}, blastFlag=4, buf={0:-1}, init=1, ret=23, s={-21:0}, s={-21:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14, tmp___6=-17] [L1402] COND FALSE !(ret <= 0) [L1407] s->state = 4448 [L1408] s->init_num = 0 VAL [={0:15}, blastFlag=4, buf={0:-1}, init=1, ret=23, s={-21:0}, s={-21:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14, tmp___6=-17] [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message VAL [={0:15}, (s->s3)->tmp.reuse_message=18446744073709551653, blastFlag=4, buf={0:-1}, init=1, ret=23, s={-21:0}, s={-21:0}, s->s3={-7:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14, tmp___6=-17] [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 VAL [={0:15}, blastFlag=4, buf={0:-1}, init=1, ret=23, s={-21:0}, s={-21:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14, tmp___6=-17] [L1153] COND TRUE 1 VAL [={0:15}, blastFlag=4, buf={0:-1}, init=1, ret=23, s={-21:0}, s={-21:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14, tmp___6=-17] [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state VAL [={0:15}, blastFlag=4, buf={0:-1}, init=1, ret=23, s={-21:0}, s={-21:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14, tmp___6=-17] [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state VAL [={0:15}, blastFlag=4, buf={0:-1}, init=1, ret=23, s={-21:0}, s={-21:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14, tmp___6=-17] [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state VAL [={0:15}, blastFlag=4, buf={0:-1}, init=1, ret=23, s={-21:0}, s={-21:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14, tmp___6=-17] [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state VAL [={0:15}, blastFlag=4, buf={0:-1}, init=1, ret=23, s={-21:0}, s={-21:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14, tmp___6=-17] [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state VAL [={0:15}, blastFlag=4, buf={0:-1}, init=1, ret=23, s={-21:0}, s={-21:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14, tmp___6=-17] [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state VAL [={0:15}, blastFlag=4, buf={0:-1}, init=1, ret=23, s={-21:0}, s={-21:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14, tmp___6=-17] [L1171] COND FALSE !(s->state == 4368) [L1174] EXPR s->state VAL [={0:15}, blastFlag=4, buf={0:-1}, init=1, ret=23, s={-21:0}, s={-21:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14, tmp___6=-17] [L1174] COND FALSE !(s->state == 4369) [L1177] EXPR s->state VAL [={0:15}, blastFlag=4, buf={0:-1}, init=1, ret=23, s={-21:0}, s={-21:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14, tmp___6=-17] [L1177] COND FALSE !(s->state == 4384) [L1180] EXPR s->state VAL [={0:15}, blastFlag=4, buf={0:-1}, init=1, ret=23, s={-21:0}, s={-21:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14, tmp___6=-17] [L1180] COND FALSE !(s->state == 4385) [L1183] EXPR s->state VAL [={0:15}, blastFlag=4, buf={0:-1}, init=1, ret=23, s={-21:0}, s={-21:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14, tmp___6=-17] [L1183] COND FALSE !(s->state == 4400) [L1186] EXPR s->state VAL [={0:15}, blastFlag=4, buf={0:-1}, init=1, ret=23, s={-21:0}, s={-21:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14, tmp___6=-17] [L1186] COND FALSE !(s->state == 4401) [L1189] EXPR s->state VAL [={0:15}, blastFlag=4, buf={0:-1}, init=1, ret=23, s={-21:0}, s={-21:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14, tmp___6=-17] [L1189] COND FALSE !(s->state == 4416) [L1192] EXPR s->state VAL [={0:15}, blastFlag=4, buf={0:-1}, init=1, ret=23, s={-21:0}, s={-21:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14, tmp___6=-17] [L1192] COND FALSE !(s->state == 4417) [L1195] EXPR s->state VAL [={0:15}, blastFlag=4, buf={0:-1}, init=1, ret=23, s={-21:0}, s={-21:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14, tmp___6=-17] [L1195] COND FALSE !(s->state == 4432) [L1198] EXPR s->state VAL [={0:15}, blastFlag=4, buf={0:-1}, init=1, ret=23, s={-21:0}, s={-21:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14, tmp___6=-17] [L1198] COND FALSE !(s->state == 4433) [L1201] EXPR s->state VAL [={0:15}, blastFlag=4, buf={0:-1}, init=1, ret=23, s={-21:0}, s={-21:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14, tmp___6=-17] [L1201] COND TRUE s->state == 4448 [L1412] ret = __VERIFIER_nondet_int() [L1413] COND TRUE blastFlag == 4 VAL [={0:15}, blastFlag=4, buf={0:-1}, init=1, ret=-19, s={-21:0}, s={-21:0}, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14, tmp___6=-17] [L1668] reach_error() VAL [={0:15}, blastFlag=4, buf={0:-1}, init=1, ret=-19, s={-21:0}, s={-21:0}, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=13, tmp___5=14, tmp___6=-17] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 140 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 51.8s, OverallIterations: 18, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 41.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 17 mSolverCounterUnknown, 1648 SdHoareTripleChecker+Valid, 41.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1648 mSDsluCounter, 6596 SdHoareTripleChecker+Invalid, 39.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3529 mSDsCounter, 412 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5713 IncrementalHoareTripleChecker+Invalid, 6142 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 412 mSolverCounterUnsat, 3067 mSDtfsCounter, 5713 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 675 GetRequests, 605 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=876occurred in iteration=14, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 2070 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 2033 NumberOfCodeBlocks, 2033 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2148 ConstructedInterpolants, 0 QuantifiedInterpolants, 5332 SizeOfPredicates, 8 NumberOfNonLiveVariables, 2739 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 21 InterpolantComputations, 17 PerfectInterpolantSequences, 2453/2535 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-03-17 23:23:24,247 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...