/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/openssl-simplified/s3_clnt_4.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 00:48:33,638 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 00:48:33,640 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 00:48:33,664 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 00:48:33,665 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 00:48:33,666 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 00:48:33,667 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 00:48:33,669 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 00:48:33,670 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 00:48:33,671 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 00:48:33,672 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 00:48:33,672 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 00:48:33,673 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 00:48:33,674 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 00:48:33,675 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 00:48:33,675 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 00:48:33,676 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 00:48:33,677 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 00:48:33,678 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 00:48:33,680 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 00:48:33,681 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 00:48:33,682 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 00:48:33,682 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 00:48:33,690 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 00:48:33,691 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 00:48:33,693 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 00:48:33,694 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 00:48:33,694 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 00:48:33,694 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 00:48:33,695 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 00:48:33,696 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 00:48:33,696 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 00:48:33,696 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 00:48:33,697 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 00:48:33,697 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 00:48:33,698 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 00:48:33,698 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 00:48:33,699 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 00:48:33,699 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 00:48:33,699 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 00:48:33,700 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 00:48:33,708 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 00:48:33,709 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-07 00:48:33,720 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 00:48:33,721 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 00:48:33,723 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 00:48:33,723 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 00:48:33,723 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 00:48:33,723 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 00:48:33,723 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 00:48:33,723 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 00:48:33,723 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 00:48:33,724 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 00:48:33,724 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 00:48:33,725 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 00:48:33,725 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 00:48:33,725 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 00:48:33,725 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 00:48:33,725 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 00:48:33,725 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 00:48:33,725 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-07 00:48:33,726 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-07 00:48:33,726 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-07 00:48:33,726 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 00:48:33,726 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-07 00:48:33,726 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-07 00:48:33,982 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 00:48:34,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 00:48:34,020 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 00:48:34,021 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 00:48:34,022 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 00:48:34,023 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl-simplified/s3_clnt_4.cil-1.c [2022-04-07 00:48:34,127 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64cb6a64c/eb7002746f5345889a9baceccc0cea3f/FLAG999baef62 [2022-04-07 00:48:34,791 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 00:48:34,792 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_clnt_4.cil-1.c [2022-04-07 00:48:34,800 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64cb6a64c/eb7002746f5345889a9baceccc0cea3f/FLAG999baef62 [2022-04-07 00:48:34,811 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64cb6a64c/eb7002746f5345889a9baceccc0cea3f [2022-04-07 00:48:34,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 00:48:34,815 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 00:48:34,816 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 00:48:34,816 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 00:48:34,819 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 00:48:34,819 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 12:48:34" (1/1) ... [2022-04-07 00:48:34,820 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61ad81c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:48:34, skipping insertion in model container [2022-04-07 00:48:34,820 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 12:48:34" (1/1) ... [2022-04-07 00:48:34,826 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 00:48:34,850 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 00:48:35,048 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_4.cil-1.c[35886,35899] [2022-04-07 00:48:35,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 00:48:35,061 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 00:48:35,106 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_4.cil-1.c[35886,35899] [2022-04-07 00:48:35,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 00:48:35,119 INFO L208 MainTranslator]: Completed translation [2022-04-07 00:48:35,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:48:35 WrapperNode [2022-04-07 00:48:35,120 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 00:48:35,121 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 00:48:35,121 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 00:48:35,121 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 00:48:35,136 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:48:35" (1/1) ... [2022-04-07 00:48:35,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:48:35" (1/1) ... [2022-04-07 00:48:35,159 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:48:35" (1/1) ... [2022-04-07 00:48:35,159 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:48:35" (1/1) ... [2022-04-07 00:48:35,168 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:48:35" (1/1) ... [2022-04-07 00:48:35,195 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:48:35" (1/1) ... [2022-04-07 00:48:35,197 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:48:35" (1/1) ... [2022-04-07 00:48:35,201 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 00:48:35,202 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 00:48:35,202 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 00:48:35,202 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 00:48:35,212 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:48:35" (1/1) ... [2022-04-07 00:48:35,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 00:48:35,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 00:48:35,245 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-07 00:48:35,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-07 00:48:35,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 00:48:35,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 00:48:35,285 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 00:48:35,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2022-04-07 00:48:35,286 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 00:48:35,286 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 00:48:35,286 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 00:48:35,286 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 00:48:35,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 00:48:35,287 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-07 00:48:35,287 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 00:48:35,287 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-07 00:48:35,288 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2022-04-07 00:48:35,288 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 00:48:35,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 00:48:35,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 00:48:35,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 00:48:35,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 00:48:35,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 00:48:35,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 00:48:35,499 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 00:48:35,501 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 00:48:35,699 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-07 00:48:36,348 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-04-07 00:48:36,348 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-04-07 00:48:36,369 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 00:48:36,376 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 00:48:36,376 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 00:48:36,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 12:48:36 BoogieIcfgContainer [2022-04-07 00:48:36,378 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 00:48:36,380 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 00:48:36,380 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 00:48:36,394 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 00:48:36,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 12:48:34" (1/3) ... [2022-04-07 00:48:36,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@514a559 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 12:48:36, skipping insertion in model container [2022-04-07 00:48:36,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:48:35" (2/3) ... [2022-04-07 00:48:36,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@514a559 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 12:48:36, skipping insertion in model container [2022-04-07 00:48:36,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 12:48:36" (3/3) ... [2022-04-07 00:48:36,396 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt_4.cil-1.c [2022-04-07 00:48:36,401 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-07 00:48:36,401 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 00:48:36,484 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 00:48:36,510 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-07 00:48:36,510 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 00:48:36,545 INFO L276 IsEmpty]: Start isEmpty. Operand has 137 states, 129 states have (on average 1.697674418604651) internal successors, (219), 130 states have internal predecessors, (219), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 00:48:36,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-07 00:48:36,580 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:36,581 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-07 00:48:36,582 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:36,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:36,587 INFO L85 PathProgramCache]: Analyzing trace with hash -53499867, now seen corresponding path program 1 times [2022-04-07 00:48:36,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:36,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1042946989] [2022-04-07 00:48:36,613 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:36,614 INFO L85 PathProgramCache]: Analyzing trace with hash -53499867, now seen corresponding path program 2 times [2022-04-07 00:48:36,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:36,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650947060] [2022-04-07 00:48:36,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:36,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:36,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:37,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:37,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:37,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 00:48:37,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:37,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650947060] [2022-04-07 00:48:37,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650947060] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:37,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:37,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:37,117 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:37,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1042946989] [2022-04-07 00:48:37,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1042946989] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:37,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:37,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:37,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562444581] [2022-04-07 00:48:37,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:37,140 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:48:37,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:37,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:48:37,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:48:37,198 INFO L87 Difference]: Start difference. First operand has 137 states, 129 states have (on average 1.697674418604651) internal successors, (219), 130 states have internal predecessors, (219), 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-07 00:48:37,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:37,640 INFO L93 Difference]: Finished difference Result 376 states and 631 transitions. [2022-04-07 00:48:37,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:48:37,642 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-07 00:48:37,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:37,660 INFO L225 Difference]: With dead ends: 376 [2022-04-07 00:48:37,660 INFO L226 Difference]: Without dead ends: 219 [2022-04-07 00:48:37,666 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-07 00:48:37,671 INFO L913 BasicCegarLoop]: 215 mSDtfsCounter, 578 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 00:48:37,672 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [580 Valid, 224 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 00:48:37,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-04-07 00:48:37,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2022-04-07 00:48:37,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 214 states have (on average 1.4906542056074767) internal successors, (319), 214 states have internal predecessors, (319), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:37,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 323 transitions. [2022-04-07 00:48:37,757 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 323 transitions. Word has length 30 [2022-04-07 00:48:37,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:37,758 INFO L478 AbstractCegarLoop]: Abstraction has 219 states and 323 transitions. [2022-04-07 00:48:37,758 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-07 00:48:37,758 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 323 transitions. [2022-04-07 00:48:37,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-07 00:48:37,763 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:37,763 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-07 00:48:37,764 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 00:48:37,764 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:37,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:37,764 INFO L85 PathProgramCache]: Analyzing trace with hash -67654802, now seen corresponding path program 1 times [2022-04-07 00:48:37,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:37,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2108762136] [2022-04-07 00:48:37,766 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:37,767 INFO L85 PathProgramCache]: Analyzing trace with hash -67654802, now seen corresponding path program 2 times [2022-04-07 00:48:37,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:37,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836826842] [2022-04-07 00:48:37,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:37,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:37,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:37,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:37,963 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 00:48:37,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:37,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836826842] [2022-04-07 00:48:37,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836826842] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:37,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:37,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:37,965 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:37,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2108762136] [2022-04-07 00:48:37,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2108762136] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:37,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:37,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:37,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374326072] [2022-04-07 00:48:37,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:37,967 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:48:37,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:37,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:48:37,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:48:37,969 INFO L87 Difference]: Start difference. First operand 219 states and 323 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-07 00:48:38,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:38,255 INFO L93 Difference]: Finished difference Result 349 states and 522 transitions. [2022-04-07 00:48:38,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:48:38,256 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-07 00:48:38,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:38,260 INFO L225 Difference]: With dead ends: 349 [2022-04-07 00:48:38,262 INFO L226 Difference]: Without dead ends: 244 [2022-04-07 00:48:38,267 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-07 00:48:38,273 INFO L913 BasicCegarLoop]: 186 mSDtfsCounter, 189 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:48:38,274 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 193 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 00:48:38,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-04-07 00:48:38,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 236. [2022-04-07 00:48:38,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 231 states have (on average 1.4761904761904763) internal successors, (341), 231 states have internal predecessors, (341), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:38,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 345 transitions. [2022-04-07 00:48:38,302 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 345 transitions. Word has length 44 [2022-04-07 00:48:38,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:38,303 INFO L478 AbstractCegarLoop]: Abstraction has 236 states and 345 transitions. [2022-04-07 00:48:38,304 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-07 00:48:38,304 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 345 transitions. [2022-04-07 00:48:38,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-07 00:48:38,310 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:38,311 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-07 00:48:38,311 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 00:48:38,311 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:38,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:38,312 INFO L85 PathProgramCache]: Analyzing trace with hash 791020593, now seen corresponding path program 1 times [2022-04-07 00:48:38,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:38,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1321278002] [2022-04-07 00:48:38,317 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:38,317 INFO L85 PathProgramCache]: Analyzing trace with hash 791020593, now seen corresponding path program 2 times [2022-04-07 00:48:38,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:38,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582108316] [2022-04-07 00:48:38,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:38,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:38,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:38,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:38,471 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-07 00:48:38,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:38,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582108316] [2022-04-07 00:48:38,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582108316] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:38,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:38,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:38,472 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:38,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1321278002] [2022-04-07 00:48:38,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1321278002] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:38,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:38,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:38,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961810760] [2022-04-07 00:48:38,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:38,473 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:48:38,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:38,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:48:38,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:48:38,489 INFO L87 Difference]: Start difference. First operand 236 states and 345 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-07 00:48:38,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:38,818 INFO L93 Difference]: Finished difference Result 561 states and 851 transitions. [2022-04-07 00:48:38,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:48:38,819 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-07 00:48:38,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:38,821 INFO L225 Difference]: With dead ends: 561 [2022-04-07 00:48:38,821 INFO L226 Difference]: Without dead ends: 336 [2022-04-07 00:48:38,823 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-07 00:48:38,841 INFO L913 BasicCegarLoop]: 197 mSDtfsCounter, 209 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 00:48:38,846 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 204 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 00:48:38,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2022-04-07 00:48:38,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 318. [2022-04-07 00:48:38,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 313 states have (on average 1.4089456869009584) internal successors, (441), 313 states have internal predecessors, (441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:38,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 445 transitions. [2022-04-07 00:48:38,892 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 445 transitions. Word has length 61 [2022-04-07 00:48:38,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:38,894 INFO L478 AbstractCegarLoop]: Abstraction has 318 states and 445 transitions. [2022-04-07 00:48:38,894 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-07 00:48:38,894 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 445 transitions. [2022-04-07 00:48:38,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-07 00:48:38,895 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:38,895 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-07 00:48:38,895 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-07 00:48:38,897 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:38,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:38,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1014417741, now seen corresponding path program 1 times [2022-04-07 00:48:38,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:38,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1960040995] [2022-04-07 00:48:38,901 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:38,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1014417741, now seen corresponding path program 2 times [2022-04-07 00:48:38,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:38,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185242021] [2022-04-07 00:48:38,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:38,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:38,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:39,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:39,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:39,032 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-07 00:48:39,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:39,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185242021] [2022-04-07 00:48:39,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185242021] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:39,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:39,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:39,033 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:39,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1960040995] [2022-04-07 00:48:39,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1960040995] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:39,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:39,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:39,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540737938] [2022-04-07 00:48:39,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:39,034 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:48:39,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:39,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:48:39,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:48:39,035 INFO L87 Difference]: Start difference. First operand 318 states and 445 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-07 00:48:39,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:39,347 INFO L93 Difference]: Finished difference Result 673 states and 957 transitions. [2022-04-07 00:48:39,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:48:39,347 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-07 00:48:39,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:39,350 INFO L225 Difference]: With dead ends: 673 [2022-04-07 00:48:39,350 INFO L226 Difference]: Without dead ends: 368 [2022-04-07 00:48:39,351 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-07 00:48:39,353 INFO L913 BasicCegarLoop]: 187 mSDtfsCounter, 195 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 00:48:39,358 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 194 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 00:48:39,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-04-07 00:48:39,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 356. [2022-04-07 00:48:39,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 351 states have (on average 1.393162393162393) internal successors, (489), 351 states have internal predecessors, (489), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:39,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 493 transitions. [2022-04-07 00:48:39,514 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 493 transitions. Word has length 61 [2022-04-07 00:48:39,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:39,516 INFO L478 AbstractCegarLoop]: Abstraction has 356 states and 493 transitions. [2022-04-07 00:48:39,516 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-07 00:48:39,516 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 493 transitions. [2022-04-07 00:48:39,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-07 00:48:39,518 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:39,518 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-07 00:48:39,519 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-07 00:48:39,522 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:39,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:39,523 INFO L85 PathProgramCache]: Analyzing trace with hash -2014829456, now seen corresponding path program 1 times [2022-04-07 00:48:39,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:39,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [649294416] [2022-04-07 00:48:39,524 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:39,524 INFO L85 PathProgramCache]: Analyzing trace with hash -2014829456, now seen corresponding path program 2 times [2022-04-07 00:48:39,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:39,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397326436] [2022-04-07 00:48:39,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:39,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:39,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:39,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:39,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:39,607 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-07 00:48:39,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:39,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397326436] [2022-04-07 00:48:39,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397326436] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:39,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:39,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:39,608 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:39,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [649294416] [2022-04-07 00:48:39,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [649294416] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:39,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:39,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:39,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207266679] [2022-04-07 00:48:39,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:39,610 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:48:39,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:39,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:48:39,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:48:39,611 INFO L87 Difference]: Start difference. First operand 356 states and 493 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-07 00:48:39,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:39,867 INFO L93 Difference]: Finished difference Result 805 states and 1153 transitions. [2022-04-07 00:48:39,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:48:39,891 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-07 00:48:39,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:39,894 INFO L225 Difference]: With dead ends: 805 [2022-04-07 00:48:39,894 INFO L226 Difference]: Without dead ends: 460 [2022-04-07 00:48:39,895 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-07 00:48:39,920 INFO L913 BasicCegarLoop]: 174 mSDtfsCounter, 295 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 181 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.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:48:39,920 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [295 Valid, 181 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 00:48:39,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2022-04-07 00:48:39,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 434. [2022-04-07 00:48:39,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 429 states have (on average 1.4522144522144522) internal successors, (623), 429 states have internal predecessors, (623), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:39,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 627 transitions. [2022-04-07 00:48:39,970 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 627 transitions. Word has length 74 [2022-04-07 00:48:39,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:39,970 INFO L478 AbstractCegarLoop]: Abstraction has 434 states and 627 transitions. [2022-04-07 00:48:39,970 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-07 00:48:39,971 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 627 transitions. [2022-04-07 00:48:39,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-07 00:48:39,972 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:39,972 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, 1] [2022-04-07 00:48:39,972 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-07 00:48:39,972 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:39,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:39,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1130395829, now seen corresponding path program 1 times [2022-04-07 00:48:39,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:39,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [354639075] [2022-04-07 00:48:39,973 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:39,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1130395829, now seen corresponding path program 2 times [2022-04-07 00:48:39,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:39,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143232530] [2022-04-07 00:48:39,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:39,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:40,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:40,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:40,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:40,068 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-07 00:48:40,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:40,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143232530] [2022-04-07 00:48:40,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143232530] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:40,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:40,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:40,070 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:40,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [354639075] [2022-04-07 00:48:40,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [354639075] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:40,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:40,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:40,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837868194] [2022-04-07 00:48:40,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:40,071 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:48:40,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:40,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:48:40,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:48:40,071 INFO L87 Difference]: Start difference. First operand 434 states and 627 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:40,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:40,344 INFO L93 Difference]: Finished difference Result 903 states and 1314 transitions. [2022-04-07 00:48:40,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:48:40,344 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2022-04-07 00:48:40,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:40,348 INFO L225 Difference]: With dead ends: 903 [2022-04-07 00:48:40,348 INFO L226 Difference]: Without dead ends: 482 [2022-04-07 00:48:40,349 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-07 00:48:40,351 INFO L913 BasicCegarLoop]: 186 mSDtfsCounter, 185 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:48:40,351 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 193 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 00:48:40,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-04-07 00:48:40,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 476. [2022-04-07 00:48:40,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 471 states have (on average 1.4331210191082802) internal successors, (675), 471 states have internal predecessors, (675), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:40,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 679 transitions. [2022-04-07 00:48:40,406 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 679 transitions. Word has length 78 [2022-04-07 00:48:40,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:40,407 INFO L478 AbstractCegarLoop]: Abstraction has 476 states and 679 transitions. [2022-04-07 00:48:40,407 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:40,407 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 679 transitions. [2022-04-07 00:48:40,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-07 00:48:40,409 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:40,409 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] [2022-04-07 00:48:40,409 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-07 00:48:40,409 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:40,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:40,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1894097131, now seen corresponding path program 1 times [2022-04-07 00:48:40,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:40,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1398355693] [2022-04-07 00:48:40,414 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:40,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1894097131, now seen corresponding path program 2 times [2022-04-07 00:48:40,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:40,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681450996] [2022-04-07 00:48:40,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:40,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:40,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:40,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:40,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:40,533 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-07 00:48:40,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:40,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681450996] [2022-04-07 00:48:40,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681450996] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:40,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:40,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:40,534 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:40,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1398355693] [2022-04-07 00:48:40,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1398355693] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:40,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:40,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:40,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810810030] [2022-04-07 00:48:40,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:40,535 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:48:40,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:40,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:48:40,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:48:40,536 INFO L87 Difference]: Start difference. First operand 476 states and 679 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:40,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:40,966 INFO L93 Difference]: Finished difference Result 956 states and 1369 transitions. [2022-04-07 00:48:40,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:48:40,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-04-07 00:48:40,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:40,983 INFO L225 Difference]: With dead ends: 956 [2022-04-07 00:48:40,986 INFO L226 Difference]: Without dead ends: 714 [2022-04-07 00:48:40,987 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-07 00:48:40,988 INFO L913 BasicCegarLoop]: 317 mSDtfsCounter, 287 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 00:48:40,988 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [287 Valid, 324 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 00:48:40,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2022-04-07 00:48:41,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 714. [2022-04-07 00:48:41,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 709 states have (on average 1.4287729196050776) internal successors, (1013), 709 states have internal predecessors, (1013), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:41,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 1017 transitions. [2022-04-07 00:48:41,049 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 1017 transitions. Word has length 98 [2022-04-07 00:48:41,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:41,049 INFO L478 AbstractCegarLoop]: Abstraction has 714 states and 1017 transitions. [2022-04-07 00:48:41,050 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:41,050 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1017 transitions. [2022-04-07 00:48:41,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-07 00:48:41,056 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:41,056 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] [2022-04-07 00:48:41,056 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-07 00:48:41,056 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:41,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:41,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1721597911, now seen corresponding path program 1 times [2022-04-07 00:48:41,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:41,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1915139007] [2022-04-07 00:48:41,059 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:41,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1721597911, now seen corresponding path program 2 times [2022-04-07 00:48:41,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:41,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623460217] [2022-04-07 00:48:41,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:41,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:41,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:41,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:41,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:41,119 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-07 00:48:41,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:41,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623460217] [2022-04-07 00:48:41,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623460217] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:41,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:41,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:41,120 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:41,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1915139007] [2022-04-07 00:48:41,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1915139007] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:41,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:41,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:41,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622240376] [2022-04-07 00:48:41,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:41,121 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:48:41,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:41,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:48:41,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:48:41,122 INFO L87 Difference]: Start difference. First operand 714 states and 1017 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:41,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:41,444 INFO L93 Difference]: Finished difference Result 1215 states and 1730 transitions. [2022-04-07 00:48:41,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:48:41,458 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-04-07 00:48:41,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:41,462 INFO L225 Difference]: With dead ends: 1215 [2022-04-07 00:48:41,462 INFO L226 Difference]: Without dead ends: 735 [2022-04-07 00:48:41,464 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-07 00:48:41,465 INFO L913 BasicCegarLoop]: 197 mSDtfsCounter, 183 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 00:48:41,465 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 204 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 00:48:41,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2022-04-07 00:48:41,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 735. [2022-04-07 00:48:41,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 730 states have (on average 1.4246575342465753) internal successors, (1040), 730 states have internal predecessors, (1040), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:41,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1044 transitions. [2022-04-07 00:48:41,589 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1044 transitions. Word has length 98 [2022-04-07 00:48:41,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:41,590 INFO L478 AbstractCegarLoop]: Abstraction has 735 states and 1044 transitions. [2022-04-07 00:48:41,590 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:41,590 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1044 transitions. [2022-04-07 00:48:41,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-07 00:48:41,592 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:41,592 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, 1] [2022-04-07 00:48:41,592 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-07 00:48:41,592 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:41,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:41,593 INFO L85 PathProgramCache]: Analyzing trace with hash -255266854, now seen corresponding path program 1 times [2022-04-07 00:48:41,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:41,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [254747251] [2022-04-07 00:48:41,607 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:41,607 INFO L85 PathProgramCache]: Analyzing trace with hash -255266854, now seen corresponding path program 2 times [2022-04-07 00:48:41,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:41,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741318017] [2022-04-07 00:48:41,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:41,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:41,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:41,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:41,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:41,666 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-07 00:48:41,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:41,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741318017] [2022-04-07 00:48:41,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741318017] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:41,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:41,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:41,667 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:41,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [254747251] [2022-04-07 00:48:41,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [254747251] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:41,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:41,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:41,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463531312] [2022-04-07 00:48:41,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:41,669 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:48:41,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:41,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:48:41,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:48:41,670 INFO L87 Difference]: Start difference. First operand 735 states and 1044 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-07 00:48:41,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:41,957 INFO L93 Difference]: Finished difference Result 1261 states and 1787 transitions. [2022-04-07 00:48:41,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:48:41,976 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 100 [2022-04-07 00:48:41,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:41,980 INFO L225 Difference]: With dead ends: 1261 [2022-04-07 00:48:41,980 INFO L226 Difference]: Without dead ends: 760 [2022-04-07 00:48:41,983 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-07 00:48:41,984 INFO L913 BasicCegarLoop]: 203 mSDtfsCounter, 179 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:48:41,984 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 210 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 00:48:41,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2022-04-07 00:48:42,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 760. [2022-04-07 00:48:42,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 755 states have (on average 1.4172185430463575) internal successors, (1070), 755 states have internal predecessors, (1070), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:42,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1074 transitions. [2022-04-07 00:48:42,038 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1074 transitions. Word has length 100 [2022-04-07 00:48:42,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:42,038 INFO L478 AbstractCegarLoop]: Abstraction has 760 states and 1074 transitions. [2022-04-07 00:48:42,038 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-07 00:48:42,039 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1074 transitions. [2022-04-07 00:48:42,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-07 00:48:42,040 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:42,040 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, 1] [2022-04-07 00:48:42,040 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-07 00:48:42,041 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:42,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:42,041 INFO L85 PathProgramCache]: Analyzing trace with hash -121253348, now seen corresponding path program 1 times [2022-04-07 00:48:42,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:42,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [847077425] [2022-04-07 00:48:42,042 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:42,042 INFO L85 PathProgramCache]: Analyzing trace with hash -121253348, now seen corresponding path program 2 times [2022-04-07 00:48:42,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:42,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160253049] [2022-04-07 00:48:42,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:42,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:42,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:42,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:42,132 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-07 00:48:42,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:42,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160253049] [2022-04-07 00:48:42,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160253049] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:42,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:42,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:42,133 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:42,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [847077425] [2022-04-07 00:48:42,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [847077425] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:42,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:42,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:42,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258552909] [2022-04-07 00:48:42,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:42,134 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:48:42,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:42,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:48:42,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:48:42,135 INFO L87 Difference]: Start difference. First operand 760 states and 1074 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-07 00:48:42,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:42,398 INFO L93 Difference]: Finished difference Result 1002 states and 1421 transitions. [2022-04-07 00:48:42,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:48:42,399 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 100 [2022-04-07 00:48:42,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:42,403 INFO L225 Difference]: With dead ends: 1002 [2022-04-07 00:48:42,403 INFO L226 Difference]: Without dead ends: 1000 [2022-04-07 00:48:42,403 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-07 00:48:42,404 INFO L913 BasicCegarLoop]: 164 mSDtfsCounter, 459 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:48:42,404 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [459 Valid, 171 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 00:48:42,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2022-04-07 00:48:42,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 1000. [2022-04-07 00:48:42,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 995 states have (on average 1.4221105527638191) internal successors, (1415), 995 states have internal predecessors, (1415), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:42,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1419 transitions. [2022-04-07 00:48:42,532 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1419 transitions. Word has length 100 [2022-04-07 00:48:42,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:42,533 INFO L478 AbstractCegarLoop]: Abstraction has 1000 states and 1419 transitions. [2022-04-07 00:48:42,533 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-07 00:48:42,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1419 transitions. [2022-04-07 00:48:42,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-04-07 00:48:42,551 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:42,552 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:48:42,552 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-07 00:48:42,552 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:42,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:42,552 INFO L85 PathProgramCache]: Analyzing trace with hash -976830099, now seen corresponding path program 1 times [2022-04-07 00:48:42,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:42,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2013061352] [2022-04-07 00:48:42,553 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:42,554 INFO L85 PathProgramCache]: Analyzing trace with hash -976830099, now seen corresponding path program 2 times [2022-04-07 00:48:42,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:42,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456520345] [2022-04-07 00:48:42,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:42,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:42,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:42,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:42,637 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-07 00:48:42,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:42,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456520345] [2022-04-07 00:48:42,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456520345] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:42,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:42,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:42,638 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:42,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2013061352] [2022-04-07 00:48:42,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2013061352] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:42,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:42,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:42,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230829733] [2022-04-07 00:48:42,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:42,639 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:48:42,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:42,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:48:42,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:48:42,640 INFO L87 Difference]: Start difference. First operand 1000 states and 1419 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:42,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:42,989 INFO L93 Difference]: Finished difference Result 2191 states and 3161 transitions. [2022-04-07 00:48:42,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:48:42,989 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 140 [2022-04-07 00:48:42,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:42,995 INFO L225 Difference]: With dead ends: 2191 [2022-04-07 00:48:42,995 INFO L226 Difference]: Without dead ends: 1196 [2022-04-07 00:48:42,997 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-07 00:48:42,998 INFO L913 BasicCegarLoop]: 197 mSDtfsCounter, 234 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:48:42,998 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 204 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 00:48:42,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2022-04-07 00:48:43,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 1156. [2022-04-07 00:48:43,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1151 states have (on average 1.4378801042571676) internal successors, (1655), 1151 states have internal predecessors, (1655), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:43,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1659 transitions. [2022-04-07 00:48:43,155 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1659 transitions. Word has length 140 [2022-04-07 00:48:43,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:43,155 INFO L478 AbstractCegarLoop]: Abstraction has 1156 states and 1659 transitions. [2022-04-07 00:48:43,156 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:43,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1659 transitions. [2022-04-07 00:48:43,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-04-07 00:48:43,174 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:43,174 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:48:43,174 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-07 00:48:43,175 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:43,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:43,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1075054782, now seen corresponding path program 1 times [2022-04-07 00:48:43,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:43,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [323190857] [2022-04-07 00:48:43,177 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:43,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1075054782, now seen corresponding path program 2 times [2022-04-07 00:48:43,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:43,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913763105] [2022-04-07 00:48:43,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:43,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:43,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:43,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:43,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:43,280 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-04-07 00:48:43,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:43,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913763105] [2022-04-07 00:48:43,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913763105] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:43,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:43,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:43,281 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:43,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [323190857] [2022-04-07 00:48:43,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [323190857] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:43,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:43,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:43,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614915274] [2022-04-07 00:48:43,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:43,282 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:48:43,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:43,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:48:43,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:48:43,283 INFO L87 Difference]: Start difference. First operand 1156 states and 1659 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:43,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:43,704 INFO L93 Difference]: Finished difference Result 2405 states and 3431 transitions. [2022-04-07 00:48:43,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:48:43,705 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (3), 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 176 [2022-04-07 00:48:43,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:43,710 INFO L225 Difference]: With dead ends: 2405 [2022-04-07 00:48:43,710 INFO L226 Difference]: Without dead ends: 1262 [2022-04-07 00:48:43,729 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-07 00:48:43,730 INFO L913 BasicCegarLoop]: 186 mSDtfsCounter, 187 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 00:48:43,731 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 193 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 00:48:43,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2022-04-07 00:48:43,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 1248. [2022-04-07 00:48:43,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1248 states, 1243 states have (on average 1.421560740144811) internal successors, (1767), 1243 states have internal predecessors, (1767), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:43,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 1771 transitions. [2022-04-07 00:48:43,916 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 1771 transitions. Word has length 176 [2022-04-07 00:48:43,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:43,917 INFO L478 AbstractCegarLoop]: Abstraction has 1248 states and 1771 transitions. [2022-04-07 00:48:43,917 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:43,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1771 transitions. [2022-04-07 00:48:43,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-04-07 00:48:43,920 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:43,922 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:48:43,922 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-07 00:48:43,923 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:43,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:43,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1144207012, now seen corresponding path program 1 times [2022-04-07 00:48:43,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:43,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [697664497] [2022-04-07 00:48:43,926 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:43,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1144207012, now seen corresponding path program 2 times [2022-04-07 00:48:43,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:43,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101824164] [2022-04-07 00:48:43,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:43,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:43,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:43,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:43,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:43,995 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2022-04-07 00:48:43,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:43,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101824164] [2022-04-07 00:48:43,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101824164] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:43,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:43,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:43,996 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:43,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [697664497] [2022-04-07 00:48:43,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [697664497] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:43,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:43,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:43,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802400397] [2022-04-07 00:48:43,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:43,996 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:48:43,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:43,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:48:43,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:48:43,997 INFO L87 Difference]: Start difference. First operand 1248 states and 1771 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:44,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:44,450 INFO L93 Difference]: Finished difference Result 2595 states and 3673 transitions. [2022-04-07 00:48:44,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:48:44,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 1 states have call successors, (3), 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 197 [2022-04-07 00:48:44,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:44,457 INFO L225 Difference]: With dead ends: 2595 [2022-04-07 00:48:44,457 INFO L226 Difference]: Without dead ends: 1360 [2022-04-07 00:48:44,460 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-07 00:48:44,461 INFO L913 BasicCegarLoop]: 186 mSDtfsCounter, 184 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-07 00:48:44,462 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 193 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-07 00:48:44,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2022-04-07 00:48:44,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 1348. [2022-04-07 00:48:44,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 1343 states have (on average 1.4050632911392404) internal successors, (1887), 1343 states have internal predecessors, (1887), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:44,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1891 transitions. [2022-04-07 00:48:44,585 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1891 transitions. Word has length 197 [2022-04-07 00:48:44,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:44,585 INFO L478 AbstractCegarLoop]: Abstraction has 1348 states and 1891 transitions. [2022-04-07 00:48:44,586 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:44,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1891 transitions. [2022-04-07 00:48:44,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-04-07 00:48:44,590 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:44,590 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 6, 6, 4, 4, 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-07 00:48:44,590 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-07 00:48:44,590 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:44,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:44,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1731794615, now seen corresponding path program 1 times [2022-04-07 00:48:44,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:44,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [695257513] [2022-04-07 00:48:44,593 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:44,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1731794615, now seen corresponding path program 2 times [2022-04-07 00:48:44,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:44,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896072385] [2022-04-07 00:48:44,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:44,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:44,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:44,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:44,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:44,667 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 391 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-07 00:48:44,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:44,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896072385] [2022-04-07 00:48:44,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896072385] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:44,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:44,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:44,668 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:44,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [695257513] [2022-04-07 00:48:44,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [695257513] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:44,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:44,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:44,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837131068] [2022-04-07 00:48:44,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:44,669 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:48:44,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:44,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:48:44,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:48:44,670 INFO L87 Difference]: Start difference. First operand 1348 states and 1891 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-07 00:48:45,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:45,134 INFO L93 Difference]: Finished difference Result 2803 states and 3925 transitions. [2022-04-07 00:48:45,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:48:45,148 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 221 [2022-04-07 00:48:45,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:45,154 INFO L225 Difference]: With dead ends: 2803 [2022-04-07 00:48:45,154 INFO L226 Difference]: Without dead ends: 1468 [2022-04-07 00:48:45,157 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-07 00:48:45,158 INFO L913 BasicCegarLoop]: 186 mSDtfsCounter, 182 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 00:48:45,158 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 193 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 00:48:45,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2022-04-07 00:48:45,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1460. [2022-04-07 00:48:45,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1460 states, 1455 states have (on average 1.3876288659793814) internal successors, (2019), 1455 states have internal predecessors, (2019), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:45,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 2023 transitions. [2022-04-07 00:48:45,383 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 2023 transitions. Word has length 221 [2022-04-07 00:48:45,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:45,384 INFO L478 AbstractCegarLoop]: Abstraction has 1460 states and 2023 transitions. [2022-04-07 00:48:45,384 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-07 00:48:45,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 2023 transitions. [2022-04-07 00:48:45,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-04-07 00:48:45,388 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:45,389 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 6, 6, 4, 4, 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-07 00:48:45,389 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-07 00:48:45,389 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:45,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:45,389 INFO L85 PathProgramCache]: Analyzing trace with hash -700753717, now seen corresponding path program 1 times [2022-04-07 00:48:45,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:45,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [328194606] [2022-04-07 00:48:45,404 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:45,405 INFO L85 PathProgramCache]: Analyzing trace with hash -700753717, now seen corresponding path program 2 times [2022-04-07 00:48:45,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:45,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849424130] [2022-04-07 00:48:45,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:45,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:45,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:45,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:45,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:45,529 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 391 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-07 00:48:45,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:45,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849424130] [2022-04-07 00:48:45,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849424130] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:45,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:45,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:45,541 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:45,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [328194606] [2022-04-07 00:48:45,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [328194606] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:45,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:45,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:45,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880984507] [2022-04-07 00:48:45,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:45,542 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:48:45,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:45,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:48:45,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:48:45,543 INFO L87 Difference]: Start difference. First operand 1460 states and 2023 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-07 00:48:46,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:46,126 INFO L93 Difference]: Finished difference Result 3043 states and 4225 transitions. [2022-04-07 00:48:46,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:48:46,126 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 221 [2022-04-07 00:48:46,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:46,133 INFO L225 Difference]: With dead ends: 3043 [2022-04-07 00:48:46,133 INFO L226 Difference]: Without dead ends: 1596 [2022-04-07 00:48:46,139 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-07 00:48:46,140 INFO L913 BasicCegarLoop]: 187 mSDtfsCounter, 184 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-07 00:48:46,140 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 194 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-07 00:48:46,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2022-04-07 00:48:46,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1584. [2022-04-07 00:48:46,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1584 states, 1579 states have (on average 1.3698543381887271) internal successors, (2163), 1579 states have internal predecessors, (2163), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:46,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2167 transitions. [2022-04-07 00:48:46,375 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2167 transitions. Word has length 221 [2022-04-07 00:48:46,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:46,376 INFO L478 AbstractCegarLoop]: Abstraction has 1584 states and 2167 transitions. [2022-04-07 00:48:46,376 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-07 00:48:46,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2167 transitions. [2022-04-07 00:48:46,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2022-04-07 00:48:46,403 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:46,403 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 7, 7, 5, 5, 3, 3, 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] [2022-04-07 00:48:46,404 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-07 00:48:46,404 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:46,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:46,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1663434775, now seen corresponding path program 1 times [2022-04-07 00:48:46,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:46,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1739015999] [2022-04-07 00:48:46,406 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:46,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1663434775, now seen corresponding path program 2 times [2022-04-07 00:48:46,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:46,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466868005] [2022-04-07 00:48:46,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:46,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:46,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:46,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:46,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:46,589 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 505 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2022-04-07 00:48:46,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:46,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466868005] [2022-04-07 00:48:46,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466868005] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:46,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:46,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:46,590 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:46,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1739015999] [2022-04-07 00:48:46,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1739015999] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:46,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:46,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:46,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972803221] [2022-04-07 00:48:46,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:46,591 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:48:46,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:46,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:48:46,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:48:46,592 INFO L87 Difference]: Start difference. First operand 1584 states and 2167 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:47,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:47,010 INFO L93 Difference]: Finished difference Result 4722 states and 6463 transitions. [2022-04-07 00:48:47,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:48:47,011 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (3), 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 251 [2022-04-07 00:48:47,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:47,022 INFO L225 Difference]: With dead ends: 4722 [2022-04-07 00:48:47,023 INFO L226 Difference]: Without dead ends: 3151 [2022-04-07 00:48:47,026 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-07 00:48:47,027 INFO L913 BasicCegarLoop]: 326 mSDtfsCounter, 299 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:48:47,027 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [299 Valid, 333 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 00:48:47,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3151 states. [2022-04-07 00:48:47,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3151 to 3149. [2022-04-07 00:48:47,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3149 states, 3144 states have (on average 1.3689567430025444) internal successors, (4304), 3144 states have internal predecessors, (4304), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:47,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3149 states to 3149 states and 4308 transitions. [2022-04-07 00:48:47,285 INFO L78 Accepts]: Start accepts. Automaton has 3149 states and 4308 transitions. Word has length 251 [2022-04-07 00:48:47,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:47,286 INFO L478 AbstractCegarLoop]: Abstraction has 3149 states and 4308 transitions. [2022-04-07 00:48:47,286 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:47,286 INFO L276 IsEmpty]: Start isEmpty. Operand 3149 states and 4308 transitions. [2022-04-07 00:48:47,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2022-04-07 00:48:47,310 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:47,311 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 7, 7, 5, 5, 3, 3, 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] [2022-04-07 00:48:47,311 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-07 00:48:47,311 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:47,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:47,312 INFO L85 PathProgramCache]: Analyzing trace with hash -632393877, now seen corresponding path program 1 times [2022-04-07 00:48:47,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:47,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [712825465] [2022-04-07 00:48:47,313 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:47,314 INFO L85 PathProgramCache]: Analyzing trace with hash -632393877, now seen corresponding path program 2 times [2022-04-07 00:48:47,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:47,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010548969] [2022-04-07 00:48:47,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:47,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:47,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:47,422 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 465 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-07 00:48:47,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:47,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010548969] [2022-04-07 00:48:47,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010548969] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:47,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:47,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:47,423 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:47,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [712825465] [2022-04-07 00:48:47,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [712825465] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:47,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:47,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:47,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467428797] [2022-04-07 00:48:47,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:47,424 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:48:47,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:47,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:48:47,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:48:47,425 INFO L87 Difference]: Start difference. First operand 3149 states and 4308 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:48,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:48,037 INFO L93 Difference]: Finished difference Result 6585 states and 9043 transitions. [2022-04-07 00:48:48,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:48:48,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 1 states have call successors, (3), 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 251 [2022-04-07 00:48:48,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:48,109 INFO L225 Difference]: With dead ends: 6585 [2022-04-07 00:48:48,110 INFO L226 Difference]: Without dead ends: 3449 [2022-04-07 00:48:48,116 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-07 00:48:48,118 INFO L913 BasicCegarLoop]: 187 mSDtfsCounter, 183 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 00:48:48,118 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 194 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 00:48:48,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3449 states. [2022-04-07 00:48:48,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3449 to 3433. [2022-04-07 00:48:48,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3433 states, 3428 states have (on average 1.3500583430571762) internal successors, (4628), 3428 states have internal predecessors, (4628), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:48,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3433 states to 3433 states and 4632 transitions. [2022-04-07 00:48:48,610 INFO L78 Accepts]: Start accepts. Automaton has 3433 states and 4632 transitions. Word has length 251 [2022-04-07 00:48:48,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:48,610 INFO L478 AbstractCegarLoop]: Abstraction has 3433 states and 4632 transitions. [2022-04-07 00:48:48,611 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:48,611 INFO L276 IsEmpty]: Start isEmpty. Operand 3433 states and 4632 transitions. [2022-04-07 00:48:48,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2022-04-07 00:48:48,619 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:48,619 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:48:48,620 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-07 00:48:48,620 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:48,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:48,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1599534867, now seen corresponding path program 1 times [2022-04-07 00:48:48,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:48,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [905949648] [2022-04-07 00:48:48,636 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:48,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1599534867, now seen corresponding path program 2 times [2022-04-07 00:48:48,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:48,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259523490] [2022-04-07 00:48:48,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:48,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:48,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:48,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:48,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:48,746 INFO L134 CoverageAnalysis]: Checked inductivity of 957 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2022-04-07 00:48:48,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:48,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259523490] [2022-04-07 00:48:48,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259523490] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:48,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:48,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:48,747 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:48,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [905949648] [2022-04-07 00:48:48,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [905949648] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:48,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:48,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:48,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578596939] [2022-04-07 00:48:48,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:48,748 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:48:48,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:48,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:48:48,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:48:48,749 INFO L87 Difference]: Start difference. First operand 3433 states and 4632 transitions. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:49,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:49,356 INFO L93 Difference]: Finished difference Result 7001 states and 9459 transitions. [2022-04-07 00:48:49,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:48:49,357 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 1 states have call successors, (3), 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 275 [2022-04-07 00:48:49,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:49,372 INFO L225 Difference]: With dead ends: 7001 [2022-04-07 00:48:49,373 INFO L226 Difference]: Without dead ends: 3581 [2022-04-07 00:48:49,385 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-07 00:48:49,386 INFO L913 BasicCegarLoop]: 186 mSDtfsCounter, 182 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 00:48:49,386 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 193 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 00:48:49,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3581 states. [2022-04-07 00:48:49,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3581 to 3565. [2022-04-07 00:48:49,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3565 states, 3560 states have (on average 1.3426966292134832) internal successors, (4780), 3560 states have internal predecessors, (4780), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:49,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3565 states to 3565 states and 4784 transitions. [2022-04-07 00:48:49,717 INFO L78 Accepts]: Start accepts. Automaton has 3565 states and 4784 transitions. Word has length 275 [2022-04-07 00:48:49,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:49,718 INFO L478 AbstractCegarLoop]: Abstraction has 3565 states and 4784 transitions. [2022-04-07 00:48:49,718 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:49,718 INFO L276 IsEmpty]: Start isEmpty. Operand 3565 states and 4784 transitions. [2022-04-07 00:48:49,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2022-04-07 00:48:49,727 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:49,727 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:48:49,727 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-07 00:48:49,727 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:49,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:49,728 INFO L85 PathProgramCache]: Analyzing trace with hash -796448876, now seen corresponding path program 1 times [2022-04-07 00:48:49,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:49,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [532389134] [2022-04-07 00:48:49,729 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:49,730 INFO L85 PathProgramCache]: Analyzing trace with hash -796448876, now seen corresponding path program 2 times [2022-04-07 00:48:49,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:49,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598756417] [2022-04-07 00:48:49,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:49,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:49,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:49,864 INFO L134 CoverageAnalysis]: Checked inductivity of 969 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2022-04-07 00:48:49,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:49,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598756417] [2022-04-07 00:48:49,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598756417] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:49,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:49,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:49,874 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:49,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [532389134] [2022-04-07 00:48:49,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [532389134] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:49,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:49,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:49,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486363] [2022-04-07 00:48:49,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:49,875 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:48:49,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:49,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:48:49,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:48:49,876 INFO L87 Difference]: Start difference. First operand 3565 states and 4784 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:50,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:50,723 INFO L93 Difference]: Finished difference Result 7517 states and 10223 transitions. [2022-04-07 00:48:50,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:48:50,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (3), 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 286 [2022-04-07 00:48:50,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:50,793 INFO L225 Difference]: With dead ends: 7517 [2022-04-07 00:48:50,793 INFO L226 Difference]: Without dead ends: 3965 [2022-04-07 00:48:50,804 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-07 00:48:50,805 INFO L913 BasicCegarLoop]: 187 mSDtfsCounter, 228 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 00:48:50,805 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [228 Valid, 194 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 00:48:50,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3965 states. [2022-04-07 00:48:51,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3965 to 3877. [2022-04-07 00:48:51,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3877 states, 3872 states have (on average 1.3295454545454546) internal successors, (5148), 3872 states have internal predecessors, (5148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:51,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3877 states to 3877 states and 5152 transitions. [2022-04-07 00:48:51,326 INFO L78 Accepts]: Start accepts. Automaton has 3877 states and 5152 transitions. Word has length 286 [2022-04-07 00:48:51,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:51,327 INFO L478 AbstractCegarLoop]: Abstraction has 3877 states and 5152 transitions. [2022-04-07 00:48:51,327 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:51,327 INFO L276 IsEmpty]: Start isEmpty. Operand 3877 states and 5152 transitions. [2022-04-07 00:48:51,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2022-04-07 00:48:51,336 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:51,337 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:48:51,337 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-07 00:48:51,338 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:51,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:51,338 INFO L85 PathProgramCache]: Analyzing trace with hash 151847702, now seen corresponding path program 1 times [2022-04-07 00:48:51,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:51,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1572774384] [2022-04-07 00:48:51,340 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:51,340 INFO L85 PathProgramCache]: Analyzing trace with hash 151847702, now seen corresponding path program 2 times [2022-04-07 00:48:51,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:51,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874398420] [2022-04-07 00:48:51,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:51,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:51,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:51,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:51,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1051 backedges. 481 proven. 0 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2022-04-07 00:48:51,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:51,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874398420] [2022-04-07 00:48:51,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874398420] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:51,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:51,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:51,401 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:51,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1572774384] [2022-04-07 00:48:51,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1572774384] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:51,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:51,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:51,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627466261] [2022-04-07 00:48:51,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:51,403 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:48:51,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:51,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:48:51,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:48:51,403 INFO L87 Difference]: Start difference. First operand 3877 states and 5152 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:51,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:51,938 INFO L93 Difference]: Finished difference Result 8149 states and 10767 transitions. [2022-04-07 00:48:51,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:48:51,940 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (3), 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 300 [2022-04-07 00:48:51,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:51,955 INFO L225 Difference]: With dead ends: 8149 [2022-04-07 00:48:51,955 INFO L226 Difference]: Without dead ends: 4285 [2022-04-07 00:48:51,966 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-07 00:48:51,967 INFO L913 BasicCegarLoop]: 185 mSDtfsCounter, 279 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 192 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.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:48:51,967 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 192 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 00:48:51,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4285 states. [2022-04-07 00:48:52,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4285 to 3997. [2022-04-07 00:48:52,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3997 states, 3992 states have (on average 1.3256513026052104) internal successors, (5292), 3992 states have internal predecessors, (5292), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:52,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3997 states to 3997 states and 5296 transitions. [2022-04-07 00:48:52,406 INFO L78 Accepts]: Start accepts. Automaton has 3997 states and 5296 transitions. Word has length 300 [2022-04-07 00:48:52,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:52,420 INFO L478 AbstractCegarLoop]: Abstraction has 3997 states and 5296 transitions. [2022-04-07 00:48:52,420 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:52,420 INFO L276 IsEmpty]: Start isEmpty. Operand 3997 states and 5296 transitions. [2022-04-07 00:48:52,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2022-04-07 00:48:52,427 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:52,428 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:48:52,428 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-07 00:48:52,428 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:52,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:52,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1047250296, now seen corresponding path program 1 times [2022-04-07 00:48:52,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:52,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [253043111] [2022-04-07 00:48:52,430 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:52,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1047250296, now seen corresponding path program 2 times [2022-04-07 00:48:52,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:52,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997682291] [2022-04-07 00:48:52,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:52,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:52,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:52,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:52,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:52,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1051 backedges. 600 proven. 0 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2022-04-07 00:48:52,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:52,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997682291] [2022-04-07 00:48:52,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997682291] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:52,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:52,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:52,600 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:52,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [253043111] [2022-04-07 00:48:52,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [253043111] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:52,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:52,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:52,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785414076] [2022-04-07 00:48:52,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:52,601 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:48:52,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:52,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:48:52,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:48:52,602 INFO L87 Difference]: Start difference. First operand 3997 states and 5296 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:53,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:53,417 INFO L93 Difference]: Finished difference Result 11461 states and 15262 transitions. [2022-04-07 00:48:53,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:48:53,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 1 states have call successors, (3), 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 301 [2022-04-07 00:48:53,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:53,438 INFO L225 Difference]: With dead ends: 11461 [2022-04-07 00:48:53,439 INFO L226 Difference]: Without dead ends: 7477 [2022-04-07 00:48:53,453 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-07 00:48:53,455 INFO L913 BasicCegarLoop]: 318 mSDtfsCounter, 260 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:48:53,456 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [260 Valid, 325 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 00:48:53,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7477 states. [2022-04-07 00:48:54,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7477 to 7475. [2022-04-07 00:48:54,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7475 states, 7470 states have (on average 1.3325301204819278) internal successors, (9954), 7470 states have internal predecessors, (9954), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:54,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7475 states to 7475 states and 9958 transitions. [2022-04-07 00:48:54,640 INFO L78 Accepts]: Start accepts. Automaton has 7475 states and 9958 transitions. Word has length 301 [2022-04-07 00:48:54,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:54,641 INFO L478 AbstractCegarLoop]: Abstraction has 7475 states and 9958 transitions. [2022-04-07 00:48:54,641 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:54,641 INFO L276 IsEmpty]: Start isEmpty. Operand 7475 states and 9958 transitions. [2022-04-07 00:48:54,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2022-04-07 00:48:54,674 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:54,674 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:48:54,674 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-07 00:48:54,675 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:54,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:54,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1156256593, now seen corresponding path program 1 times [2022-04-07 00:48:54,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:54,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1479788725] [2022-04-07 00:48:54,693 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:54,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1156256593, now seen corresponding path program 2 times [2022-04-07 00:48:54,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:54,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158308260] [2022-04-07 00:48:54,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:54,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:54,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:54,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:54,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1051 backedges. 604 proven. 0 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2022-04-07 00:48:54,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:54,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158308260] [2022-04-07 00:48:54,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158308260] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:54,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:54,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:54,813 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:54,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1479788725] [2022-04-07 00:48:54,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1479788725] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:54,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:54,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:54,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357956922] [2022-04-07 00:48:54,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:54,814 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:48:54,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:54,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:48:54,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:48:54,815 INFO L87 Difference]: Start difference. First operand 7475 states and 9958 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:55,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:55,685 INFO L93 Difference]: Finished difference Result 14945 states and 19891 transitions. [2022-04-07 00:48:55,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:48:55,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (3), 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 302 [2022-04-07 00:48:55,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:55,708 INFO L225 Difference]: With dead ends: 14945 [2022-04-07 00:48:55,708 INFO L226 Difference]: Without dead ends: 7483 [2022-04-07 00:48:55,728 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-07 00:48:55,729 INFO L913 BasicCegarLoop]: 186 mSDtfsCounter, 182 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 00:48:55,729 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 193 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 00:48:55,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7483 states. [2022-04-07 00:48:56,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7483 to 7451. [2022-04-07 00:48:56,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7451 states, 7446 states have (on average 1.2992210582863282) internal successors, (9674), 7446 states have internal predecessors, (9674), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:56,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7451 states to 7451 states and 9678 transitions. [2022-04-07 00:48:56,641 INFO L78 Accepts]: Start accepts. Automaton has 7451 states and 9678 transitions. Word has length 302 [2022-04-07 00:48:56,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:56,642 INFO L478 AbstractCegarLoop]: Abstraction has 7451 states and 9678 transitions. [2022-04-07 00:48:56,642 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:56,642 INFO L276 IsEmpty]: Start isEmpty. Operand 7451 states and 9678 transitions. [2022-04-07 00:48:56,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2022-04-07 00:48:56,663 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:56,664 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:48:56,664 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-07 00:48:56,664 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:56,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:56,664 INFO L85 PathProgramCache]: Analyzing trace with hash 503831525, now seen corresponding path program 1 times [2022-04-07 00:48:56,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:56,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [317965993] [2022-04-07 00:48:56,675 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:56,676 INFO L85 PathProgramCache]: Analyzing trace with hash 503831525, now seen corresponding path program 2 times [2022-04-07 00:48:56,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:56,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648645044] [2022-04-07 00:48:56,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:56,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:56,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:56,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:56,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 637 proven. 14 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2022-04-07 00:48:56,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:56,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648645044] [2022-04-07 00:48:56,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648645044] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 00:48:56,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729955376] [2022-04-07 00:48:56,797 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 00:48:56,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 00:48:56,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 00:48:56,799 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-07 00:48:56,802 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-07 00:48:57,000 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 00:48:57,000 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 00:48:57,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-07 00:48:57,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 00:48:57,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 1097 trivial. 0 not checked. [2022-04-07 00:48:57,832 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 00:48:57,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729955376] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:57,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 00:48:57,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2022-04-07 00:48:57,835 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:57,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [317965993] [2022-04-07 00:48:57,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [317965993] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:57,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:57,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 00:48:57,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755628944] [2022-04-07 00:48:57,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:57,836 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 00:48:57,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:57,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 00:48:57,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-07 00:48:57,836 INFO L87 Difference]: Start difference. First operand 7451 states and 9678 transitions. Second operand has 5 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:58,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:58,803 INFO L93 Difference]: Finished difference Result 15067 states and 19580 transitions. [2022-04-07 00:48:58,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 00:48:58,804 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (3), 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 325 [2022-04-07 00:48:58,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:58,852 INFO L225 Difference]: With dead ends: 15067 [2022-04-07 00:48:58,852 INFO L226 Difference]: Without dead ends: 7601 [2022-04-07 00:48:58,916 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-07 00:48:58,918 INFO L913 BasicCegarLoop]: 150 mSDtfsCounter, 249 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:48:58,918 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 382 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 00:48:58,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7601 states. [2022-04-07 00:48:59,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7601 to 7457. [2022-04-07 00:48:59,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7457 states, 7452 states have (on average 1.299248523886205) internal successors, (9682), 7452 states have internal predecessors, (9682), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:59,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7457 states to 7457 states and 9686 transitions. [2022-04-07 00:48:59,735 INFO L78 Accepts]: Start accepts. Automaton has 7457 states and 9686 transitions. Word has length 325 [2022-04-07 00:48:59,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:59,736 INFO L478 AbstractCegarLoop]: Abstraction has 7457 states and 9686 transitions. [2022-04-07 00:48:59,736 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:59,736 INFO L276 IsEmpty]: Start isEmpty. Operand 7457 states and 9686 transitions. [2022-04-07 00:48:59,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2022-04-07 00:48:59,748 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:59,749 INFO L499 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:48:59,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-07 00:48:59,970 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,SelfDestructingSolverStorable22 [2022-04-07 00:48:59,970 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:59,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:59,971 INFO L85 PathProgramCache]: Analyzing trace with hash 629515054, now seen corresponding path program 1 times [2022-04-07 00:48:59,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:59,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1403043750] [2022-04-07 00:48:59,973 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:59,973 INFO L85 PathProgramCache]: Analyzing trace with hash 629515054, now seen corresponding path program 2 times [2022-04-07 00:48:59,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:59,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590571725] [2022-04-07 00:48:59,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:59,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:49:00,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:49:00,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:49:00,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:49:00,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 657 proven. 14 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2022-04-07 00:49:00,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:49:00,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590571725] [2022-04-07 00:49:00,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590571725] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 00:49:00,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834927128] [2022-04-07 00:49:00,073 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 00:49:00,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 00:49:00,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 00:49:00,075 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-07 00:49:00,076 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-07 00:49:00,270 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 00:49:00,271 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 00:49:00,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-07 00:49:00,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 00:49:00,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 657 proven. 14 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2022-04-07 00:49:00,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 00:49:01,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 657 proven. 14 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2022-04-07 00:49:01,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834927128] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 00:49:01,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 00:49:01,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-04-07 00:49:01,373 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:49:01,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1403043750] [2022-04-07 00:49:01,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1403043750] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:49:01,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:49:01,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 00:49:01,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559817412] [2022-04-07 00:49:01,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:49:01,376 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 00:49:01,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:49:01,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 00:49:01,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-07 00:49:01,377 INFO L87 Difference]: Start difference. First operand 7457 states and 9686 transitions. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 4 states have internal predecessors, (179), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:49:03,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:49:03,409 INFO L93 Difference]: Finished difference Result 14825 states and 19252 transitions. [2022-04-07 00:49:03,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 00:49:03,410 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 4 states have internal predecessors, (179), 1 states have call successors, (3), 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 338 [2022-04-07 00:49:03,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:49:03,489 INFO L225 Difference]: With dead ends: 14825 [2022-04-07 00:49:03,489 INFO L226 Difference]: Without dead ends: 11185 [2022-04-07 00:49:03,521 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 679 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-07 00:49:03,536 INFO L913 BasicCegarLoop]: 362 mSDtfsCounter, 332 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-07 00:49:03,536 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [332 Valid, 374 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-07 00:49:03,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11185 states. [2022-04-07 00:49:04,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11185 to 8561. [2022-04-07 00:49:04,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8561 states, 8556 states have (on average 1.3064516129032258) internal successors, (11178), 8556 states have internal predecessors, (11178), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:49:04,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8561 states to 8561 states and 11182 transitions. [2022-04-07 00:49:04,482 INFO L78 Accepts]: Start accepts. Automaton has 8561 states and 11182 transitions. Word has length 338 [2022-04-07 00:49:04,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:49:04,482 INFO L478 AbstractCegarLoop]: Abstraction has 8561 states and 11182 transitions. [2022-04-07 00:49:04,482 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 4 states have internal predecessors, (179), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:49:04,483 INFO L276 IsEmpty]: Start isEmpty. Operand 8561 states and 11182 transitions. [2022-04-07 00:49:04,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2022-04-07 00:49:04,495 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:49:04,495 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:49:04,523 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-07 00:49:04,715 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,SelfDestructingSolverStorable23 [2022-04-07 00:49:04,716 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:49:04,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:49:04,716 INFO L85 PathProgramCache]: Analyzing trace with hash -804487531, now seen corresponding path program 3 times [2022-04-07 00:49:04,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:49:04,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1519868974] [2022-04-07 00:49:04,717 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:49:04,718 INFO L85 PathProgramCache]: Analyzing trace with hash -804487531, now seen corresponding path program 4 times [2022-04-07 00:49:04,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:49:04,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134169268] [2022-04-07 00:49:04,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:49:04,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:49:04,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:49:04,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:49:04,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:49:04,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 714 proven. 5 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2022-04-07 00:49:04,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:49:04,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134169268] [2022-04-07 00:49:04,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134169268] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 00:49:04,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411509528] [2022-04-07 00:49:04,819 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-07 00:49:04,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 00:49:04,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 00:49:04,820 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-07 00:49:04,821 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-07 00:49:04,972 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-07 00:49:04,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 00:49:04,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 724 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-07 00:49:04,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 00:49:05,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 497 proven. 0 refuted. 0 times theorem prover too weak. 835 trivial. 0 not checked. [2022-04-07 00:49:05,629 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 00:49:05,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411509528] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:49:05,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 00:49:05,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-04-07 00:49:05,630 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:49:05,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1519868974] [2022-04-07 00:49:05,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1519868974] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:49:05,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:49:05,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 00:49:05,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123287255] [2022-04-07 00:49:05,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:49:05,632 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 00:49:05,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:49:05,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 00:49:05,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-07 00:49:05,636 INFO L87 Difference]: Start difference. First operand 8561 states and 11182 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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-07 00:49:06,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:49:06,459 INFO L93 Difference]: Finished difference Result 14704 states and 18910 transitions. [2022-04-07 00:49:06,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 00:49:06,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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 351 [2022-04-07 00:49:06,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:49:06,489 INFO L225 Difference]: With dead ends: 14704 [2022-04-07 00:49:06,490 INFO L226 Difference]: Without dead ends: 6162 [2022-04-07 00:49:06,548 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 352 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-07 00:49:06,549 INFO L913 BasicCegarLoop]: 171 mSDtfsCounter, 13 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 259 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-07 00:49:06,554 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 259 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 00:49:06,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6162 states. [2022-04-07 00:49:07,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6162 to 5972. [2022-04-07 00:49:07,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5972 states, 5967 states have (on average 1.2552371375900788) internal successors, (7490), 5967 states have internal predecessors, (7490), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:49:07,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5972 states to 5972 states and 7494 transitions. [2022-04-07 00:49:07,471 INFO L78 Accepts]: Start accepts. Automaton has 5972 states and 7494 transitions. Word has length 351 [2022-04-07 00:49:07,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:49:07,472 INFO L478 AbstractCegarLoop]: Abstraction has 5972 states and 7494 transitions. [2022-04-07 00:49:07,472 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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-07 00:49:07,472 INFO L276 IsEmpty]: Start isEmpty. Operand 5972 states and 7494 transitions. [2022-04-07 00:49:07,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2022-04-07 00:49:07,481 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:49:07,481 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, 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-07 00:49:07,508 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-07 00:49:07,695 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 00:49:07,695 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:49:07,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:49:07,696 INFO L85 PathProgramCache]: Analyzing trace with hash 627308297, now seen corresponding path program 1 times [2022-04-07 00:49:07,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:49:07,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1162686623] [2022-04-07 00:49:07,697 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:49:07,697 INFO L85 PathProgramCache]: Analyzing trace with hash 627308297, now seen corresponding path program 2 times [2022-04-07 00:49:07,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:49:07,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695651257] [2022-04-07 00:49:07,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:49:07,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:49:07,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:49:07,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:49:07,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:49:07,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 957 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-04-07 00:49:07,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:49:07,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695651257] [2022-04-07 00:49:07,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695651257] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 00:49:07,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236360005] [2022-04-07 00:49:07,851 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 00:49:07,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 00:49:07,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 00:49:07,852 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-07 00:49:07,854 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-07 00:49:08,058 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 00:49:08,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 00:49:08,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-07 00:49:08,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 00:49:08,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 957 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-04-07 00:49:08,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 00:49:09,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 957 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-04-07 00:49:09,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236360005] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 00:49:09,707 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 00:49:09,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-04-07 00:49:09,707 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:49:09,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1162686623] [2022-04-07 00:49:09,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1162686623] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:49:09,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:49:09,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 00:49:09,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705894060] [2022-04-07 00:49:09,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:49:09,709 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 00:49:09,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:49:09,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 00:49:09,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-07 00:49:09,710 INFO L87 Difference]: Start difference. First operand 5972 states and 7494 transitions. Second operand has 5 states, 5 states have (on average 38.0) internal successors, (190), 4 states have internal predecessors, (190), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:49:11,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:49:11,076 INFO L93 Difference]: Finished difference Result 12972 states and 16213 transitions. [2022-04-07 00:49:11,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 00:49:11,076 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 4 states have internal predecessors, (190), 1 states have call successors, (3), 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 382 [2022-04-07 00:49:11,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:49:11,095 INFO L225 Difference]: With dead ends: 12972 [2022-04-07 00:49:11,096 INFO L226 Difference]: Without dead ends: 7040 [2022-04-07 00:49:11,121 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 773 GetRequests, 766 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-07 00:49:11,124 INFO L913 BasicCegarLoop]: 216 mSDtfsCounter, 457 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-07 00:49:11,125 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [457 Valid, 228 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-07 00:49:11,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7040 states. [2022-04-07 00:49:12,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7040 to 6098. [2022-04-07 00:49:12,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6098 states, 6093 states have (on average 1.247497127851633) internal successors, (7601), 6093 states have internal predecessors, (7601), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:49:12,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6098 states to 6098 states and 7605 transitions. [2022-04-07 00:49:12,030 INFO L78 Accepts]: Start accepts. Automaton has 6098 states and 7605 transitions. Word has length 382 [2022-04-07 00:49:12,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:49:12,031 INFO L478 AbstractCegarLoop]: Abstraction has 6098 states and 7605 transitions. [2022-04-07 00:49:12,031 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 4 states have internal predecessors, (190), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:49:12,031 INFO L276 IsEmpty]: Start isEmpty. Operand 6098 states and 7605 transitions. [2022-04-07 00:49:12,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2022-04-07 00:49:12,039 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:49:12,040 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:49:12,072 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-07 00:49:12,263 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-07 00:49:12,263 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:49:12,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:49:12,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1284701442, now seen corresponding path program 1 times [2022-04-07 00:49:12,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:49:12,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [808755713] [2022-04-07 00:49:12,266 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:49:12,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1284701442, now seen corresponding path program 2 times [2022-04-07 00:49:12,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:49:12,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294301588] [2022-04-07 00:49:12,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:49:12,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:49:12,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:49:12,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:49:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:49:12,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1972 backedges. 887 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2022-04-07 00:49:12,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:49:12,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294301588] [2022-04-07 00:49:12,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294301588] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:49:12,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:49:12,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:49:12,468 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:49:12,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [808755713] [2022-04-07 00:49:12,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [808755713] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:49:12,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:49:12,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:49:12,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337243105] [2022-04-07 00:49:12,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:49:12,469 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:49:12,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:49:12,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:49:12,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:49:12,470 INFO L87 Difference]: Start difference. First operand 6098 states and 7605 transitions. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:49:13,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:49:13,139 INFO L93 Difference]: Finished difference Result 11742 states and 14397 transitions. [2022-04-07 00:49:13,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:49:13,140 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (3), 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 421 [2022-04-07 00:49:13,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:49:13,147 INFO L225 Difference]: With dead ends: 11742 [2022-04-07 00:49:13,147 INFO L226 Difference]: Without dead ends: 2973 [2022-04-07 00:49:13,162 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-07 00:49:13,163 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.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:49:13,165 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.2s Time] [2022-04-07 00:49:13,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2973 states. [2022-04-07 00:49:13,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2973 to 2807. [2022-04-07 00:49:13,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2807 states, 2802 states have (on average 1.2373304782298358) internal successors, (3467), 2802 states have internal predecessors, (3467), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:49:13,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2807 states to 2807 states and 3471 transitions. [2022-04-07 00:49:13,487 INFO L78 Accepts]: Start accepts. Automaton has 2807 states and 3471 transitions. Word has length 421 [2022-04-07 00:49:13,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:49:13,487 INFO L478 AbstractCegarLoop]: Abstraction has 2807 states and 3471 transitions. [2022-04-07 00:49:13,488 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:49:13,488 INFO L276 IsEmpty]: Start isEmpty. Operand 2807 states and 3471 transitions. [2022-04-07 00:49:13,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2022-04-07 00:49:13,493 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:49:13,493 INFO L499 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 16, 16, 15, 15, 13, 13, 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, 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-07 00:49:13,493 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-07 00:49:13,493 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:49:13,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:49:13,494 INFO L85 PathProgramCache]: Analyzing trace with hash -359683297, now seen corresponding path program 1 times [2022-04-07 00:49:13,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:49:13,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2034587789] [2022-04-07 00:49:13,512 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:49:13,513 INFO L85 PathProgramCache]: Analyzing trace with hash -359683297, now seen corresponding path program 2 times [2022-04-07 00:49:13,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:49:13,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819912253] [2022-04-07 00:49:13,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:49:13,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:49:13,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:49:13,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:49:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:49:13,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2503 backedges. 1481 proven. 14 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2022-04-07 00:49:13,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:49:13,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819912253] [2022-04-07 00:49:13,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819912253] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 00:49:13,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192742838] [2022-04-07 00:49:13,672 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 00:49:13,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 00:49:13,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 00:49:13,683 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-07 00:49:13,739 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-07 00:49:13,873 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 00:49:13,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 00:49:13,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 892 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-07 00:49:13,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 00:49:14,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2503 backedges. 1481 proven. 14 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2022-04-07 00:49:14,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 00:49:15,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2503 backedges. 1481 proven. 14 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2022-04-07 00:49:15,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192742838] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 00:49:15,480 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 00:49:15,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-04-07 00:49:15,481 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:49:15,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2034587789] [2022-04-07 00:49:15,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2034587789] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:49:15,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:49:15,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 00:49:15,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628558679] [2022-04-07 00:49:15,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:49:15,482 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 00:49:15,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:49:15,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 00:49:15,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-07 00:49:15,483 INFO L87 Difference]: Start difference. First operand 2807 states and 3471 transitions. Second operand has 5 states, 5 states have (on average 42.2) internal successors, (211), 4 states have internal predecessors, (211), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:49:15,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:49:15,801 INFO L93 Difference]: Finished difference Result 3042 states and 3766 transitions. [2022-04-07 00:49:15,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 00:49:15,802 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 42.2) internal successors, (211), 4 states have internal predecessors, (211), 1 states have call successors, (3), 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 488 [2022-04-07 00:49:15,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:49:15,803 INFO L225 Difference]: With dead ends: 3042 [2022-04-07 00:49:15,803 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 00:49:15,821 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 985 GetRequests, 976 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-07 00:49:15,826 INFO L913 BasicCegarLoop]: 166 mSDtfsCounter, 151 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-07 00:49:15,827 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-07 00:49:15,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 00:49:15,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 00:49:15,828 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-07 00:49:15,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 00:49:15,828 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 488 [2022-04-07 00:49:15,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:49:15,828 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 00:49:15,829 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.2) internal successors, (211), 4 states have internal predecessors, (211), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:49:15,829 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 00:49:15,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 00:49:15,834 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 00:49:15,864 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-07 00:49:16,055 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,SelfDestructingSolverStorable27 [2022-04-07 00:49:16,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-07 00:50:11,353 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 13) no Hoare annotation was computed. [2022-04-07 00:50:11,353 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 13) no Hoare annotation was computed. [2022-04-07 00:50:11,353 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 13) no Hoare annotation was computed. [2022-04-07 00:50:11,353 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 564 574) the Hoare annotation is: true [2022-04-07 00:50:11,353 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 564 574) the Hoare annotation is: true [2022-04-07 00:50:11,354 INFO L878 garLoopResultBuilder]: At program point L570(line 570) the Hoare annotation is: (<= 12292 main_~s~0) [2022-04-07 00:50:11,354 INFO L885 garLoopResultBuilder]: At program point L570-1(line 570) the Hoare annotation is: true [2022-04-07 00:50:11,354 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 564 574) the Hoare annotation is: true [2022-04-07 00:50:11,354 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-07 00:50:11,354 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-07 00:50:11,354 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-07 00:50:11,354 INFO L878 garLoopResultBuilder]: At program point L399(lines 399 403) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (= ssl3_connect_~s__state~0 4528))) (or (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 (= 2 ssl3_connect_~blastFlag~0)))) [2022-04-07 00:50:11,354 INFO L878 garLoopResultBuilder]: At program point L333(lines 87 562) the Hoare annotation is: (not (<= 12292 |ssl3_connect_#in~initial_state|)) [2022-04-07 00:50:11,354 INFO L878 garLoopResultBuilder]: At program point L399-2(lines 213 496) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (= ssl3_connect_~s__state~0 4528))) (or (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 (= 2 ssl3_connect_~blastFlag~0)))) [2022-04-07 00:50:11,355 INFO L878 garLoopResultBuilder]: At program point L234(lines 234 245) the Hoare annotation is: (or (= ssl3_connect_~blastFlag~0 0) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-04-07 00:50:11,355 INFO L878 garLoopResultBuilder]: At program point L234-2(lines 213 496) the Hoare annotation is: (or (= ssl3_connect_~blastFlag~0 0) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-04-07 00:50:11,356 INFO L878 garLoopResultBuilder]: At program point L532(lines 532 548) the Hoare annotation is: (let ((.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse14 (<= 4352 ssl3_connect_~s__state~0)) (.cse15 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse3 (= 3 ssl3_connect_~s__state~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4416)) (.cse13 (= ssl3_connect_~s__state~0 4480)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse16 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0) (and .cse5 .cse0 .cse6) (and .cse5 .cse0 .cse7) (and .cse5 .cse0 .cse8) (and .cse4 .cse6) (and .cse9 .cse5 .cse10 .cse0 .cse11) (and .cse12 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse13) (and .cse0 .cse8 .cse2) (and (= 4432 ssl3_connect_~s__state~0) .cse0 .cse2) (and .cse9 .cse10 .cse4) (and .cse14 .cse15 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse7 .cse2) (and .cse14 .cse15 .cse5 .cse0 .cse11) (and (= 4400 ssl3_connect_~s__state~0) .cse4 .cse0) (and .cse12 .cse4 .cse0) (and .cse0 .cse6 .cse2) (and .cse5 .cse3) (and .cse16 .cse5 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse5 .cse0 .cse1) (and .cse12 (= 3 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 .cse13 .cse2) (and .cse16 .cse0 .cse2) (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 .cse16 .cse4))) [2022-04-07 00:50:11,357 INFO L878 garLoopResultBuilder]: At program point L301(lines 301 303) the Hoare annotation is: (not (<= 12292 |ssl3_connect_#in~initial_state|)) [2022-04-07 00:50:11,357 INFO L878 garLoopResultBuilder]: At program point L301-2(lines 296 308) 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 (= 3 ssl3_connect_~blastFlag~0) .cse1 .cse2) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)))) [2022-04-07 00:50:11,357 INFO L878 garLoopResultBuilder]: At program point L533(lines 533 547) the Hoare annotation is: (let ((.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse14 (<= 4352 ssl3_connect_~s__state~0)) (.cse15 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse3 (= 3 ssl3_connect_~s__state~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4416)) (.cse13 (= ssl3_connect_~s__state~0 4480)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse16 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0) (and .cse5 .cse0 .cse6) (and .cse5 .cse0 .cse7) (and .cse5 .cse0 .cse8) (and .cse4 .cse6) (and .cse9 .cse5 .cse10 .cse0 .cse11) (and .cse12 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse13) (and .cse0 .cse8 .cse2) (and (= 4432 ssl3_connect_~s__state~0) .cse0 .cse2) (and .cse9 .cse10 .cse4) (and .cse14 .cse15 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse7 .cse2) (and .cse14 .cse15 .cse5 .cse0 .cse11) (and (= 4400 ssl3_connect_~s__state~0) .cse4 .cse0) (and .cse12 .cse4 .cse0) (and .cse0 .cse6 .cse2) (and .cse5 .cse3) (and .cse16 .cse5 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse5 .cse0 .cse1) (and .cse12 (= 3 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 .cse13 .cse2) (and .cse16 .cse0 .cse2) (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 .cse16 .cse4))) [2022-04-07 00:50:11,357 INFO L878 garLoopResultBuilder]: At program point L368(lines 368 370) the Hoare annotation is: (let ((.cse0 (<= 4432 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_~blastFlag~0 4)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-04-07 00:50:11,358 INFO L878 garLoopResultBuilder]: At program point L335(lines 335 337) the Hoare annotation is: (let ((.cse0 (<= 4432 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_~blastFlag~0 4)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-04-07 00:50:11,358 INFO L878 garLoopResultBuilder]: At program point L236(lines 236 239) the Hoare annotation is: (or (= ssl3_connect_~blastFlag~0 0) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-04-07 00:50:11,358 INFO L878 garLoopResultBuilder]: At program point L203(lines 203 501) the Hoare annotation is: (let ((.cse2 (= 2 ssl3_connect_~blastFlag~0)) (.cse0 (= 3 ssl3_connect_~s__state~0)) (.cse4 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse1 .cse2 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= 4432 ssl3_connect_~s__state~0) .cse1) (and .cse4 .cse0) (and .cse4 .cse1 .cse3 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-07 00:50:11,358 INFO L878 garLoopResultBuilder]: At program point L170(lines 170 512) the Hoare annotation is: (let ((.cse6 (<= 4560 ssl3_connect_~s__state~0)) (.cse7 (<= ssl3_connect_~s__state~0 4560)) (.cse5 (= 4496 ssl3_connect_~s__state~0)) (.cse4 (= 4512 ssl3_connect_~s__state~0)) (.cse11 (= 3 ssl3_connect_~s__state~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)) (.cse9 (= ssl3_connect_~s__state~0 4480)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse10 (<= ssl3_connect_~blastFlag~0 4)) (.cse12 (= 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 .cse2 .cse3 .cse5) (and .cse1 .cse4) (and .cse6 .cse2 .cse7 .cse3 .cse8) (and .cse2 .cse3 .cse9) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse6 .cse7 .cse1) (and .cse3 .cse5 .cse10) (and .cse0 .cse11 .cse1 .cse3) (and .cse3 .cse4 .cse10) (and .cse2 .cse11) (and .cse12 .cse2 .cse3) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse2 .cse3 .cse8) (and .cse3 .cse9 .cse10) (and .cse12 .cse3 .cse10) (and .cse12 .cse1))) [2022-04-07 00:50:11,358 INFO L878 garLoopResultBuilder]: At program point L137(lines 137 523) the Hoare annotation is: (let ((.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse14 (= 3 ssl3_connect_~s__state~0)) (.cse3 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4416)) (.cse13 (= ssl3_connect_~s__state~0 4480)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse15 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse5 .cse0 .cse6) (and .cse5 .cse0 .cse7) (and .cse5 .cse0 .cse8) (and .cse4 .cse6) (and .cse9 .cse5 .cse10 .cse0 .cse11) (and .cse12 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse13) (and .cse0 .cse8 .cse2) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and (= 4432 ssl3_connect_~s__state~0) .cse0 .cse2) (and .cse9 .cse10 .cse4) (and .cse0 .cse7 .cse2) (and .cse3 .cse14 .cse4 .cse0) (and (= 4400 ssl3_connect_~s__state~0) .cse4 .cse0) (and .cse12 .cse4 .cse0) (and .cse0 .cse6 .cse2) (and .cse5 .cse14) (and .cse15 .cse5 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse3 .cse5 .cse0 .cse11) (and .cse5 .cse0 .cse1) (and .cse12 (= 3 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 .cse13 .cse2) (and .cse15 .cse0 .cse2) (and .cse15 .cse4))) [2022-04-07 00:50:11,358 INFO L878 garLoopResultBuilder]: At program point L104(lines 104 108) 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-07 00:50:11,358 INFO L878 garLoopResultBuilder]: At program point L534(lines 534 539) the Hoare annotation is: (let ((.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse14 (<= 4352 ssl3_connect_~s__state~0)) (.cse15 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse3 (= 3 ssl3_connect_~s__state~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4416)) (.cse13 (= ssl3_connect_~s__state~0 4480)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse16 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0) (and .cse5 .cse0 .cse6) (and .cse5 .cse0 .cse7) (and .cse5 .cse0 .cse8) (and .cse4 .cse6) (and .cse9 .cse5 .cse10 .cse0 .cse11) (and .cse12 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse13) (and .cse0 .cse8 .cse2) (and (= 4432 ssl3_connect_~s__state~0) .cse0 .cse2) (and .cse9 .cse10 .cse4) (and .cse14 .cse15 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse7 .cse2) (and .cse14 .cse15 .cse5 .cse0 .cse11) (and (= 4400 ssl3_connect_~s__state~0) .cse4 .cse0) (and .cse12 .cse4 .cse0) (and .cse0 .cse6 .cse2) (and .cse5 .cse3) (and .cse16 .cse5 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse5 .cse0 .cse1) (and .cse12 (= 3 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 .cse13 .cse2) (and .cse16 .cse0 .cse2) (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 .cse16 .cse4))) [2022-04-07 00:50:11,359 INFO L878 garLoopResultBuilder]: At program point L534-2(lines 533 547) the Hoare annotation is: (let ((.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse14 (<= 4352 ssl3_connect_~s__state~0)) (.cse15 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse3 (= 3 ssl3_connect_~s__state~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4416)) (.cse13 (= ssl3_connect_~s__state~0 4480)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse16 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0) (and .cse5 .cse0 .cse6) (and .cse5 .cse0 .cse7) (and .cse5 .cse0 .cse8) (and .cse4 .cse6) (and .cse9 .cse5 .cse10 .cse0 .cse11) (and .cse12 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse13) (and .cse0 .cse8 .cse2) (and (= 4432 ssl3_connect_~s__state~0) .cse0 .cse2) (and .cse9 .cse10 .cse4) (and .cse14 .cse15 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse7 .cse2) (and .cse14 .cse15 .cse5 .cse0 .cse11) (and (= 4400 ssl3_connect_~s__state~0) .cse4 .cse0) (and .cse12 .cse4 .cse0) (and .cse0 .cse6 .cse2) (and .cse5 .cse3) (and .cse16 .cse5 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse5 .cse0 .cse1) (and .cse12 (= 3 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 .cse13 .cse2) (and .cse16 .cse0 .cse2) (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 .cse16 .cse4))) [2022-04-07 00:50:11,359 INFO L878 garLoopResultBuilder]: At program point L270(lines 270 272) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384))) [2022-04-07 00:50:11,359 INFO L878 garLoopResultBuilder]: At program point L204(lines 200 502) the Hoare annotation is: (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 (= ssl3_connect_~s__hit~0 0) (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-07 00:50:11,359 INFO L878 garLoopResultBuilder]: At program point L138(lines 134 524) the Hoare annotation is: (or (and (<= 4352 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 1) (<= ssl3_connect_~s__state~0 4560)) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-04-07 00:50:11,359 INFO L878 garLoopResultBuilder]: At program point L105(lines 105 107) 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-07 00:50:11,359 INFO L878 garLoopResultBuilder]: At program point L536(lines 536 538) the Hoare annotation is: (let ((.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse14 (<= 4352 ssl3_connect_~s__state~0)) (.cse15 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse3 (= 3 ssl3_connect_~s__state~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4416)) (.cse13 (= ssl3_connect_~s__state~0 4480)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse16 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0) (and .cse5 .cse0 .cse6) (and .cse5 .cse0 .cse7) (and .cse5 .cse0 .cse8) (and .cse4 .cse6) (and .cse9 .cse5 .cse10 .cse0 .cse11) (and .cse12 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse13) (and .cse0 .cse8 .cse2) (and (= 4432 ssl3_connect_~s__state~0) .cse0 .cse2) (and .cse9 .cse10 .cse4) (and .cse14 .cse15 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse7 .cse2) (and .cse14 .cse15 .cse5 .cse0 .cse11) (and (= 4400 ssl3_connect_~s__state~0) .cse4 .cse0) (and .cse12 .cse4 .cse0) (and .cse0 .cse6 .cse2) (and .cse5 .cse3) (and .cse16 .cse5 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse5 .cse0 .cse1) (and .cse12 (= 3 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 .cse13 .cse2) (and .cse16 .cse0 .cse2) (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 .cse16 .cse4))) [2022-04-07 00:50:11,359 INFO L878 garLoopResultBuilder]: At program point L206(lines 206 500) the Hoare annotation is: (let ((.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse3 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse0 (= 3 ssl3_connect_~s__state~0)) (.cse1 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (<= 4432 ssl3_connect_~s__state~0) (and .cse3 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse1 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)))) [2022-04-07 00:50:11,360 INFO L878 garLoopResultBuilder]: At program point L173(lines 173 511) the Hoare annotation is: (let ((.cse6 (<= 4560 ssl3_connect_~s__state~0)) (.cse7 (<= ssl3_connect_~s__state~0 4560)) (.cse5 (= 4496 ssl3_connect_~s__state~0)) (.cse4 (= 4512 ssl3_connect_~s__state~0)) (.cse11 (= 3 ssl3_connect_~s__state~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)) (.cse9 (= ssl3_connect_~s__state~0 4480)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse10 (<= ssl3_connect_~blastFlag~0 4)) (.cse12 (= 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 .cse2 .cse3 .cse5) (and .cse1 .cse4) (and .cse6 .cse2 .cse7 .cse3 .cse8) (and .cse2 .cse3 .cse9) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse6 .cse7 .cse1) (and .cse3 .cse5 .cse10) (and .cse0 .cse11 .cse1 .cse3) (and .cse3 .cse4 .cse10) (and .cse2 .cse11) (and .cse12 .cse2 .cse3) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse2 .cse3 .cse8) (and .cse3 .cse9 .cse10) (and .cse12 .cse3 .cse10) (and .cse12 .cse1))) [2022-04-07 00:50:11,360 INFO L878 garLoopResultBuilder]: At program point L140(lines 140 522) the Hoare annotation is: (let ((.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse14 (= 3 ssl3_connect_~s__state~0)) (.cse3 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4416)) (.cse13 (= ssl3_connect_~s__state~0 4480)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse15 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse5 .cse0 .cse6) (and .cse5 .cse0 .cse7) (and .cse5 .cse0 .cse8) (and .cse4 .cse6) (and .cse9 .cse5 .cse10 .cse0 .cse11) (and .cse12 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse13) (and .cse0 .cse8 .cse2) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and (= 4432 ssl3_connect_~s__state~0) .cse0 .cse2) (and .cse9 .cse10 .cse4) (and .cse0 .cse7 .cse2) (and .cse3 .cse14 .cse4 .cse0) (and (= 4400 ssl3_connect_~s__state~0) .cse4 .cse0) (and .cse12 .cse4 .cse0) (and .cse0 .cse6 .cse2) (and .cse5 .cse14) (and .cse15 .cse5 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse3 .cse5 .cse0 .cse11) (and .cse5 .cse0 .cse1) (and .cse12 (= 3 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 .cse13 .cse2) (and .cse15 .cse0 .cse2) (and .cse15 .cse4))) [2022-04-07 00:50:11,360 INFO L878 garLoopResultBuilder]: At program point L372(lines 372 377) the Hoare annotation is: (let ((.cse0 (<= 4432 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_~blastFlag~0 4)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-04-07 00:50:11,360 INFO L878 garLoopResultBuilder]: At program point L372-2(lines 372 377) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse3 (= 4496 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (= 4512 ssl3_connect_~s__state~0)) (.cse4 (<= ssl3_connect_~blastFlag~0 4))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse3) (and .cse1 .cse3 .cse4) (and .cse1 .cse2 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-07 00:50:11,360 INFO L878 garLoopResultBuilder]: At program point L240(lines 240 243) the Hoare annotation is: (or (= ssl3_connect_~blastFlag~0 0) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-04-07 00:50:11,360 INFO L878 garLoopResultBuilder]: At program point L207(lines 206 500) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4352))) (or (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse1 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) (= ssl3_connect_~s__hit~0 0) (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-07 00:50:11,360 INFO L878 garLoopResultBuilder]: At program point L174(lines 164 514) the Hoare annotation is: (let ((.cse0 (<= 4432 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_~blastFlag~0 4)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-04-07 00:50:11,360 INFO L885 garLoopResultBuilder]: At program point L472-1(lines 472 474) the Hoare annotation is: true [2022-04-07 00:50:11,360 INFO L885 garLoopResultBuilder]: At program point L209(lines 209 499) the Hoare annotation is: true [2022-04-07 00:50:11,361 INFO L878 garLoopResultBuilder]: At program point L176(lines 176 510) the Hoare annotation is: (let ((.cse6 (<= 4560 ssl3_connect_~s__state~0)) (.cse7 (<= ssl3_connect_~s__state~0 4560)) (.cse5 (= 4496 ssl3_connect_~s__state~0)) (.cse4 (= 4512 ssl3_connect_~s__state~0)) (.cse11 (= 3 ssl3_connect_~s__state~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)) (.cse9 (= ssl3_connect_~s__state~0 4480)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse10 (<= ssl3_connect_~blastFlag~0 4)) (.cse12 (= 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 .cse2 .cse3 .cse5) (and .cse1 .cse4) (and .cse6 .cse2 .cse7 .cse3 .cse8) (and .cse2 .cse3 .cse9) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse6 .cse7 .cse1) (and .cse3 .cse5 .cse10) (and .cse0 .cse11 .cse1 .cse3) (and .cse3 .cse4 .cse10) (and .cse2 .cse11) (and .cse12 .cse2 .cse3) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse2 .cse3 .cse8) (and .cse3 .cse9 .cse10) (and .cse12 .cse3 .cse10) (and .cse12 .cse1))) [2022-04-07 00:50:11,361 INFO L878 garLoopResultBuilder]: At program point L143(lines 143 521) the Hoare annotation is: (let ((.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse14 (= 3 ssl3_connect_~s__state~0)) (.cse3 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4416)) (.cse13 (= ssl3_connect_~s__state~0 4480)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse15 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse5 .cse0 .cse6) (and .cse5 .cse0 .cse7) (and .cse5 .cse0 .cse8) (and .cse4 .cse6) (and .cse9 .cse5 .cse10 .cse0 .cse11) (and .cse12 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse13) (and .cse0 .cse8 .cse2) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and (= 4432 ssl3_connect_~s__state~0) .cse0 .cse2) (and .cse9 .cse10 .cse4) (and .cse0 .cse7 .cse2) (and .cse3 .cse14 .cse4 .cse0) (and .cse12 .cse4 .cse0) (and .cse0 .cse6 .cse2) (and .cse5 .cse14) (and .cse15 .cse5 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse3 .cse5 .cse0 .cse11) (and .cse5 .cse0 .cse1) (and .cse12 (= 3 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 .cse13 .cse2) (and .cse15 .cse0 .cse2) (and .cse15 .cse4))) [2022-04-07 00:50:11,361 INFO L878 garLoopResultBuilder]: At program point L110-1(lines 87 562) the Hoare annotation is: (let ((.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse15 (<= 4352 ssl3_connect_~s__state~0)) (.cse16 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse3 (= 3 ssl3_connect_~s__state~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4416)) (.cse13 (= ssl3_connect_~s__state~0 4480)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse14 (= ssl3_connect_~blastFlag~0 0)) (.cse17 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0) (and .cse5 .cse0 .cse6) (and .cse5 .cse0 .cse7) (and .cse5 .cse0 .cse8) (and .cse4 .cse6) (and .cse9 .cse5 .cse10 .cse0 .cse11) (and .cse12 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse13) (and .cse0 .cse8 .cse2) (and (<= 12292 ssl3_connect_~s__state~0) .cse14) (and (= 4432 ssl3_connect_~s__state~0) .cse0 .cse2) (and .cse9 .cse10 .cse4) (and .cse15 .cse16 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse7 .cse2) (and .cse15 .cse16 .cse5 .cse0 .cse11) (and (= 4400 ssl3_connect_~s__state~0) .cse4 .cse0) (and .cse12 .cse4 .cse0) (and .cse0 .cse6 .cse2) (and .cse5 .cse3) (and .cse17 .cse5 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse5 .cse0 .cse1) (and .cse12 (= 3 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 .cse13 .cse2) (and .cse17 .cse0 .cse2) (and (= ssl3_connect_~s__state~0 4368) .cse14) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse17 .cse4))) [2022-04-07 00:50:11,361 INFO L878 garLoopResultBuilder]: At program point L408(lines 408 411) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (= ssl3_connect_~s__state~0 4528))) (or (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 (= 2 ssl3_connect_~blastFlag~0)))) [2022-04-07 00:50:11,361 INFO L885 garLoopResultBuilder]: At program point L210(lines 209 499) the Hoare annotation is: true [2022-04-07 00:50:11,361 INFO L878 garLoopResultBuilder]: At program point L144(lines 140 522) 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) (= 2 ssl3_connect_~blastFlag~0) (= ssl3_connect_~s__hit~0 0))) [2022-04-07 00:50:11,362 INFO L878 garLoopResultBuilder]: At program point L111(line 111) the Hoare annotation is: (let ((.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse15 (<= 4352 ssl3_connect_~s__state~0)) (.cse16 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse3 (= 3 ssl3_connect_~s__state~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4416)) (.cse13 (= ssl3_connect_~s__state~0 4480)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse14 (= ssl3_connect_~blastFlag~0 0)) (.cse17 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0) (and .cse5 .cse0 .cse6) (and .cse5 .cse0 .cse7) (and .cse5 .cse0 .cse8) (and .cse4 .cse6) (and .cse9 .cse5 .cse10 .cse0 .cse11) (and .cse12 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse13) (and .cse0 .cse8 .cse2) (and (<= 12292 ssl3_connect_~s__state~0) .cse14) (and (= 4432 ssl3_connect_~s__state~0) .cse0 .cse2) (and .cse9 .cse10 .cse4) (and .cse15 .cse16 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse7 .cse2) (and .cse15 .cse16 .cse5 .cse0 .cse11) (and (= 4400 ssl3_connect_~s__state~0) .cse4 .cse0) (and .cse12 .cse4 .cse0) (and .cse0 .cse6 .cse2) (and .cse5 .cse3) (and .cse17 .cse5 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse5 .cse0 .cse1) (and .cse12 (= 3 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 .cse13 .cse2) (and .cse17 .cse0 .cse2) (and (= ssl3_connect_~s__state~0 4368) .cse14) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse17 .cse4))) [2022-04-07 00:50:11,362 INFO L878 garLoopResultBuilder]: At program point L541(lines 541 545) the Hoare annotation is: (let ((.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse14 (<= 4352 ssl3_connect_~s__state~0)) (.cse15 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse3 (= 3 ssl3_connect_~s__state~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4416)) (.cse13 (= ssl3_connect_~s__state~0 4480)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse16 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0) (and .cse5 .cse0 .cse6) (and .cse5 .cse0 .cse7) (and .cse5 .cse0 .cse8) (and .cse4 .cse6) (and .cse9 .cse5 .cse10 .cse0 .cse11) (and .cse12 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse13) (and .cse0 .cse8 .cse2) (and (= 4432 ssl3_connect_~s__state~0) .cse0 .cse2) (and .cse9 .cse10 .cse4) (and .cse14 .cse15 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse7 .cse2) (and .cse14 .cse15 .cse5 .cse0 .cse11) (and (= 4400 ssl3_connect_~s__state~0) .cse4 .cse0) (and .cse12 .cse4 .cse0) (and .cse0 .cse6 .cse2) (and .cse5 .cse3) (and .cse16 .cse5 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse5 .cse0 .cse1) (and .cse12 (= 3 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 .cse13 .cse2) (and .cse16 .cse0 .cse2) (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 .cse16 .cse4))) [2022-04-07 00:50:11,362 INFO L878 garLoopResultBuilder]: At program point L277(lines 277 279) the Hoare annotation is: (or (and (<= 4352 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 1) (<= ssl3_connect_~s__state~0 4560)) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-04-07 00:50:11,362 INFO L878 garLoopResultBuilder]: At program point L277-2(lines 213 496) 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) (= 2 ssl3_connect_~blastFlag~0))) [2022-04-07 00:50:11,362 INFO L878 garLoopResultBuilder]: At program point L443(lines 443 445) the Hoare annotation is: (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 (= ssl3_connect_~s__hit~0 0) (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-07 00:50:11,362 INFO L878 garLoopResultBuilder]: At program point L344(lines 344 346) the Hoare annotation is: (let ((.cse0 (<= 4432 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_~blastFlag~0 4)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-04-07 00:50:11,362 INFO L885 garLoopResultBuilder]: At program point L212(lines 211 499) the Hoare annotation is: true [2022-04-07 00:50:11,362 INFO L878 garLoopResultBuilder]: At program point L179(lines 179 509) the Hoare annotation is: (let ((.cse6 (<= 4560 ssl3_connect_~s__state~0)) (.cse7 (<= ssl3_connect_~s__state~0 4560)) (.cse5 (= 4496 ssl3_connect_~s__state~0)) (.cse4 (= 4512 ssl3_connect_~s__state~0)) (.cse10 (= 3 ssl3_connect_~s__state~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)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse9 (<= ssl3_connect_~blastFlag~0 4)) (.cse11 (= 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 .cse2 .cse3 .cse5) (and .cse1 .cse4) (and .cse6 .cse2 .cse7 .cse3 .cse8) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse6 .cse7 .cse1) (and .cse3 .cse5 .cse9) (and .cse0 .cse10 .cse1 .cse3) (and .cse3 .cse4 .cse9) (and .cse2 .cse10) (and .cse11 .cse2 .cse3) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse2 .cse3 .cse8) (and .cse11 .cse3 .cse9) (and .cse11 .cse1))) [2022-04-07 00:50:11,363 INFO L878 garLoopResultBuilder]: At program point L146(lines 146 520) the Hoare annotation is: (let ((.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse14 (= 3 ssl3_connect_~s__state~0)) (.cse3 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4416)) (.cse13 (= ssl3_connect_~s__state~0 4480)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse15 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse5 .cse0 .cse6) (and .cse5 .cse0 .cse7) (and .cse5 .cse0 .cse8) (and .cse4 .cse6) (and .cse9 .cse5 .cse10 .cse0 .cse11) (and .cse12 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse13) (and .cse0 .cse8 .cse2) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and (= 4432 ssl3_connect_~s__state~0) .cse0 .cse2) (and .cse9 .cse10 .cse4) (and .cse0 .cse7 .cse2) (and .cse3 .cse14 .cse4 .cse0) (and .cse12 .cse4 .cse0) (and .cse0 .cse6 .cse2) (and .cse5 .cse14) (and .cse15 .cse5 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse3 .cse5 .cse0 .cse11) (and .cse5 .cse0 .cse1) (and .cse12 (= 3 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 .cse13 .cse2) (and .cse15 .cse0 .cse2) (and .cse15 .cse4))) [2022-04-07 00:50:11,363 INFO L878 garLoopResultBuilder]: At program point L113(lines 113 531) the Hoare annotation is: (let ((.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse15 (<= 4352 ssl3_connect_~s__state~0)) (.cse16 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse3 (= 3 ssl3_connect_~s__state~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4416)) (.cse13 (= ssl3_connect_~s__state~0 4480)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse14 (= ssl3_connect_~blastFlag~0 0)) (.cse17 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0) (and .cse5 .cse0 .cse6) (and .cse5 .cse0 .cse7) (and .cse5 .cse0 .cse8) (and .cse4 .cse6) (and .cse9 .cse5 .cse10 .cse0 .cse11) (and .cse12 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse13) (and .cse0 .cse8 .cse2) (and (<= 12292 ssl3_connect_~s__state~0) .cse14) (and (= 4432 ssl3_connect_~s__state~0) .cse0 .cse2) (and .cse9 .cse10 .cse4) (and .cse15 .cse16 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse7 .cse2) (and .cse15 .cse16 .cse5 .cse0 .cse11) (and (= 4400 ssl3_connect_~s__state~0) .cse4 .cse0) (and .cse12 .cse4 .cse0) (and .cse0 .cse6 .cse2) (and .cse5 .cse3) (and .cse17 .cse5 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse5 .cse0 .cse1) (and .cse12 (= 3 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 .cse13 .cse2) (and .cse17 .cse0 .cse2) (and (= ssl3_connect_~s__state~0 4368) .cse14) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse17 .cse4))) [2022-04-07 00:50:11,363 INFO L878 garLoopResultBuilder]: At program point L180(lines 176 510) the Hoare annotation is: (let ((.cse0 (<= 4432 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_~blastFlag~0 4)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-04-07 00:50:11,387 INFO L878 garLoopResultBuilder]: At program point L114(lines 113 531) 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-07 00:50:11,387 INFO L885 garLoopResultBuilder]: At program point L478(lines 478 480) the Hoare annotation is: true [2022-04-07 00:50:11,387 INFO L885 garLoopResultBuilder]: At program point L478-2(lines 478 480) the Hoare annotation is: true [2022-04-07 00:50:11,388 INFO L878 garLoopResultBuilder]: At program point L446(lines 446 450) the Hoare annotation is: (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 (= ssl3_connect_~s__hit~0 0) (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-07 00:50:11,388 INFO L878 garLoopResultBuilder]: At program point L446-2(lines 446 450) 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))) (or (and .cse0 .cse1 .cse2) (and .cse1 (= 4512 ssl3_connect_~s__state~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse2))) [2022-04-07 00:50:11,388 INFO L878 garLoopResultBuilder]: At program point L347(lines 347 351) the Hoare annotation is: (let ((.cse0 (<= 4432 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_~blastFlag~0 4)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-04-07 00:50:11,388 INFO L878 garLoopResultBuilder]: At program point L347-2(lines 347 351) the Hoare annotation is: (let ((.cse2 (= ssl3_connect_~s__state~0 4464)) (.cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse4 (<= ssl3_connect_~s__s3__tmp__cert_req~0 0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse5 (= ssl3_connect_~s__state~0 4480)) (.cse3 (<= ssl3_connect_~blastFlag~0 4))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse1 .cse5) (and .cse4 .cse1 .cse5 .cse3) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-07 00:50:11,388 INFO L878 garLoopResultBuilder]: At program point L182(lines 182 508) the Hoare annotation is: (let ((.cse6 (<= 4560 ssl3_connect_~s__state~0)) (.cse7 (<= ssl3_connect_~s__state~0 4560)) (.cse5 (= 4496 ssl3_connect_~s__state~0)) (.cse4 (= 4512 ssl3_connect_~s__state~0)) (.cse10 (= 3 ssl3_connect_~s__state~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)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse9 (<= ssl3_connect_~blastFlag~0 4)) (.cse11 (= 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 .cse2 .cse3 .cse5) (and .cse1 .cse4) (and .cse6 .cse2 .cse7 .cse3 .cse8) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse6 .cse7 .cse1) (and .cse3 .cse5 .cse9) (and .cse0 .cse10 .cse1 .cse3) (and .cse3 .cse4 .cse9) (and .cse2 .cse10) (and .cse11 .cse2 .cse3) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse2 .cse3 .cse8) (and .cse11 .cse3 .cse9) (and .cse11 .cse1))) [2022-04-07 00:50:11,388 INFO L878 garLoopResultBuilder]: At program point L149(lines 149 519) the Hoare annotation is: (let ((.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse13 (= 3 ssl3_connect_~s__state~0)) (.cse3 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4480)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse14 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse5 .cse0 .cse6) (and .cse5 .cse0 .cse7) (and .cse5 .cse0 .cse8) (and .cse4 .cse6) (and .cse9 .cse5 .cse10 .cse0 .cse11) (and .cse5 .cse0 .cse12) (and .cse0 .cse8 .cse2) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and (= 4432 ssl3_connect_~s__state~0) .cse0 .cse2) (and .cse9 .cse10 .cse4) (and .cse0 .cse7 .cse2) (and .cse3 .cse13 .cse4 .cse0) (and .cse0 .cse6 .cse2) (and .cse5 .cse13) (and .cse14 .cse5 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse3 .cse5 .cse0 .cse11) (and .cse5 .cse0 .cse1) (and .cse0 .cse12 .cse2) (and .cse14 .cse0 .cse2) (and .cse14 .cse4))) [2022-04-07 00:50:11,389 INFO L878 garLoopResultBuilder]: At program point L116(lines 116 530) the Hoare annotation is: (let ((.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse15 (<= 4352 ssl3_connect_~s__state~0)) (.cse16 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse3 (= 3 ssl3_connect_~s__state~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4416)) (.cse13 (= ssl3_connect_~s__state~0 4480)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse14 (= ssl3_connect_~blastFlag~0 0)) (.cse17 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0) (and .cse5 .cse0 .cse6) (and .cse5 .cse0 .cse7) (and .cse5 .cse0 .cse8) (and .cse4 .cse6) (and .cse9 .cse5 .cse10 .cse0 .cse11) (and .cse12 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse13) (and .cse0 .cse8 .cse2) (and (<= 12292 ssl3_connect_~s__state~0) .cse14) (and (= 4432 ssl3_connect_~s__state~0) .cse0 .cse2) (and .cse9 .cse10 .cse4) (and .cse15 .cse16 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse7 .cse2) (and .cse15 .cse16 .cse5 .cse0 .cse11) (and (= 4400 ssl3_connect_~s__state~0) .cse4 .cse0) (and .cse12 .cse4 .cse0) (and .cse0 .cse6 .cse2) (and .cse5 .cse3) (and .cse17 .cse5 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse5 .cse0 .cse1) (and .cse12 (= 3 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 .cse13 .cse2) (and .cse17 .cse0 .cse2) (and (= ssl3_connect_~s__state~0 4368) .cse14) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse17 .cse4))) [2022-04-07 00:50:11,389 INFO L878 garLoopResultBuilder]: At program point L150(lines 146 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 (and .cse0 (= 3 ssl3_connect_~blastFlag~0) .cse1 .cse2) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) .cse2))) [2022-04-07 00:50:11,389 INFO L885 garLoopResultBuilder]: At program point ssl3_connectENTRY(lines 22 563) the Hoare annotation is: true [2022-04-07 00:50:11,389 INFO L878 garLoopResultBuilder]: At program point L316(lines 316 318) 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 (= 3 ssl3_connect_~blastFlag~0) .cse1 .cse2) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) .cse2))) [2022-04-07 00:50:11,389 INFO L878 garLoopResultBuilder]: At program point L283(lines 283 287) 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) (= 2 ssl3_connect_~blastFlag~0))) [2022-04-07 00:50:11,389 INFO L878 garLoopResultBuilder]: At program point L250(lines 250 253) the Hoare annotation is: (or (= ssl3_connect_~blastFlag~0 0) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-04-07 00:50:11,389 INFO L878 garLoopResultBuilder]: At program point L316-2(lines 213 496) 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_~blastFlag~0 4))) [2022-04-07 00:50:11,389 INFO L878 garLoopResultBuilder]: At program point L283-2(lines 283 287) the Hoare annotation is: (let ((.cse0 (= 2 ssl3_connect_~blastFlag~0))) (or (and (<= 4560 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560) .cse0) (and (= 4400 ssl3_connect_~s__state~0) .cse0 (= ssl3_connect_~s__hit~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-07 00:50:11,389 INFO L878 garLoopResultBuilder]: At program point L416(lines 416 418) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0)) (and .cse0 .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-04-07 00:50:11,390 INFO L878 garLoopResultBuilder]: At program point L383(lines 383 385) the Hoare annotation is: (let ((.cse0 (<= 4432 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_~blastFlag~0 4)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-04-07 00:50:11,390 INFO L878 garLoopResultBuilder]: At program point L218(lines 116 530) the Hoare annotation is: (or (= ssl3_connect_~blastFlag~0 0) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-04-07 00:50:11,390 INFO L878 garLoopResultBuilder]: At program point L185(lines 185 507) the Hoare annotation is: (let ((.cse5 (<= 4560 ssl3_connect_~s__state~0)) (.cse6 (<= ssl3_connect_~s__state~0 4560)) (.cse4 (= 4512 ssl3_connect_~s__state~0)) (.cse8 (= 3 ssl3_connect_~s__state~0)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse2 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse7 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse9 (<= ssl3_connect_~blastFlag~0 4)) (.cse10 (= 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 .cse1 .cse4) (and .cse5 .cse2 .cse6 .cse3 .cse7) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse5 .cse6 .cse1) (and .cse0 .cse8 .cse1 .cse3) (and .cse3 .cse4 .cse9) (and .cse2 .cse8) (and .cse10 .cse2 .cse3) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse2 .cse3 .cse7) (and .cse10 .cse3 .cse9) (and .cse10 .cse1))) [2022-04-07 00:50:11,390 INFO L878 garLoopResultBuilder]: At program point L152(lines 152 518) the Hoare annotation is: (let ((.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse13 (= 3 ssl3_connect_~s__state~0)) (.cse3 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4480)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse14 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse5 .cse0 .cse6) (and .cse5 .cse0 .cse7) (and .cse5 .cse0 .cse8) (and .cse4 .cse6) (and .cse9 .cse5 .cse10 .cse0 .cse11) (and .cse5 .cse0 .cse12) (and .cse0 .cse8 .cse2) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and (= 4432 ssl3_connect_~s__state~0) .cse0 .cse2) (and .cse9 .cse10 .cse4) (and .cse0 .cse7 .cse2) (and .cse3 .cse13 .cse4 .cse0) (and .cse0 .cse6 .cse2) (and .cse5 .cse13) (and .cse14 .cse5 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse3 .cse5 .cse0 .cse11) (and .cse5 .cse0 .cse1) (and .cse0 .cse12 .cse2) (and .cse14 .cse0 .cse2) (and .cse14 .cse4))) [2022-04-07 00:50:11,390 INFO L878 garLoopResultBuilder]: At program point L119(lines 119 529) the Hoare annotation is: (let ((.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse15 (<= 4352 ssl3_connect_~s__state~0)) (.cse16 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse3 (= 3 ssl3_connect_~s__state~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4416)) (.cse13 (= ssl3_connect_~s__state~0 4480)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse14 (= ssl3_connect_~blastFlag~0 0)) (.cse17 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0) (and .cse5 .cse0 .cse6) (and .cse5 .cse0 .cse7) (and .cse5 .cse0 .cse8) (and .cse4 .cse6) (and .cse9 .cse5 .cse10 .cse0 .cse11) (and .cse12 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse13) (and .cse0 .cse8 .cse2) (and (<= 12292 ssl3_connect_~s__state~0) .cse14) (and (= 4432 ssl3_connect_~s__state~0) .cse0 .cse2) (and .cse9 .cse10 .cse4) (and .cse15 .cse16 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse7 .cse2) (and .cse15 .cse16 .cse5 .cse0 .cse11) (and (= 4400 ssl3_connect_~s__state~0) .cse4 .cse0) (and .cse12 .cse4 .cse0) (and .cse0 .cse6 .cse2) (and .cse5 .cse3) (and .cse17 .cse5 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse5 .cse0 .cse1) (and .cse12 (= 3 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 .cse13 .cse2) (and .cse17 .cse0 .cse2) (and (= ssl3_connect_~s__state~0 4368) .cse14) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse17 .cse4))) [2022-04-07 00:50:11,390 INFO L878 garLoopResultBuilder]: At program point L186(lines 182 508) the Hoare annotation is: (let ((.cse0 (<= 4432 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_~blastFlag~0 4)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-04-07 00:50:11,390 INFO L885 garLoopResultBuilder]: At program point L484(lines 484 486) the Hoare annotation is: true [2022-04-07 00:50:11,391 INFO L885 garLoopResultBuilder]: At program point L484-2(lines 484 486) the Hoare annotation is: true [2022-04-07 00:50:11,391 INFO L885 garLoopResultBuilder]: At program point L551(lines 109 552) the Hoare annotation is: true [2022-04-07 00:50:11,391 INFO L878 garLoopResultBuilder]: At program point L188(lines 188 506) the Hoare annotation is: (let ((.cse5 (<= 4560 ssl3_connect_~s__state~0)) (.cse6 (<= ssl3_connect_~s__state~0 4560)) (.cse4 (= 4512 ssl3_connect_~s__state~0)) (.cse8 (= 3 ssl3_connect_~s__state~0)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse2 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse7 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse9 (<= ssl3_connect_~blastFlag~0 4)) (.cse10 (= 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 .cse1 .cse4) (and .cse5 .cse2 .cse6 .cse3 .cse7) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse5 .cse6 .cse1) (and .cse0 .cse8 .cse1 .cse3) (and .cse3 .cse4 .cse9) (and .cse2 .cse8) (and .cse10 .cse2 .cse3) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse2 .cse3 .cse7) (and .cse10 .cse3 .cse9) (and .cse10 .cse1))) [2022-04-07 00:50:11,391 INFO L878 garLoopResultBuilder]: At program point L155(lines 155 517) the Hoare annotation is: (let ((.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse13 (= 3 ssl3_connect_~s__state~0)) (.cse3 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4480)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse14 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse5 .cse0 .cse6) (and .cse5 .cse0 .cse7) (and .cse5 .cse0 .cse8) (and .cse4 .cse6) (and .cse9 .cse5 .cse10 .cse0 .cse11) (and .cse5 .cse0 .cse12) (and .cse0 .cse8 .cse2) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse9 .cse10 .cse4) (and .cse0 .cse7 .cse2) (and .cse3 .cse13 .cse4 .cse0) (and .cse0 .cse6 .cse2) (and .cse5 .cse13) (and .cse14 .cse5 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse3 .cse5 .cse0 .cse11) (and .cse5 .cse0 .cse1) (and .cse0 .cse12 .cse2) (and .cse14 .cse0 .cse2) (and .cse14 .cse4))) [2022-04-07 00:50:11,391 INFO L878 garLoopResultBuilder]: At program point L122(lines 122 528) the Hoare annotation is: (let ((.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse15 (<= 4352 ssl3_connect_~s__state~0)) (.cse16 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse3 (= 3 ssl3_connect_~s__state~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4416)) (.cse13 (= ssl3_connect_~s__state~0 4480)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse14 (= ssl3_connect_~blastFlag~0 0)) (.cse17 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0) (and .cse5 .cse0 .cse6) (and .cse5 .cse0 .cse7) (and .cse5 .cse0 .cse8) (and .cse4 .cse6) (and .cse9 .cse5 .cse10 .cse0 .cse11) (and .cse12 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse13) (and .cse0 .cse8 .cse2) (and (<= 12292 ssl3_connect_~s__state~0) .cse14) (and (= 4432 ssl3_connect_~s__state~0) .cse0 .cse2) (and .cse9 .cse10 .cse4) (and .cse15 .cse16 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse7 .cse2) (and .cse15 .cse16 .cse5 .cse0 .cse11) (and (= 4400 ssl3_connect_~s__state~0) .cse4 .cse0) (and .cse12 .cse4 .cse0) (and .cse0 .cse6 .cse2) (and .cse5 .cse3) (and .cse17 .cse5 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse5 .cse0 .cse1) (and .cse12 (= 3 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 .cse13 .cse2) (and .cse17 .cse0 .cse2) (and (= ssl3_connect_~s__state~0 4368) .cse14) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse17 .cse4))) [2022-04-07 00:50:11,391 INFO L878 garLoopResultBuilder]: At program point L156(lines 152 518) the Hoare annotation is: (or (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~blastFlag~0 4)) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-04-07 00:50:11,391 INFO L878 garLoopResultBuilder]: At program point L223(lines 223 225) the Hoare annotation is: (or (= ssl3_connect_~blastFlag~0 0) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-04-07 00:50:11,391 INFO L878 garLoopResultBuilder]: At program point L223-2(lines 223 225) the Hoare annotation is: (or (= ssl3_connect_~blastFlag~0 0) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-04-07 00:50:11,392 INFO L878 garLoopResultBuilder]: At program point L191(lines 191 505) the Hoare annotation is: (let ((.cse2 (<= 4560 ssl3_connect_~s__state~0)) (.cse4 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse3 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse6 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse5 (= ssl3_connect_~s__hit~0 0)) (.cse8 (= 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 .cse5 .cse6) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse2 .cse4 .cse1) (and .cse0 .cse7 .cse1 .cse5) (and .cse3 .cse7) (and .cse8 .cse3 .cse5) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse3 .cse5 .cse6) (and .cse8 .cse5 (<= ssl3_connect_~blastFlag~0 4)) (and .cse8 .cse1))) [2022-04-07 00:50:11,392 INFO L878 garLoopResultBuilder]: At program point L158(lines 158 516) the Hoare annotation is: (let ((.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse13 (= 3 ssl3_connect_~s__state~0)) (.cse3 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4480)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse14 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse5 .cse0 .cse6) (and .cse5 .cse0 .cse7) (and .cse5 .cse0 .cse8) (and .cse4 .cse6) (and .cse9 .cse5 .cse10 .cse0 .cse11) (and .cse5 .cse0 .cse12) (and .cse0 .cse8 .cse2) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse9 .cse10 .cse4) (and .cse0 .cse7 .cse2) (and .cse3 .cse13 .cse4 .cse0) (and .cse0 .cse6 .cse2) (and .cse5 .cse13) (and .cse14 .cse5 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse3 .cse5 .cse0 .cse11) (and .cse5 .cse0 .cse1) (and .cse0 .cse12 .cse2) (and .cse14 .cse0 .cse2) (and .cse14 .cse4))) [2022-04-07 00:50:11,392 INFO L878 garLoopResultBuilder]: At program point L125(lines 125 527) the Hoare annotation is: (let ((.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse15 (<= 4352 ssl3_connect_~s__state~0)) (.cse16 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse3 (= 3 ssl3_connect_~s__state~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4416)) (.cse13 (= ssl3_connect_~s__state~0 4480)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse14 (= ssl3_connect_~blastFlag~0 0)) (.cse17 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0) (and .cse5 .cse0 .cse6) (and .cse5 .cse0 .cse7) (and .cse5 .cse0 .cse8) (and .cse4 .cse6) (and .cse9 .cse5 .cse10 .cse0 .cse11) (and .cse12 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse13) (and .cse0 .cse8 .cse2) (and (<= 12292 ssl3_connect_~s__state~0) .cse14) (and (= 4432 ssl3_connect_~s__state~0) .cse0 .cse2) (and .cse9 .cse10 .cse4) (and .cse15 .cse16 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse7 .cse2) (and .cse15 .cse16 .cse5 .cse0 .cse11) (and (= 4400 ssl3_connect_~s__state~0) .cse4 .cse0) (and .cse12 .cse4 .cse0) (and .cse0 .cse6 .cse2) (and .cse5 .cse3) (and .cse17 .cse5 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse5 .cse0 .cse1) (and .cse12 (= 3 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 .cse13 .cse2) (and .cse17 .cse0 .cse2) (and (= ssl3_connect_~s__state~0 4368) .cse14) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse17 .cse4))) [2022-04-07 00:50:11,392 INFO L885 garLoopResultBuilder]: At program point ssl3_connectEXIT(lines 22 563) the Hoare annotation is: true [2022-04-07 00:50:11,392 INFO L885 garLoopResultBuilder]: At program point L489(lines 489 491) the Hoare annotation is: true [2022-04-07 00:50:11,392 INFO L878 garLoopResultBuilder]: At program point L456(lines 456 467) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4352))) (or (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse1 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) (= ssl3_connect_~s__hit~0 0) (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-07 00:50:11,392 INFO L878 garLoopResultBuilder]: At program point L423(lines 423 437) the Hoare annotation is: (let ((.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4352))) (or (and .cse0 .cse1 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2) (and .cse0 .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0)))) [2022-04-07 00:50:11,392 INFO L878 garLoopResultBuilder]: At program point L423-1(lines 423 437) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4352)) (.cse2 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560))) (or (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse1 .cse2 (= ssl3_connect_~s__hit~0 0) (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse2 (= 3 ssl3_connect_~s__state~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-07 00:50:11,392 INFO L878 garLoopResultBuilder]: At program point L456-2(lines 456 467) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4352))) (or (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse1 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) (= ssl3_connect_~s__hit~0 0) (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-07 00:50:11,392 INFO L878 garLoopResultBuilder]: At program point L324(lines 324 327) the Hoare annotation is: (or (and (= 4432 ssl3_connect_~s__state~0) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~blastFlag~0 4)) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-04-07 00:50:11,393 INFO L878 garLoopResultBuilder]: At program point L192(lines 188 506) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0)) (and .cse0 .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-04-07 00:50:11,393 INFO L885 garLoopResultBuilder]: At program point ssl3_connectFINAL(lines 22 563) the Hoare annotation is: true [2022-04-07 00:50:11,393 INFO L885 garLoopResultBuilder]: At program point L556(lines 556 558) the Hoare annotation is: true [2022-04-07 00:50:11,393 INFO L885 garLoopResultBuilder]: At program point L556-2(lines 556 558) the Hoare annotation is: true [2022-04-07 00:50:11,393 INFO L878 garLoopResultBuilder]: At program point L359(lines 359 361) the Hoare annotation is: (let ((.cse0 (<= 4432 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_~blastFlag~0 4)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-04-07 00:50:11,393 INFO L878 garLoopResultBuilder]: At program point L194(lines 194 504) the Hoare annotation is: (let ((.cse2 (<= 4560 ssl3_connect_~s__state~0)) (.cse4 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse3 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse6 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse5 (= ssl3_connect_~s__hit~0 0)) (.cse8 (= 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 .cse5 .cse6) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse2 .cse4 .cse1) (and .cse0 .cse7 .cse1 .cse5) (and .cse3 .cse7) (and .cse8 .cse3 .cse5) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse3 .cse5 .cse6) (and .cse8 .cse5 (<= ssl3_connect_~blastFlag~0 4)) (and .cse8 .cse1))) [2022-04-07 00:50:11,393 INFO L878 garLoopResultBuilder]: At program point L161(lines 161 515) the Hoare annotation is: (let ((.cse6 (= ssl3_connect_~s__state~0 4464)) (.cse7 (<= 4560 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__state~0 4560)) (.cse5 (= 4496 ssl3_connect_~s__state~0)) (.cse4 (= 4512 ssl3_connect_~s__state~0)) (.cse12 (= 3 ssl3_connect_~s__state~0)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse2 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse9 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse10 (= ssl3_connect_~s__state~0 4480)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse11 (<= ssl3_connect_~blastFlag~0 4)) (.cse13 (= 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 .cse2 .cse3 .cse5) (and .cse2 .cse3 .cse6) (and .cse1 .cse4) (and .cse7 .cse2 .cse8 .cse3 .cse9) (and .cse2 .cse3 .cse10) (and .cse3 .cse6 .cse11) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse7 .cse8 .cse1) (and .cse3 .cse5 .cse11) (and .cse0 .cse12 .cse1 .cse3) (and .cse3 .cse4 .cse11) (and .cse2 .cse12) (and .cse13 .cse2 .cse3) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse2 .cse3 .cse9) (and .cse3 .cse10 .cse11) (and .cse13 .cse3 .cse11) (and .cse13 .cse1))) [2022-04-07 00:50:11,393 INFO L878 garLoopResultBuilder]: At program point L128(lines 128 526) the Hoare annotation is: (let ((.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse15 (= 3 ssl3_connect_~s__state~0)) (.cse3 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4416)) (.cse13 (= ssl3_connect_~s__state~0 4480)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse14 (= ssl3_connect_~blastFlag~0 0)) (.cse16 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse5 .cse0 .cse6) (and .cse5 .cse0 .cse7) (and .cse5 .cse0 .cse8) (and .cse4 .cse6) (and .cse9 .cse5 .cse10 .cse0 .cse11) (and .cse12 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse13) (and .cse0 .cse8 .cse2) (and (<= 12292 ssl3_connect_~s__state~0) .cse14) (and (= 4432 ssl3_connect_~s__state~0) .cse0 .cse2) (and .cse9 .cse10 .cse4) (and .cse0 .cse7 .cse2) (and .cse3 .cse15 .cse4 .cse0) (and (= 4400 ssl3_connect_~s__state~0) .cse4 .cse0) (and .cse12 .cse4 .cse0) (and .cse0 .cse6 .cse2) (and .cse5 .cse15) (and .cse16 .cse5 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse3 .cse5 .cse0 .cse11) (and .cse5 .cse0 .cse1) (and .cse12 (= 3 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 .cse13 .cse2) (and .cse16 .cse0 .cse2) (and (= ssl3_connect_~s__state~0 4368) .cse14) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse16 .cse4))) [2022-04-07 00:50:11,393 INFO L878 garLoopResultBuilder]: At program point L393(lines 393 395) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0)) (and .cse0 .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-04-07 00:50:11,393 INFO L878 garLoopResultBuilder]: At program point L294(lines 294 308) 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) (= 2 ssl3_connect_~blastFlag~0) (= ssl3_connect_~s__hit~0 0))) [2022-04-07 00:50:11,394 INFO L878 garLoopResultBuilder]: At program point L228(lines 228 231) the Hoare annotation is: (or (= ssl3_connect_~blastFlag~0 0) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-04-07 00:50:11,394 INFO L878 garLoopResultBuilder]: At program point L294-2(lines 294 308) 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 (= 3 ssl3_connect_~blastFlag~0) .cse1 .cse2) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) .cse2))) [2022-04-07 00:50:11,394 INFO L878 garLoopResultBuilder]: At program point L162(lines 158 516) the Hoare annotation is: (let ((.cse0 (<= 4432 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_~blastFlag~0 4)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-04-07 00:50:11,394 INFO L878 garLoopResultBuilder]: At program point L96(lines 96 102) 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-07 00:50:11,395 INFO L878 garLoopResultBuilder]: At program point L427(lines 427 433) 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-07 00:50:11,395 INFO L878 garLoopResultBuilder]: At program point L262(lines 262 264) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (= ssl3_connect_~s__state~0 4368) (= ssl3_connect_~blastFlag~0 0))) [2022-04-07 00:50:11,395 INFO L878 garLoopResultBuilder]: At program point L262-2(lines 213 496) the Hoare annotation is: (or (and (<= 4352 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 1) (<= ssl3_connect_~s__state~0 4560)) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-04-07 00:50:11,395 INFO L878 garLoopResultBuilder]: At program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 560) the Hoare annotation is: (not (<= 12292 |ssl3_connect_#in~initial_state|)) [2022-04-07 00:50:11,395 INFO L878 garLoopResultBuilder]: At program point L461(lines 461 464) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4352))) (or (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse1 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) (= ssl3_connect_~s__hit~0 0) (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-07 00:50:11,395 INFO L878 garLoopResultBuilder]: At program point L197(lines 197 503) the Hoare annotation is: (let ((.cse2 (<= 4560 ssl3_connect_~s__state~0)) (.cse4 (<= ssl3_connect_~s__state~0 4560)) (.cse1 (= 2 ssl3_connect_~blastFlag~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse3 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__hit~0 0)) (.cse6 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0))) (or (and .cse0 .cse1 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse2 .cse3 .cse4 .cse5 .cse6) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse2 .cse4 .cse1) (and .cse0 .cse7 .cse1 .cse5) (and .cse3 .cse7) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse3 .cse5 .cse6))) [2022-04-07 00:50:11,396 INFO L878 garLoopResultBuilder]: At program point L164(lines 164 514) the Hoare annotation is: (let ((.cse6 (= ssl3_connect_~s__state~0 4464)) (.cse7 (<= 4560 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__state~0 4560)) (.cse5 (= 4496 ssl3_connect_~s__state~0)) (.cse4 (= 4512 ssl3_connect_~s__state~0)) (.cse12 (= 3 ssl3_connect_~s__state~0)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse2 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse9 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse10 (= ssl3_connect_~s__state~0 4480)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse11 (<= ssl3_connect_~blastFlag~0 4)) (.cse13 (= 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 .cse2 .cse3 .cse5) (and .cse2 .cse3 .cse6) (and .cse1 .cse4) (and .cse7 .cse2 .cse8 .cse3 .cse9) (and .cse2 .cse3 .cse10) (and .cse3 .cse6 .cse11) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse7 .cse8 .cse1) (and .cse3 .cse5 .cse11) (and .cse0 .cse12 .cse1 .cse3) (and .cse3 .cse4 .cse11) (and .cse2 .cse12) (and .cse13 .cse2 .cse3) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse2 .cse3 .cse9) (and .cse3 .cse10 .cse11) (and .cse13 .cse3 .cse11) (and .cse13 .cse1))) [2022-04-07 00:50:11,396 INFO L878 garLoopResultBuilder]: At program point L131(lines 131 525) the Hoare annotation is: (let ((.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse14 (= 3 ssl3_connect_~s__state~0)) (.cse3 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4416)) (.cse13 (= ssl3_connect_~s__state~0 4480)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse15 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse5 .cse0 .cse6) (and .cse5 .cse0 .cse7) (and .cse5 .cse0 .cse8) (and .cse4 .cse6) (and .cse9 .cse5 .cse10 .cse0 .cse11) (and .cse12 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse13) (and .cse0 .cse8 .cse2) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and (= 4432 ssl3_connect_~s__state~0) .cse0 .cse2) (and .cse9 .cse10 .cse4) (and .cse0 .cse7 .cse2) (and .cse3 .cse14 .cse4 .cse0) (and (= 4400 ssl3_connect_~s__state~0) .cse4 .cse0) (and .cse12 .cse4 .cse0) (and .cse0 .cse6 .cse2) (and .cse5 .cse14) (and .cse15 .cse5 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse3 .cse5 .cse0 .cse11) (and .cse5 .cse0 .cse1) (and .cse12 (= 3 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 .cse13 .cse2) (and .cse15 .cse0 .cse2) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse15 .cse4))) [2022-04-07 00:50:11,396 INFO L878 garLoopResultBuilder]: At program point L198(lines 194 504) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0)) (and .cse0 .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-04-07 00:50:11,396 INFO L878 garLoopResultBuilder]: At program point L132(lines 128 526) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (= ssl3_connect_~s__state~0 4368) (= ssl3_connect_~blastFlag~0 0))) [2022-04-07 00:50:11,396 INFO L878 garLoopResultBuilder]: At program point L99(lines 99 101) 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-07 00:50:11,396 INFO L878 garLoopResultBuilder]: At program point L99-2(lines 96 102) 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-07 00:50:11,397 INFO L878 garLoopResultBuilder]: At program point L298(lines 298 304) 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) (= 2 ssl3_connect_~blastFlag~0) (= ssl3_connect_~s__hit~0 0))) [2022-04-07 00:50:11,397 INFO L878 garLoopResultBuilder]: At program point L497(lines 110 550) the Hoare annotation is: (let ((.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse14 (<= 4352 ssl3_connect_~s__state~0)) (.cse15 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse3 (= 3 ssl3_connect_~s__state~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4416)) (.cse13 (= ssl3_connect_~s__state~0 4480)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse16 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0) (and .cse5 .cse0 .cse6) (and .cse5 .cse0 .cse7) (and .cse5 .cse0 .cse8) (and .cse4 .cse6) (and .cse9 .cse5 .cse10 .cse0 .cse11) (and .cse12 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse13) (and .cse0 .cse8 .cse2) (and (= 4432 ssl3_connect_~s__state~0) .cse0 .cse2) (and .cse9 .cse10 .cse4) (and .cse14 .cse15 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse7 .cse2) (and .cse14 .cse15 .cse5 .cse0 .cse11) (and (= 4400 ssl3_connect_~s__state~0) .cse4 .cse0) (and .cse12 .cse4 .cse0) (and .cse0 .cse6 .cse2) (and .cse5 .cse3) (and .cse16 .cse5 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse5 .cse0 .cse1) (and .cse12 (= 3 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 .cse13 .cse2) (and .cse16 .cse0 .cse2) (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 .cse16 .cse4))) [2022-04-07 00:50:11,397 INFO L878 garLoopResultBuilder]: At program point L332(lines 332 334) the Hoare annotation is: (or (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~blastFlag~0 4)) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-04-07 00:50:11,398 INFO L878 garLoopResultBuilder]: At program point L200(lines 200 502) the Hoare annotation is: (let ((.cse2 (<= 4560 ssl3_connect_~s__state~0)) (.cse4 (<= ssl3_connect_~s__state~0 4560)) (.cse1 (= 2 ssl3_connect_~blastFlag~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse3 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__hit~0 0)) (.cse6 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0))) (or (and .cse0 .cse1 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse2 .cse3 .cse4 .cse5 .cse6) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse2 .cse4 .cse1) (and .cse0 .cse7 .cse1 .cse5) (and .cse3 .cse7) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse3 .cse5 .cse6))) [2022-04-07 00:50:11,398 INFO L878 garLoopResultBuilder]: At program point L167(lines 167 513) the Hoare annotation is: (let ((.cse6 (<= 4560 ssl3_connect_~s__state~0)) (.cse7 (<= ssl3_connect_~s__state~0 4560)) (.cse5 (= 4496 ssl3_connect_~s__state~0)) (.cse4 (= 4512 ssl3_connect_~s__state~0)) (.cse11 (= 3 ssl3_connect_~s__state~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)) (.cse9 (= ssl3_connect_~s__state~0 4480)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse10 (<= ssl3_connect_~blastFlag~0 4)) (.cse12 (= 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 .cse2 .cse3 .cse5) (and .cse1 .cse4) (and .cse6 .cse2 .cse7 .cse3 .cse8) (and .cse2 .cse3 .cse9) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse6 .cse7 .cse1) (and .cse3 .cse5 .cse10) (and .cse0 .cse11 .cse1 .cse3) (and .cse3 .cse4 .cse10) (and .cse2 .cse11) (and .cse12 .cse2 .cse3) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse2 .cse3 .cse8) (and .cse3 .cse9 .cse10) (and .cse12 .cse3 .cse10) (and .cse12 .cse1))) [2022-04-07 00:50:11,398 INFO L878 garLoopResultBuilder]: At program point L134(lines 134 524) the Hoare annotation is: (let ((.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse14 (= 3 ssl3_connect_~s__state~0)) (.cse3 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4416)) (.cse13 (= ssl3_connect_~s__state~0 4480)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse15 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse5 .cse0 .cse6) (and .cse5 .cse0 .cse7) (and .cse5 .cse0 .cse8) (and .cse4 .cse6) (and .cse9 .cse5 .cse10 .cse0 .cse11) (and .cse12 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse13) (and .cse0 .cse8 .cse2) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and (= 4432 ssl3_connect_~s__state~0) .cse0 .cse2) (and .cse9 .cse10 .cse4) (and .cse0 .cse7 .cse2) (and .cse3 .cse14 .cse4 .cse0) (and (= 4400 ssl3_connect_~s__state~0) .cse4 .cse0) (and .cse12 .cse4 .cse0) (and .cse0 .cse6 .cse2) (and .cse5 .cse14) (and .cse15 .cse5 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse3 .cse5 .cse0 .cse11) (and .cse5 .cse0 .cse1) (and .cse12 (= 3 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 .cse13 .cse2) (and .cse15 .cse0 .cse2) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse15 .cse4))) [2022-04-07 00:50:11,398 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-07 00:50:11,398 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-07 00:50:11,398 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-07 00:50:11,398 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-07 00:50:11,403 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, 2] [2022-04-07 00:50:11,404 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 00:50:11,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 12:50:11 BoogieIcfgContainer [2022-04-07 00:50:11,425 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 00:50:11,426 INFO L158 Benchmark]: Toolchain (without parser) took 96610.81ms. Allocated memory was 159.4MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 134.7MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2022-04-07 00:50:11,426 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 122.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 00:50:11,426 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.66ms. Allocated memory is still 159.4MB. Free memory was 134.5MB in the beginning and 129.1MB in the end (delta: 5.3MB). Peak memory consumption was 12.8MB. Max. memory is 8.0GB. [2022-04-07 00:50:11,426 INFO L158 Benchmark]: Boogie Preprocessor took 79.81ms. Allocated memory is still 159.4MB. Free memory was 129.1MB in the beginning and 126.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 00:50:11,426 INFO L158 Benchmark]: RCFGBuilder took 1176.43ms. Allocated memory is still 159.4MB. Free memory was 126.7MB in the beginning and 101.2MB in the end (delta: 25.6MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-04-07 00:50:11,426 INFO L158 Benchmark]: TraceAbstraction took 95045.57ms. Allocated memory was 159.4MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 100.5MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2022-04-07 00:50:11,427 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.16ms. Allocated memory is still 159.4MB. Free memory is still 122.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 304.66ms. Allocated memory is still 159.4MB. Free memory was 134.5MB in the beginning and 129.1MB in the end (delta: 5.3MB). Peak memory consumption was 12.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 79.81ms. Allocated memory is still 159.4MB. Free memory was 129.1MB in the beginning and 126.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1176.43ms. Allocated memory is still 159.4MB. Free memory was 126.7MB in the beginning and 101.2MB in the end (delta: 25.6MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * TraceAbstraction took 95045.57ms. Allocated memory was 159.4MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 100.5MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.4GB. 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: 560]: 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, 140 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 94.9s, OverallIterations: 28, TraceHistogramMax: 18, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.3s, AutomataDifference: 17.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 55.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6756 SdHoareTripleChecker+Valid, 8.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6754 mSDsluCounter, 6312 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 519 mSDsCounter, 540 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5666 IncrementalHoareTripleChecker+Invalid, 6206 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 540 mSolverCounterUnsat, 5793 mSDtfsCounter, 5666 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3292 GetRequests, 3188 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8561occurred in iteration=24, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.7s AutomataMinimizationTime, 28 MinimizatonAttempts, 4666 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 137 LocationsWithAnnotation, 137 PreInvPairs, 3275 NumberOfFragments, 10540 HoareAnnotationTreeSize, 137 FomulaSimplifications, 67412 FormulaSimplificationTreeSizeReduction, 16.2s HoareSimplificationTime, 137 FomulaSimplificationsInter, 140763 FormulaSimplificationTreeSizeReductionInter, 38.9s 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: 110]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((s__hit == 0 && s__state == 4448) && blastFlag <= 4) || ((3 == s__state && 2 == blastFlag) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && 4512 == s__state)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && 4496 == s__state)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && s__state == 4464)) || (2 == blastFlag && 4512 == s__state)) || ((((4560 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || (((s__state == 4416 && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && blastFlag <= 4)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && s__state == 4480)) || ((s__hit == 0 && s__state == 4464) && blastFlag <= 4)) || ((4432 == s__state && s__hit == 0) && blastFlag <= 4)) || ((4560 <= s__state && s__state <= 4560) && 2 == blastFlag)) || (((4352 <= s__state && s__state <= 4352) && 2 == blastFlag) && 3 == s__s3__tmp__next_state___0)) || ((s__hit == 0 && 4496 == s__state) && blastFlag <= 4)) || ((((4352 <= s__state && s__state <= 4352) && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((4400 == s__state && 2 == blastFlag) && s__hit == 0)) || ((s__state == 4416 && 2 == blastFlag) && s__hit == 0)) || ((s__hit == 0 && 4512 == s__state) && blastFlag <= 4)) || (s__s3__tmp__next_state___0 <= 4560 && 3 == s__state)) || ((s__state == 4528 && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0)) || !(12292 <= \old(initial_state))) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && s__state == 4448)) || ((s__state == 4416 && 3 == blastFlag) && s__hit == 0)) || ((s__hit == 0 && s__state == 4480) && blastFlag <= 4)) || ((s__state == 4528 && s__hit == 0) && blastFlag <= 4)) || (s__state == 4368 && blastFlag == 0)) || (blastFlag == 1 && s__state == 4384)) || (s__state == 4528 && 2 == blastFlag) - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: (12292 <= s__state && blastFlag == 0) || !(12292 <= \old(initial_state)) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: (((4432 <= s__state && s__state <= 4560) && s__hit == 0) && blastFlag <= 4) || !(12292 <= \old(initial_state)) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || (s__state == 4368 && blastFlag == 0) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (((((4352 <= s__state && 3 == blastFlag) && s__state <= 4560) && s__hit == 0) || !(12292 <= \old(initial_state))) || ((((4352 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) && blastFlag <= 4)) || (((4352 <= s__state && s__state <= 4560) && 2 == blastFlag) && s__hit == 0) - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: ((((4352 <= s__state && s__state <= 4352) && 2 == blastFlag) && 3 == s__s3__tmp__next_state___0) || ((((4352 <= s__state && s__state <= 4352) && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || !(12292 <= \old(initial_state)) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: blastFlag == 0 || !(12292 <= \old(initial_state)) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((((4432 <= s__state && s__state <= 4560) && s__hit == 0) && blastFlag <= 4) || !(12292 <= \old(initial_state))) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: (((((4560 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0) || ((4560 <= s__state && s__state <= 4560) && 2 == blastFlag)) || !(12292 <= \old(initial_state)) - InvariantResult [Line: 211]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || (((4352 <= s__state && s__state <= 4560) && 2 == blastFlag) && s__hit == 0) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: ((((4432 <= s__state && s__state <= 4560) && s__hit == 0) && blastFlag <= 4) || !(12292 <= \old(initial_state))) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((((4432 <= s__state && s__state <= 4560) && s__hit == 0) && blastFlag <= 4) || !(12292 <= \old(initial_state))) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 182]: Loop Invariant Derived loop invariant: ((((4432 <= s__state && s__state <= 4560) && s__hit == 0) && blastFlag <= 4) || !(12292 <= \old(initial_state))) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: ((((4432 <= s__state && s__state <= 4560) && 2 == blastFlag) || (((4432 <= s__state && s__state <= 4560) && s__hit == 0) && blastFlag <= 4)) || !(12292 <= \old(initial_state))) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: ((((4432 <= s__state && s__state <= 4560) && 2 == blastFlag) || (((4432 <= s__state && s__state <= 4560) && s__hit == 0) && blastFlag <= 4)) || !(12292 <= \old(initial_state))) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((4352 <= s__state && blastFlag == 1) && s__state <= 4560) || !(12292 <= \old(initial_state)) - ProcedureContractResult [Line: 22]: Procedure Contract for ssl3_connect Derived contract for procedure ssl3_connect: 1 - ProcedureContractResult [Line: 564]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-04-07 00:50:11,483 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...