/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/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/openssl-simplified/s3_clnt_1.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-06 18:50:20,936 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-06 18:50:20,952 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-06 18:50:21,002 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-06 18:50:21,003 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-06 18:50:21,004 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-06 18:50:21,006 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-06 18:50:21,008 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-06 18:50:21,009 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-06 18:50:21,012 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-06 18:50:21,013 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-06 18:50:21,014 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-06 18:50:21,014 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-06 18:50:21,016 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-06 18:50:21,016 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-06 18:50:21,018 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-06 18:50:21,019 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-06 18:50:21,019 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-06 18:50:21,021 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-06 18:50:21,025 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-06 18:50:21,026 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-06 18:50:21,027 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-06 18:50:21,027 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-06 18:50:21,028 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-06 18:50:21,028 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-06 18:50:21,033 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-06 18:50:21,033 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-06 18:50:21,033 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-06 18:50:21,034 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-06 18:50:21,034 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-06 18:50:21,035 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-06 18:50:21,035 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-06 18:50:21,036 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-06 18:50:21,036 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-06 18:50:21,037 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-06 18:50:21,037 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-06 18:50:21,038 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-06 18:50:21,038 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-06 18:50:21,038 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-06 18:50:21,038 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-06 18:50:21,039 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-06 18:50:21,040 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-06 18:50:21,040 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-06 18:50:21,048 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-06 18:50:21,049 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-06 18:50:21,049 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-06 18:50:21,049 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-06 18:50:21,050 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-06 18:50:21,050 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-06 18:50:21,050 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-06 18:50:21,050 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-06 18:50:21,050 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-06 18:50:21,050 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-06 18:50:21,051 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-06 18:50:21,051 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-06 18:50:21,051 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-06 18:50:21,051 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-06 18:50:21,051 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-06 18:50:21,051 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-06 18:50:21,051 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-06 18:50:21,051 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-06 18:50:21,051 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-06 18:50:21,051 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-06 18:50:21,051 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-06 18:50:21,051 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-06 18:50:21,052 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-06 18:50:21,052 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-06 18:50:21,052 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-06 18:50:21,052 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-06 18:50:21,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-06 18:50:21,263 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-06 18:50:21,265 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-06 18:50:21,266 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-06 18:50:21,268 INFO L275 PluginConnector]: CDTParser initialized [2022-04-06 18:50:21,268 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl-simplified/s3_clnt_1.cil-1.c [2022-04-06 18:50:21,328 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d45084ed2/d6f449058af04763b137d695ba9394f0/FLAGc0fcd9e60 [2022-04-06 18:50:21,685 INFO L306 CDTParser]: Found 1 translation units. [2022-04-06 18:50:21,685 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_clnt_1.cil-1.c [2022-04-06 18:50:21,691 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d45084ed2/d6f449058af04763b137d695ba9394f0/FLAGc0fcd9e60 [2022-04-06 18:50:21,700 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d45084ed2/d6f449058af04763b137d695ba9394f0 [2022-04-06 18:50:21,702 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-06 18:50:21,703 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-06 18:50:21,704 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-06 18:50:21,704 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-06 18:50:21,706 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-06 18:50:21,706 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 06:50:21" (1/1) ... [2022-04-06 18:50:21,707 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7749a68b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:50:21, skipping insertion in model container [2022-04-06 18:50:21,707 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 06:50:21" (1/1) ... [2022-04-06 18:50:21,711 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-06 18:50:21,727 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-06 18:50:21,904 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-simplified/s3_clnt_1.cil-1.c[35497,35510] [2022-04-06 18:50:21,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-06 18:50:21,921 INFO L203 MainTranslator]: Completed pre-run [2022-04-06 18:50:21,965 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-simplified/s3_clnt_1.cil-1.c[35497,35510] [2022-04-06 18:50:21,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-06 18:50:21,974 INFO L208 MainTranslator]: Completed translation [2022-04-06 18:50:21,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:50:21 WrapperNode [2022-04-06 18:50:21,974 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-06 18:50:21,975 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-06 18:50:21,975 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-06 18:50:21,975 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-06 18:50:21,983 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:50:21" (1/1) ... [2022-04-06 18:50:21,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:50:21" (1/1) ... [2022-04-06 18:50:21,997 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:50:21" (1/1) ... [2022-04-06 18:50:21,997 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:50:21" (1/1) ... [2022-04-06 18:50:22,004 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:50:21" (1/1) ... [2022-04-06 18:50:22,022 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:50:21" (1/1) ... [2022-04-06 18:50:22,024 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:50:21" (1/1) ... [2022-04-06 18:50:22,025 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-06 18:50:22,026 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-06 18:50:22,026 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-06 18:50:22,026 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-06 18:50:22,027 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:50:21" (1/1) ... [2022-04-06 18:50:22,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-06 18:50:22,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 18:50:22,056 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-06 18:50:22,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-06 18:50:22,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-06 18:50:22,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-06 18:50:22,087 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-06 18:50:22,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2022-04-06 18:50:22,087 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-06 18:50:22,087 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-06 18:50:22,087 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-06 18:50:22,087 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-06 18:50:22,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-06 18:50:22,087 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-06 18:50:22,088 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-06 18:50:22,088 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-06 18:50:22,089 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2022-04-06 18:50:22,089 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-06 18:50:22,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-06 18:50:22,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-06 18:50:22,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-06 18:50:22,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-06 18:50:22,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-06 18:50:22,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-06 18:50:22,183 INFO L234 CfgBuilder]: Building ICFG [2022-04-06 18:50:22,184 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-06 18:50:22,262 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-06 18:50:22,504 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-04-06 18:50:22,505 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-04-06 18:50:22,507 INFO L275 CfgBuilder]: Performing block encoding [2022-04-06 18:50:22,511 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-06 18:50:22,511 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-06 18:50:22,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 06:50:22 BoogieIcfgContainer [2022-04-06 18:50:22,513 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-06 18:50:22,514 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-06 18:50:22,514 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-06 18:50:22,525 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-06 18:50:22,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.04 06:50:21" (1/3) ... [2022-04-06 18:50:22,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@622a6cab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 06:50:22, skipping insertion in model container [2022-04-06 18:50:22,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:50:21" (2/3) ... [2022-04-06 18:50:22,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@622a6cab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 06:50:22, skipping insertion in model container [2022-04-06 18:50:22,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 06:50:22" (3/3) ... [2022-04-06 18:50:22,527 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt_1.cil-1.c [2022-04-06 18:50:22,530 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-06 18:50:22,530 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-06 18:50:22,567 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-06 18:50:22,574 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-06 18:50:22,574 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-06 18:50:22,588 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 128 states have (on average 1.703125) internal successors, (218), 129 states have internal predecessors, (218), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-06 18:50:22,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-06 18:50:22,593 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:50:22,593 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 18:50:22,594 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:50:22,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:50:22,597 INFO L85 PathProgramCache]: Analyzing trace with hash -53505819, now seen corresponding path program 1 times [2022-04-06 18:50:22,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:22,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [765932480] [2022-04-06 18:50:22,608 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:50:22,608 INFO L85 PathProgramCache]: Analyzing trace with hash -53505819, now seen corresponding path program 2 times [2022-04-06 18:50:22,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:50:22,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680877011] [2022-04-06 18:50:22,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:50:22,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:50:22,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:22,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:50:22,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:22,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 18:50:22,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:50:22,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680877011] [2022-04-06 18:50:22,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680877011] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:22,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:50:22,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:50:22,838 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:50:22,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [765932480] [2022-04-06 18:50:22,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [765932480] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:22,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:50:22,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:50:22,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244271548] [2022-04-06 18:50:22,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:50:22,844 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:50:22,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:22,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:50:22,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:50:22,868 INFO L87 Difference]: Start difference. First operand has 136 states, 128 states have (on average 1.703125) internal successors, (218), 129 states have internal predecessors, (218), 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 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:23,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:50:23,197 INFO L93 Difference]: Finished difference Result 373 states and 628 transitions. [2022-04-06 18:50:23,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:50:23,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-06 18:50:23,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:50:23,211 INFO L225 Difference]: With dead ends: 373 [2022-04-06 18:50:23,212 INFO L226 Difference]: Without dead ends: 217 [2022-04-06 18:50:23,215 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 18:50:23,217 INFO L913 BasicCegarLoop]: 214 mSDtfsCounter, 575 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-06 18:50:23,218 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [577 Valid, 223 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-06 18:50:23,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-04-06 18:50:23,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2022-04-06 18:50:23,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 212 states have (on average 1.4952830188679245) internal successors, (317), 212 states have internal predecessors, (317), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:23,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 321 transitions. [2022-04-06 18:50:23,273 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 321 transitions. Word has length 30 [2022-04-06 18:50:23,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:50:23,273 INFO L478 AbstractCegarLoop]: Abstraction has 217 states and 321 transitions. [2022-04-06 18:50:23,274 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:23,274 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 321 transitions. [2022-04-06 18:50:23,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-06 18:50:23,275 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:50:23,276 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 18:50:23,276 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-06 18:50:23,276 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:50:23,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:50:23,276 INFO L85 PathProgramCache]: Analyzing trace with hash -67660754, now seen corresponding path program 1 times [2022-04-06 18:50:23,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:23,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1831956157] [2022-04-06 18:50:23,277 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:50:23,278 INFO L85 PathProgramCache]: Analyzing trace with hash -67660754, now seen corresponding path program 2 times [2022-04-06 18:50:23,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:50:23,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184048238] [2022-04-06 18:50:23,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:50:23,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:50:23,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:23,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:50:23,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:23,357 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 18:50:23,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:50:23,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184048238] [2022-04-06 18:50:23,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184048238] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:23,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:50:23,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:50:23,359 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:50:23,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1831956157] [2022-04-06 18:50:23,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1831956157] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:23,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:50:23,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:50:23,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080421258] [2022-04-06 18:50:23,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:50:23,360 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:50:23,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:23,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:50:23,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:50:23,361 INFO L87 Difference]: Start difference. First operand 217 states and 321 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:23,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:50:23,541 INFO L93 Difference]: Finished difference Result 346 states and 519 transitions. [2022-04-06 18:50:23,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:50:23,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-06 18:50:23,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:50:23,549 INFO L225 Difference]: With dead ends: 346 [2022-04-06 18:50:23,550 INFO L226 Difference]: Without dead ends: 242 [2022-04-06 18:50:23,551 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 18:50:23,552 INFO L913 BasicCegarLoop]: 185 mSDtfsCounter, 188 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-06 18:50:23,552 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 192 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-06 18:50:23,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-04-06 18:50:23,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 234. [2022-04-06 18:50:23,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 229 states have (on average 1.480349344978166) internal successors, (339), 229 states have internal predecessors, (339), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:23,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 343 transitions. [2022-04-06 18:50:23,569 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 343 transitions. Word has length 44 [2022-04-06 18:50:23,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:50:23,569 INFO L478 AbstractCegarLoop]: Abstraction has 234 states and 343 transitions. [2022-04-06 18:50:23,569 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:23,569 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 343 transitions. [2022-04-06 18:50:23,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-06 18:50:23,571 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:50:23,579 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 18:50:23,579 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-06 18:50:23,579 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:50:23,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:50:23,580 INFO L85 PathProgramCache]: Analyzing trace with hash 791014641, now seen corresponding path program 1 times [2022-04-06 18:50:23,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:23,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1156412529] [2022-04-06 18:50:23,581 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:50:23,581 INFO L85 PathProgramCache]: Analyzing trace with hash 791014641, now seen corresponding path program 2 times [2022-04-06 18:50:23,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:50:23,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110002518] [2022-04-06 18:50:23,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:50:23,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:50:23,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:23,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:50:23,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:23,654 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-06 18:50:23,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:50:23,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110002518] [2022-04-06 18:50:23,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110002518] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:23,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:50:23,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:50:23,655 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:50:23,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1156412529] [2022-04-06 18:50:23,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1156412529] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:23,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:50:23,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:50:23,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493676702] [2022-04-06 18:50:23,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:50:23,656 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:50:23,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:23,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:50:23,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:50:23,657 INFO L87 Difference]: Start difference. First operand 234 states and 343 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:23,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:50:23,854 INFO L93 Difference]: Finished difference Result 557 states and 847 transitions. [2022-04-06 18:50:23,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:50:23,855 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2022-04-06 18:50:23,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:50:23,857 INFO L225 Difference]: With dead ends: 557 [2022-04-06 18:50:23,857 INFO L226 Difference]: Without dead ends: 334 [2022-04-06 18:50:23,859 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 18:50:23,860 INFO L913 BasicCegarLoop]: 196 mSDtfsCounter, 208 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-06 18:50:23,864 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 203 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-06 18:50:23,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2022-04-06 18:50:23,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 316. [2022-04-06 18:50:23,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 311 states have (on average 1.4115755627009647) internal successors, (439), 311 states have internal predecessors, (439), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:23,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 443 transitions. [2022-04-06 18:50:23,895 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 443 transitions. Word has length 61 [2022-04-06 18:50:23,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:50:23,896 INFO L478 AbstractCegarLoop]: Abstraction has 316 states and 443 transitions. [2022-04-06 18:50:23,896 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:23,896 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 443 transitions. [2022-04-06 18:50:23,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-06 18:50:23,902 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:50:23,902 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 18:50:23,903 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-06 18:50:23,904 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:50:23,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:50:23,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1014423693, now seen corresponding path program 1 times [2022-04-06 18:50:23,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:23,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1466835310] [2022-04-06 18:50:23,907 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:50:23,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1014423693, now seen corresponding path program 2 times [2022-04-06 18:50:23,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:50:23,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731887786] [2022-04-06 18:50:23,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:50:23,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:50:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:23,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:50:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:23,974 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-06 18:50:23,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:50:23,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731887786] [2022-04-06 18:50:23,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731887786] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:23,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:50:23,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:50:23,975 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:50:23,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1466835310] [2022-04-06 18:50:23,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1466835310] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:23,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:50:23,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:50:23,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882580439] [2022-04-06 18:50:23,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:50:23,976 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:50:23,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:23,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:50:23,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:50:23,977 INFO L87 Difference]: Start difference. First operand 316 states and 443 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:24,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:50:24,131 INFO L93 Difference]: Finished difference Result 665 states and 948 transitions. [2022-04-06 18:50:24,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:50:24,131 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2022-04-06 18:50:24,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:50:24,133 INFO L225 Difference]: With dead ends: 665 [2022-04-06 18:50:24,133 INFO L226 Difference]: Without dead ends: 362 [2022-04-06 18:50:24,133 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 18:50:24,136 INFO L913 BasicCegarLoop]: 186 mSDtfsCounter, 188 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 18:50:24,138 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 193 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 18:50:24,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-04-06 18:50:24,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 354. [2022-04-06 18:50:24,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 349 states have (on average 1.3954154727793697) internal successors, (487), 349 states have internal predecessors, (487), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:24,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 491 transitions. [2022-04-06 18:50:24,155 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 491 transitions. Word has length 61 [2022-04-06 18:50:24,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:50:24,156 INFO L478 AbstractCegarLoop]: Abstraction has 354 states and 491 transitions. [2022-04-06 18:50:24,156 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:24,156 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 491 transitions. [2022-04-06 18:50:24,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-06 18:50:24,160 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:50:24,161 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 18:50:24,161 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-06 18:50:24,162 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:50:24,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:50:24,162 INFO L85 PathProgramCache]: Analyzing trace with hash -2014835408, now seen corresponding path program 1 times [2022-04-06 18:50:24,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:24,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [773528035] [2022-04-06 18:50:24,163 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:50:24,163 INFO L85 PathProgramCache]: Analyzing trace with hash -2014835408, now seen corresponding path program 2 times [2022-04-06 18:50:24,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:50:24,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374180983] [2022-04-06 18:50:24,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:50:24,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:50:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:24,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:50:24,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:24,228 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-06 18:50:24,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:50:24,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374180983] [2022-04-06 18:50:24,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374180983] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:24,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:50:24,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:50:24,229 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:50:24,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [773528035] [2022-04-06 18:50:24,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [773528035] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:24,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:50:24,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:50:24,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540332729] [2022-04-06 18:50:24,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:50:24,230 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:50:24,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:24,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:50:24,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:50:24,231 INFO L87 Difference]: Start difference. First operand 354 states and 491 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:24,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:50:24,390 INFO L93 Difference]: Finished difference Result 801 states and 1149 transitions. [2022-04-06 18:50:24,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:50:24,391 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-04-06 18:50:24,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:50:24,393 INFO L225 Difference]: With dead ends: 801 [2022-04-06 18:50:24,393 INFO L226 Difference]: Without dead ends: 458 [2022-04-06 18:50:24,394 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 18:50:24,394 INFO L913 BasicCegarLoop]: 173 mSDtfsCounter, 293 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 18:50:24,394 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [293 Valid, 180 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 18:50:24,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2022-04-06 18:50:24,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 432. [2022-04-06 18:50:24,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 427 states have (on average 1.4543325526932085) internal successors, (621), 427 states have internal predecessors, (621), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:24,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 625 transitions. [2022-04-06 18:50:24,416 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 625 transitions. Word has length 74 [2022-04-06 18:50:24,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:50:24,416 INFO L478 AbstractCegarLoop]: Abstraction has 432 states and 625 transitions. [2022-04-06 18:50:24,416 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:24,416 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 625 transitions. [2022-04-06 18:50:24,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-06 18:50:24,417 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:50:24,418 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2022-04-06 18:50:24,418 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-06 18:50:24,418 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:50:24,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:50:24,418 INFO L85 PathProgramCache]: Analyzing trace with hash 10265417, now seen corresponding path program 1 times [2022-04-06 18:50:24,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:24,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [334170677] [2022-04-06 18:50:24,419 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:50:24,419 INFO L85 PathProgramCache]: Analyzing trace with hash 10265417, now seen corresponding path program 2 times [2022-04-06 18:50:24,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:50:24,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208422032] [2022-04-06 18:50:24,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:50:24,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:50:24,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:24,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:50:24,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:24,473 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-06 18:50:24,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:50:24,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208422032] [2022-04-06 18:50:24,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208422032] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:24,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:50:24,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:50:24,473 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:50:24,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [334170677] [2022-04-06 18:50:24,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [334170677] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:24,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:50:24,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:50:24,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544617856] [2022-04-06 18:50:24,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:50:24,474 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:50:24,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:24,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:50:24,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:50:24,475 INFO L87 Difference]: Start difference. First operand 432 states and 625 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:24,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:50:24,629 INFO L93 Difference]: Finished difference Result 899 states and 1310 transitions. [2022-04-06 18:50:24,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:50:24,630 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-06 18:50:24,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:50:24,633 INFO L225 Difference]: With dead ends: 899 [2022-04-06 18:50:24,633 INFO L226 Difference]: Without dead ends: 480 [2022-04-06 18:50:24,634 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 18:50:24,635 INFO L913 BasicCegarLoop]: 185 mSDtfsCounter, 184 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 18:50:24,635 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 192 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 18:50:24,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2022-04-06 18:50:24,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 474. [2022-04-06 18:50:24,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 469 states have (on average 1.4349680170575694) internal successors, (673), 469 states have internal predecessors, (673), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:24,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 677 transitions. [2022-04-06 18:50:24,656 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 677 transitions. Word has length 77 [2022-04-06 18:50:24,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:50:24,657 INFO L478 AbstractCegarLoop]: Abstraction has 474 states and 677 transitions. [2022-04-06 18:50:24,657 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:24,657 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 677 transitions. [2022-04-06 18:50:24,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-06 18:50:24,658 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:50:24,658 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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] [2022-04-06 18:50:24,658 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-06 18:50:24,659 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:50:24,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:50:24,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1616356031, now seen corresponding path program 1 times [2022-04-06 18:50:24,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:24,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1266546439] [2022-04-06 18:50:24,660 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:50:24,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1616356031, now seen corresponding path program 2 times [2022-04-06 18:50:24,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:50:24,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634939151] [2022-04-06 18:50:24,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:50:24,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:50:24,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:24,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:50:24,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:24,710 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-06 18:50:24,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:50:24,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634939151] [2022-04-06 18:50:24,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634939151] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:24,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:50:24,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:50:24,713 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:50:24,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1266546439] [2022-04-06 18:50:24,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1266546439] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:24,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:50:24,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:50:24,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591028619] [2022-04-06 18:50:24,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:50:24,714 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:50:24,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:24,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:50:24,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:50:24,714 INFO L87 Difference]: Start difference. First operand 474 states and 677 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:24,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:50:24,867 INFO L93 Difference]: Finished difference Result 953 states and 1367 transitions. [2022-04-06 18:50:24,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:50:24,868 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2022-04-06 18:50:24,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:50:24,870 INFO L225 Difference]: With dead ends: 953 [2022-04-06 18:50:24,870 INFO L226 Difference]: Without dead ends: 712 [2022-04-06 18:50:24,871 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 18:50:24,871 INFO L913 BasicCegarLoop]: 315 mSDtfsCounter, 294 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 18:50:24,871 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [294 Valid, 322 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 18:50:24,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2022-04-06 18:50:24,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 712. [2022-04-06 18:50:24,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 707 states have (on average 1.42998585572843) internal successors, (1011), 707 states have internal predecessors, (1011), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:24,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1015 transitions. [2022-04-06 18:50:24,909 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1015 transitions. Word has length 97 [2022-04-06 18:50:24,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:50:24,910 INFO L478 AbstractCegarLoop]: Abstraction has 712 states and 1015 transitions. [2022-04-06 18:50:24,910 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:24,910 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1015 transitions. [2022-04-06 18:50:24,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-06 18:50:24,914 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:50:24,914 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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] [2022-04-06 18:50:24,914 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-06 18:50:24,914 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:50:24,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:50:24,915 INFO L85 PathProgramCache]: Analyzing trace with hash 345218627, now seen corresponding path program 1 times [2022-04-06 18:50:24,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:24,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1201502780] [2022-04-06 18:50:24,916 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:50:24,916 INFO L85 PathProgramCache]: Analyzing trace with hash 345218627, now seen corresponding path program 2 times [2022-04-06 18:50:24,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:50:24,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189567020] [2022-04-06 18:50:24,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:50:24,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:50:24,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:24,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:50:24,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:24,952 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-06 18:50:24,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:50:24,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189567020] [2022-04-06 18:50:24,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189567020] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:24,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:50:24,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:50:24,953 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:50:24,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1201502780] [2022-04-06 18:50:24,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1201502780] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:24,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:50:24,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:50:24,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341863578] [2022-04-06 18:50:24,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:50:24,953 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:50:24,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:24,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:50:24,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:50:24,954 INFO L87 Difference]: Start difference. First operand 712 states and 1015 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:25,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:50:25,107 INFO L93 Difference]: Finished difference Result 1212 states and 1727 transitions. [2022-04-06 18:50:25,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:50:25,107 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2022-04-06 18:50:25,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:50:25,109 INFO L225 Difference]: With dead ends: 1212 [2022-04-06 18:50:25,109 INFO L226 Difference]: Without dead ends: 733 [2022-04-06 18:50:25,110 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 18:50:25,110 INFO L913 BasicCegarLoop]: 196 mSDtfsCounter, 182 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 18:50:25,111 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 203 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 18:50:25,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2022-04-06 18:50:25,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 733. [2022-04-06 18:50:25,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 728 states have (on average 1.4258241758241759) internal successors, (1038), 728 states have internal predecessors, (1038), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:25,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1042 transitions. [2022-04-06 18:50:25,137 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1042 transitions. Word has length 97 [2022-04-06 18:50:25,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:50:25,137 INFO L478 AbstractCegarLoop]: Abstraction has 733 states and 1042 transitions. [2022-04-06 18:50:25,138 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:25,138 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1042 transitions. [2022-04-06 18:50:25,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-06 18:50:25,139 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:50:25,139 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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] [2022-04-06 18:50:25,139 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-06 18:50:25,139 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:50:25,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:50:25,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1195196107, now seen corresponding path program 1 times [2022-04-06 18:50:25,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:25,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1014272371] [2022-04-06 18:50:25,140 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:50:25,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1195196107, now seen corresponding path program 2 times [2022-04-06 18:50:25,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:50:25,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605328271] [2022-04-06 18:50:25,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:50:25,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:50:25,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:25,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:50:25,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:25,171 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-04-06 18:50:25,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:50:25,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605328271] [2022-04-06 18:50:25,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605328271] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:25,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:50:25,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:50:25,172 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:50:25,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1014272371] [2022-04-06 18:50:25,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1014272371] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:25,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:50:25,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:50:25,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766361583] [2022-04-06 18:50:25,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:50:25,172 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:50:25,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:25,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:50:25,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:50:25,173 INFO L87 Difference]: Start difference. First operand 733 states and 1042 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:25,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:50:25,384 INFO L93 Difference]: Finished difference Result 974 states and 1388 transitions. [2022-04-06 18:50:25,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:50:25,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2022-04-06 18:50:25,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:50:25,387 INFO L225 Difference]: With dead ends: 974 [2022-04-06 18:50:25,387 INFO L226 Difference]: Without dead ends: 972 [2022-04-06 18:50:25,388 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 18:50:25,388 INFO L913 BasicCegarLoop]: 163 mSDtfsCounter, 456 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-06 18:50:25,388 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [456 Valid, 170 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-06 18:50:25,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2022-04-06 18:50:25,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 972. [2022-04-06 18:50:25,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 967 states have (on average 1.4291623578076524) internal successors, (1382), 967 states have internal predecessors, (1382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:25,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1386 transitions. [2022-04-06 18:50:25,455 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1386 transitions. Word has length 99 [2022-04-06 18:50:25,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:50:25,455 INFO L478 AbstractCegarLoop]: Abstraction has 972 states and 1386 transitions. [2022-04-06 18:50:25,455 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:25,455 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1386 transitions. [2022-04-06 18:50:25,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-04-06 18:50:25,457 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:50:25,457 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 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] [2022-04-06 18:50:25,457 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-06 18:50:25,457 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:50:25,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:50:25,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1938929245, now seen corresponding path program 1 times [2022-04-06 18:50:25,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:25,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [555974889] [2022-04-06 18:50:25,458 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:50:25,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1938929245, now seen corresponding path program 2 times [2022-04-06 18:50:25,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:50:25,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452719974] [2022-04-06 18:50:25,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:50:25,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:50:25,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:25,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:50:25,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:25,499 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-04-06 18:50:25,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:50:25,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452719974] [2022-04-06 18:50:25,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452719974] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:25,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:50:25,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:50:25,500 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:50:25,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [555974889] [2022-04-06 18:50:25,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [555974889] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:25,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:50:25,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:50:25,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810998744] [2022-04-06 18:50:25,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:50:25,500 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:50:25,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:25,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:50:25,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:50:25,501 INFO L87 Difference]: Start difference. First operand 972 states and 1386 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 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-04-06 18:50:25,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:50:25,690 INFO L93 Difference]: Finished difference Result 2037 states and 2925 transitions. [2022-04-06 18:50:25,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:50:25,691 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 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 124 [2022-04-06 18:50:25,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:50:25,694 INFO L225 Difference]: With dead ends: 2037 [2022-04-06 18:50:25,694 INFO L226 Difference]: Without dead ends: 1078 [2022-04-06 18:50:25,695 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 18:50:25,696 INFO L913 BasicCegarLoop]: 185 mSDtfsCounter, 186 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 18:50:25,696 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 192 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 18:50:25,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2022-04-06 18:50:25,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 1064. [2022-04-06 18:50:25,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1064 states, 1059 states have (on average 1.4107648725212465) internal successors, (1494), 1059 states have internal predecessors, (1494), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:25,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1498 transitions. [2022-04-06 18:50:25,736 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1498 transitions. Word has length 124 [2022-04-06 18:50:25,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:50:25,736 INFO L478 AbstractCegarLoop]: Abstraction has 1064 states and 1498 transitions. [2022-04-06 18:50:25,736 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 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-04-06 18:50:25,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1498 transitions. [2022-04-06 18:50:25,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-04-06 18:50:25,738 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:50:25,738 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 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] [2022-04-06 18:50:25,738 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-06 18:50:25,738 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:50:25,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:50:25,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1804156861, now seen corresponding path program 1 times [2022-04-06 18:50:25,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:25,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [448200591] [2022-04-06 18:50:25,739 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:50:25,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1804156861, now seen corresponding path program 2 times [2022-04-06 18:50:25,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:50:25,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676826925] [2022-04-06 18:50:25,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:50:25,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:50:25,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:25,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:50:25,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:25,773 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-06 18:50:25,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:50:25,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676826925] [2022-04-06 18:50:25,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676826925] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:25,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:50:25,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:50:25,773 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:50:25,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [448200591] [2022-04-06 18:50:25,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [448200591] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:25,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:50:25,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:50:25,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393425156] [2022-04-06 18:50:25,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:50:25,774 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:50:25,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:25,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:50:25,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:50:25,774 INFO L87 Difference]: Start difference. First operand 1064 states and 1498 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:26,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:50:26,003 INFO L93 Difference]: Finished difference Result 2319 states and 3319 transitions. [2022-04-06 18:50:26,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:50:26,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 145 [2022-04-06 18:50:26,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:50:26,007 INFO L225 Difference]: With dead ends: 2319 [2022-04-06 18:50:26,007 INFO L226 Difference]: Without dead ends: 1260 [2022-04-06 18:50:26,009 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 18:50:26,009 INFO L913 BasicCegarLoop]: 196 mSDtfsCounter, 222 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 18:50:26,009 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 203 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 18:50:26,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2022-04-06 18:50:26,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 1220. [2022-04-06 18:50:26,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1220 states, 1215 states have (on average 1.4139917695473252) internal successors, (1718), 1215 states have internal predecessors, (1718), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:26,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 1722 transitions. [2022-04-06 18:50:26,057 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 1722 transitions. Word has length 145 [2022-04-06 18:50:26,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:50:26,058 INFO L478 AbstractCegarLoop]: Abstraction has 1220 states and 1722 transitions. [2022-04-06 18:50:26,058 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:26,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1722 transitions. [2022-04-06 18:50:26,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-04-06 18:50:26,060 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:50:26,060 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 18:50:26,060 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-06 18:50:26,060 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:50:26,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:50:26,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1263783822, now seen corresponding path program 1 times [2022-04-06 18:50:26,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:26,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1952275361] [2022-04-06 18:50:26,061 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:50:26,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1263783822, now seen corresponding path program 2 times [2022-04-06 18:50:26,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:50:26,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012315124] [2022-04-06 18:50:26,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:50:26,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:50:26,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:26,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:50:26,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:26,099 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-06 18:50:26,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:50:26,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012315124] [2022-04-06 18:50:26,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012315124] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:26,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:50:26,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:50:26,099 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:50:26,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1952275361] [2022-04-06 18:50:26,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1952275361] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:26,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:50:26,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:50:26,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504090070] [2022-04-06 18:50:26,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:50:26,100 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:50:26,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:26,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:50:26,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:50:26,101 INFO L87 Difference]: Start difference. First operand 1220 states and 1722 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:26,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:50:26,305 INFO L93 Difference]: Finished difference Result 2547 states and 3571 transitions. [2022-04-06 18:50:26,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:50:26,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (3), 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 181 [2022-04-06 18:50:26,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:50:26,309 INFO L225 Difference]: With dead ends: 2547 [2022-04-06 18:50:26,309 INFO L226 Difference]: Without dead ends: 1340 [2022-04-06 18:50:26,311 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 18:50:26,311 INFO L913 BasicCegarLoop]: 185 mSDtfsCounter, 181 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 18:50:26,311 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 192 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 18:50:26,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2022-04-06 18:50:26,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1332. [2022-04-06 18:50:26,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1332 states, 1327 states have (on average 1.3941220798794274) internal successors, (1850), 1327 states have internal predecessors, (1850), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:26,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 1332 states and 1854 transitions. [2022-04-06 18:50:26,364 INFO L78 Accepts]: Start accepts. Automaton has 1332 states and 1854 transitions. Word has length 181 [2022-04-06 18:50:26,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:50:26,365 INFO L478 AbstractCegarLoop]: Abstraction has 1332 states and 1854 transitions. [2022-04-06 18:50:26,365 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:26,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 1854 transitions. [2022-04-06 18:50:26,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-04-06 18:50:26,367 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:50:26,367 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 18:50:26,367 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-06 18:50:26,367 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:50:26,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:50:26,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1824483600, now seen corresponding path program 1 times [2022-04-06 18:50:26,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:26,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2019515772] [2022-04-06 18:50:26,368 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:50:26,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1824483600, now seen corresponding path program 2 times [2022-04-06 18:50:26,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:50:26,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936824734] [2022-04-06 18:50:26,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:50:26,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:50:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:26,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:50:26,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:26,401 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-06 18:50:26,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:50:26,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936824734] [2022-04-06 18:50:26,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936824734] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:26,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:50:26,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:50:26,402 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:50:26,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2019515772] [2022-04-06 18:50:26,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2019515772] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:26,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:50:26,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:50:26,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006806709] [2022-04-06 18:50:26,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:50:26,403 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:50:26,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:26,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:50:26,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:50:26,403 INFO L87 Difference]: Start difference. First operand 1332 states and 1854 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:26,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:50:26,600 INFO L93 Difference]: Finished difference Result 2787 states and 3871 transitions. [2022-04-06 18:50:26,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:50:26,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (3), 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 181 [2022-04-06 18:50:26,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:50:26,604 INFO L225 Difference]: With dead ends: 2787 [2022-04-06 18:50:26,604 INFO L226 Difference]: Without dead ends: 1468 [2022-04-06 18:50:26,606 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 18:50:26,607 INFO L913 BasicCegarLoop]: 186 mSDtfsCounter, 183 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 18:50:26,607 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 193 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 18:50:26,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2022-04-06 18:50:26,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1456. [2022-04-06 18:50:26,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1456 states, 1451 states have (on average 1.3742246726395588) internal successors, (1994), 1451 states have internal predecessors, (1994), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:26,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 1456 states and 1998 transitions. [2022-04-06 18:50:26,680 INFO L78 Accepts]: Start accepts. Automaton has 1456 states and 1998 transitions. Word has length 181 [2022-04-06 18:50:26,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:50:26,680 INFO L478 AbstractCegarLoop]: Abstraction has 1456 states and 1998 transitions. [2022-04-06 18:50:26,680 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:26,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 1998 transitions. [2022-04-06 18:50:26,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2022-04-06 18:50:26,683 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:50:26,683 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 18:50:26,683 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-06 18:50:26,683 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:50:26,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:50:26,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1925802926, now seen corresponding path program 1 times [2022-04-06 18:50:26,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:26,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [651428681] [2022-04-06 18:50:26,684 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:50:26,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1925802926, now seen corresponding path program 2 times [2022-04-06 18:50:26,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:50:26,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136736664] [2022-04-06 18:50:26,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:50:26,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:50:26,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:26,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:50:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:26,720 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 308 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2022-04-06 18:50:26,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:50:26,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136736664] [2022-04-06 18:50:26,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136736664] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:26,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:50:26,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:50:26,720 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:50:26,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [651428681] [2022-04-06 18:50:26,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [651428681] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:26,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:50:26,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:50:26,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154936723] [2022-04-06 18:50:26,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:50:26,721 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:50:26,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:26,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:50:26,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:50:26,722 INFO L87 Difference]: Start difference. First operand 1456 states and 1998 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:26,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:50:26,988 INFO L93 Difference]: Finished difference Result 4338 states and 5956 transitions. [2022-04-06 18:50:26,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:50:26,989 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (3), 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 211 [2022-04-06 18:50:26,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:50:26,997 INFO L225 Difference]: With dead ends: 4338 [2022-04-06 18:50:26,997 INFO L226 Difference]: Without dead ends: 2895 [2022-04-06 18:50:26,999 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 18:50:26,999 INFO L913 BasicCegarLoop]: 325 mSDtfsCounter, 296 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 18:50:27,000 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [296 Valid, 332 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 18:50:27,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2895 states. [2022-04-06 18:50:27,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2895 to 2893. [2022-04-06 18:50:27,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2893 states, 2888 states have (on average 1.3732686980609419) internal successors, (3966), 2888 states have internal predecessors, (3966), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:27,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2893 states to 2893 states and 3970 transitions. [2022-04-06 18:50:27,119 INFO L78 Accepts]: Start accepts. Automaton has 2893 states and 3970 transitions. Word has length 211 [2022-04-06 18:50:27,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:50:27,119 INFO L478 AbstractCegarLoop]: Abstraction has 2893 states and 3970 transitions. [2022-04-06 18:50:27,119 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:27,119 INFO L276 IsEmpty]: Start isEmpty. Operand 2893 states and 3970 transitions. [2022-04-06 18:50:27,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2022-04-06 18:50:27,125 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:50:27,125 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 18:50:27,125 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-06 18:50:27,125 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:50:27,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:50:27,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1808464592, now seen corresponding path program 1 times [2022-04-06 18:50:27,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:27,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1921022700] [2022-04-06 18:50:27,127 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:50:27,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1808464592, now seen corresponding path program 2 times [2022-04-06 18:50:27,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:50:27,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731832155] [2022-04-06 18:50:27,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:50:27,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:50:27,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:27,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:50:27,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:27,168 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-04-06 18:50:27,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:50:27,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731832155] [2022-04-06 18:50:27,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731832155] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:27,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:50:27,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:50:27,168 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:50:27,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1921022700] [2022-04-06 18:50:27,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1921022700] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:27,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:50:27,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:50:27,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83257214] [2022-04-06 18:50:27,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:50:27,169 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:50:27,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:27,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:50:27,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:50:27,169 INFO L87 Difference]: Start difference. First operand 2893 states and 3970 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:27,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:50:27,453 INFO L93 Difference]: Finished difference Result 6073 states and 8335 transitions. [2022-04-06 18:50:27,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:50:27,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 1 states have call successors, (3), 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 211 [2022-04-06 18:50:27,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:50:27,462 INFO L225 Difference]: With dead ends: 6073 [2022-04-06 18:50:27,462 INFO L226 Difference]: Without dead ends: 3193 [2022-04-06 18:50:27,467 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 18:50:27,468 INFO L913 BasicCegarLoop]: 186 mSDtfsCounter, 182 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 18:50:27,468 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 193 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 18:50:27,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3193 states. [2022-04-06 18:50:27,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3193 to 3177. [2022-04-06 18:50:27,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3177 states, 3172 states have (on average 1.3524590163934427) internal successors, (4290), 3172 states have internal predecessors, (4290), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:27,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3177 states to 3177 states and 4294 transitions. [2022-04-06 18:50:27,598 INFO L78 Accepts]: Start accepts. Automaton has 3177 states and 4294 transitions. Word has length 211 [2022-04-06 18:50:27,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:50:27,598 INFO L478 AbstractCegarLoop]: Abstraction has 3177 states and 4294 transitions. [2022-04-06 18:50:27,598 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:27,599 INFO L276 IsEmpty]: Start isEmpty. Operand 3177 states and 4294 transitions. [2022-04-06 18:50:27,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2022-04-06 18:50:27,604 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:50:27,604 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 18:50:27,604 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-06 18:50:27,604 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:50:27,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:50:27,605 INFO L85 PathProgramCache]: Analyzing trace with hash -366726440, now seen corresponding path program 1 times [2022-04-06 18:50:27,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:27,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [351347181] [2022-04-06 18:50:27,606 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:50:27,606 INFO L85 PathProgramCache]: Analyzing trace with hash -366726440, now seen corresponding path program 2 times [2022-04-06 18:50:27,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:50:27,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000297302] [2022-04-06 18:50:27,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:50:27,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:50:27,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:27,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:50:27,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:27,652 INFO L134 CoverageAnalysis]: Checked inductivity of 656 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2022-04-06 18:50:27,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:50:27,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000297302] [2022-04-06 18:50:27,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000297302] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:27,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:50:27,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:50:27,653 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:50:27,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [351347181] [2022-04-06 18:50:27,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [351347181] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:27,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:50:27,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:50:27,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532982458] [2022-04-06 18:50:27,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:50:27,653 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:50:27,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:27,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:50:27,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:50:27,654 INFO L87 Difference]: Start difference. First operand 3177 states and 4294 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:27,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:50:27,918 INFO L93 Difference]: Finished difference Result 6489 states and 8767 transitions. [2022-04-06 18:50:27,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:50:27,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 1 states have call successors, (3), 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 235 [2022-04-06 18:50:27,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:50:27,927 INFO L225 Difference]: With dead ends: 6489 [2022-04-06 18:50:27,927 INFO L226 Difference]: Without dead ends: 3325 [2022-04-06 18:50:27,930 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 18:50:27,931 INFO L913 BasicCegarLoop]: 185 mSDtfsCounter, 181 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 18:50:27,931 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 192 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 18:50:27,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3325 states. [2022-04-06 18:50:28,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3325 to 3309. [2022-04-06 18:50:28,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3309 states, 3304 states have (on average 1.3444309927360776) internal successors, (4442), 3304 states have internal predecessors, (4442), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:28,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3309 states to 3309 states and 4446 transitions. [2022-04-06 18:50:28,048 INFO L78 Accepts]: Start accepts. Automaton has 3309 states and 4446 transitions. Word has length 235 [2022-04-06 18:50:28,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:50:28,048 INFO L478 AbstractCegarLoop]: Abstraction has 3309 states and 4446 transitions. [2022-04-06 18:50:28,048 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:28,048 INFO L276 IsEmpty]: Start isEmpty. Operand 3309 states and 4446 transitions. [2022-04-06 18:50:28,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2022-04-06 18:50:28,053 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:50:28,053 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 18:50:28,053 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-06 18:50:28,053 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:50:28,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:50:28,053 INFO L85 PathProgramCache]: Analyzing trace with hash -333414931, now seen corresponding path program 1 times [2022-04-06 18:50:28,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:28,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [996250024] [2022-04-06 18:50:28,054 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:50:28,054 INFO L85 PathProgramCache]: Analyzing trace with hash -333414931, now seen corresponding path program 2 times [2022-04-06 18:50:28,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:50:28,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161903009] [2022-04-06 18:50:28,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:50:28,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:50:28,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:28,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:50:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:28,091 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2022-04-06 18:50:28,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:50:28,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161903009] [2022-04-06 18:50:28,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161903009] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:28,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:50:28,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:50:28,091 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:50:28,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [996250024] [2022-04-06 18:50:28,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [996250024] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:28,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:50:28,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:50:28,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002499263] [2022-04-06 18:50:28,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:50:28,092 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:50:28,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:28,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:50:28,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:50:28,092 INFO L87 Difference]: Start difference. First operand 3309 states and 4446 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:28,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:50:28,360 INFO L93 Difference]: Finished difference Result 7005 states and 9547 transitions. [2022-04-06 18:50:28,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:50:28,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (3), 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 246 [2022-04-06 18:50:28,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:50:28,370 INFO L225 Difference]: With dead ends: 7005 [2022-04-06 18:50:28,370 INFO L226 Difference]: Without dead ends: 3709 [2022-04-06 18:50:28,375 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 18:50:28,376 INFO L913 BasicCegarLoop]: 186 mSDtfsCounter, 223 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 18:50:28,376 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [223 Valid, 193 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 18:50:28,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3709 states. [2022-04-06 18:50:28,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3709 to 3621. [2022-04-06 18:50:28,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3621 states, 3616 states have (on average 1.3301991150442478) internal successors, (4810), 3616 states have internal predecessors, (4810), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:28,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3621 states to 3621 states and 4814 transitions. [2022-04-06 18:50:28,552 INFO L78 Accepts]: Start accepts. Automaton has 3621 states and 4814 transitions. Word has length 246 [2022-04-06 18:50:28,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:50:28,552 INFO L478 AbstractCegarLoop]: Abstraction has 3621 states and 4814 transitions. [2022-04-06 18:50:28,552 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:28,552 INFO L276 IsEmpty]: Start isEmpty. Operand 3621 states and 4814 transitions. [2022-04-06 18:50:28,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2022-04-06 18:50:28,558 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:50:28,558 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 18:50:28,558 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-06 18:50:28,558 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:50:28,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:50:28,558 INFO L85 PathProgramCache]: Analyzing trace with hash -126033425, now seen corresponding path program 1 times [2022-04-06 18:50:28,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:28,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1272526876] [2022-04-06 18:50:28,559 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:50:28,559 INFO L85 PathProgramCache]: Analyzing trace with hash -126033425, now seen corresponding path program 2 times [2022-04-06 18:50:28,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:50:28,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056716010] [2022-04-06 18:50:28,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:50:28,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:50:28,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:28,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:50:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:28,604 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2022-04-06 18:50:28,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:50:28,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056716010] [2022-04-06 18:50:28,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056716010] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:28,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:50:28,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:50:28,605 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:50:28,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1272526876] [2022-04-06 18:50:28,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1272526876] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:28,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:50:28,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:50:28,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673502197] [2022-04-06 18:50:28,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:50:28,605 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:50:28,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:28,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:50:28,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:50:28,606 INFO L87 Difference]: Start difference. First operand 3621 states and 4814 transitions. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 3 states have internal predecessors, (120), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:28,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:50:28,871 INFO L93 Difference]: Finished difference Result 7637 states and 10091 transitions. [2022-04-06 18:50:28,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:50:28,871 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 3 states have internal predecessors, (120), 1 states have call successors, (3), 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 260 [2022-04-06 18:50:28,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:50:28,881 INFO L225 Difference]: With dead ends: 7637 [2022-04-06 18:50:28,881 INFO L226 Difference]: Without dead ends: 4029 [2022-04-06 18:50:28,886 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 18:50:28,886 INFO L913 BasicCegarLoop]: 184 mSDtfsCounter, 277 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 18:50:28,887 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [277 Valid, 191 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 18:50:28,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4029 states. [2022-04-06 18:50:29,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4029 to 3741. [2022-04-06 18:50:29,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3741 states, 3736 states have (on average 1.326017130620985) internal successors, (4954), 3736 states have internal predecessors, (4954), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:29,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3741 states to 3741 states and 4958 transitions. [2022-04-06 18:50:29,046 INFO L78 Accepts]: Start accepts. Automaton has 3741 states and 4958 transitions. Word has length 260 [2022-04-06 18:50:29,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:50:29,046 INFO L478 AbstractCegarLoop]: Abstraction has 3741 states and 4958 transitions. [2022-04-06 18:50:29,046 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 3 states have internal predecessors, (120), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:29,046 INFO L276 IsEmpty]: Start isEmpty. Operand 3741 states and 4958 transitions. [2022-04-06 18:50:29,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2022-04-06 18:50:29,052 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:50:29,052 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 18:50:29,052 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-06 18:50:29,052 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:50:29,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:50:29,052 INFO L85 PathProgramCache]: Analyzing trace with hash -237998131, now seen corresponding path program 1 times [2022-04-06 18:50:29,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:29,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1411169051] [2022-04-06 18:50:29,053 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:50:29,053 INFO L85 PathProgramCache]: Analyzing trace with hash -237998131, now seen corresponding path program 2 times [2022-04-06 18:50:29,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:50:29,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907469178] [2022-04-06 18:50:29,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:50:29,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:50:29,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:29,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:50:29,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:29,095 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2022-04-06 18:50:29,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:50:29,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907469178] [2022-04-06 18:50:29,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907469178] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:29,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:50:29,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:50:29,096 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:50:29,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1411169051] [2022-04-06 18:50:29,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1411169051] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:29,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:50:29,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:50:29,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247298719] [2022-04-06 18:50:29,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:50:29,096 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:50:29,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:29,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:50:29,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:50:29,102 INFO L87 Difference]: Start difference. First operand 3741 states and 4958 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:29,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:50:29,469 INFO L93 Difference]: Finished difference Result 10693 states and 14248 transitions. [2022-04-06 18:50:29,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:50:29,470 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (3), 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 261 [2022-04-06 18:50:29,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:50:29,482 INFO L225 Difference]: With dead ends: 10693 [2022-04-06 18:50:29,482 INFO L226 Difference]: Without dead ends: 6965 [2022-04-06 18:50:29,489 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 18:50:29,489 INFO L913 BasicCegarLoop]: 316 mSDtfsCounter, 258 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 18:50:29,489 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [258 Valid, 323 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 18:50:29,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6965 states. [2022-04-06 18:50:29,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6965 to 6963. [2022-04-06 18:50:29,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6963 states, 6958 states have (on average 1.3334291463064099) internal successors, (9278), 6958 states have internal predecessors, (9278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:29,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6963 states to 6963 states and 9282 transitions. [2022-04-06 18:50:29,836 INFO L78 Accepts]: Start accepts. Automaton has 6963 states and 9282 transitions. Word has length 261 [2022-04-06 18:50:29,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:50:29,837 INFO L478 AbstractCegarLoop]: Abstraction has 6963 states and 9282 transitions. [2022-04-06 18:50:29,837 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:29,837 INFO L276 IsEmpty]: Start isEmpty. Operand 6963 states and 9282 transitions. [2022-04-06 18:50:29,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2022-04-06 18:50:29,845 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:50:29,845 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 18:50:29,845 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-06 18:50:29,845 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:50:29,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:50:29,846 INFO L85 PathProgramCache]: Analyzing trace with hash -684484950, now seen corresponding path program 1 times [2022-04-06 18:50:29,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:29,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [494165720] [2022-04-06 18:50:29,846 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:50:29,847 INFO L85 PathProgramCache]: Analyzing trace with hash -684484950, now seen corresponding path program 2 times [2022-04-06 18:50:29,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:50:29,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964008467] [2022-04-06 18:50:29,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:50:29,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:50:29,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:29,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:50:29,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:29,883 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 347 proven. 0 refuted. 0 times theorem prover too weak. 389 trivial. 0 not checked. [2022-04-06 18:50:29,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:50:29,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964008467] [2022-04-06 18:50:29,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964008467] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:29,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:50:29,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:50:29,884 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:50:29,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [494165720] [2022-04-06 18:50:29,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [494165720] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:29,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:50:29,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:50:29,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91656809] [2022-04-06 18:50:29,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:50:29,884 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:50:29,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:29,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:50:29,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:50:29,885 INFO L87 Difference]: Start difference. First operand 6963 states and 9282 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:30,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:50:30,301 INFO L93 Difference]: Finished difference Result 13921 states and 18539 transitions. [2022-04-06 18:50:30,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:50:30,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (3), 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 262 [2022-04-06 18:50:30,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:50:30,314 INFO L225 Difference]: With dead ends: 13921 [2022-04-06 18:50:30,314 INFO L226 Difference]: Without dead ends: 6971 [2022-04-06 18:50:30,324 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 18:50:30,325 INFO L913 BasicCegarLoop]: 185 mSDtfsCounter, 181 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 18:50:30,325 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 192 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 18:50:30,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6971 states. [2022-04-06 18:50:30,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6971 to 6939. [2022-04-06 18:50:30,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6939 states, 6934 states have (on average 1.3068935679261608) internal successors, (9062), 6934 states have internal predecessors, (9062), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:30,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6939 states to 6939 states and 9066 transitions. [2022-04-06 18:50:30,634 INFO L78 Accepts]: Start accepts. Automaton has 6939 states and 9066 transitions. Word has length 262 [2022-04-06 18:50:30,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:50:30,634 INFO L478 AbstractCegarLoop]: Abstraction has 6939 states and 9066 transitions. [2022-04-06 18:50:30,634 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:30,634 INFO L276 IsEmpty]: Start isEmpty. Operand 6939 states and 9066 transitions. [2022-04-06 18:50:30,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2022-04-06 18:50:30,642 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:50:30,642 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 18:50:30,642 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-06 18:50:30,642 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:50:30,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:50:30,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1980944426, now seen corresponding path program 1 times [2022-04-06 18:50:30,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:30,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [182949567] [2022-04-06 18:50:30,643 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:50:30,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1980944426, now seen corresponding path program 2 times [2022-04-06 18:50:30,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:50:30,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984537255] [2022-04-06 18:50:30,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:50:30,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:50:30,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:30,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:50:30,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:30,692 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 318 proven. 18 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2022-04-06 18:50:30,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:50:30,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984537255] [2022-04-06 18:50:30,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984537255] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 18:50:30,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78220287] [2022-04-06 18:50:30,693 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 18:50:30,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 18:50:30,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 18:50:30,694 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-04-06 18:50:30,709 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-04-06 18:50:30,799 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-06 18:50:30,799 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 18:50:30,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-06 18:50:30,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 18:50:31,181 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 782 trivial. 0 not checked. [2022-04-06 18:50:31,181 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-06 18:50:31,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78220287] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:31,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-06 18:50:31,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-04-06 18:50:31,182 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:50:31,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [182949567] [2022-04-06 18:50:31,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [182949567] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:31,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:50:31,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:50:31,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495205527] [2022-04-06 18:50:31,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:50:31,183 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:50:31,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:31,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:50:31,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-06 18:50:31,184 INFO L87 Difference]: Start difference. First operand 6939 states and 9066 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:31,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:50:31,654 INFO L93 Difference]: Finished difference Result 14043 states and 18356 transitions. [2022-04-06 18:50:31,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:50:31,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 285 [2022-04-06 18:50:31,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:50:31,669 INFO L225 Difference]: With dead ends: 14043 [2022-04-06 18:50:31,669 INFO L226 Difference]: Without dead ends: 7089 [2022-04-06 18:50:31,681 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-06 18:50:31,682 INFO L913 BasicCegarLoop]: 149 mSDtfsCounter, 248 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 18:50:31,682 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [248 Valid, 233 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 18:50:31,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7089 states. [2022-04-06 18:50:32,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7089 to 6945. [2022-04-06 18:50:32,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6945 states, 6940 states have (on average 1.3069164265129682) internal successors, (9070), 6940 states have internal predecessors, (9070), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:32,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6945 states to 6945 states and 9074 transitions. [2022-04-06 18:50:32,123 INFO L78 Accepts]: Start accepts. Automaton has 6945 states and 9074 transitions. Word has length 285 [2022-04-06 18:50:32,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:50:32,123 INFO L478 AbstractCegarLoop]: Abstraction has 6945 states and 9074 transitions. [2022-04-06 18:50:32,123 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:32,123 INFO L276 IsEmpty]: Start isEmpty. Operand 6945 states and 9074 transitions. [2022-04-06 18:50:32,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2022-04-06 18:50:32,131 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:50:32,132 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 18:50:32,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-06 18:50:32,348 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,SelfDestructingSolverStorable20 [2022-04-06 18:50:32,348 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:50:32,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:50:32,349 INFO L85 PathProgramCache]: Analyzing trace with hash 381178995, now seen corresponding path program 1 times [2022-04-06 18:50:32,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:32,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1209292118] [2022-04-06 18:50:32,350 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:50:32,350 INFO L85 PathProgramCache]: Analyzing trace with hash 381178995, now seen corresponding path program 2 times [2022-04-06 18:50:32,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:50:32,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466188391] [2022-04-06 18:50:32,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:50:32,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:50:32,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:32,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:50:32,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:32,401 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 328 proven. 18 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2022-04-06 18:50:32,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:50:32,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466188391] [2022-04-06 18:50:32,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466188391] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 18:50:32,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846262858] [2022-04-06 18:50:32,401 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 18:50:32,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 18:50:32,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 18:50:32,402 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-04-06 18:50:32,403 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-04-06 18:50:32,499 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-06 18:50:32,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 18:50:32,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-06 18:50:32,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 18:50:32,830 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 328 proven. 18 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2022-04-06 18:50:32,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 18:50:33,129 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 328 proven. 18 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2022-04-06 18:50:33,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846262858] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 18:50:33,130 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 18:50:33,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-04-06 18:50:33,130 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:50:33,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1209292118] [2022-04-06 18:50:33,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1209292118] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:33,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:50:33,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 18:50:33,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975280119] [2022-04-06 18:50:33,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:50:33,131 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 18:50:33,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:33,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 18:50:33,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-06 18:50:33,131 INFO L87 Difference]: Start difference. First operand 6945 states and 9074 transitions. Second operand has 5 states, 5 states have (on average 30.8) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:34,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:50:34,066 INFO L93 Difference]: Finished difference Result 13801 states and 18028 transitions. [2022-04-06 18:50:34,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-06 18:50:34,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (3), 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 298 [2022-04-06 18:50:34,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:50:34,084 INFO L225 Difference]: With dead ends: 13801 [2022-04-06 18:50:34,084 INFO L226 Difference]: Without dead ends: 10417 [2022-04-06 18:50:34,092 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 607 GetRequests, 599 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-06 18:50:34,093 INFO L913 BasicCegarLoop]: 361 mSDtfsCounter, 325 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-06 18:50:34,093 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [325 Valid, 373 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-06 18:50:34,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10417 states. [2022-04-06 18:50:34,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10417 to 8851. [2022-04-06 18:50:34,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8851 states, 8846 states have (on average 1.3070314266335066) internal successors, (11562), 8846 states have internal predecessors, (11562), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:34,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8851 states to 8851 states and 11566 transitions. [2022-04-06 18:50:34,531 INFO L78 Accepts]: Start accepts. Automaton has 8851 states and 11566 transitions. Word has length 298 [2022-04-06 18:50:34,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:50:34,532 INFO L478 AbstractCegarLoop]: Abstraction has 8851 states and 11566 transitions. [2022-04-06 18:50:34,532 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:34,532 INFO L276 IsEmpty]: Start isEmpty. Operand 8851 states and 11566 transitions. [2022-04-06 18:50:34,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2022-04-06 18:50:34,542 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:50:34,542 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 18:50:34,561 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-04-06 18:50:34,758 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,SelfDestructingSolverStorable21 [2022-04-06 18:50:34,758 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:50:34,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:50:34,759 INFO L85 PathProgramCache]: Analyzing trace with hash -329946898, now seen corresponding path program 3 times [2022-04-06 18:50:34,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:34,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [762513504] [2022-04-06 18:50:34,760 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:50:34,760 INFO L85 PathProgramCache]: Analyzing trace with hash -329946898, now seen corresponding path program 4 times [2022-04-06 18:50:34,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:50:34,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346641205] [2022-04-06 18:50:34,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:50:34,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:50:34,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:34,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:50:34,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:34,807 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 407 proven. 5 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2022-04-06 18:50:34,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:50:34,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346641205] [2022-04-06 18:50:34,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346641205] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 18:50:34,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289612620] [2022-04-06 18:50:34,808 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-06 18:50:34,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 18:50:34,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 18:50:34,809 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 18:50:34,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-06 18:50:34,905 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-06 18:50:34,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 18:50:34,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-06 18:50:34,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 18:50:35,224 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 811 trivial. 0 not checked. [2022-04-06 18:50:35,224 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-06 18:50:35,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289612620] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:35,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-06 18:50:35,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-04-06 18:50:35,225 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:50:35,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [762513504] [2022-04-06 18:50:35,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [762513504] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:35,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:50:35,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-06 18:50:35,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477312330] [2022-04-06 18:50:35,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:50:35,225 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-06 18:50:35,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:35,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-06 18:50:35,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-06 18:50:35,226 INFO L87 Difference]: Start difference. First operand 8851 states and 11566 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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-04-06 18:50:35,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:50:35,665 INFO L93 Difference]: Finished difference Result 15948 states and 20874 transitions. [2022-04-06 18:50:35,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-06 18:50:35,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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 311 [2022-04-06 18:50:35,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:50:35,674 INFO L225 Difference]: With dead ends: 15948 [2022-04-06 18:50:35,674 INFO L226 Difference]: Without dead ends: 7116 [2022-04-06 18:50:35,686 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-06 18:50:35,686 INFO L913 BasicCegarLoop]: 170 mSDtfsCounter, 13 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 18:50:35,687 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 257 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 18:50:35,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7116 states. [2022-04-06 18:50:35,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7116 to 7056. [2022-04-06 18:50:35,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7056 states, 7051 states have (on average 1.3101687703871792) internal successors, (9238), 7051 states have internal predecessors, (9238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:36,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7056 states to 7056 states and 9242 transitions. [2022-04-06 18:50:36,004 INFO L78 Accepts]: Start accepts. Automaton has 7056 states and 9242 transitions. Word has length 311 [2022-04-06 18:50:36,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:50:36,004 INFO L478 AbstractCegarLoop]: Abstraction has 7056 states and 9242 transitions. [2022-04-06 18:50:36,004 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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-04-06 18:50:36,004 INFO L276 IsEmpty]: Start isEmpty. Operand 7056 states and 9242 transitions. [2022-04-06 18:50:36,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2022-04-06 18:50:36,011 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:50:36,011 INFO L499 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 18:50:36,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-06 18:50:36,223 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 18:50:36,224 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:50:36,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:50:36,224 INFO L85 PathProgramCache]: Analyzing trace with hash 693944410, now seen corresponding path program 1 times [2022-04-06 18:50:36,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:36,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1036233510] [2022-04-06 18:50:36,225 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:50:36,225 INFO L85 PathProgramCache]: Analyzing trace with hash 693944410, now seen corresponding path program 2 times [2022-04-06 18:50:36,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:50:36,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190884389] [2022-04-06 18:50:36,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:50:36,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:50:36,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:36,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:50:36,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:36,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 954 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-04-06 18:50:36,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:50:36,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190884389] [2022-04-06 18:50:36,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190884389] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 18:50:36,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165163281] [2022-04-06 18:50:36,280 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 18:50:36,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 18:50:36,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 18:50:36,281 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 18:50:36,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-06 18:50:36,383 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-06 18:50:36,384 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 18:50:36,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-06 18:50:36,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 18:50:36,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 821 proven. 0 refuted. 0 times theorem prover too weak. 827 trivial. 0 not checked. [2022-04-06 18:50:36,868 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-06 18:50:36,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165163281] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:36,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-06 18:50:36,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-04-06 18:50:36,869 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:50:36,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1036233510] [2022-04-06 18:50:36,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1036233510] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:36,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:50:36,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-06 18:50:36,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398199278] [2022-04-06 18:50:36,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:50:36,870 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-06 18:50:36,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:36,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-06 18:50:36,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-06 18:50:36,870 INFO L87 Difference]: Start difference. First operand 7056 states and 9242 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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-04-06 18:50:37,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:50:37,473 INFO L93 Difference]: Finished difference Result 16101 states and 21058 transitions. [2022-04-06 18:50:37,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-06 18:50:37,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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 378 [2022-04-06 18:50:37,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:50:37,489 INFO L225 Difference]: With dead ends: 16101 [2022-04-06 18:50:37,489 INFO L226 Difference]: Without dead ends: 9091 [2022-04-06 18:50:37,502 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-06 18:50:37,503 INFO L913 BasicCegarLoop]: 321 mSDtfsCounter, 61 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 18:50:37,503 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 484 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 18:50:37,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9091 states. [2022-04-06 18:50:37,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9091 to 9091. [2022-04-06 18:50:37,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9091 states, 9086 states have (on average 1.3045344486022452) internal successors, (11853), 9086 states have internal predecessors, (11853), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:37,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9091 states to 9091 states and 11857 transitions. [2022-04-06 18:50:37,998 INFO L78 Accepts]: Start accepts. Automaton has 9091 states and 11857 transitions. Word has length 378 [2022-04-06 18:50:37,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:50:37,999 INFO L478 AbstractCegarLoop]: Abstraction has 9091 states and 11857 transitions. [2022-04-06 18:50:37,999 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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-04-06 18:50:37,999 INFO L276 IsEmpty]: Start isEmpty. Operand 9091 states and 11857 transitions. [2022-04-06 18:50:38,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2022-04-06 18:50:38,005 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:50:38,006 INFO L499 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 18:50:38,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-06 18:50:38,206 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 18:50:38,206 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:50:38,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:50:38,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1349613086, now seen corresponding path program 1 times [2022-04-06 18:50:38,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:38,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1255116711] [2022-04-06 18:50:38,208 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:50:38,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1349613086, now seen corresponding path program 2 times [2022-04-06 18:50:38,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:50:38,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273222930] [2022-04-06 18:50:38,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:50:38,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:50:38,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:38,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:50:38,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:38,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 956 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-04-06 18:50:38,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:50:38,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273222930] [2022-04-06 18:50:38,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273222930] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 18:50:38,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742538340] [2022-04-06 18:50:38,261 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 18:50:38,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 18:50:38,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 18:50:38,262 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 18:50:38,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-06 18:50:38,368 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-06 18:50:38,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 18:50:38,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 773 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-06 18:50:38,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 18:50:38,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 956 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-04-06 18:50:38,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 18:50:39,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 956 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-04-06 18:50:39,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742538340] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 18:50:39,111 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 18:50:39,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-04-06 18:50:39,111 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:50:39,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1255116711] [2022-04-06 18:50:39,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1255116711] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:39,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:50:39,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 18:50:39,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065491121] [2022-04-06 18:50:39,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:50:39,112 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 18:50:39,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:39,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 18:50:39,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-06 18:50:39,113 INFO L87 Difference]: Start difference. First operand 9091 states and 11857 transitions. Second operand has 5 states, 5 states have (on average 37.6) internal successors, (188), 4 states have internal predecessors, (188), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:39,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:50:39,959 INFO L93 Difference]: Finished difference Result 19702 states and 25593 transitions. [2022-04-06 18:50:39,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-06 18:50:39,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.6) internal successors, (188), 4 states have internal predecessors, (188), 1 states have call successors, (3), 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 380 [2022-04-06 18:50:39,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:50:39,971 INFO L225 Difference]: With dead ends: 19702 [2022-04-06 18:50:39,972 INFO L226 Difference]: Without dead ends: 10670 [2022-04-06 18:50:39,981 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 769 GetRequests, 762 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-06 18:50:39,982 INFO L913 BasicCegarLoop]: 201 mSDtfsCounter, 486 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-06 18:50:39,982 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [486 Valid, 213 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-06 18:50:39,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10670 states. [2022-04-06 18:50:40,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10670 to 9237. [2022-04-06 18:50:40,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9237 states, 9232 states have (on average 1.2705805892547661) internal successors, (11730), 9232 states have internal predecessors, (11730), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:40,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9237 states to 9237 states and 11734 transitions. [2022-04-06 18:50:40,479 INFO L78 Accepts]: Start accepts. Automaton has 9237 states and 11734 transitions. Word has length 380 [2022-04-06 18:50:40,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:50:40,479 INFO L478 AbstractCegarLoop]: Abstraction has 9237 states and 11734 transitions. [2022-04-06 18:50:40,479 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.6) internal successors, (188), 4 states have internal predecessors, (188), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:40,480 INFO L276 IsEmpty]: Start isEmpty. Operand 9237 states and 11734 transitions. [2022-04-06 18:50:40,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2022-04-06 18:50:40,489 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:50:40,489 INFO L499 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 18:50:40,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-06 18:50:40,690 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-06 18:50:40,690 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:50:40,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:50:40,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1929917103, now seen corresponding path program 1 times [2022-04-06 18:50:40,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:40,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1781592276] [2022-04-06 18:50:40,691 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:50:40,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1929917103, now seen corresponding path program 2 times [2022-04-06 18:50:40,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:50:40,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855301980] [2022-04-06 18:50:40,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:50:40,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:50:40,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:40,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:50:40,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:40,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1971 backedges. 886 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2022-04-06 18:50:40,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:50:40,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855301980] [2022-04-06 18:50:40,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855301980] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:40,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:50:40,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:50:40,745 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:50:40,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1781592276] [2022-04-06 18:50:40,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1781592276] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:40,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:50:40,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:50:40,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992767098] [2022-04-06 18:50:40,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:50:40,746 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:50:40,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:40,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:50:40,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:50:40,746 INFO L87 Difference]: Start difference. First operand 9237 states and 11734 transitions. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:41,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:50:41,403 INFO L93 Difference]: Finished difference Result 17041 states and 21431 transitions. [2022-04-06 18:50:41,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:50:41,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (3), 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 419 [2022-04-06 18:50:41,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:50:41,409 INFO L225 Difference]: With dead ends: 17041 [2022-04-06 18:50:41,409 INFO L226 Difference]: Without dead ends: 3804 [2022-04-06 18:50:41,424 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 18:50:41,425 INFO L913 BasicCegarLoop]: 185 mSDtfsCounter, 209 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 18:50:41,425 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 192 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 18:50:41,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3804 states. [2022-04-06 18:50:41,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3804 to 3576. [2022-04-06 18:50:41,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3576 states, 3571 states have (on average 1.2427891346961635) internal successors, (4438), 3571 states have internal predecessors, (4438), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:41,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3576 states to 3576 states and 4442 transitions. [2022-04-06 18:50:41,608 INFO L78 Accepts]: Start accepts. Automaton has 3576 states and 4442 transitions. Word has length 419 [2022-04-06 18:50:41,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:50:41,608 INFO L478 AbstractCegarLoop]: Abstraction has 3576 states and 4442 transitions. [2022-04-06 18:50:41,608 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:41,608 INFO L276 IsEmpty]: Start isEmpty. Operand 3576 states and 4442 transitions. [2022-04-06 18:50:41,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2022-04-06 18:50:41,612 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:50:41,612 INFO L499 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 18:50:41,612 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-06 18:50:41,613 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:50:41,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:50:41,613 INFO L85 PathProgramCache]: Analyzing trace with hash -2052196744, now seen corresponding path program 1 times [2022-04-06 18:50:41,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:41,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1758371026] [2022-04-06 18:50:41,615 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:50:41,615 INFO L85 PathProgramCache]: Analyzing trace with hash -2052196744, now seen corresponding path program 2 times [2022-04-06 18:50:41,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:50:41,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759717346] [2022-04-06 18:50:41,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:50:41,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:50:41,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:41,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:50:41,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:50:41,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1283 proven. 14 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2022-04-06 18:50:41,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:50:41,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759717346] [2022-04-06 18:50:41,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759717346] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 18:50:41,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949746799] [2022-04-06 18:50:41,666 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 18:50:41,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 18:50:41,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 18:50:41,667 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 18:50:41,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-06 18:50:41,786 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-06 18:50:41,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 18:50:41,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-06 18:50:41,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 18:50:42,238 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1283 proven. 14 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2022-04-06 18:50:42,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 18:50:42,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1283 proven. 14 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2022-04-06 18:50:42,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949746799] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 18:50:42,690 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 18:50:42,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-04-06 18:50:42,690 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:50:42,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1758371026] [2022-04-06 18:50:42,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1758371026] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:50:42,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:50:42,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 18:50:42,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879586878] [2022-04-06 18:50:42,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:50:42,691 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 18:50:42,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:50:42,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 18:50:42,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-06 18:50:42,692 INFO L87 Difference]: Start difference. First operand 3576 states and 4442 transitions. Second operand has 5 states, 5 states have (on average 41.4) internal successors, (207), 4 states have internal predecessors, (207), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:42,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:50:42,909 INFO L93 Difference]: Finished difference Result 3790 states and 4710 transitions. [2022-04-06 18:50:42,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-06 18:50:42,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.4) internal successors, (207), 4 states have internal predecessors, (207), 1 states have call successors, (3), 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 448 [2022-04-06 18:50:42,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:50:42,911 INFO L225 Difference]: With dead ends: 3790 [2022-04-06 18:50:42,911 INFO L226 Difference]: Without dead ends: 0 [2022-04-06 18:50:42,917 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 905 GetRequests, 896 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-04-06 18:50:42,917 INFO L913 BasicCegarLoop]: 166 mSDtfsCounter, 151 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-06 18:50:42,918 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 178 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-06 18:50:42,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-06 18:50:42,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-06 18:50:42,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-06 18:50:42,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-06 18:50:42,918 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 448 [2022-04-06 18:50:42,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:50:42,919 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-06 18:50:42,919 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.4) internal successors, (207), 4 states have internal predecessors, (207), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 18:50:42,919 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-06 18:50:42,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-06 18:50:42,921 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-06 18:50:42,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-06 18:50:43,131 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-06 18:50:43,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-06 18:51:40,068 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 13) no Hoare annotation was computed. [2022-04-06 18:51:40,068 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 13) no Hoare annotation was computed. [2022-04-06 18:51:40,068 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 13) no Hoare annotation was computed. [2022-04-06 18:51:40,068 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 558 568) the Hoare annotation is: true [2022-04-06 18:51:40,068 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 558 568) the Hoare annotation is: true [2022-04-06 18:51:40,068 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 558 568) the Hoare annotation is: true [2022-04-06 18:51:40,068 INFO L885 garLoopResultBuilder]: At program point L564(line 564) the Hoare annotation is: true [2022-04-06 18:51:40,068 INFO L885 garLoopResultBuilder]: At program point L564-1(line 564) the Hoare annotation is: true [2022-04-06 18:51:40,068 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-06 18:51:40,068 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-06 18:51:40,068 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-06 18:51:40,068 INFO L878 garLoopResultBuilder]: At program point L366(lines 366 371) the Hoare annotation is: (let ((.cse0 (<= 4464 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 .cse2 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) .cse2) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-06 18:51:40,069 INFO L878 garLoopResultBuilder]: At program point L366-2(lines 366 371) the Hoare annotation is: (let ((.cse2 (= 4512 ssl3_connect_~s__state~0)) (.cse0 (= 2 ssl3_connect_~blastFlag~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse3 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse4 (= 4496 ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse2) (and .cse0 .cse1 .cse4) (and .cse1 .cse3 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-06 18:51:40,069 INFO L878 garLoopResultBuilder]: At program point L234(lines 234 237) the Hoare annotation is: (let ((.cse0 (= ssl3_connect_~s__hit~0 0))) (or (= ssl3_connect_~blastFlag~0 0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (= 2 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (<= ssl3_connect_~blastFlag~0 4)))) [2022-04-06 18:51:40,069 INFO L878 garLoopResultBuilder]: At program point L201(lines 201 495) the Hoare annotation is: (let ((.cse1 (= 3 ssl3_connect_~s__state~0)) (.cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse2 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (= 2 ssl3_connect_~blastFlag~0)) (.cse4 (= ssl3_connect_~s__hit~0 0)) (.cse5 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse4 .cse5 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse0 .cse1 .cse5) (and (<= 4464 ssl3_connect_~s__state~0) .cse2) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse3 .cse4) (and .cse0 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse4 .cse5 (<= ssl3_connect_~blastFlag~0 4)))) [2022-04-06 18:51:40,070 INFO L878 garLoopResultBuilder]: At program point L168(lines 168 506) the Hoare annotation is: (let ((.cse2 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= 4560 ssl3_connect_~s__state~0)) (.cse9 (<= ssl3_connect_~s__state~0 4560)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse6 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse10 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse4 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse5 (= ssl3_connect_~s__state~0 4528)) (.cse1 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse5 .cse3 .cse4) (and .cse0 .cse6 .cse7 .cse1) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse8 .cse9 .cse1) (and .cse6 .cse7 .cse4) (and .cse8 .cse6 .cse9 .cse3 .cse4 .cse10) (and .cse3 .cse4 (= 4496 ssl3_connect_~s__state~0)) (and .cse3 .cse4 (= ssl3_connect_~s__state~0 4480)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse1 .cse3) (and .cse0 .cse6 .cse3 .cse4 .cse10) (and .cse3 .cse4 (<= ssl3_connect_~blastFlag~0 4)) (and .cse5 .cse1))) [2022-04-06 18:51:40,070 INFO L878 garLoopResultBuilder]: At program point L135(lines 135 517) the Hoare annotation is: (let ((.cse2 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= 4560 ssl3_connect_~s__state~0)) (.cse9 (<= ssl3_connect_~s__state~0 4560)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse6 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse10 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse4 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse5 (= ssl3_connect_~s__state~0 4528)) (.cse1 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse5 .cse3 .cse4) (and .cse0 .cse6 .cse7 .cse1) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse8 .cse9 .cse1) (and .cse6 .cse7 .cse4) (and .cse8 .cse6 .cse9 .cse3 .cse4 .cse10) (and .cse3 .cse4 (= 4496 ssl3_connect_~s__state~0)) (and .cse3 .cse4 (= ssl3_connect_~s__state~0 4480)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse1 .cse3) (and .cse0 .cse6 .cse3 .cse4 .cse10) (and .cse3 .cse4 (<= ssl3_connect_~blastFlag~0 4)) (and .cse3 .cse4 (= ssl3_connect_~s__state~0 4464)) (and .cse5 .cse1))) [2022-04-06 18:51:40,070 INFO L878 garLoopResultBuilder]: At program point L102(lines 102 106) the Hoare annotation is: (or (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-04-06 18:51:40,070 INFO L885 garLoopResultBuilder]: At program point L466-1(lines 466 468) the Hoare annotation is: true [2022-04-06 18:51:40,070 INFO L878 garLoopResultBuilder]: At program point L268(lines 268 270) the Hoare annotation is: (let ((.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse1 (= ssl3_connect_~s__state~0 4384))) (or (and .cse0 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse1 (<= ssl3_connect_~blastFlag~0 4)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (= 2 ssl3_connect_~blastFlag~0) .cse0 .cse1) (and (= ssl3_connect_~blastFlag~0 1) .cse1))) [2022-04-06 18:51:40,070 INFO L878 garLoopResultBuilder]: At program point L202(lines 198 496) the Hoare annotation is: (let ((.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= 2 ssl3_connect_~blastFlag~0)) (.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse4 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256))) (or (and .cse0 .cse1 .cse2) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse3 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse2 .cse3) (and .cse0 .cse3 .cse4 (<= ssl3_connect_~blastFlag~0 4)))) [2022-04-06 18:51:40,070 INFO L878 garLoopResultBuilder]: At program point L136(lines 132 518) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 (= ssl3_connect_~blastFlag~0 1) .cse1) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 .cse2 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) .cse2))) [2022-04-06 18:51:40,070 INFO L878 garLoopResultBuilder]: At program point L103(lines 103 105) the Hoare annotation is: (or (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-04-06 18:51:40,070 INFO L878 garLoopResultBuilder]: At program point L335(lines 335 337) the Hoare annotation is: (let ((.cse3 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) .cse2))) [2022-04-06 18:51:40,070 INFO L878 garLoopResultBuilder]: At program point L335-2(lines 211 490) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 .cse2 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) .cse2))) [2022-04-06 18:51:40,070 INFO L878 garLoopResultBuilder]: At program point L402(lines 402 405) the Hoare annotation is: (let ((.cse0 (= ssl3_connect_~s__state~0 4528))) (or (and .cse0 (= ssl3_connect_~s__hit~0 0) (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (= 2 ssl3_connect_~blastFlag~0)))) [2022-04-06 18:51:40,070 INFO L878 garLoopResultBuilder]: At program point L204(lines 204 494) the Hoare annotation is: (let ((.cse1 (= 3 ssl3_connect_~s__state~0)) (.cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse4 (= ssl3_connect_~s__hit~0 0)) (.cse3 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (<= 4464 ssl3_connect_~s__state~0) (and .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse3) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse4 .cse3 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse2 .cse4) (and .cse4 .cse3 (<= ssl3_connect_~blastFlag~0 4)) (and .cse2 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)))) [2022-04-06 18:51:40,070 INFO L878 garLoopResultBuilder]: At program point L171(lines 171 505) the Hoare annotation is: (let ((.cse2 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= 4560 ssl3_connect_~s__state~0)) (.cse9 (<= ssl3_connect_~s__state~0 4560)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse6 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse10 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse4 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse5 (= ssl3_connect_~s__state~0 4528)) (.cse1 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse5 .cse3 .cse4) (and .cse0 .cse6 .cse7 .cse1) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse8 .cse9 .cse1) (and .cse6 .cse7 .cse4) (and .cse8 .cse6 .cse9 .cse3 .cse4 .cse10) (and .cse3 .cse4 (= 4496 ssl3_connect_~s__state~0)) (and .cse3 .cse4 (= ssl3_connect_~s__state~0 4480)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse1 .cse3) (and .cse0 .cse6 .cse3 .cse4 .cse10) (and .cse3 .cse4 (<= ssl3_connect_~blastFlag~0 4)) (and .cse5 .cse1))) [2022-04-06 18:51:40,071 INFO L878 garLoopResultBuilder]: At program point L138(lines 138 516) the Hoare annotation is: (let ((.cse2 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= 4560 ssl3_connect_~s__state~0)) (.cse9 (<= ssl3_connect_~s__state~0 4560)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse6 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse10 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse4 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse5 (= ssl3_connect_~s__state~0 4528)) (.cse1 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse5 .cse3 .cse4) (and .cse0 .cse6 .cse7 .cse1) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse8 .cse9 .cse1) (and .cse6 .cse7 .cse4) (and .cse8 .cse6 .cse9 .cse3 .cse4 .cse10) (and .cse3 .cse4 (= 4496 ssl3_connect_~s__state~0)) (and .cse3 .cse4 (= ssl3_connect_~s__state~0 4480)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse1 .cse3) (and .cse0 .cse6 .cse3 .cse4 .cse10) (and .cse3 .cse4 (<= ssl3_connect_~blastFlag~0 4)) (and .cse3 .cse4 (= ssl3_connect_~s__state~0 4464)) (and .cse5 .cse1))) [2022-04-06 18:51:40,071 INFO L878 garLoopResultBuilder]: At program point L535(lines 535 539) the Hoare annotation is: (let ((.cse1 (= 4512 ssl3_connect_~s__state~0)) (.cse8 (= 3 ssl3_connect_~s__state~0)) (.cse5 (<= 4560 ssl3_connect_~s__state~0)) (.cse6 (<= ssl3_connect_~s__state~0 4560)) (.cse9 (<= 4352 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4352)) (.cse7 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse3 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse4 (= ssl3_connect_~s__state~0 4528)) (.cse0 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse1) (and .cse4 .cse2 .cse3) (and .cse5 .cse6 .cse0) (and .cse7 .cse8 .cse0) (and .cse9 .cse10 .cse0 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse7 .cse8 .cse3) (and .cse5 .cse7 .cse6 .cse2 .cse3 .cse11) (and .cse2 .cse3 (= 4496 ssl3_connect_~s__state~0)) (and .cse2 .cse3 (= ssl3_connect_~s__state~0 4480)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse9 .cse10 .cse7 .cse2 .cse3 .cse11) (and .cse0 .cse2) (and .cse2 .cse3 (<= ssl3_connect_~blastFlag~0 4)) (and (= ssl3_connect_~s__state~0 4368) (= ssl3_connect_~blastFlag~0 0)) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse2 .cse3 (= ssl3_connect_~s__state~0 4464)) (and .cse4 .cse0))) [2022-04-06 18:51:40,071 INFO L878 garLoopResultBuilder]: At program point L238(lines 238 241) the Hoare annotation is: (let ((.cse0 (= ssl3_connect_~s__hit~0 0))) (or (= ssl3_connect_~blastFlag~0 0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (= 2 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (<= ssl3_connect_~blastFlag~0 4)))) [2022-04-06 18:51:40,071 INFO L878 garLoopResultBuilder]: At program point L205(lines 204 494) the Hoare annotation is: (let ((.cse4 (= 2 ssl3_connect_~blastFlag~0)) (.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4352)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse3 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 .cse4 .cse2) (and .cse0 .cse1 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 .cse3 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)))) [2022-04-06 18:51:40,071 INFO L878 garLoopResultBuilder]: At program point L172(lines 162 508) the Hoare annotation is: (let ((.cse0 (<= 4464 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 .cse2 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) .cse2) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-06 18:51:40,071 INFO L878 garLoopResultBuilder]: At program point L437(lines 437 439) the Hoare annotation is: (let ((.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= 2 ssl3_connect_~blastFlag~0)) (.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse4 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256))) (or (and .cse0 .cse1 .cse2) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse3 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse2 .cse3) (and .cse0 .cse3 .cse4 (<= ssl3_connect_~blastFlag~0 4)))) [2022-04-06 18:51:40,071 INFO L885 garLoopResultBuilder]: At program point L207(lines 207 493) the Hoare annotation is: true [2022-04-06 18:51:40,071 INFO L878 garLoopResultBuilder]: At program point L174(lines 174 504) the Hoare annotation is: (let ((.cse2 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= 4560 ssl3_connect_~s__state~0)) (.cse9 (<= ssl3_connect_~s__state~0 4560)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse6 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse10 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse4 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse5 (= ssl3_connect_~s__state~0 4528)) (.cse1 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse5 .cse3 .cse4) (and .cse0 .cse6 .cse7 .cse1) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse8 .cse9 .cse1) (and .cse6 .cse7 .cse4) (and .cse8 .cse6 .cse9 .cse3 .cse4 .cse10) (and .cse3 .cse4 (= 4496 ssl3_connect_~s__state~0)) (and .cse3 .cse4 (= ssl3_connect_~s__state~0 4480)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse1 .cse3) (and .cse0 .cse6 .cse3 .cse4 .cse10) (and .cse3 .cse4 (<= ssl3_connect_~blastFlag~0 4)) (and .cse5 .cse1))) [2022-04-06 18:51:40,071 INFO L878 garLoopResultBuilder]: At program point L141(lines 141 515) the Hoare annotation is: (let ((.cse2 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= 4560 ssl3_connect_~s__state~0)) (.cse9 (<= ssl3_connect_~s__state~0 4560)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse6 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse10 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse4 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse5 (= ssl3_connect_~s__state~0 4528)) (.cse1 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse5 .cse3 .cse4) (and .cse0 .cse6 .cse7 .cse1) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse8 .cse9 .cse1) (and .cse6 .cse7 .cse4) (and .cse8 .cse6 .cse9 .cse3 .cse4 .cse10) (and .cse3 .cse4 (= 4496 ssl3_connect_~s__state~0)) (and .cse3 .cse4 (= ssl3_connect_~s__state~0 4480)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse1 .cse3) (and .cse0 .cse6 .cse3 .cse4 .cse10) (and .cse3 .cse4 (<= ssl3_connect_~blastFlag~0 4)) (and .cse3 .cse4 (= ssl3_connect_~s__state~0 4464)) (and .cse5 .cse1))) [2022-04-06 18:51:40,072 INFO L878 garLoopResultBuilder]: At program point L108-1(lines 86 556) the Hoare annotation is: (let ((.cse1 (= 4512 ssl3_connect_~s__state~0)) (.cse9 (= 3 ssl3_connect_~s__state~0)) (.cse6 (<= 4560 ssl3_connect_~s__state~0)) (.cse7 (<= ssl3_connect_~s__state~0 4560)) (.cse10 (<= 4352 ssl3_connect_~s__state~0)) (.cse11 (<= ssl3_connect_~s__state~0 4352)) (.cse8 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse12 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse5 (= ssl3_connect_~blastFlag~0 0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse3 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse4 (= ssl3_connect_~s__state~0 4528)) (.cse0 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse1) (and .cse4 .cse2 .cse3) (and (<= 12292 ssl3_connect_~s__state~0) .cse5) (and .cse6 .cse7 .cse0) (and .cse8 .cse9 .cse0) (and .cse10 .cse11 .cse0 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse8 .cse9 .cse3) (and .cse6 .cse8 .cse7 .cse2 .cse3 .cse12) (and .cse2 .cse3 (= 4496 ssl3_connect_~s__state~0)) (and .cse2 .cse3 (= ssl3_connect_~s__state~0 4480)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse10 .cse11 .cse8 .cse2 .cse3 .cse12) (and .cse0 .cse2) (and .cse2 .cse3 (<= ssl3_connect_~blastFlag~0 4)) (and (= ssl3_connect_~s__state~0 4368) .cse5) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse2 .cse3 (= ssl3_connect_~s__state~0 4464)) (and .cse4 .cse0))) [2022-04-06 18:51:40,072 INFO L885 garLoopResultBuilder]: At program point L472(lines 472 474) the Hoare annotation is: true [2022-04-06 18:51:40,072 INFO L885 garLoopResultBuilder]: At program point L472-2(lines 472 474) the Hoare annotation is: true [2022-04-06 18:51:40,072 INFO L878 garLoopResultBuilder]: At program point L307(lines 307 309) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 .cse2 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) .cse2))) [2022-04-06 18:51:40,072 INFO L878 garLoopResultBuilder]: At program point L307-2(lines 211 490) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 .cse2 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) .cse2))) [2022-04-06 18:51:40,072 INFO L885 garLoopResultBuilder]: At program point L208(lines 207 493) the Hoare annotation is: true [2022-04-06 18:51:40,072 INFO L878 garLoopResultBuilder]: At program point L142(lines 138 516) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 .cse2 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) .cse2))) [2022-04-06 18:51:40,072 INFO L878 garLoopResultBuilder]: At program point L109(line 109) the Hoare annotation is: (let ((.cse1 (= 4512 ssl3_connect_~s__state~0)) (.cse9 (= 3 ssl3_connect_~s__state~0)) (.cse6 (<= 4560 ssl3_connect_~s__state~0)) (.cse7 (<= ssl3_connect_~s__state~0 4560)) (.cse10 (<= 4352 ssl3_connect_~s__state~0)) (.cse11 (<= ssl3_connect_~s__state~0 4352)) (.cse8 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse12 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse5 (= ssl3_connect_~blastFlag~0 0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse3 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse4 (= ssl3_connect_~s__state~0 4528)) (.cse0 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse1) (and .cse4 .cse2 .cse3) (and (<= 12292 ssl3_connect_~s__state~0) .cse5) (and .cse6 .cse7 .cse0) (and .cse8 .cse9 .cse0) (and .cse10 .cse11 .cse0 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse8 .cse9 .cse3) (and .cse6 .cse8 .cse7 .cse2 .cse3 .cse12) (and .cse2 .cse3 (= 4496 ssl3_connect_~s__state~0)) (and .cse2 .cse3 (= ssl3_connect_~s__state~0 4480)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse10 .cse11 .cse8 .cse2 .cse3 .cse12) (and .cse0 .cse2) (and .cse2 .cse3 (<= ssl3_connect_~blastFlag~0 4)) (and (= ssl3_connect_~s__state~0 4368) .cse5) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse2 .cse3 (= ssl3_connect_~s__state~0 4464)) (and .cse4 .cse0))) [2022-04-06 18:51:40,072 INFO L878 garLoopResultBuilder]: At program point L440(lines 440 444) the Hoare annotation is: (let ((.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= 2 ssl3_connect_~blastFlag~0)) (.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse4 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256))) (or (and .cse0 .cse1 .cse2) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse3 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse2 .cse3) (and .cse0 .cse3 .cse4 (<= ssl3_connect_~blastFlag~0 4)))) [2022-04-06 18:51:40,072 INFO L878 garLoopResultBuilder]: At program point L440-2(lines 440 444) the Hoare annotation is: (let ((.cse1 (= 2 ssl3_connect_~blastFlag~0)) (.cse0 (= 3 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse3 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256))) (or (and .cse0 .cse1 .cse2) (and .cse1 (= 4512 ssl3_connect_~s__state~0)) (and .cse0 .cse2 .cse3 (<= ssl3_connect_~blastFlag~0 4)) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse2 .cse3) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-06 18:51:40,072 INFO L878 garLoopResultBuilder]: At program point L341(lines 341 345) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 .cse2 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) .cse2))) [2022-04-06 18:51:40,072 INFO L878 garLoopResultBuilder]: At program point L275(lines 275 277) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 (= ssl3_connect_~blastFlag~0 1) .cse1) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 .cse2 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) .cse2))) [2022-04-06 18:51:40,072 INFO L878 garLoopResultBuilder]: At program point L341-2(lines 341 345) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse2 (= ssl3_connect_~s__state~0 4464)) (.cse3 (<= ssl3_connect_~s__s3__tmp__cert_req~0 0)) (.cse0 (= 2 ssl3_connect_~blastFlag~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse5 (= ssl3_connect_~s__state~0 4480))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse4 .cse5) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse1 .cse4 .cse2) (and .cse3 .cse0 .cse1 .cse5))) [2022-04-06 18:51:40,072 INFO L878 garLoopResultBuilder]: At program point L275-2(lines 211 490) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 (= ssl3_connect_~s__hit~0 0) (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0)))) [2022-04-06 18:51:40,072 INFO L885 garLoopResultBuilder]: At program point L210(lines 209 493) the Hoare annotation is: true [2022-04-06 18:51:40,073 INFO L878 garLoopResultBuilder]: At program point L177(lines 177 503) the Hoare annotation is: (let ((.cse2 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= 4560 ssl3_connect_~s__state~0)) (.cse9 (<= ssl3_connect_~s__state~0 4560)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse6 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse10 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse4 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse5 (= ssl3_connect_~s__state~0 4528)) (.cse1 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse5 .cse3 .cse4) (and .cse0 .cse6 .cse7 .cse1) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse8 .cse9 .cse1) (and .cse6 .cse7 .cse4) (and .cse8 .cse6 .cse9 .cse3 .cse4 .cse10) (and .cse3 .cse4 (= 4496 ssl3_connect_~s__state~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse1 .cse3) (and .cse0 .cse6 .cse3 .cse4 .cse10) (and .cse3 .cse4 (<= ssl3_connect_~blastFlag~0 4)) (and .cse5 .cse1))) [2022-04-06 18:51:40,073 INFO L878 garLoopResultBuilder]: At program point L144(lines 144 514) the Hoare annotation is: (let ((.cse2 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= 4560 ssl3_connect_~s__state~0)) (.cse9 (<= ssl3_connect_~s__state~0 4560)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse6 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse10 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse4 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse5 (= ssl3_connect_~s__state~0 4528)) (.cse1 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse5 .cse3 .cse4) (and .cse0 .cse6 .cse7 .cse1) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse8 .cse9 .cse1) (and .cse6 .cse7 .cse4) (and .cse8 .cse6 .cse9 .cse3 .cse4 .cse10) (and .cse3 .cse4 (= 4496 ssl3_connect_~s__state~0)) (and .cse3 .cse4 (= ssl3_connect_~s__state~0 4480)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse1 .cse3) (and .cse0 .cse6 .cse3 .cse4 .cse10) (and .cse3 .cse4 (<= ssl3_connect_~blastFlag~0 4)) (and .cse3 .cse4 (= ssl3_connect_~s__state~0 4464)) (and .cse5 .cse1))) [2022-04-06 18:51:40,073 INFO L878 garLoopResultBuilder]: At program point L111(lines 111 525) the Hoare annotation is: (let ((.cse1 (= 4512 ssl3_connect_~s__state~0)) (.cse9 (= 3 ssl3_connect_~s__state~0)) (.cse6 (<= 4560 ssl3_connect_~s__state~0)) (.cse7 (<= ssl3_connect_~s__state~0 4560)) (.cse10 (<= 4352 ssl3_connect_~s__state~0)) (.cse11 (<= ssl3_connect_~s__state~0 4352)) (.cse8 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse12 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse5 (= ssl3_connect_~blastFlag~0 0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse3 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse4 (= ssl3_connect_~s__state~0 4528)) (.cse0 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse1) (and .cse4 .cse2 .cse3) (and (<= 12292 ssl3_connect_~s__state~0) .cse5) (and .cse6 .cse7 .cse0) (and .cse8 .cse9 .cse0) (and .cse10 .cse11 .cse0 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse8 .cse9 .cse3) (and .cse6 .cse8 .cse7 .cse2 .cse3 .cse12) (and .cse2 .cse3 (= 4496 ssl3_connect_~s__state~0)) (and .cse2 .cse3 (= ssl3_connect_~s__state~0 4480)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse10 .cse11 .cse8 .cse2 .cse3 .cse12) (and .cse0 .cse2) (and .cse2 .cse3 (<= ssl3_connect_~blastFlag~0 4)) (and (= ssl3_connect_~s__state~0 4368) .cse5) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse2 .cse3 (= ssl3_connect_~s__state~0 4464)) (and .cse4 .cse0))) [2022-04-06 18:51:40,073 INFO L878 garLoopResultBuilder]: At program point L178(lines 174 504) the Hoare annotation is: (let ((.cse0 (<= 4464 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 .cse2 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) .cse2) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-06 18:51:40,073 INFO L878 garLoopResultBuilder]: At program point L112(lines 111 525) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 12292 ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 (= 2 ssl3_connect_~blastFlag~0) .cse1) (and .cse0 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-06 18:51:40,073 INFO L878 garLoopResultBuilder]: At program point L410(lines 410 412) the Hoare annotation is: (let ((.cse0 (<= 4464 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 .cse1 (= ssl3_connect_~s__hit~0 0) (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-06 18:51:40,073 INFO L878 garLoopResultBuilder]: At program point L377(lines 377 379) the Hoare annotation is: (let ((.cse0 (<= 4464 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 .cse2 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) .cse2) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-06 18:51:40,073 INFO L878 garLoopResultBuilder]: At program point L180(lines 180 502) the Hoare annotation is: (let ((.cse2 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= 4560 ssl3_connect_~s__state~0)) (.cse9 (<= ssl3_connect_~s__state~0 4560)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse6 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse10 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse4 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse5 (= ssl3_connect_~s__state~0 4528)) (.cse1 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse5 .cse3 .cse4) (and .cse0 .cse6 .cse7 .cse1) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse8 .cse9 .cse1) (and .cse6 .cse7 .cse4) (and .cse8 .cse6 .cse9 .cse3 .cse4 .cse10) (and .cse3 .cse4 (= 4496 ssl3_connect_~s__state~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse1 .cse3) (and .cse0 .cse6 .cse3 .cse4 .cse10) (and .cse3 .cse4 (<= ssl3_connect_~blastFlag~0 4)) (and .cse5 .cse1))) [2022-04-06 18:51:40,073 INFO L878 garLoopResultBuilder]: At program point L147(lines 147 513) the Hoare annotation is: (let ((.cse2 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= 4560 ssl3_connect_~s__state~0)) (.cse9 (<= ssl3_connect_~s__state~0 4560)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse6 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse10 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse4 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse5 (= ssl3_connect_~s__state~0 4528)) (.cse1 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse5 .cse3 .cse4) (and .cse0 .cse6 .cse7 .cse1) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse8 .cse9 .cse1) (and .cse6 .cse7 .cse4) (and .cse8 .cse6 .cse9 .cse3 .cse4 .cse10) (and .cse3 .cse4 (= 4496 ssl3_connect_~s__state~0)) (and .cse3 .cse4 (= ssl3_connect_~s__state~0 4480)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse1 .cse3) (and .cse0 .cse6 .cse3 .cse4 .cse10) (and .cse3 .cse4 (<= ssl3_connect_~blastFlag~0 4)) (and .cse3 .cse4 (= ssl3_connect_~s__state~0 4464)) (and .cse5 .cse1))) [2022-04-06 18:51:40,073 INFO L878 garLoopResultBuilder]: At program point L114(lines 114 524) the Hoare annotation is: (let ((.cse1 (= 4512 ssl3_connect_~s__state~0)) (.cse9 (= 3 ssl3_connect_~s__state~0)) (.cse6 (<= 4560 ssl3_connect_~s__state~0)) (.cse7 (<= ssl3_connect_~s__state~0 4560)) (.cse10 (<= 4352 ssl3_connect_~s__state~0)) (.cse11 (<= ssl3_connect_~s__state~0 4352)) (.cse8 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse12 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse5 (= ssl3_connect_~blastFlag~0 0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse3 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse4 (= ssl3_connect_~s__state~0 4528)) (.cse0 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse1) (and .cse4 .cse2 .cse3) (and (<= 12292 ssl3_connect_~s__state~0) .cse5) (and .cse6 .cse7 .cse0) (and .cse8 .cse9 .cse0) (and .cse10 .cse11 .cse0 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse8 .cse9 .cse3) (and .cse6 .cse8 .cse7 .cse2 .cse3 .cse12) (and .cse2 .cse3 (= 4496 ssl3_connect_~s__state~0)) (and .cse2 .cse3 (= ssl3_connect_~s__state~0 4480)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse10 .cse11 .cse8 .cse2 .cse3 .cse12) (and .cse0 .cse2) (and .cse2 .cse3 (<= ssl3_connect_~blastFlag~0 4)) (and (= ssl3_connect_~s__state~0 4368) .cse5) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse2 .cse3 (= ssl3_connect_~s__state~0 4464)) (and .cse4 .cse0))) [2022-04-06 18:51:40,073 INFO L885 garLoopResultBuilder]: At program point L478(lines 478 480) the Hoare annotation is: true [2022-04-06 18:51:40,073 INFO L885 garLoopResultBuilder]: At program point L478-2(lines 478 480) the Hoare annotation is: true [2022-04-06 18:51:40,074 INFO L878 garLoopResultBuilder]: At program point L148(lines 144 514) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 .cse2 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) .cse2))) [2022-04-06 18:51:40,074 INFO L885 garLoopResultBuilder]: At program point L545(lines 107 546) the Hoare annotation is: true [2022-04-06 18:51:40,074 INFO L878 garLoopResultBuilder]: At program point L281(lines 281 285) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 (= ssl3_connect_~s__hit~0 0) (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0)))) [2022-04-06 18:51:40,074 INFO L878 garLoopResultBuilder]: At program point L248(lines 248 251) the Hoare annotation is: (let ((.cse0 (= ssl3_connect_~s__hit~0 0))) (or (= ssl3_connect_~blastFlag~0 0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (= 2 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (<= ssl3_connect_~blastFlag~0 4)))) [2022-04-06 18:51:40,074 INFO L878 garLoopResultBuilder]: At program point L281-2(lines 281 285) the Hoare annotation is: (let ((.cse0 (= 2 ssl3_connect_~blastFlag~0)) (.cse1 (= 4400 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and (<= 4560 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560) .cse0) (and .cse1 .cse0 .cse2) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse1 .cse2 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (<= ssl3_connect_~blastFlag~0 4)))) [2022-04-06 18:51:40,074 INFO L878 garLoopResultBuilder]: At program point L315(lines 315 318) the Hoare annotation is: (let ((.cse0 (= 4432 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (<= ssl3_connect_~blastFlag~0 4)) (and (= 2 ssl3_connect_~blastFlag~0) .cse0 .cse1) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-06 18:51:40,074 INFO L878 garLoopResultBuilder]: At program point L216(lines 114 524) the Hoare annotation is: (let ((.cse0 (= ssl3_connect_~s__hit~0 0))) (or (= ssl3_connect_~blastFlag~0 0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (= 2 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (<= ssl3_connect_~blastFlag~0 4)))) [2022-04-06 18:51:40,074 INFO L878 garLoopResultBuilder]: At program point L183(lines 183 501) the Hoare annotation is: (let ((.cse2 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= 4560 ssl3_connect_~s__state~0)) (.cse9 (<= ssl3_connect_~s__state~0 4560)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse6 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse10 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse4 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse5 (= ssl3_connect_~s__state~0 4528)) (.cse1 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse5 .cse3 .cse4) (and .cse0 .cse6 .cse7 .cse1) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse8 .cse9 .cse1) (and .cse6 .cse7 .cse4) (and .cse8 .cse6 .cse9 .cse3 .cse4 .cse10) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse1 .cse3) (and .cse0 .cse6 .cse3 .cse4 .cse10) (and .cse3 .cse4 (<= ssl3_connect_~blastFlag~0 4)) (and .cse5 .cse1))) [2022-04-06 18:51:40,074 INFO L878 garLoopResultBuilder]: At program point L150(lines 150 512) the Hoare annotation is: (let ((.cse2 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= 4560 ssl3_connect_~s__state~0)) (.cse9 (<= ssl3_connect_~s__state~0 4560)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse6 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse10 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse4 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse5 (= ssl3_connect_~s__state~0 4528)) (.cse1 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse5 .cse3 .cse4) (and .cse0 .cse6 .cse7 .cse1) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse8 .cse9 .cse1) (and .cse6 .cse7 .cse4) (and .cse8 .cse6 .cse9 .cse3 .cse4 .cse10) (and .cse3 .cse4 (= 4496 ssl3_connect_~s__state~0)) (and .cse3 .cse4 (= ssl3_connect_~s__state~0 4480)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse1 .cse3) (and .cse0 .cse6 .cse3 .cse4 .cse10) (and .cse3 .cse4 (<= ssl3_connect_~blastFlag~0 4)) (and .cse3 .cse4 (= ssl3_connect_~s__state~0 4464)) (and .cse5 .cse1))) [2022-04-06 18:51:40,074 INFO L878 garLoopResultBuilder]: At program point L117(lines 117 523) the Hoare annotation is: (let ((.cse1 (= 4512 ssl3_connect_~s__state~0)) (.cse9 (= 3 ssl3_connect_~s__state~0)) (.cse6 (<= 4560 ssl3_connect_~s__state~0)) (.cse7 (<= ssl3_connect_~s__state~0 4560)) (.cse10 (<= 4352 ssl3_connect_~s__state~0)) (.cse11 (<= ssl3_connect_~s__state~0 4352)) (.cse8 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse12 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse5 (= ssl3_connect_~blastFlag~0 0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse3 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse4 (= ssl3_connect_~s__state~0 4528)) (.cse0 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse1) (and .cse4 .cse2 .cse3) (and (<= 12292 ssl3_connect_~s__state~0) .cse5) (and .cse6 .cse7 .cse0) (and .cse8 .cse9 .cse0) (and .cse10 .cse11 .cse0 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse8 .cse9 .cse3) (and .cse6 .cse8 .cse7 .cse2 .cse3 .cse12) (and .cse2 .cse3 (= 4496 ssl3_connect_~s__state~0)) (and .cse2 .cse3 (= ssl3_connect_~s__state~0 4480)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse10 .cse11 .cse8 .cse2 .cse3 .cse12) (and .cse0 .cse2) (and .cse2 .cse3 (<= ssl3_connect_~blastFlag~0 4)) (and (= ssl3_connect_~s__state~0 4368) .cse5) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse2 .cse3 (= ssl3_connect_~s__state~0 4464)) (and .cse4 .cse0))) [2022-04-06 18:51:40,074 INFO L885 garLoopResultBuilder]: At program point ssl3_connectENTRY(lines 22 557) the Hoare annotation is: true [2022-04-06 18:51:40,074 INFO L878 garLoopResultBuilder]: At program point L184(lines 180 502) the Hoare annotation is: (let ((.cse0 (<= 4464 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 .cse2 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) .cse2) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-06 18:51:40,074 INFO L885 garLoopResultBuilder]: At program point L483(lines 483 485) the Hoare annotation is: true [2022-04-06 18:51:40,074 INFO L878 garLoopResultBuilder]: At program point L450(lines 450 461) the Hoare annotation is: (let ((.cse4 (= 2 ssl3_connect_~blastFlag~0)) (.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4352)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse3 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 .cse4 .cse2) (and .cse0 .cse1 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 .cse3 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)))) [2022-04-06 18:51:40,075 INFO L878 garLoopResultBuilder]: At program point L417(lines 417 431) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4352))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 (= ssl3_connect_~s__hit~0 0) (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0)))) [2022-04-06 18:51:40,075 INFO L878 garLoopResultBuilder]: At program point L417-1(lines 417 431) the Hoare annotation is: (let ((.cse1 (= 3 ssl3_connect_~s__state~0)) (.cse5 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse3 (<= 4352 ssl3_connect_~s__state~0)) (.cse4 (<= ssl3_connect_~s__state~0 4352)) (.cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse2 (= 2 ssl3_connect_~blastFlag~0)) (.cse6 (= ssl3_connect_~s__hit~0 0)) (.cse7 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse1 .cse5) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse3 .cse4 .cse0 .cse6 .cse5 .cse7) (and .cse3 .cse4 .cse0 .cse2 .cse6 .cse7))) [2022-04-06 18:51:40,075 INFO L878 garLoopResultBuilder]: At program point L450-2(lines 450 461) the Hoare annotation is: (let ((.cse4 (= 2 ssl3_connect_~blastFlag~0)) (.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4352)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse3 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 .cse4 .cse2) (and .cse0 .cse1 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 .cse3 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)))) [2022-04-06 18:51:40,075 INFO L878 garLoopResultBuilder]: At program point L186(lines 186 500) the Hoare annotation is: (let ((.cse2 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= 4560 ssl3_connect_~s__state~0)) (.cse9 (<= ssl3_connect_~s__state~0 4560)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse6 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse10 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse4 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse5 (= ssl3_connect_~s__state~0 4528)) (.cse1 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse5 .cse3 .cse4) (and .cse0 .cse6 .cse7 .cse1) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse8 .cse9 .cse1) (and .cse6 .cse7 .cse4) (and .cse8 .cse6 .cse9 .cse3 .cse4 .cse10) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse1 .cse3) (and .cse0 .cse6 .cse3 .cse4 .cse10) (and .cse3 .cse4 (<= ssl3_connect_~blastFlag~0 4)) (and .cse5 .cse1))) [2022-04-06 18:51:40,075 INFO L878 garLoopResultBuilder]: At program point L153(lines 153 511) the Hoare annotation is: (let ((.cse2 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= 4560 ssl3_connect_~s__state~0)) (.cse9 (<= ssl3_connect_~s__state~0 4560)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse6 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse10 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse4 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse5 (= ssl3_connect_~s__state~0 4528)) (.cse1 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse5 .cse3 .cse4) (and .cse0 .cse6 .cse7 .cse1) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse8 .cse9 .cse1) (and .cse6 .cse7 .cse4) (and .cse8 .cse6 .cse9 .cse3 .cse4 .cse10) (and .cse3 .cse4 (= 4496 ssl3_connect_~s__state~0)) (and .cse3 .cse4 (= ssl3_connect_~s__state~0 4480)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse1 .cse3) (and .cse0 .cse6 .cse3 .cse4 .cse10) (and .cse3 .cse4 (<= ssl3_connect_~blastFlag~0 4)) (and .cse3 .cse4 (= ssl3_connect_~s__state~0 4464)) (and .cse5 .cse1))) [2022-04-06 18:51:40,075 INFO L878 garLoopResultBuilder]: At program point L120(lines 120 522) the Hoare annotation is: (let ((.cse1 (= 4512 ssl3_connect_~s__state~0)) (.cse9 (= 3 ssl3_connect_~s__state~0)) (.cse6 (<= 4560 ssl3_connect_~s__state~0)) (.cse7 (<= ssl3_connect_~s__state~0 4560)) (.cse10 (<= 4352 ssl3_connect_~s__state~0)) (.cse11 (<= ssl3_connect_~s__state~0 4352)) (.cse8 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse12 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse5 (= ssl3_connect_~blastFlag~0 0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse3 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse4 (= ssl3_connect_~s__state~0 4528)) (.cse0 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse1) (and .cse4 .cse2 .cse3) (and (<= 12292 ssl3_connect_~s__state~0) .cse5) (and .cse6 .cse7 .cse0) (and .cse8 .cse9 .cse0) (and .cse10 .cse11 .cse0 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse8 .cse9 .cse3) (and .cse6 .cse8 .cse7 .cse2 .cse3 .cse12) (and .cse2 .cse3 (= 4496 ssl3_connect_~s__state~0)) (and .cse2 .cse3 (= ssl3_connect_~s__state~0 4480)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse10 .cse11 .cse8 .cse2 .cse3 .cse12) (and .cse0 .cse2) (and .cse2 .cse3 (<= ssl3_connect_~blastFlag~0 4)) (and (= ssl3_connect_~s__state~0 4368) .cse5) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse2 .cse3 (= ssl3_connect_~s__state~0 4464)) (and .cse4 .cse0))) [2022-04-06 18:51:40,075 INFO L885 garLoopResultBuilder]: At program point L550(lines 550 552) the Hoare annotation is: true [2022-04-06 18:51:40,075 INFO L885 garLoopResultBuilder]: At program point L550-2(lines 550 552) the Hoare annotation is: true [2022-04-06 18:51:40,075 INFO L878 garLoopResultBuilder]: At program point L154(lines 150 512) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 .cse2 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) .cse2))) [2022-04-06 18:51:40,075 INFO L878 garLoopResultBuilder]: At program point L353(lines 353 355) the Hoare annotation is: (let ((.cse0 (<= 4464 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 .cse2 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) .cse2) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-06 18:51:40,075 INFO L878 garLoopResultBuilder]: At program point L221(lines 221 223) the Hoare annotation is: (let ((.cse0 (= ssl3_connect_~s__hit~0 0))) (or (= ssl3_connect_~blastFlag~0 0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (= 2 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (<= ssl3_connect_~blastFlag~0 4)))) [2022-04-06 18:51:40,075 INFO L878 garLoopResultBuilder]: At program point L221-2(lines 221 223) the Hoare annotation is: (let ((.cse0 (= ssl3_connect_~s__hit~0 0))) (or (= ssl3_connect_~blastFlag~0 0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (= 2 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (<= ssl3_connect_~blastFlag~0 4)))) [2022-04-06 18:51:40,075 INFO L878 garLoopResultBuilder]: At program point L387(lines 387 389) the Hoare annotation is: (let ((.cse0 (<= 4464 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 .cse1 (= ssl3_connect_~s__hit~0 0) (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-06 18:51:40,076 INFO L878 garLoopResultBuilder]: At program point L189(lines 189 499) the Hoare annotation is: (let ((.cse6 (= 3 ssl3_connect_~s__state~0)) (.cse7 (<= 4560 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__state~0 4560)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse9 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse4 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse2 (= ssl3_connect_~s__state~0 4528)) (.cse1 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse6 .cse1) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse7 .cse8 .cse1) (and .cse5 .cse6 .cse4) (and .cse7 .cse5 .cse8 .cse3 .cse4 .cse9) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse1 .cse3) (and .cse0 .cse5 .cse3 .cse4 .cse9) (and .cse3 .cse4 (<= ssl3_connect_~blastFlag~0 4)) (and .cse2 .cse1))) [2022-04-06 18:51:40,076 INFO L878 garLoopResultBuilder]: At program point L156(lines 156 510) the Hoare annotation is: (let ((.cse2 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= 4560 ssl3_connect_~s__state~0)) (.cse9 (<= ssl3_connect_~s__state~0 4560)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse6 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse10 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse4 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse5 (= ssl3_connect_~s__state~0 4528)) (.cse1 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse5 .cse3 .cse4) (and .cse0 .cse6 .cse7 .cse1) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse8 .cse9 .cse1) (and .cse6 .cse7 .cse4) (and .cse8 .cse6 .cse9 .cse3 .cse4 .cse10) (and .cse3 .cse4 (= 4496 ssl3_connect_~s__state~0)) (and .cse3 .cse4 (= ssl3_connect_~s__state~0 4480)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse1 .cse3) (and .cse0 .cse6 .cse3 .cse4 .cse10) (and .cse3 .cse4 (<= ssl3_connect_~blastFlag~0 4)) (and .cse3 .cse4 (= ssl3_connect_~s__state~0 4464)) (and .cse5 .cse1))) [2022-04-06 18:51:40,076 INFO L878 garLoopResultBuilder]: At program point L123(lines 123 521) the Hoare annotation is: (let ((.cse1 (= 4512 ssl3_connect_~s__state~0)) (.cse9 (= 3 ssl3_connect_~s__state~0)) (.cse6 (<= 4560 ssl3_connect_~s__state~0)) (.cse7 (<= ssl3_connect_~s__state~0 4560)) (.cse10 (<= 4352 ssl3_connect_~s__state~0)) (.cse11 (<= ssl3_connect_~s__state~0 4352)) (.cse8 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse12 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse5 (= ssl3_connect_~blastFlag~0 0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse3 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse4 (= ssl3_connect_~s__state~0 4528)) (.cse0 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse1) (and .cse4 .cse2 .cse3) (and (<= 12292 ssl3_connect_~s__state~0) .cse5) (and .cse6 .cse7 .cse0) (and .cse8 .cse9 .cse0) (and .cse10 .cse11 .cse0 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse8 .cse9 .cse3) (and .cse6 .cse8 .cse7 .cse2 .cse3 .cse12) (and .cse2 .cse3 (= 4496 ssl3_connect_~s__state~0)) (and .cse2 .cse3 (= ssl3_connect_~s__state~0 4480)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse10 .cse11 .cse8 .cse2 .cse3 .cse12) (and .cse0 .cse2) (and .cse2 .cse3 (<= ssl3_connect_~blastFlag~0 4)) (and (= ssl3_connect_~s__state~0 4368) .cse5) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse2 .cse3 (= ssl3_connect_~s__state~0 4464)) (and .cse4 .cse0))) [2022-04-06 18:51:40,076 INFO L878 garLoopResultBuilder]: At program point L421(lines 421 427) the Hoare annotation is: (or (and (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4352) (= 2 ssl3_connect_~blastFlag~0) (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-04-06 18:51:40,076 INFO L878 garLoopResultBuilder]: At program point L190(lines 186 500) the Hoare annotation is: (let ((.cse0 (<= 4464 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 .cse1 (= ssl3_connect_~s__hit~0 0) (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-06 18:51:40,076 INFO L878 garLoopResultBuilder]: At program point L455(lines 455 458) the Hoare annotation is: (let ((.cse4 (= 2 ssl3_connect_~blastFlag~0)) (.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4352)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse3 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 .cse4 .cse2) (and .cse0 .cse1 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 .cse3 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)))) [2022-04-06 18:51:40,076 INFO L878 garLoopResultBuilder]: At program point L323(lines 323 325) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 .cse2 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) .cse2))) [2022-04-06 18:51:40,076 INFO L878 garLoopResultBuilder]: At program point L290-1(lines 290 300) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 .cse2 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) .cse2))) [2022-04-06 18:51:40,076 INFO L885 garLoopResultBuilder]: At program point ssl3_connectEXIT(lines 22 557) the Hoare annotation is: true [2022-04-06 18:51:40,077 INFO L878 garLoopResultBuilder]: At program point L324(lines 86 556) the Hoare annotation is: (not (<= 12292 |ssl3_connect_#in~initial_state|)) [2022-04-06 18:51:40,077 INFO L878 garLoopResultBuilder]: At program point L192(lines 192 498) the Hoare annotation is: (let ((.cse6 (= 3 ssl3_connect_~s__state~0)) (.cse7 (<= 4560 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__state~0 4560)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse9 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse4 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse2 (= ssl3_connect_~s__state~0 4528)) (.cse1 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse6 .cse1) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse7 .cse8 .cse1) (and .cse5 .cse6 .cse4) (and .cse7 .cse5 .cse8 .cse3 .cse4 .cse9) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse1 .cse3) (and .cse0 .cse5 .cse3 .cse4 .cse9) (and .cse3 .cse4 (<= ssl3_connect_~blastFlag~0 4)) (and .cse2 .cse1))) [2022-04-06 18:51:40,077 INFO L878 garLoopResultBuilder]: At program point L159(lines 159 509) the Hoare annotation is: (let ((.cse2 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= 4560 ssl3_connect_~s__state~0)) (.cse9 (<= ssl3_connect_~s__state~0 4560)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse6 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse10 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse4 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse5 (= ssl3_connect_~s__state~0 4528)) (.cse1 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse5 .cse3 .cse4) (and .cse0 .cse6 .cse7 .cse1) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse8 .cse9 .cse1) (and .cse6 .cse7 .cse4) (and .cse8 .cse6 .cse9 .cse3 .cse4 .cse10) (and .cse3 .cse4 (= 4496 ssl3_connect_~s__state~0)) (and .cse3 .cse4 (= ssl3_connect_~s__state~0 4480)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse1 .cse3) (and .cse0 .cse6 .cse3 .cse4 .cse10) (and .cse3 .cse4 (<= ssl3_connect_~blastFlag~0 4)) (and .cse3 .cse4 (= ssl3_connect_~s__state~0 4464)) (and .cse5 .cse1))) [2022-04-06 18:51:40,077 INFO L878 garLoopResultBuilder]: At program point L126(lines 126 520) the Hoare annotation is: (let ((.cse2 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse6 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse8 (= ssl3_connect_~blastFlag~0 0)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse4 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse5 (= ssl3_connect_~s__state~0 4528)) (.cse1 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse5 .cse3 .cse4) (and .cse0 .cse6 .cse7 .cse1) (and (<= 12292 ssl3_connect_~s__state~0) .cse8) (and .cse9 .cse10 .cse1) (and .cse6 .cse7 .cse4) (and .cse9 .cse6 .cse10 .cse3 .cse4 .cse11) (and .cse3 .cse4 (= 4496 ssl3_connect_~s__state~0)) (and .cse3 .cse4 (= ssl3_connect_~s__state~0 4480)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse1 .cse3) (and .cse0 .cse6 .cse3 .cse4 .cse11) (and .cse3 .cse4 (<= ssl3_connect_~blastFlag~0 4)) (and (= ssl3_connect_~s__state~0 4368) .cse8) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse3 .cse4 (= ssl3_connect_~s__state~0 4464)) (and .cse5 .cse1))) [2022-04-06 18:51:40,077 INFO L885 garLoopResultBuilder]: At program point ssl3_connectFINAL(lines 22 557) the Hoare annotation is: true [2022-04-06 18:51:40,077 INFO L878 garLoopResultBuilder]: At program point L226(lines 226 229) the Hoare annotation is: (let ((.cse0 (= ssl3_connect_~s__hit~0 0))) (or (= ssl3_connect_~blastFlag~0 0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (= 2 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (<= ssl3_connect_~blastFlag~0 4)))) [2022-04-06 18:51:40,077 INFO L878 garLoopResultBuilder]: At program point L160(lines 156 510) the Hoare annotation is: (let ((.cse3 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) .cse2))) [2022-04-06 18:51:40,077 INFO L878 garLoopResultBuilder]: At program point L94(lines 94 100) the Hoare annotation is: (or (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-04-06 18:51:40,077 INFO L878 garLoopResultBuilder]: At program point L491(lines 108 544) the Hoare annotation is: (let ((.cse1 (= 4512 ssl3_connect_~s__state~0)) (.cse8 (= 3 ssl3_connect_~s__state~0)) (.cse5 (<= 4560 ssl3_connect_~s__state~0)) (.cse6 (<= ssl3_connect_~s__state~0 4560)) (.cse9 (<= 4352 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4352)) (.cse7 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse3 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse4 (= ssl3_connect_~s__state~0 4528)) (.cse0 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse1) (and .cse4 .cse2 .cse3) (and .cse5 .cse6 .cse0) (and .cse7 .cse8 .cse0) (and .cse9 .cse10 .cse0 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse7 .cse8 .cse3) (and .cse5 .cse7 .cse6 .cse2 .cse3 .cse11) (and .cse2 .cse3 (= 4496 ssl3_connect_~s__state~0)) (and .cse2 .cse3 (= ssl3_connect_~s__state~0 4480)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse9 .cse10 .cse7 .cse2 .cse3 .cse11) (and .cse0 .cse2) (and .cse2 .cse3 (<= ssl3_connect_~blastFlag~0 4)) (and (= ssl3_connect_~s__state~0 4368) (= ssl3_connect_~blastFlag~0 0)) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse2 .cse3 (= ssl3_connect_~s__state~0 4464)) (and .cse4 .cse0))) [2022-04-06 18:51:40,077 INFO L878 garLoopResultBuilder]: At program point L326(lines 326 328) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 .cse2 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) .cse2))) [2022-04-06 18:51:40,077 INFO L878 garLoopResultBuilder]: At program point L260(lines 260 262) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 .cse2 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) .cse2) (and (= ssl3_connect_~s__state~0 4368) (= ssl3_connect_~blastFlag~0 0)))) [2022-04-06 18:51:40,078 INFO L878 garLoopResultBuilder]: At program point L260-2(lines 211 490) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 (= ssl3_connect_~blastFlag~0 1) .cse1) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 .cse2 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) .cse2))) [2022-04-06 18:51:40,078 INFO L878 garLoopResultBuilder]: At program point L393(lines 393 397) the Hoare annotation is: (let ((.cse0 (= ssl3_connect_~s__state~0 4528))) (or (and .cse0 (= ssl3_connect_~s__hit~0 0) (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (= 2 ssl3_connect_~blastFlag~0)))) [2022-04-06 18:51:40,078 INFO L878 garLoopResultBuilder]: At program point L393-2(lines 211 490) the Hoare annotation is: (let ((.cse0 (= ssl3_connect_~s__state~0 4528))) (or (and .cse0 (= ssl3_connect_~s__hit~0 0) (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (= 2 ssl3_connect_~blastFlag~0)))) [2022-04-06 18:51:40,078 INFO L878 garLoopResultBuilder]: At program point L294(lines 294 296) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560) (= ssl3_connect_~s__hit~0 0) (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (<= ssl3_connect_~blastFlag~0 4))) [2022-04-06 18:51:40,078 INFO L878 garLoopResultBuilder]: At program point L294-2(lines 292 300) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560) (= ssl3_connect_~s__hit~0 0) (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (<= ssl3_connect_~blastFlag~0 4))) [2022-04-06 18:51:40,078 INFO L878 garLoopResultBuilder]: At program point L195(lines 195 497) the Hoare annotation is: (let ((.cse3 (= 3 ssl3_connect_~s__state~0)) (.cse4 (<= 4560 ssl3_connect_~s__state~0)) (.cse5 (<= ssl3_connect_~s__state~0 4560)) (.cse1 (= 2 ssl3_connect_~blastFlag~0)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse2 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse8 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse7 (= ssl3_connect_~s__hit~0 0)) (.cse6 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256))) (or (and .cse0 .cse1 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse2 .cse3 .cse1) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse4 .cse5 .cse1) (and .cse2 .cse3 .cse6) (and .cse4 .cse2 .cse5 .cse7 .cse6 .cse8) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse1 .cse7) (and .cse0 .cse2 .cse7 .cse6 .cse8) (and .cse7 .cse6 (<= ssl3_connect_~blastFlag~0 4)))) [2022-04-06 18:51:40,078 INFO L878 garLoopResultBuilder]: At program point L162(lines 162 508) the Hoare annotation is: (let ((.cse2 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= 4560 ssl3_connect_~s__state~0)) (.cse9 (<= ssl3_connect_~s__state~0 4560)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse6 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse10 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse4 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse5 (= ssl3_connect_~s__state~0 4528)) (.cse1 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse5 .cse3 .cse4) (and .cse0 .cse6 .cse7 .cse1) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse8 .cse9 .cse1) (and .cse6 .cse7 .cse4) (and .cse8 .cse6 .cse9 .cse3 .cse4 .cse10) (and .cse3 .cse4 (= 4496 ssl3_connect_~s__state~0)) (and .cse3 .cse4 (= ssl3_connect_~s__state~0 4480)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse1 .cse3) (and .cse0 .cse6 .cse3 .cse4 .cse10) (and .cse3 .cse4 (<= ssl3_connect_~blastFlag~0 4)) (and .cse3 .cse4 (= ssl3_connect_~s__state~0 4464)) (and .cse5 .cse1))) [2022-04-06 18:51:40,079 INFO L878 garLoopResultBuilder]: At program point L129(lines 129 519) the Hoare annotation is: (let ((.cse2 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= 4560 ssl3_connect_~s__state~0)) (.cse9 (<= ssl3_connect_~s__state~0 4560)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse6 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse10 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse4 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse5 (= ssl3_connect_~s__state~0 4528)) (.cse1 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse5 .cse3 .cse4) (and .cse0 .cse6 .cse7 .cse1) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse8 .cse9 .cse1) (and .cse6 .cse7 .cse4) (and .cse8 .cse6 .cse9 .cse3 .cse4 .cse10) (and .cse3 .cse4 (= 4496 ssl3_connect_~s__state~0)) (and .cse3 .cse4 (= ssl3_connect_~s__state~0 4480)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse1 .cse3) (and .cse0 .cse6 .cse3 .cse4 .cse10) (and .cse3 .cse4 (<= ssl3_connect_~blastFlag~0 4)) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse3 .cse4 (= ssl3_connect_~s__state~0 4464)) (and .cse5 .cse1))) [2022-04-06 18:51:40,079 INFO L878 garLoopResultBuilder]: At program point L526(lines 526 542) the Hoare annotation is: (let ((.cse1 (= 4512 ssl3_connect_~s__state~0)) (.cse8 (= 3 ssl3_connect_~s__state~0)) (.cse5 (<= 4560 ssl3_connect_~s__state~0)) (.cse6 (<= ssl3_connect_~s__state~0 4560)) (.cse9 (<= 4352 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4352)) (.cse7 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse3 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse4 (= ssl3_connect_~s__state~0 4528)) (.cse0 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse1) (and .cse4 .cse2 .cse3) (and .cse5 .cse6 .cse0) (and .cse7 .cse8 .cse0) (and .cse9 .cse10 .cse0 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse7 .cse8 .cse3) (and .cse5 .cse7 .cse6 .cse2 .cse3 .cse11) (and .cse2 .cse3 (= 4496 ssl3_connect_~s__state~0)) (and .cse2 .cse3 (= ssl3_connect_~s__state~0 4480)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse9 .cse10 .cse7 .cse2 .cse3 .cse11) (and .cse0 .cse2) (and .cse2 .cse3 (<= ssl3_connect_~blastFlag~0 4)) (and (= ssl3_connect_~s__state~0 4368) (= ssl3_connect_~blastFlag~0 0)) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse2 .cse3 (= ssl3_connect_~s__state~0 4464)) (and .cse4 .cse0))) [2022-04-06 18:51:40,079 INFO L878 garLoopResultBuilder]: At program point L196(lines 192 498) the Hoare annotation is: (let ((.cse0 (<= 4464 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 .cse1 (= ssl3_connect_~s__hit~0 0) (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-06 18:51:40,079 INFO L878 garLoopResultBuilder]: At program point L130(lines 126 520) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 .cse2 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) .cse2) (and (= ssl3_connect_~s__state~0 4368) (= ssl3_connect_~blastFlag~0 0)))) [2022-04-06 18:51:40,079 INFO L878 garLoopResultBuilder]: At program point L97(lines 97 99) the Hoare annotation is: (or (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-04-06 18:51:40,079 INFO L878 garLoopResultBuilder]: At program point L97-2(lines 94 100) the Hoare annotation is: (or (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-04-06 18:51:40,080 INFO L878 garLoopResultBuilder]: At program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 554) the Hoare annotation is: (not (<= 12292 |ssl3_connect_#in~initial_state|)) [2022-04-06 18:51:40,080 INFO L878 garLoopResultBuilder]: At program point L527(lines 527 541) the Hoare annotation is: (let ((.cse1 (= 4512 ssl3_connect_~s__state~0)) (.cse8 (= 3 ssl3_connect_~s__state~0)) (.cse5 (<= 4560 ssl3_connect_~s__state~0)) (.cse6 (<= ssl3_connect_~s__state~0 4560)) (.cse9 (<= 4352 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4352)) (.cse7 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse3 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse4 (= ssl3_connect_~s__state~0 4528)) (.cse0 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse1) (and .cse4 .cse2 .cse3) (and .cse5 .cse6 .cse0) (and .cse7 .cse8 .cse0) (and .cse9 .cse10 .cse0 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse7 .cse8 .cse3) (and .cse5 .cse7 .cse6 .cse2 .cse3 .cse11) (and .cse2 .cse3 (= 4496 ssl3_connect_~s__state~0)) (and .cse2 .cse3 (= ssl3_connect_~s__state~0 4480)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse9 .cse10 .cse7 .cse2 .cse3 .cse11) (and .cse0 .cse2) (and .cse2 .cse3 (<= ssl3_connect_~blastFlag~0 4)) (and (= ssl3_connect_~s__state~0 4368) (= ssl3_connect_~blastFlag~0 0)) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse2 .cse3 (= ssl3_connect_~s__state~0 4464)) (and .cse4 .cse0))) [2022-04-06 18:51:40,080 INFO L878 garLoopResultBuilder]: At program point L362(lines 362 364) the Hoare annotation is: (let ((.cse0 (<= 4464 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 .cse2 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) .cse2) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-06 18:51:40,080 INFO L878 garLoopResultBuilder]: At program point L528(lines 528 533) the Hoare annotation is: (let ((.cse1 (= 4512 ssl3_connect_~s__state~0)) (.cse8 (= 3 ssl3_connect_~s__state~0)) (.cse5 (<= 4560 ssl3_connect_~s__state~0)) (.cse6 (<= ssl3_connect_~s__state~0 4560)) (.cse9 (<= 4352 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4352)) (.cse7 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse3 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse4 (= ssl3_connect_~s__state~0 4528)) (.cse0 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse1) (and .cse4 .cse2 .cse3) (and .cse5 .cse6 .cse0) (and .cse7 .cse8 .cse0) (and .cse9 .cse10 .cse0 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse7 .cse8 .cse3) (and .cse5 .cse7 .cse6 .cse2 .cse3 .cse11) (and .cse2 .cse3 (= 4496 ssl3_connect_~s__state~0)) (and .cse2 .cse3 (= ssl3_connect_~s__state~0 4480)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse9 .cse10 .cse7 .cse2 .cse3 .cse11) (and .cse0 .cse2) (and .cse2 .cse3 (<= ssl3_connect_~blastFlag~0 4)) (and (= ssl3_connect_~s__state~0 4368) (= ssl3_connect_~blastFlag~0 0)) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse2 .cse3 (= ssl3_connect_~s__state~0 4464)) (and .cse4 .cse0))) [2022-04-06 18:51:40,080 INFO L878 garLoopResultBuilder]: At program point L528-2(lines 527 541) the Hoare annotation is: (let ((.cse1 (= 4512 ssl3_connect_~s__state~0)) (.cse8 (= 3 ssl3_connect_~s__state~0)) (.cse5 (<= 4560 ssl3_connect_~s__state~0)) (.cse6 (<= ssl3_connect_~s__state~0 4560)) (.cse9 (<= 4352 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4352)) (.cse7 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse3 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse4 (= ssl3_connect_~s__state~0 4528)) (.cse0 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse1) (and .cse4 .cse2 .cse3) (and .cse5 .cse6 .cse0) (and .cse7 .cse8 .cse0) (and .cse9 .cse10 .cse0 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse7 .cse8 .cse3) (and .cse5 .cse7 .cse6 .cse2 .cse3 .cse11) (and .cse2 .cse3 (= 4496 ssl3_connect_~s__state~0)) (and .cse2 .cse3 (= ssl3_connect_~s__state~0 4480)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse9 .cse10 .cse7 .cse2 .cse3 .cse11) (and .cse0 .cse2) (and .cse2 .cse3 (<= ssl3_connect_~blastFlag~0 4)) (and (= ssl3_connect_~s__state~0 4368) (= ssl3_connect_~blastFlag~0 0)) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse2 .cse3 (= ssl3_connect_~s__state~0 4464)) (and .cse4 .cse0))) [2022-04-06 18:51:40,080 INFO L878 garLoopResultBuilder]: At program point L198(lines 198 496) the Hoare annotation is: (let ((.cse3 (= 3 ssl3_connect_~s__state~0)) (.cse4 (<= 4560 ssl3_connect_~s__state~0)) (.cse5 (<= ssl3_connect_~s__state~0 4560)) (.cse1 (= 2 ssl3_connect_~blastFlag~0)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse2 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse8 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse7 (= ssl3_connect_~s__hit~0 0)) (.cse6 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256))) (or (and .cse0 .cse1 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse2 .cse3 .cse1) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse4 .cse5 .cse1) (and .cse2 .cse3 .cse6) (and .cse4 .cse2 .cse5 .cse7 .cse6 .cse8) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse1 .cse7) (and .cse0 .cse2 .cse7 .cse6 .cse8) (and .cse7 .cse6 (<= ssl3_connect_~blastFlag~0 4)))) [2022-04-06 18:51:40,080 INFO L878 garLoopResultBuilder]: At program point L165(lines 165 507) the Hoare annotation is: (let ((.cse2 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= 4560 ssl3_connect_~s__state~0)) (.cse9 (<= ssl3_connect_~s__state~0 4560)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse6 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse10 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse4 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse5 (= ssl3_connect_~s__state~0 4528)) (.cse1 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse5 .cse3 .cse4) (and .cse0 .cse6 .cse7 .cse1) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse8 .cse9 .cse1) (and .cse6 .cse7 .cse4) (and .cse8 .cse6 .cse9 .cse3 .cse4 .cse10) (and .cse3 .cse4 (= 4496 ssl3_connect_~s__state~0)) (and .cse3 .cse4 (= ssl3_connect_~s__state~0 4480)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse1 .cse3) (and .cse0 .cse6 .cse3 .cse4 .cse10) (and .cse3 .cse4 (<= ssl3_connect_~blastFlag~0 4)) (and .cse5 .cse1))) [2022-04-06 18:51:40,080 INFO L878 garLoopResultBuilder]: At program point L132(lines 132 518) the Hoare annotation is: (let ((.cse2 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= 4560 ssl3_connect_~s__state~0)) (.cse9 (<= ssl3_connect_~s__state~0 4560)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse6 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse10 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse4 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse5 (= ssl3_connect_~s__state~0 4528)) (.cse1 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse5 .cse3 .cse4) (and .cse0 .cse6 .cse7 .cse1) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse8 .cse9 .cse1) (and .cse6 .cse7 .cse4) (and .cse8 .cse6 .cse9 .cse3 .cse4 .cse10) (and .cse3 .cse4 (= 4496 ssl3_connect_~s__state~0)) (and .cse3 .cse4 (= ssl3_connect_~s__state~0 4480)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse1 .cse3) (and .cse0 .cse6 .cse3 .cse4 .cse10) (and .cse3 .cse4 (<= ssl3_connect_~blastFlag~0 4)) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse3 .cse4 (= ssl3_connect_~s__state~0 4464)) (and .cse5 .cse1))) [2022-04-06 18:51:40,080 INFO L878 garLoopResultBuilder]: At program point L232(lines 232 243) the Hoare annotation is: (let ((.cse0 (= ssl3_connect_~s__hit~0 0))) (or (= ssl3_connect_~blastFlag~0 0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (= 2 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (<= ssl3_connect_~blastFlag~0 4)))) [2022-04-06 18:51:40,081 INFO L878 garLoopResultBuilder]: At program point L232-2(lines 211 490) the Hoare annotation is: (let ((.cse0 (= ssl3_connect_~s__hit~0 0))) (or (= ssl3_connect_~blastFlag~0 0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (= 2 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (<= ssl3_connect_~blastFlag~0 4)))) [2022-04-06 18:51:40,081 INFO L878 garLoopResultBuilder]: At program point L530(lines 530 532) the Hoare annotation is: (let ((.cse1 (= 4512 ssl3_connect_~s__state~0)) (.cse8 (= 3 ssl3_connect_~s__state~0)) (.cse5 (<= 4560 ssl3_connect_~s__state~0)) (.cse6 (<= ssl3_connect_~s__state~0 4560)) (.cse9 (<= 4352 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4352)) (.cse7 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse3 (= ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse4 (= ssl3_connect_~s__state~0 4528)) (.cse0 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse1) (and .cse4 .cse2 .cse3) (and .cse5 .cse6 .cse0) (and .cse7 .cse8 .cse0) (and .cse9 .cse10 .cse0 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse7 .cse8 .cse3) (and .cse5 .cse7 .cse6 .cse2 .cse3 .cse11) (and .cse2 .cse3 (= 4496 ssl3_connect_~s__state~0)) (and .cse2 .cse3 (= ssl3_connect_~s__state~0 4480)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse9 .cse10 .cse7 .cse2 .cse3 .cse11) (and .cse0 .cse2) (and .cse2 .cse3 (<= ssl3_connect_~blastFlag~0 4)) (and (= ssl3_connect_~s__state~0 4368) (= ssl3_connect_~blastFlag~0 0)) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse2 .cse3 (= ssl3_connect_~s__state~0 4464)) (and .cse4 .cse0))) [2022-04-06 18:51:40,081 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-06 18:51:40,081 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-06 18:51:40,081 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-06 18:51:40,081 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-06 18:51:40,083 INFO L719 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-06 18:51:40,084 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-06 18:51:40,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 06:51:40 BoogieIcfgContainer [2022-04-06 18:51:40,098 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-06 18:51:40,099 INFO L158 Benchmark]: Toolchain (without parser) took 78396.07ms. Allocated memory was 196.1MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 146.3MB in the beginning and 716.3MB in the end (delta: -570.0MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2022-04-06 18:51:40,099 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 196.1MB. Free memory was 163.1MB in the beginning and 162.9MB in the end (delta: 150.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-06 18:51:40,099 INFO L158 Benchmark]: CACSL2BoogieTranslator took 270.99ms. Allocated memory is still 196.1MB. Free memory was 146.1MB in the beginning and 167.7MB in the end (delta: -21.6MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. [2022-04-06 18:51:40,099 INFO L158 Benchmark]: Boogie Preprocessor took 50.41ms. Allocated memory is still 196.1MB. Free memory was 167.7MB in the beginning and 165.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-06 18:51:40,100 INFO L158 Benchmark]: RCFGBuilder took 486.68ms. Allocated memory is still 196.1MB. Free memory was 165.1MB in the beginning and 139.4MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-04-06 18:51:40,100 INFO L158 Benchmark]: TraceAbstraction took 77584.59ms. Allocated memory was 196.1MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 138.9MB in the beginning and 716.3MB in the end (delta: -577.4MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2022-04-06 18:51:40,100 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.10ms. Allocated memory is still 196.1MB. Free memory was 163.1MB in the beginning and 162.9MB in the end (delta: 150.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 270.99ms. Allocated memory is still 196.1MB. Free memory was 146.1MB in the beginning and 167.7MB in the end (delta: -21.6MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.41ms. Allocated memory is still 196.1MB. Free memory was 167.7MB in the beginning and 165.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 486.68ms. Allocated memory is still 196.1MB. Free memory was 165.1MB in the beginning and 139.4MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * TraceAbstraction took 77584.59ms. Allocated memory was 196.1MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 138.9MB in the beginning and 716.3MB in the end (delta: -577.4MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 554]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 139 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 77.5s, OverallIterations: 27, TraceHistogramMax: 18, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 56.9s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6433 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6431 mSDsluCounter, 6204 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 519 mSDsCounter, 520 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5276 IncrementalHoareTripleChecker+Invalid, 5796 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 520 mSolverCounterUnsat, 5685 mSDtfsCounter, 5276 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3417 GetRequests, 3316 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9237occurred in iteration=25, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.2s AutomataMinimizationTime, 27 MinimizatonAttempts, 4015 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 136 LocationsWithAnnotation, 136 PreInvPairs, 4605 NumberOfFragments, 8978 HoareAnnotationTreeSize, 136 FomulaSimplifications, 82680 FormulaSimplificationTreeSizeReduction, 19.3s HoareSimplificationTime, 136 FomulaSimplificationsInter, 195655 FormulaSimplificationTreeSizeReductionInter, 37.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: (((((((4352 <= s__state && s__state <= 4352) && s__hit == 0) && s__s3__tmp__new_cipher__algorithms == 256) && blastFlag <= 4) || (((4352 <= s__state && s__state <= 4352) && 2 == blastFlag) && s__hit == 0)) || (((4352 <= s__state && s__state <= 4352) && 2 == blastFlag) && 3 == s__s3__tmp__next_state___0)) || !(12292 <= \old(initial_state))) || (((((4352 <= s__state && s__state <= 4352) && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__s3__tmp__new_cipher__algorithms == 256) && 4560 <= s__s3__tmp__next_state___0) - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: ((((4464 <= s__state && s__state <= 4560) && s__hit == 0) && s__s3__tmp__new_cipher__algorithms == 256) || ((4464 <= s__state && s__state <= 4560) && 2 == blastFlag)) || !(12292 <= \old(initial_state)) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((((4352 <= s__state && blastFlag == 1) && s__state <= 4560) || !(12292 <= \old(initial_state))) || ((((4352 <= s__state && s__state <= 4560) && s__hit == 0) && s__s3__tmp__new_cipher__algorithms == 256) && blastFlag <= 4)) || (((4352 <= s__state && s__state <= 4560) && 2 == blastFlag) && s__hit == 0) - InvariantResult [Line: 86]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: (((((12292 <= s__state && s__hit == 0) && s__s3__tmp__new_cipher__algorithms == 256) && blastFlag <= 4) || ((12292 <= s__state && 2 == blastFlag) && s__hit == 0)) || (12292 <= s__state && blastFlag == 0)) || !(12292 <= \old(initial_state)) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: ((((4464 <= s__state && s__state <= 4560) && s__hit == 0) && s__s3__tmp__new_cipher__algorithms == 256) || (((4464 <= s__state && s__state <= 4560) && 2 == blastFlag) && s__hit == 0)) || !(12292 <= \old(initial_state)) - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: (((((((((((((((((2 == blastFlag && 4512 == s__state) || ((s__hit == 0 && s__s3__tmp__new_cipher__algorithms == 256) && 4512 == s__state)) || ((s__state == 4528 && s__hit == 0) && s__s3__tmp__new_cipher__algorithms == 256)) || ((4560 <= s__state && s__state <= 4560) && 2 == blastFlag)) || ((s__s3__tmp__next_state___0 <= 4560 && 3 == s__state) && 2 == blastFlag)) || (((4352 <= s__state && s__state <= 4352) && 2 == blastFlag) && 3 == s__s3__tmp__next_state___0)) || ((s__s3__tmp__next_state___0 <= 4560 && 3 == s__state) && s__s3__tmp__new_cipher__algorithms == 256)) || (((((4560 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) && s__s3__tmp__new_cipher__algorithms == 256) && 4560 <= s__s3__tmp__next_state___0)) || ((s__hit == 0 && s__s3__tmp__new_cipher__algorithms == 256) && 4496 == s__state)) || ((s__hit == 0 && s__s3__tmp__new_cipher__algorithms == 256) && s__state == 4480)) || !(12292 <= \old(initial_state))) || (((((4352 <= s__state && s__state <= 4352) && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__s3__tmp__new_cipher__algorithms == 256) && 4560 <= s__s3__tmp__next_state___0)) || (2 == blastFlag && s__hit == 0)) || ((s__hit == 0 && s__s3__tmp__new_cipher__algorithms == 256) && blastFlag <= 4)) || (s__state == 4368 && blastFlag == 0)) || (blastFlag == 1 && s__state == 4384)) || ((s__hit == 0 && s__s3__tmp__new_cipher__algorithms == 256) && s__state == 4464)) || (s__state == 4528 && 2 == blastFlag) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || ((((4352 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) && s__s3__tmp__new_cipher__algorithms == 256)) || ((((4352 <= s__state && s__state <= 4560) && s__hit == 0) && s__s3__tmp__new_cipher__algorithms == 256) && blastFlag <= 4)) || (((4352 <= s__state && s__state <= 4560) && 2 == blastFlag) && s__hit == 0) - InvariantResult [Line: 150]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || ((((4352 <= s__state && s__state <= 4560) && s__hit == 0) && s__s3__tmp__new_cipher__algorithms == 256) && blastFlag <= 4)) || (((4352 <= s__state && s__state <= 4560) && 2 == blastFlag) && s__hit == 0) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (((((4560 <= s__state && s__state <= 4560) && 2 == blastFlag) || ((((4560 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) && s__s3__tmp__new_cipher__algorithms == 256)) || !(12292 <= \old(initial_state))) || ((4560 <= s__state && 2 == blastFlag) && s__hit == 0)) || (((4560 <= s__state && s__hit == 0) && s__s3__tmp__new_cipher__algorithms == 256) && blastFlag <= 4) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: ((blastFlag == 0 || !(12292 <= \old(initial_state))) || (2 == blastFlag && s__hit == 0)) || ((s__hit == 0 && s__s3__tmp__new_cipher__algorithms == 256) && blastFlag <= 4) - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || ((((4352 <= s__state && s__state <= 4560) && s__hit == 0) && s__s3__tmp__new_cipher__algorithms == 256) && blastFlag <= 4)) || (((4352 <= s__state && s__state <= 4560) && 2 == blastFlag) && s__hit == 0)) || (s__state == 4368 && blastFlag == 0) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: ((((4464 <= s__state && s__state <= 4560) && s__hit == 0) && s__s3__tmp__new_cipher__algorithms == 256) || ((4464 <= s__state && s__state <= 4560) && 2 == blastFlag)) || !(12292 <= \old(initial_state)) - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: ((((4464 <= s__state && s__state <= 4560) && s__hit == 0) && s__s3__tmp__new_cipher__algorithms == 256) || (((4464 <= s__state && s__state <= 4560) && 2 == blastFlag) && s__hit == 0)) || !(12292 <= \old(initial_state)) - InvariantResult [Line: 144]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || ((((4352 <= s__state && s__state <= 4560) && s__hit == 0) && s__s3__tmp__new_cipher__algorithms == 256) && blastFlag <= 4)) || (((4352 <= s__state && s__state <= 4560) && 2 == blastFlag) && s__hit == 0) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || ((((4352 <= s__state && s__state <= 4560) && s__hit == 0) && s__s3__tmp__new_cipher__algorithms == 256) && blastFlag <= 4)) || (((4352 <= s__state && s__state <= 4560) && 2 == blastFlag) && s__hit == 0) - InvariantResult [Line: 162]: Loop Invariant Derived loop invariant: ((((4464 <= s__state && s__state <= 4560) && s__hit == 0) && s__s3__tmp__new_cipher__algorithms == 256) || (((4464 <= s__state && s__state <= 4560) && 2 == blastFlag) && s__hit == 0)) || !(12292 <= \old(initial_state)) - ProcedureContractResult [Line: 22]: Procedure Contract for ssl3_connect Derived contract for procedure ssl3_connect: 1 - ProcedureContractResult [Line: 558]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-04-06 18:51:40,131 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...