/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_2.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 00:48:09,535 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 00:48:09,537 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 00:48:09,563 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 00:48:09,564 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 00:48:09,565 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 00:48:09,565 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 00:48:09,567 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 00:48:09,568 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 00:48:09,569 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 00:48:09,569 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 00:48:09,570 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 00:48:09,571 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 00:48:09,571 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 00:48:09,572 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 00:48:09,573 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 00:48:09,573 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 00:48:09,574 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 00:48:09,578 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 00:48:09,580 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 00:48:09,581 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 00:48:09,582 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 00:48:09,583 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 00:48:09,583 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 00:48:09,584 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 00:48:09,586 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 00:48:09,587 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 00:48:09,587 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 00:48:09,588 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 00:48:09,588 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 00:48:09,589 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 00:48:09,589 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 00:48:09,590 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 00:48:09,590 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 00:48:09,591 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 00:48:09,592 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 00:48:09,592 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 00:48:09,593 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 00:48:09,593 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 00:48:09,593 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 00:48:09,594 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 00:48:09,594 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 00:48:09,595 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:09,602 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 00:48:09,602 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 00:48:09,603 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 00:48:09,604 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 00:48:09,604 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 00:48:09,604 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 00:48:09,604 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 00:48:09,605 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 00:48:09,605 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 00:48:09,605 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 00:48:09,605 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 00:48:09,606 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 00:48:09,606 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 00:48:09,606 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 00:48:09,606 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 00:48:09,607 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 00:48:09,607 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 00:48:09,607 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-07 00:48:09,607 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-07 00:48:09,608 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-07 00:48:09,608 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 00:48:09,608 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-07 00:48:09,608 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:09,824 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 00:48:09,847 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 00:48:09,849 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 00:48:09,850 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 00:48:09,852 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 00:48:09,854 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl-simplified/s3_clnt_2.cil-2.c [2022-04-07 00:48:09,943 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebfcc2454/1654adba092c486eb4ad45eda8899728/FLAG6d5a4f898 [2022-04-07 00:48:10,323 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 00:48:10,324 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_clnt_2.cil-2.c [2022-04-07 00:48:10,332 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebfcc2454/1654adba092c486eb4ad45eda8899728/FLAG6d5a4f898 [2022-04-07 00:48:10,340 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebfcc2454/1654adba092c486eb4ad45eda8899728 [2022-04-07 00:48:10,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 00:48:10,343 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 00:48:10,344 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 00:48:10,344 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 00:48:10,349 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 00:48:10,350 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 12:48:10" (1/1) ... [2022-04-07 00:48:10,351 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70088eab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:48:10, skipping insertion in model container [2022-04-07 00:48:10,351 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 12:48:10" (1/1) ... [2022-04-07 00:48:10,361 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 00:48:10,394 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 00:48:10,569 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_2.cil-2.c[35827,35840] [2022-04-07 00:48:10,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 00:48:10,578 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 00:48:10,606 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_2.cil-2.c[35827,35840] [2022-04-07 00:48:10,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 00:48:10,617 INFO L208 MainTranslator]: Completed translation [2022-04-07 00:48:10,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:48:10 WrapperNode [2022-04-07 00:48:10,618 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 00:48:10,619 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 00:48:10,619 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 00:48:10,619 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 00:48:10,626 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:10" (1/1) ... [2022-04-07 00:48:10,626 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:10" (1/1) ... [2022-04-07 00:48:10,645 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:10" (1/1) ... [2022-04-07 00:48:10,645 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:10" (1/1) ... [2022-04-07 00:48:10,654 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:10" (1/1) ... [2022-04-07 00:48:10,660 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:10" (1/1) ... [2022-04-07 00:48:10,662 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:10" (1/1) ... [2022-04-07 00:48:10,673 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 00:48:10,674 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 00:48:10,674 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 00:48:10,674 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 00:48:10,689 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:48:10" (1/1) ... [2022-04-07 00:48:10,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 00:48:10,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 00:48:10,716 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:10,733 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:10,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 00:48:10,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 00:48:10,747 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 00:48:10,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2022-04-07 00:48:10,747 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 00:48:10,747 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 00:48:10,748 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 00:48:10,748 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 00:48:10,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 00:48:10,748 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-07 00:48:10,748 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 00:48:10,748 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-07 00:48:10,748 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2022-04-07 00:48:10,748 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 00:48:10,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 00:48:10,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 00:48:10,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 00:48:10,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 00:48:10,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 00:48:10,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 00:48:10,859 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 00:48:10,860 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 00:48:10,938 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-07 00:48:11,239 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-04-07 00:48:11,239 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-04-07 00:48:11,243 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 00:48:11,248 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 00:48:11,248 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 00:48:11,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 12:48:11 BoogieIcfgContainer [2022-04-07 00:48:11,249 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 00:48:11,250 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 00:48:11,250 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 00:48:11,254 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 00:48:11,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 12:48:10" (1/3) ... [2022-04-07 00:48:11,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a0dd1be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 12:48:11, skipping insertion in model container [2022-04-07 00:48:11,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:48:10" (2/3) ... [2022-04-07 00:48:11,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a0dd1be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 12:48:11, skipping insertion in model container [2022-04-07 00:48:11,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 12:48:11" (3/3) ... [2022-04-07 00:48:11,256 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.cil-2.c [2022-04-07 00:48:11,261 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-07 00:48:11,261 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 00:48:11,289 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 00:48:11,293 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:11,293 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 00:48:11,307 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:11,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-07 00:48:11,313 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:11,314 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:11,314 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:11,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:11,323 INFO L85 PathProgramCache]: Analyzing trace with hash -53499867, now seen corresponding path program 1 times [2022-04-07 00:48:11,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:11,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [411402197] [2022-04-07 00:48:11,335 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:11,336 INFO L85 PathProgramCache]: Analyzing trace with hash -53499867, now seen corresponding path program 2 times [2022-04-07 00:48:11,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:11,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589846361] [2022-04-07 00:48:11,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:11,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:11,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:11,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:11,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:11,553 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:11,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:11,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589846361] [2022-04-07 00:48:11,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589846361] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:11,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:11,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:11,556 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:11,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [411402197] [2022-04-07 00:48:11,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [411402197] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:11,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:11,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:11,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662586825] [2022-04-07 00:48:11,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:11,567 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:48:11,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:11,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:48:11,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:48:11,596 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:11,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:11,943 INFO L93 Difference]: Finished difference Result 375 states and 629 transitions. [2022-04-07 00:48:11,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:48:11,945 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:11,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:11,955 INFO L225 Difference]: With dead ends: 375 [2022-04-07 00:48:11,955 INFO L226 Difference]: Without dead ends: 218 [2022-04-07 00:48:11,959 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:11,962 INFO L913 BasicCegarLoop]: 216 mSDtfsCounter, 576 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:48:11,963 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [578 Valid, 225 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 00:48:11,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-04-07 00:48:12,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2022-04-07 00:48:12,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 213 states have (on average 1.4929577464788732) internal successors, (318), 213 states have internal predecessors, (318), 3 states have call successors, (3), 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:12,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 322 transitions. [2022-04-07 00:48:12,014 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 322 transitions. Word has length 30 [2022-04-07 00:48:12,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:12,015 INFO L478 AbstractCegarLoop]: Abstraction has 218 states and 322 transitions. [2022-04-07 00:48:12,015 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:12,015 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 322 transitions. [2022-04-07 00:48:12,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-07 00:48:12,017 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:12,017 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:12,017 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 00:48:12,017 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:12,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:12,018 INFO L85 PathProgramCache]: Analyzing trace with hash 479708172, now seen corresponding path program 1 times [2022-04-07 00:48:12,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:12,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1090723781] [2022-04-07 00:48:12,019 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:12,019 INFO L85 PathProgramCache]: Analyzing trace with hash 479708172, now seen corresponding path program 2 times [2022-04-07 00:48:12,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:12,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334770328] [2022-04-07 00:48:12,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:12,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:12,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:12,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:12,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:12,098 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:12,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:12,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334770328] [2022-04-07 00:48:12,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334770328] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:12,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:12,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:12,106 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:12,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1090723781] [2022-04-07 00:48:12,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1090723781] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:12,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:12,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:12,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003240734] [2022-04-07 00:48:12,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:12,117 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:48:12,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:12,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:48:12,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:48:12,118 INFO L87 Difference]: Start difference. First operand 218 states and 322 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:12,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:12,324 INFO L93 Difference]: Finished difference Result 348 states and 521 transitions. [2022-04-07 00:48:12,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:48:12,325 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:12,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:12,328 INFO L225 Difference]: With dead ends: 348 [2022-04-07 00:48:12,330 INFO L226 Difference]: Without dead ends: 243 [2022-04-07 00:48:12,333 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:12,336 INFO L913 BasicCegarLoop]: 186 mSDtfsCounter, 189 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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:12,337 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:12,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-04-07 00:48:12,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 235. [2022-04-07 00:48:12,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 230 states have (on average 1.4782608695652173) internal successors, (340), 230 states have internal predecessors, (340), 3 states have call successors, (3), 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:12,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 344 transitions. [2022-04-07 00:48:12,361 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 344 transitions. Word has length 44 [2022-04-07 00:48:12,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:12,362 INFO L478 AbstractCegarLoop]: Abstraction has 235 states and 344 transitions. [2022-04-07 00:48:12,362 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:12,362 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 344 transitions. [2022-04-07 00:48:12,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-07 00:48:12,366 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:12,366 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:12,366 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 00:48:12,366 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:12,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:12,366 INFO L85 PathProgramCache]: Analyzing trace with hash -7403090, now seen corresponding path program 1 times [2022-04-07 00:48:12,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:12,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1720786386] [2022-04-07 00:48:12,367 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:12,367 INFO L85 PathProgramCache]: Analyzing trace with hash -7403090, now seen corresponding path program 2 times [2022-04-07 00:48:12,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:12,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337690784] [2022-04-07 00:48:12,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:12,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:12,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:12,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:12,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:12,488 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:12,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:12,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337690784] [2022-04-07 00:48:12,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337690784] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:12,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:12,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:12,490 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:12,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1720786386] [2022-04-07 00:48:12,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1720786386] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:12,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:12,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:12,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178718992] [2022-04-07 00:48:12,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:12,490 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:48:12,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:12,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:48:12,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:48:12,504 INFO L87 Difference]: Start difference. First operand 235 states and 344 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:12,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:12,731 INFO L93 Difference]: Finished difference Result 559 states and 849 transitions. [2022-04-07 00:48:12,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:48:12,732 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:12,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:12,734 INFO L225 Difference]: With dead ends: 559 [2022-04-07 00:48:12,734 INFO L226 Difference]: Without dead ends: 335 [2022-04-07 00:48:12,736 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:12,738 INFO L913 BasicCegarLoop]: 197 mSDtfsCounter, 209 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:48:12,743 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.2s Time] [2022-04-07 00:48:12,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2022-04-07 00:48:12,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 317. [2022-04-07 00:48:12,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 312 states have (on average 1.4102564102564104) internal successors, (440), 312 states have internal predecessors, (440), 3 states have call successors, (3), 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:12,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 444 transitions. [2022-04-07 00:48:12,785 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 444 transitions. Word has length 61 [2022-04-07 00:48:12,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:12,786 INFO L478 AbstractCegarLoop]: Abstraction has 317 states and 444 transitions. [2022-04-07 00:48:12,786 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:12,787 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 444 transitions. [2022-04-07 00:48:12,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-07 00:48:12,789 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:12,789 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:12,789 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-07 00:48:12,790 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:12,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:12,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1812841424, now seen corresponding path program 1 times [2022-04-07 00:48:12,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:12,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1584982660] [2022-04-07 00:48:12,794 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:12,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1812841424, now seen corresponding path program 2 times [2022-04-07 00:48:12,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:12,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195061421] [2022-04-07 00:48:12,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:12,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:12,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:12,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:12,854 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:12,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:12,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195061421] [2022-04-07 00:48:12,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195061421] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:12,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:12,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:12,855 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:12,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1584982660] [2022-04-07 00:48:12,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1584982660] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:12,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:12,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:12,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754449067] [2022-04-07 00:48:12,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:12,855 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:48:12,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:12,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:48:12,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:48:12,856 INFO L87 Difference]: Start difference. First operand 317 states and 444 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:13,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:13,004 INFO L93 Difference]: Finished difference Result 669 states and 952 transitions. [2022-04-07 00:48:13,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:48:13,005 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:13,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:13,007 INFO L225 Difference]: With dead ends: 669 [2022-04-07 00:48:13,007 INFO L226 Difference]: Without dead ends: 365 [2022-04-07 00:48:13,008 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:13,010 INFO L913 BasicCegarLoop]: 187 mSDtfsCounter, 191 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 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.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:48:13,012 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 194 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 00:48:13,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-04-07 00:48:13,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 355. [2022-04-07 00:48:13,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 350 states have (on average 1.3942857142857144) internal successors, (488), 350 states have internal predecessors, (488), 3 states have call successors, (3), 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:13,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 492 transitions. [2022-04-07 00:48:13,044 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 492 transitions. Word has length 61 [2022-04-07 00:48:13,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:13,044 INFO L478 AbstractCegarLoop]: Abstraction has 355 states and 492 transitions. [2022-04-07 00:48:13,045 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:13,045 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 492 transitions. [2022-04-07 00:48:13,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-07 00:48:13,045 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:13,046 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:13,046 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-07 00:48:13,046 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:13,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:13,046 INFO L85 PathProgramCache]: Analyzing trace with hash 140161555, now seen corresponding path program 1 times [2022-04-07 00:48:13,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:13,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [944389959] [2022-04-07 00:48:13,047 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:13,047 INFO L85 PathProgramCache]: Analyzing trace with hash 140161555, now seen corresponding path program 2 times [2022-04-07 00:48:13,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:13,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893691948] [2022-04-07 00:48:13,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:13,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:13,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:13,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:13,084 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:13,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:13,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893691948] [2022-04-07 00:48:13,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893691948] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:13,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:13,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:13,085 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:13,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [944389959] [2022-04-07 00:48:13,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [944389959] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:13,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:13,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:13,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387951852] [2022-04-07 00:48:13,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:13,085 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:48:13,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:13,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:48:13,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:48:13,086 INFO L87 Difference]: Start difference. First operand 355 states and 492 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:13,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:13,235 INFO L93 Difference]: Finished difference Result 803 states and 1151 transitions. [2022-04-07 00:48:13,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:48:13,236 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:13,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:13,238 INFO L225 Difference]: With dead ends: 803 [2022-04-07 00:48:13,238 INFO L226 Difference]: Without dead ends: 459 [2022-04-07 00:48:13,238 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:13,239 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.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:48:13,239 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.1s Time] [2022-04-07 00:48:13,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2022-04-07 00:48:13,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 433. [2022-04-07 00:48:13,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 428 states have (on average 1.4532710280373833) internal successors, (622), 428 states have internal predecessors, (622), 3 states have call successors, (3), 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:13,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 626 transitions. [2022-04-07 00:48:13,268 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 626 transitions. Word has length 74 [2022-04-07 00:48:13,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:13,269 INFO L478 AbstractCegarLoop]: Abstraction has 433 states and 626 transitions. [2022-04-07 00:48:13,269 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:13,269 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 626 transitions. [2022-04-07 00:48:13,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-07 00:48:13,270 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:13,270 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:13,271 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-07 00:48:13,271 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:13,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:13,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1706902904, now seen corresponding path program 1 times [2022-04-07 00:48:13,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:13,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2082336090] [2022-04-07 00:48:13,272 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:13,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1706902904, now seen corresponding path program 2 times [2022-04-07 00:48:13,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:13,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426532376] [2022-04-07 00:48:13,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:13,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:13,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:13,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:13,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:13,320 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:13,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:13,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426532376] [2022-04-07 00:48:13,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426532376] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:13,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:13,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:13,321 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:13,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2082336090] [2022-04-07 00:48:13,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2082336090] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:13,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:13,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:13,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471234205] [2022-04-07 00:48:13,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:13,322 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:48:13,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:13,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:48:13,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:48:13,322 INFO L87 Difference]: Start difference. First operand 433 states and 626 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:13,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:13,479 INFO L93 Difference]: Finished difference Result 901 states and 1312 transitions. [2022-04-07 00:48:13,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:48:13,479 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:13,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:13,483 INFO L225 Difference]: With dead ends: 901 [2022-04-07 00:48:13,483 INFO L226 Difference]: Without dead ends: 481 [2022-04-07 00:48:13,484 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:13,485 INFO L913 BasicCegarLoop]: 186 mSDtfsCounter, 185 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:48:13,486 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.1s Time] [2022-04-07 00:48:13,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2022-04-07 00:48:13,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 475. [2022-04-07 00:48:13,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 470 states have (on average 1.4340425531914893) internal successors, (674), 470 states have internal predecessors, (674), 3 states have call successors, (3), 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:13,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 678 transitions. [2022-04-07 00:48:13,528 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 678 transitions. Word has length 78 [2022-04-07 00:48:13,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:13,529 INFO L478 AbstractCegarLoop]: Abstraction has 475 states and 678 transitions. [2022-04-07 00:48:13,529 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:13,529 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 678 transitions. [2022-04-07 00:48:13,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-07 00:48:13,530 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:13,531 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:13,531 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-07 00:48:13,531 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:13,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:13,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1231515182, now seen corresponding path program 1 times [2022-04-07 00:48:13,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:13,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1120349362] [2022-04-07 00:48:13,533 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:13,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1231515182, now seen corresponding path program 2 times [2022-04-07 00:48:13,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:13,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877874536] [2022-04-07 00:48:13,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:13,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:13,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:13,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:13,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:13,610 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:13,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:13,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877874536] [2022-04-07 00:48:13,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877874536] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:13,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:13,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:13,613 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:13,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1120349362] [2022-04-07 00:48:13,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1120349362] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:13,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:13,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:13,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548221843] [2022-04-07 00:48:13,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:13,615 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:48:13,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:13,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:48:13,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:48:13,617 INFO L87 Difference]: Start difference. First operand 475 states and 678 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:13,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:13,815 INFO L93 Difference]: Finished difference Result 956 states and 1370 transitions. [2022-04-07 00:48:13,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:48:13,816 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:13,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:13,818 INFO L225 Difference]: With dead ends: 956 [2022-04-07 00:48:13,818 INFO L226 Difference]: Without dead ends: 714 [2022-04-07 00:48:13,819 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:13,819 INFO L913 BasicCegarLoop]: 316 mSDtfsCounter, 289 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:48:13,820 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [289 Valid, 323 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 00:48:13,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2022-04-07 00:48:13,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 714. [2022-04-07 00:48:13,849 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:13,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 1017 transitions. [2022-04-07 00:48:13,851 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 1017 transitions. Word has length 98 [2022-04-07 00:48:13,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:13,851 INFO L478 AbstractCegarLoop]: Abstraction has 714 states and 1017 transitions. [2022-04-07 00:48:13,851 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:13,852 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1017 transitions. [2022-04-07 00:48:13,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-07 00:48:13,855 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:13,855 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:13,855 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-07 00:48:13,855 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:13,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:13,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1910787436, now seen corresponding path program 1 times [2022-04-07 00:48:13,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:13,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [440001039] [2022-04-07 00:48:13,857 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:13,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1910787436, now seen corresponding path program 2 times [2022-04-07 00:48:13,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:13,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516483591] [2022-04-07 00:48:13,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:13,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:13,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:13,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:13,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:13,904 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:13,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:13,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516483591] [2022-04-07 00:48:13,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516483591] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:13,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:13,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:13,905 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:13,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [440001039] [2022-04-07 00:48:13,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [440001039] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:13,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:13,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:13,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130588667] [2022-04-07 00:48:13,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:13,906 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:48:13,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:13,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:48:13,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:48:13,907 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:14,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:14,074 INFO L93 Difference]: Finished difference Result 1216 states and 1731 transitions. [2022-04-07 00:48:14,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:48:14,075 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:14,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:14,077 INFO L225 Difference]: With dead ends: 1216 [2022-04-07 00:48:14,077 INFO L226 Difference]: Without dead ends: 735 [2022-04-07 00:48:14,078 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:14,078 INFO L913 BasicCegarLoop]: 197 mSDtfsCounter, 183 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:48:14,079 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.1s Time] [2022-04-07 00:48:14,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2022-04-07 00:48:14,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 735. [2022-04-07 00:48:14,106 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:14,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1044 transitions. [2022-04-07 00:48:14,109 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1044 transitions. Word has length 98 [2022-04-07 00:48:14,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:14,109 INFO L478 AbstractCegarLoop]: Abstraction has 735 states and 1044 transitions. [2022-04-07 00:48:14,109 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:14,109 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1044 transitions. [2022-04-07 00:48:14,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-07 00:48:14,110 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:14,110 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:14,110 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-07 00:48:14,111 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:14,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:14,111 INFO L85 PathProgramCache]: Analyzing trace with hash 2125104952, now seen corresponding path program 1 times [2022-04-07 00:48:14,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:14,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [424127197] [2022-04-07 00:48:14,112 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:14,112 INFO L85 PathProgramCache]: Analyzing trace with hash 2125104952, now seen corresponding path program 2 times [2022-04-07 00:48:14,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:14,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031931532] [2022-04-07 00:48:14,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:14,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:14,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:14,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:14,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:14,145 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:14,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:14,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031931532] [2022-04-07 00:48:14,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031931532] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:14,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:14,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:14,145 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:14,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [424127197] [2022-04-07 00:48:14,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [424127197] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:14,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:14,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:14,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499949874] [2022-04-07 00:48:14,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:14,146 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:48:14,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:14,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:48:14,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:48:14,147 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:14,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:14,305 INFO L93 Difference]: Finished difference Result 1262 states and 1788 transitions. [2022-04-07 00:48:14,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:48:14,305 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:14,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:14,308 INFO L225 Difference]: With dead ends: 1262 [2022-04-07 00:48:14,308 INFO L226 Difference]: Without dead ends: 760 [2022-04-07 00:48:14,309 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:14,309 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.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:48:14,309 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.1s Time] [2022-04-07 00:48:14,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2022-04-07 00:48:14,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 760. [2022-04-07 00:48:14,334 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:14,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1074 transitions. [2022-04-07 00:48:14,337 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1074 transitions. Word has length 100 [2022-04-07 00:48:14,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:14,337 INFO L478 AbstractCegarLoop]: Abstraction has 760 states and 1074 transitions. [2022-04-07 00:48:14,337 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:14,337 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1074 transitions. [2022-04-07 00:48:14,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-07 00:48:14,338 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:14,338 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:14,338 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-07 00:48:14,339 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:14,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:14,339 INFO L85 PathProgramCache]: Analyzing trace with hash -2035848838, now seen corresponding path program 1 times [2022-04-07 00:48:14,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:14,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [175794891] [2022-04-07 00:48:14,340 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:14,340 INFO L85 PathProgramCache]: Analyzing trace with hash -2035848838, now seen corresponding path program 2 times [2022-04-07 00:48:14,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:14,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356732646] [2022-04-07 00:48:14,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:14,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:14,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:14,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:14,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:14,369 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:14,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:14,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356732646] [2022-04-07 00:48:14,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356732646] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:14,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:14,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:14,370 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:14,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [175794891] [2022-04-07 00:48:14,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [175794891] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:14,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:14,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:14,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844827975] [2022-04-07 00:48:14,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:14,371 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:48:14,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:14,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:48:14,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:48:14,371 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:14,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:14,534 INFO L93 Difference]: Finished difference Result 1002 states and 1421 transitions. [2022-04-07 00:48:14,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:48:14,535 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:14,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:14,538 INFO L225 Difference]: With dead ends: 1002 [2022-04-07 00:48:14,538 INFO L226 Difference]: Without dead ends: 1000 [2022-04-07 00:48:14,538 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:14,539 INFO L913 BasicCegarLoop]: 164 mSDtfsCounter, 459 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:48:14,539 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.1s Time] [2022-04-07 00:48:14,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2022-04-07 00:48:14,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 1000. [2022-04-07 00:48:14,598 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:14,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1419 transitions. [2022-04-07 00:48:14,601 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1419 transitions. Word has length 100 [2022-04-07 00:48:14,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:14,602 INFO L478 AbstractCegarLoop]: Abstraction has 1000 states and 1419 transitions. [2022-04-07 00:48:14,602 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:14,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1419 transitions. [2022-04-07 00:48:14,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-04-07 00:48:14,604 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:14,604 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:48:14,604 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-07 00:48:14,604 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:14,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:14,605 INFO L85 PathProgramCache]: Analyzing trace with hash -967015081, now seen corresponding path program 1 times [2022-04-07 00:48:14,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:14,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [375881210] [2022-04-07 00:48:14,605 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:14,606 INFO L85 PathProgramCache]: Analyzing trace with hash -967015081, now seen corresponding path program 2 times [2022-04-07 00:48:14,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:14,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769929794] [2022-04-07 00:48:14,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:14,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:14,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:14,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:14,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:14,644 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2022-04-07 00:48:14,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:14,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769929794] [2022-04-07 00:48:14,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769929794] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:14,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:14,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:14,645 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:14,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [375881210] [2022-04-07 00:48:14,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [375881210] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:14,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:14,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:14,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958862988] [2022-04-07 00:48:14,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:14,646 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:48:14,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:14,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:48:14,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:48:14,646 INFO L87 Difference]: Start difference. First operand 1000 states and 1419 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have 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:14,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:14,868 INFO L93 Difference]: Finished difference Result 2191 states and 3161 transitions. [2022-04-07 00:48:14,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:48:14,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 1 states have call successors, (3), 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 169 [2022-04-07 00:48:14,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:14,874 INFO L225 Difference]: With dead ends: 2191 [2022-04-07 00:48:14,874 INFO L226 Difference]: Without dead ends: 1196 [2022-04-07 00:48:14,876 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:14,876 INFO L913 BasicCegarLoop]: 197 mSDtfsCounter, 238 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 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.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:48:14,877 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [238 Valid, 204 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 00:48:14,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2022-04-07 00:48:14,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 1156. [2022-04-07 00:48:14,923 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:14,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1659 transitions. [2022-04-07 00:48:14,926 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1659 transitions. Word has length 169 [2022-04-07 00:48:14,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:14,926 INFO L478 AbstractCegarLoop]: Abstraction has 1156 states and 1659 transitions. [2022-04-07 00:48:14,926 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have 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:14,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1659 transitions. [2022-04-07 00:48:14,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-04-07 00:48:14,929 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:14,929 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 6, 6, 4, 4, 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] [2022-04-07 00:48:14,929 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-07 00:48:14,929 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:14,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:14,930 INFO L85 PathProgramCache]: Analyzing trace with hash 671376038, now seen corresponding path program 1 times [2022-04-07 00:48:14,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:14,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2030892531] [2022-04-07 00:48:14,930 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:14,931 INFO L85 PathProgramCache]: Analyzing trace with hash 671376038, now seen corresponding path program 2 times [2022-04-07 00:48:14,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:14,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773197916] [2022-04-07 00:48:14,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:14,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:14,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:14,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:14,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:14,970 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 366 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2022-04-07 00:48:14,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:14,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773197916] [2022-04-07 00:48:14,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773197916] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:14,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:14,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:14,971 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:14,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2030892531] [2022-04-07 00:48:14,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2030892531] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:14,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:14,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:14,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332261089] [2022-04-07 00:48:14,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:14,971 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:48:14,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:14,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:48:14,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:48:14,972 INFO L87 Difference]: Start difference. First operand 1156 states and 1659 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (3), 2 states have 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:15,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:15,185 INFO L93 Difference]: Finished difference Result 2405 states and 3431 transitions. [2022-04-07 00:48:15,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:48:15,186 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (3), 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 205 [2022-04-07 00:48:15,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:15,189 INFO L225 Difference]: With dead ends: 2405 [2022-04-07 00:48:15,189 INFO L226 Difference]: Without dead ends: 1262 [2022-04-07 00:48:15,193 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:15,193 INFO L913 BasicCegarLoop]: 186 mSDtfsCounter, 187 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:48:15,193 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.1s Time] [2022-04-07 00:48:15,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2022-04-07 00:48:15,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 1248. [2022-04-07 00:48:15,240 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:15,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 1771 transitions. [2022-04-07 00:48:15,243 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 1771 transitions. Word has length 205 [2022-04-07 00:48:15,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:15,243 INFO L478 AbstractCegarLoop]: Abstraction has 1248 states and 1771 transitions. [2022-04-07 00:48:15,244 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (3), 2 states have 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:15,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1771 transitions. [2022-04-07 00:48:15,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-04-07 00:48:15,246 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:15,246 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:48:15,246 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-07 00:48:15,246 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:15,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:15,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1618228412, now seen corresponding path program 1 times [2022-04-07 00:48:15,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:15,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2109442120] [2022-04-07 00:48:15,249 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:15,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1618228412, now seen corresponding path program 2 times [2022-04-07 00:48:15,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:15,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788131684] [2022-04-07 00:48:15,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:15,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:15,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:15,296 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2022-04-07 00:48:15,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:15,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788131684] [2022-04-07 00:48:15,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788131684] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:15,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:15,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:15,296 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:15,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2109442120] [2022-04-07 00:48:15,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2109442120] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:15,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:15,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:15,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038486064] [2022-04-07 00:48:15,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:15,297 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:48:15,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:15,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:48:15,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:48:15,297 INFO L87 Difference]: Start difference. First operand 1248 states and 1771 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:15,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:15,510 INFO L93 Difference]: Finished difference Result 2595 states and 3673 transitions. [2022-04-07 00:48:15,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:48:15,511 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 226 [2022-04-07 00:48:15,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:15,515 INFO L225 Difference]: With dead ends: 2595 [2022-04-07 00:48:15,515 INFO L226 Difference]: Without dead ends: 1360 [2022-04-07 00:48:15,516 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:15,517 INFO L913 BasicCegarLoop]: 186 mSDtfsCounter, 184 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:48:15,517 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.1s Time] [2022-04-07 00:48:15,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2022-04-07 00:48:15,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 1348. [2022-04-07 00:48:15,571 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:15,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1891 transitions. [2022-04-07 00:48:15,574 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1891 transitions. Word has length 226 [2022-04-07 00:48:15,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:15,575 INFO L478 AbstractCegarLoop]: Abstraction has 1348 states and 1891 transitions. [2022-04-07 00:48:15,575 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:15,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1891 transitions. [2022-04-07 00:48:15,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2022-04-07 00:48:15,578 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:15,578 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 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] [2022-04-07 00:48:15,578 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-07 00:48:15,578 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:15,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:15,578 INFO L85 PathProgramCache]: Analyzing trace with hash 341161079, now seen corresponding path program 1 times [2022-04-07 00:48:15,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:15,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1537583719] [2022-04-07 00:48:15,579 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:15,579 INFO L85 PathProgramCache]: Analyzing trace with hash 341161079, now seen corresponding path program 2 times [2022-04-07 00:48:15,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:15,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915161736] [2022-04-07 00:48:15,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:15,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:15,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:15,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:15,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:15,632 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 546 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2022-04-07 00:48:15,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:15,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915161736] [2022-04-07 00:48:15,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915161736] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:15,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:15,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:15,632 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:15,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1537583719] [2022-04-07 00:48:15,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1537583719] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:15,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:15,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:15,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859690204] [2022-04-07 00:48:15,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:15,633 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:48:15,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:15,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:48:15,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:48:15,634 INFO L87 Difference]: Start difference. First operand 1348 states and 1891 transitions. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (3), 2 states have 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:15,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:15,828 INFO L93 Difference]: Finished difference Result 2803 states and 3925 transitions. [2022-04-07 00:48:15,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:48:15,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (3), 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 250 [2022-04-07 00:48:15,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:15,832 INFO L225 Difference]: With dead ends: 2803 [2022-04-07 00:48:15,832 INFO L226 Difference]: Without dead ends: 1468 [2022-04-07 00:48:15,835 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:15,835 INFO L913 BasicCegarLoop]: 186 mSDtfsCounter, 182 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:48:15,835 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.1s Time] [2022-04-07 00:48:15,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2022-04-07 00:48:15,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1460. [2022-04-07 00:48:15,959 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:15,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 2023 transitions. [2022-04-07 00:48:15,963 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 2023 transitions. Word has length 250 [2022-04-07 00:48:15,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:15,964 INFO L478 AbstractCegarLoop]: Abstraction has 1460 states and 2023 transitions. [2022-04-07 00:48:15,964 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (3), 2 states have 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:15,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 2023 transitions. [2022-04-07 00:48:15,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2022-04-07 00:48:15,967 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:15,967 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 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] [2022-04-07 00:48:15,967 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-07 00:48:15,968 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:15,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:15,968 INFO L85 PathProgramCache]: Analyzing trace with hash -243610571, now seen corresponding path program 1 times [2022-04-07 00:48:15,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:15,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [748568803] [2022-04-07 00:48:15,970 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:15,970 INFO L85 PathProgramCache]: Analyzing trace with hash -243610571, now seen corresponding path program 2 times [2022-04-07 00:48:15,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:15,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062849102] [2022-04-07 00:48:15,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:15,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:15,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:16,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:16,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:16,022 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 546 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2022-04-07 00:48:16,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:16,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062849102] [2022-04-07 00:48:16,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062849102] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:16,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:16,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:16,023 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:16,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [748568803] [2022-04-07 00:48:16,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [748568803] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:16,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:16,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:16,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536122025] [2022-04-07 00:48:16,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:16,024 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:48:16,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:16,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:48:16,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:48:16,025 INFO L87 Difference]: Start difference. First operand 1460 states and 2023 transitions. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (3), 2 states have 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:16,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:16,247 INFO L93 Difference]: Finished difference Result 3043 states and 4225 transitions. [2022-04-07 00:48:16,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:48:16,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (3), 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 250 [2022-04-07 00:48:16,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:16,252 INFO L225 Difference]: With dead ends: 3043 [2022-04-07 00:48:16,253 INFO L226 Difference]: Without dead ends: 1596 [2022-04-07 00:48:16,256 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:16,257 INFO L913 BasicCegarLoop]: 187 mSDtfsCounter, 184 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:48:16,257 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.1s Time] [2022-04-07 00:48:16,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2022-04-07 00:48:16,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1584. [2022-04-07 00:48:16,371 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:16,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2167 transitions. [2022-04-07 00:48:16,375 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2167 transitions. Word has length 250 [2022-04-07 00:48:16,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:16,375 INFO L478 AbstractCegarLoop]: Abstraction has 1584 states and 2167 transitions. [2022-04-07 00:48:16,375 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (3), 2 states have 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:16,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2167 transitions. [2022-04-07 00:48:16,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2022-04-07 00:48:16,379 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:16,379 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:48:16,379 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-07 00:48:16,379 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:16,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:16,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1220168023, now seen corresponding path program 1 times [2022-04-07 00:48:16,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:16,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [885658089] [2022-04-07 00:48:16,381 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:16,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1220168023, now seen corresponding path program 2 times [2022-04-07 00:48:16,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:16,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456213231] [2022-04-07 00:48:16,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:16,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:16,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:16,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:16,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:16,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 660 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2022-04-07 00:48:16,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:16,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456213231] [2022-04-07 00:48:16,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456213231] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:16,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:16,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:16,438 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:16,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [885658089] [2022-04-07 00:48:16,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [885658089] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:16,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:16,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:16,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907840953] [2022-04-07 00:48:16,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:16,439 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:48:16,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:16,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:48:16,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:48:16,439 INFO L87 Difference]: Start difference. First operand 1584 states and 2167 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (3), 2 states have 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:16,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:16,690 INFO L93 Difference]: Finished difference Result 4722 states and 6463 transitions. [2022-04-07 00:48:16,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:48:16,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (3), 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 280 [2022-04-07 00:48:16,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:16,700 INFO L225 Difference]: With dead ends: 4722 [2022-04-07 00:48:16,700 INFO L226 Difference]: Without dead ends: 3151 [2022-04-07 00:48:16,704 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:16,705 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.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:48:16,705 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.1s Time] [2022-04-07 00:48:16,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3151 states. [2022-04-07 00:48:16,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3151 to 3149. [2022-04-07 00:48:16,856 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:16,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3149 states to 3149 states and 4308 transitions. [2022-04-07 00:48:16,863 INFO L78 Accepts]: Start accepts. Automaton has 3149 states and 4308 transitions. Word has length 280 [2022-04-07 00:48:16,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:16,863 INFO L478 AbstractCegarLoop]: Abstraction has 3149 states and 4308 transitions. [2022-04-07 00:48:16,864 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (3), 2 states have 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:16,864 INFO L276 IsEmpty]: Start isEmpty. Operand 3149 states and 4308 transitions. [2022-04-07 00:48:16,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2022-04-07 00:48:16,871 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:16,871 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:48:16,871 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-07 00:48:16,871 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:16,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:16,872 INFO L85 PathProgramCache]: Analyzing trace with hash 635396373, now seen corresponding path program 1 times [2022-04-07 00:48:16,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:16,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1201100579] [2022-04-07 00:48:16,873 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:16,873 INFO L85 PathProgramCache]: Analyzing trace with hash 635396373, now seen corresponding path program 2 times [2022-04-07 00:48:16,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:16,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601456370] [2022-04-07 00:48:16,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:16,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:16,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:16,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:16,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:16,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 642 proven. 0 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2022-04-07 00:48:16,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:16,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601456370] [2022-04-07 00:48:16,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601456370] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:16,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:16,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:16,922 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:16,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1201100579] [2022-04-07 00:48:16,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1201100579] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:16,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:16,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:16,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209926610] [2022-04-07 00:48:16,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:16,923 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:48:16,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:16,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:48:16,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:48:16,924 INFO L87 Difference]: Start difference. First operand 3149 states and 4308 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (3), 2 states have 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:17,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:17,214 INFO L93 Difference]: Finished difference Result 6585 states and 9043 transitions. [2022-04-07 00:48:17,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:48:17,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (3), 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 280 [2022-04-07 00:48:17,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:17,225 INFO L225 Difference]: With dead ends: 6585 [2022-04-07 00:48:17,225 INFO L226 Difference]: Without dead ends: 3449 [2022-04-07 00:48:17,231 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:17,232 INFO L913 BasicCegarLoop]: 187 mSDtfsCounter, 183 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:48:17,232 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.1s Time] [2022-04-07 00:48:17,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3449 states. [2022-04-07 00:48:17,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3449 to 3433. [2022-04-07 00:48:17,376 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:17,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3433 states to 3433 states and 4632 transitions. [2022-04-07 00:48:17,383 INFO L78 Accepts]: Start accepts. Automaton has 3433 states and 4632 transitions. Word has length 280 [2022-04-07 00:48:17,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:17,383 INFO L478 AbstractCegarLoop]: Abstraction has 3433 states and 4632 transitions. [2022-04-07 00:48:17,383 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (3), 2 states have 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:17,383 INFO L276 IsEmpty]: Start isEmpty. Operand 3433 states and 4632 transitions. [2022-04-07 00:48:17,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2022-04-07 00:48:17,389 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:17,389 INFO L499 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 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, 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:17,389 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-07 00:48:17,389 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:17,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:17,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1636229011, now seen corresponding path program 1 times [2022-04-07 00:48:17,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:17,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1070718690] [2022-04-07 00:48:17,391 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:17,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1636229011, now seen corresponding path program 2 times [2022-04-07 00:48:17,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:17,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496574032] [2022-04-07 00:48:17,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:17,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:17,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:17,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:17,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1232 backedges. 734 proven. 0 refuted. 0 times theorem prover too weak. 498 trivial. 0 not checked. [2022-04-07 00:48:17,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:17,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496574032] [2022-04-07 00:48:17,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496574032] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:17,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:17,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:17,459 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:17,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1070718690] [2022-04-07 00:48:17,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1070718690] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:17,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:17,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:17,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651558503] [2022-04-07 00:48:17,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:17,459 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:48:17,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:17,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:48:17,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:48:17,460 INFO L87 Difference]: Start difference. First operand 3433 states and 4632 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (3), 2 states have 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:17,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:17,719 INFO L93 Difference]: Finished difference Result 7001 states and 9459 transitions. [2022-04-07 00:48:17,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:48:17,719 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (3), 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 304 [2022-04-07 00:48:17,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:17,730 INFO L225 Difference]: With dead ends: 7001 [2022-04-07 00:48:17,730 INFO L226 Difference]: Without dead ends: 3581 [2022-04-07 00:48:17,738 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:17,738 INFO L913 BasicCegarLoop]: 186 mSDtfsCounter, 182 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:48:17,739 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.1s Time] [2022-04-07 00:48:17,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3581 states. [2022-04-07 00:48:17,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3581 to 3565. [2022-04-07 00:48:17,947 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:17,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3565 states to 3565 states and 4784 transitions. [2022-04-07 00:48:17,953 INFO L78 Accepts]: Start accepts. Automaton has 3565 states and 4784 transitions. Word has length 304 [2022-04-07 00:48:17,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:17,954 INFO L478 AbstractCegarLoop]: Abstraction has 3565 states and 4784 transitions. [2022-04-07 00:48:17,954 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (3), 2 states have 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:17,954 INFO L276 IsEmpty]: Start isEmpty. Operand 3565 states and 4784 transitions. [2022-04-07 00:48:17,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2022-04-07 00:48:17,961 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:17,961 INFO L499 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:48:17,961 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-07 00:48:17,961 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:17,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:17,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1456115728, now seen corresponding path program 1 times [2022-04-07 00:48:17,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:17,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [514249249] [2022-04-07 00:48:17,963 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:17,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1456115728, now seen corresponding path program 2 times [2022-04-07 00:48:17,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:17,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649733236] [2022-04-07 00:48:17,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:17,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:17,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:18,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:18,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:18,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1244 backedges. 638 proven. 0 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2022-04-07 00:48:18,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:18,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649733236] [2022-04-07 00:48:18,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649733236] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:18,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:18,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:18,010 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:18,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [514249249] [2022-04-07 00:48:18,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [514249249] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:18,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:18,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:18,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347206373] [2022-04-07 00:48:18,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:18,011 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:48:18,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:18,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:48:18,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:48:18,012 INFO L87 Difference]: Start difference. First operand 3565 states and 4784 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (3), 2 states have 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:18,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:18,299 INFO L93 Difference]: Finished difference Result 7517 states and 10223 transitions. [2022-04-07 00:48:18,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:48:18,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (3), 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 315 [2022-04-07 00:48:18,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:18,317 INFO L225 Difference]: With dead ends: 7517 [2022-04-07 00:48:18,318 INFO L226 Difference]: Without dead ends: 3965 [2022-04-07 00:48:18,323 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:18,323 INFO L913 BasicCegarLoop]: 187 mSDtfsCounter, 232 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 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.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:48:18,323 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [232 Valid, 194 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 00:48:18,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3965 states. [2022-04-07 00:48:18,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3965 to 3877. [2022-04-07 00:48:18,488 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:18,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3877 states to 3877 states and 5152 transitions. [2022-04-07 00:48:18,495 INFO L78 Accepts]: Start accepts. Automaton has 3877 states and 5152 transitions. Word has length 315 [2022-04-07 00:48:18,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:18,495 INFO L478 AbstractCegarLoop]: Abstraction has 3877 states and 5152 transitions. [2022-04-07 00:48:18,496 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (3), 2 states have 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:18,496 INFO L276 IsEmpty]: Start isEmpty. Operand 3877 states and 5152 transitions. [2022-04-07 00:48:18,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2022-04-07 00:48:18,504 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:18,505 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 14, 12, 12, 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, 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] [2022-04-07 00:48:18,505 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-07 00:48:18,505 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:18,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:18,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1301874766, now seen corresponding path program 1 times [2022-04-07 00:48:18,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:18,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [684971625] [2022-04-07 00:48:18,507 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:18,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1301874766, now seen corresponding path program 2 times [2022-04-07 00:48:18,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:18,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956596308] [2022-04-07 00:48:18,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:18,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:18,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:18,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:18,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1340 backedges. 694 proven. 0 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked. [2022-04-07 00:48:18,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:18,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956596308] [2022-04-07 00:48:18,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956596308] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:18,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:18,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:18,554 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:18,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [684971625] [2022-04-07 00:48:18,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [684971625] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:18,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:18,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:18,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331655864] [2022-04-07 00:48:18,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:18,554 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:48:18,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:18,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:48:18,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:48:18,555 INFO L87 Difference]: Start difference. First operand 3877 states and 5152 transitions. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (3), 2 states have 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:18,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:18,867 INFO L93 Difference]: Finished difference Result 8149 states and 10767 transitions. [2022-04-07 00:48:18,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:48:18,867 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (3), 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 329 [2022-04-07 00:48:18,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:18,876 INFO L225 Difference]: With dead ends: 8149 [2022-04-07 00:48:18,876 INFO L226 Difference]: Without dead ends: 4285 [2022-04-07 00:48:18,882 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:18,883 INFO L913 BasicCegarLoop]: 185 mSDtfsCounter, 279 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:48:18,883 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.1s Time] [2022-04-07 00:48:18,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4285 states. [2022-04-07 00:48:19,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4285 to 3997. [2022-04-07 00:48:19,072 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:19,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3997 states to 3997 states and 5296 transitions. [2022-04-07 00:48:19,076 INFO L78 Accepts]: Start accepts. Automaton has 3997 states and 5296 transitions. Word has length 329 [2022-04-07 00:48:19,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:19,077 INFO L478 AbstractCegarLoop]: Abstraction has 3997 states and 5296 transitions. [2022-04-07 00:48:19,077 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (3), 2 states have 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:19,077 INFO L276 IsEmpty]: Start isEmpty. Operand 3997 states and 5296 transitions. [2022-04-07 00:48:19,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2022-04-07 00:48:19,084 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:19,084 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 14, 12, 12, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:48:19,084 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-07 00:48:19,084 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:19,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:19,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1272239000, now seen corresponding path program 1 times [2022-04-07 00:48:19,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:19,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [502094235] [2022-04-07 00:48:19,085 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:19,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1272239000, now seen corresponding path program 2 times [2022-04-07 00:48:19,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:19,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060947383] [2022-04-07 00:48:19,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:19,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:19,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:19,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:19,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1340 backedges. 799 proven. 0 refuted. 0 times theorem prover too weak. 541 trivial. 0 not checked. [2022-04-07 00:48:19,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:19,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060947383] [2022-04-07 00:48:19,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060947383] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:19,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:19,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:19,138 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:19,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [502094235] [2022-04-07 00:48:19,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [502094235] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:19,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:19,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:19,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821363999] [2022-04-07 00:48:19,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:19,138 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:48:19,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:19,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:48:19,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:48:19,139 INFO L87 Difference]: Start difference. First operand 3997 states and 5296 transitions. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (3), 2 states have 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:19,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:19,594 INFO L93 Difference]: Finished difference Result 11461 states and 15262 transitions. [2022-04-07 00:48:19,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:48:19,596 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (3), 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 330 [2022-04-07 00:48:19,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:19,614 INFO L225 Difference]: With dead ends: 11461 [2022-04-07 00:48:19,614 INFO L226 Difference]: Without dead ends: 7477 [2022-04-07 00:48:19,625 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:19,626 INFO L913 BasicCegarLoop]: 317 mSDtfsCounter, 261 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 324 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.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:48:19,626 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [261 Valid, 324 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 00:48:19,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7477 states. [2022-04-07 00:48:20,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7477 to 7475. [2022-04-07 00:48:20,021 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:20,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7475 states to 7475 states and 9958 transitions. [2022-04-07 00:48:20,034 INFO L78 Accepts]: Start accepts. Automaton has 7475 states and 9958 transitions. Word has length 330 [2022-04-07 00:48:20,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:20,035 INFO L478 AbstractCegarLoop]: Abstraction has 7475 states and 9958 transitions. [2022-04-07 00:48:20,035 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (3), 2 states have 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:20,035 INFO L276 IsEmpty]: Start isEmpty. Operand 7475 states and 9958 transitions. [2022-04-07 00:48:20,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2022-04-07 00:48:20,046 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:20,046 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 14, 12, 12, 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, 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:48:20,046 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-07 00:48:20,046 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:20,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:20,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1394133645, now seen corresponding path program 1 times [2022-04-07 00:48:20,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:20,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [216876067] [2022-04-07 00:48:20,048 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:20,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1394133645, now seen corresponding path program 2 times [2022-04-07 00:48:20,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:20,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965088503] [2022-04-07 00:48:20,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:20,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:20,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:20,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:20,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1340 backedges. 803 proven. 0 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2022-04-07 00:48:20,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:20,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965088503] [2022-04-07 00:48:20,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965088503] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:20,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:20,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:20,109 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:20,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [216876067] [2022-04-07 00:48:20,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [216876067] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:20,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:20,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:20,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362622972] [2022-04-07 00:48:20,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:20,110 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:48:20,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:20,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:48:20,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:48:20,111 INFO L87 Difference]: Start difference. First operand 7475 states and 9958 transitions. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (3), 2 states have 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:20,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:20,603 INFO L93 Difference]: Finished difference Result 14945 states and 19891 transitions. [2022-04-07 00:48:20,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:48:20,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (3), 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 331 [2022-04-07 00:48:20,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:20,663 INFO L225 Difference]: With dead ends: 14945 [2022-04-07 00:48:20,663 INFO L226 Difference]: Without dead ends: 7483 [2022-04-07 00:48:20,673 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:20,674 INFO L913 BasicCegarLoop]: 186 mSDtfsCounter, 182 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:48:20,674 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.2s Time] [2022-04-07 00:48:20,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7483 states. [2022-04-07 00:48:20,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7483 to 7451. [2022-04-07 00:48:20,955 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:20,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7451 states to 7451 states and 9678 transitions. [2022-04-07 00:48:20,968 INFO L78 Accepts]: Start accepts. Automaton has 7451 states and 9678 transitions. Word has length 331 [2022-04-07 00:48:20,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:20,968 INFO L478 AbstractCegarLoop]: Abstraction has 7451 states and 9678 transitions. [2022-04-07 00:48:20,968 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (3), 2 states have 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:20,968 INFO L276 IsEmpty]: Start isEmpty. Operand 7451 states and 9678 transitions. [2022-04-07 00:48:20,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2022-04-07 00:48:20,978 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:20,978 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20,979 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-07 00:48:20,979 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:20,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:20,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1780616869, now seen corresponding path program 1 times [2022-04-07 00:48:20,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:20,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1726246093] [2022-04-07 00:48:20,980 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:20,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1780616869, now seen corresponding path program 2 times [2022-04-07 00:48:20,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:20,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483745542] [2022-04-07 00:48:20,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:20,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:20,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:21,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:21,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:21,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1490 backedges. 874 proven. 10 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2022-04-07 00:48:21,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:21,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483745542] [2022-04-07 00:48:21,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483745542] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 00:48:21,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588372068] [2022-04-07 00:48:21,038 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 00:48:21,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 00:48:21,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 00:48:21,045 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:21,046 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:21,173 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 00:48:21,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 00:48:21,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-07 00:48:21,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 00:48:21,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1490 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2022-04-07 00:48:21,724 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 00:48:21,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588372068] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:21,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 00:48:21,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2022-04-07 00:48:21,725 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:21,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1726246093] [2022-04-07 00:48:21,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1726246093] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:21,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:21,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 00:48:21,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093672571] [2022-04-07 00:48:21,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:21,726 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 00:48:21,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:21,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 00:48:21,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-07 00:48:21,727 INFO L87 Difference]: Start difference. First operand 7451 states and 9678 transitions. Second operand has 5 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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:22,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:22,255 INFO L93 Difference]: Finished difference Result 15067 states and 19580 transitions. [2022-04-07 00:48:22,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 00:48:22,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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 354 [2022-04-07 00:48:22,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:22,271 INFO L225 Difference]: With dead ends: 15067 [2022-04-07 00:48:22,271 INFO L226 Difference]: Without dead ends: 7601 [2022-04-07 00:48:22,287 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 353 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:22,288 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.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:48:22,288 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.1s Time] [2022-04-07 00:48:22,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7601 states. [2022-04-07 00:48:22,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7601 to 7457. [2022-04-07 00:48:22,797 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:22,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7457 states to 7457 states and 9686 transitions. [2022-04-07 00:48:22,810 INFO L78 Accepts]: Start accepts. Automaton has 7457 states and 9686 transitions. Word has length 354 [2022-04-07 00:48:22,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:22,811 INFO L478 AbstractCegarLoop]: Abstraction has 7457 states and 9686 transitions. [2022-04-07 00:48:22,811 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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:22,811 INFO L276 IsEmpty]: Start isEmpty. Operand 7457 states and 9686 transitions. [2022-04-07 00:48:22,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2022-04-07 00:48:22,821 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:22,821 INFO L499 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22,839 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:23,035 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:23,035 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:23,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:23,036 INFO L85 PathProgramCache]: Analyzing trace with hash 640055986, now seen corresponding path program 1 times [2022-04-07 00:48:23,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:23,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [919558977] [2022-04-07 00:48:23,037 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:23,037 INFO L85 PathProgramCache]: Analyzing trace with hash 640055986, now seen corresponding path program 2 times [2022-04-07 00:48:23,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:23,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695183237] [2022-04-07 00:48:23,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:23,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:23,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:23,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:23,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 904 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2022-04-07 00:48:23,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:23,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695183237] [2022-04-07 00:48:23,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695183237] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 00:48:23,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803218204] [2022-04-07 00:48:23,118 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 00:48:23,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 00:48:23,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 00:48:23,119 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:48:23,134 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:48:23,250 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 00:48:23,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 00:48:23,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 734 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-07 00:48:23,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 00:48:23,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 904 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2022-04-07 00:48:23,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 00:48:24,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 904 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2022-04-07 00:48:24,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803218204] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 00:48:24,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 00:48:24,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-04-07 00:48:24,239 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:24,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [919558977] [2022-04-07 00:48:24,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [919558977] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:24,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:24,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 00:48:24,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657144052] [2022-04-07 00:48:24,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:24,240 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 00:48:24,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:24,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 00:48:24,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-07 00:48:24,241 INFO L87 Difference]: Start difference. First operand 7457 states and 9686 transitions. Second operand has 5 states, 5 states have (on average 36.8) internal successors, (184), 4 states have internal predecessors, (184), 1 states have call successors, (3), 2 states have 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:25,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:25,373 INFO L93 Difference]: Finished difference Result 14825 states and 19252 transitions. [2022-04-07 00:48:25,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 00:48:25,374 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 36.8) internal successors, (184), 4 states have internal predecessors, (184), 1 states have call successors, (3), 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 367 [2022-04-07 00:48:25,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:25,396 INFO L225 Difference]: With dead ends: 14825 [2022-04-07 00:48:25,397 INFO L226 Difference]: Without dead ends: 11185 [2022-04-07 00:48:25,407 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 745 GetRequests, 737 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:48:25,408 INFO L913 BasicCegarLoop]: 362 mSDtfsCounter, 336 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 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.4s IncrementalHoareTripleChecker+Time [2022-04-07 00:48:25,408 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 374 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-07 00:48:25,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11185 states. [2022-04-07 00:48:25,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11185 to 8561. [2022-04-07 00:48:25,955 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:48:25,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8561 states to 8561 states and 11182 transitions. [2022-04-07 00:48:25,969 INFO L78 Accepts]: Start accepts. Automaton has 8561 states and 11182 transitions. Word has length 367 [2022-04-07 00:48:25,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:25,969 INFO L478 AbstractCegarLoop]: Abstraction has 8561 states and 11182 transitions. [2022-04-07 00:48:25,969 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.8) internal successors, (184), 4 states have internal predecessors, (184), 1 states have call successors, (3), 2 states have 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:25,970 INFO L276 IsEmpty]: Start isEmpty. Operand 8561 states and 11182 transitions. [2022-04-07 00:48:25,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2022-04-07 00:48:25,981 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:25,981 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,000 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:48:26,201 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:48:26,201 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:26,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:26,201 INFO L85 PathProgramCache]: Analyzing trace with hash 101382063, now seen corresponding path program 3 times [2022-04-07 00:48:26,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:26,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1243233785] [2022-04-07 00:48:26,202 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:26,203 INFO L85 PathProgramCache]: Analyzing trace with hash 101382063, now seen corresponding path program 4 times [2022-04-07 00:48:26,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:26,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222113237] [2022-04-07 00:48:26,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:26,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:26,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:26,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:26,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-04-07 00:48:26,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:26,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222113237] [2022-04-07 00:48:26,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222113237] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 00:48:26,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366236764] [2022-04-07 00:48:26,256 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-07 00:48:26,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 00:48:26,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 00:48:26,257 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:48:26,258 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:48:26,368 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-07 00:48:26,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 00:48:26,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 766 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-07 00:48:26,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 00:48:26,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-04-07 00:48:26,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 00:48:27,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-04-07 00:48:27,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366236764] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 00:48:27,181 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 00:48:27,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-04-07 00:48:27,181 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:27,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1243233785] [2022-04-07 00:48:27,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1243233785] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:27,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:27,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 00:48:27,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777110841] [2022-04-07 00:48:27,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:27,182 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 00:48:27,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:27,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 00:48:27,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-07 00:48:27,183 INFO L87 Difference]: Start difference. First operand 8561 states and 11182 transitions. Second operand has 5 states, 5 states have (on average 37.6) internal successors, (188), 4 states have internal predecessors, (188), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:28,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:28,135 INFO L93 Difference]: Finished difference Result 19299 states and 25058 transitions. [2022-04-07 00:48:28,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 00:48:28,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.6) internal successors, (188), 4 states have internal predecessors, (188), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 380 [2022-04-07 00:48:28,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:28,154 INFO L225 Difference]: With dead ends: 19299 [2022-04-07 00:48:28,155 INFO L226 Difference]: Without dead ends: 10749 [2022-04-07 00:48:28,170 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 769 GetRequests, 762 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-07 00:48:28,171 INFO L913 BasicCegarLoop]: 202 mSDtfsCounter, 494 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 00:48:28,174 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [494 Valid, 214 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 00:48:28,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10749 states. [2022-04-07 00:48:28,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10749 to 8599. [2022-04-07 00:48:28,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8599 states, 8594 states have (on average 1.2754247149173843) internal successors, (10961), 8594 states have internal predecessors, (10961), 3 states have call successors, (3), 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:28,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8599 states to 8599 states and 10965 transitions. [2022-04-07 00:48:28,735 INFO L78 Accepts]: Start accepts. Automaton has 8599 states and 10965 transitions. Word has length 380 [2022-04-07 00:48:28,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:28,736 INFO L478 AbstractCegarLoop]: Abstraction has 8599 states and 10965 transitions. [2022-04-07 00:48:28,736 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.6) internal successors, (188), 4 states have internal predecessors, (188), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:28,736 INFO L276 IsEmpty]: Start isEmpty. Operand 8599 states and 10965 transitions. [2022-04-07 00:48:28,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2022-04-07 00:48:28,748 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:28,749 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,783 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:48:28,963 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:48:28,963 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:28,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:28,964 INFO L85 PathProgramCache]: Analyzing trace with hash 617327076, now seen corresponding path program 1 times [2022-04-07 00:48:28,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:28,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1254728524] [2022-04-07 00:48:28,965 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:28,965 INFO L85 PathProgramCache]: Analyzing trace with hash 617327076, now seen corresponding path program 2 times [2022-04-07 00:48:28,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:28,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599028895] [2022-04-07 00:48:28,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:28,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:29,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:29,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:29,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:29,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 885 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2022-04-07 00:48:29,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:29,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599028895] [2022-04-07 00:48:29,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599028895] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:29,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:29,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:29,081 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:29,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1254728524] [2022-04-07 00:48:29,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1254728524] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:29,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:29,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:48:29,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656312713] [2022-04-07 00:48:29,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:29,082 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:48:29,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:29,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:48:29,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:48:29,083 INFO L87 Difference]: Start difference. First operand 8599 states and 10965 transitions. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:29,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:29,868 INFO L93 Difference]: Finished difference Result 16055 states and 19918 transitions. [2022-04-07 00:48:29,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:48:29,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 419 [2022-04-07 00:48:29,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:29,877 INFO L225 Difference]: With dead ends: 16055 [2022-04-07 00:48:29,877 INFO L226 Difference]: Without dead ends: 3851 [2022-04-07 00:48:29,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:29,895 INFO L913 BasicCegarLoop]: 188 mSDtfsCounter, 208 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:48:29,897 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 195 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 00:48:29,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3851 states. [2022-04-07 00:48:30,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3851 to 3661. [2022-04-07 00:48:30,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3661 states, 3656 states have (on average 1.2464442013129102) internal successors, (4557), 3656 states have internal predecessors, (4557), 3 states have call successors, (3), 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:30,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3661 states to 3661 states and 4561 transitions. [2022-04-07 00:48:30,102 INFO L78 Accepts]: Start accepts. Automaton has 3661 states and 4561 transitions. Word has length 419 [2022-04-07 00:48:30,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:30,102 INFO L478 AbstractCegarLoop]: Abstraction has 3661 states and 4561 transitions. [2022-04-07 00:48:30,102 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:48:30,102 INFO L276 IsEmpty]: Start isEmpty. Operand 3661 states and 4561 transitions. [2022-04-07 00:48:30,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2022-04-07 00:48:30,107 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:30,108 INFO L499 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 17, 17, 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, 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:30,108 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-07 00:48:30,108 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:30,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:30,108 INFO L85 PathProgramCache]: Analyzing trace with hash 421546763, now seen corresponding path program 1 times [2022-04-07 00:48:30,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:30,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [293876790] [2022-04-07 00:48:30,111 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:30,111 INFO L85 PathProgramCache]: Analyzing trace with hash 421546763, now seen corresponding path program 2 times [2022-04-07 00:48:30,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:30,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814605931] [2022-04-07 00:48:30,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:30,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:30,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:30,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:30,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:30,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1648 proven. 14 refuted. 0 times theorem prover too weak. 1236 trivial. 0 not checked. [2022-04-07 00:48:30,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:30,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814605931] [2022-04-07 00:48:30,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814605931] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 00:48:30,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404910157] [2022-04-07 00:48:30,184 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 00:48:30,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 00:48:30,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 00:48:30,187 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:48:30,189 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:48:30,338 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 00:48:30,338 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 00:48:30,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 934 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-07 00:48:30,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 00:48:31,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1075 proven. 0 refuted. 0 times theorem prover too weak. 1823 trivial. 0 not checked. [2022-04-07 00:48:31,104 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 00:48:31,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404910157] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:31,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 00:48:31,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-04-07 00:48:31,105 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:31,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [293876790] [2022-04-07 00:48:31,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [293876790] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:31,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:31,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 00:48:31,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473077129] [2022-04-07 00:48:31,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:31,105 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 00:48:31,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:31,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 00:48:31,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 00:48:31,106 INFO L87 Difference]: Start difference. First operand 3661 states and 4561 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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:48:31,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:31,355 INFO L93 Difference]: Finished difference Result 4076 states and 5041 transitions. [2022-04-07 00:48:31,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 00:48:31,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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 517 [2022-04-07 00:48:31,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:31,361 INFO L225 Difference]: With dead ends: 4076 [2022-04-07 00:48:31,361 INFO L226 Difference]: Without dead ends: 3999 [2022-04-07 00:48:31,362 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 518 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 00:48:31,362 INFO L913 BasicCegarLoop]: 306 mSDtfsCounter, 56 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 00:48:31,362 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 462 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 00:48:31,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3999 states. [2022-04-07 00:48:31,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3999 to 3586. [2022-04-07 00:48:31,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3586 states, 3581 states have (on average 1.246579167830215) internal successors, (4464), 3581 states have internal predecessors, (4464), 3 states have call successors, (3), 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:31,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3586 states to 3586 states and 4468 transitions. [2022-04-07 00:48:31,565 INFO L78 Accepts]: Start accepts. Automaton has 3586 states and 4468 transitions. Word has length 517 [2022-04-07 00:48:31,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:31,565 INFO L478 AbstractCegarLoop]: Abstraction has 3586 states and 4468 transitions. [2022-04-07 00:48:31,565 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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:48:31,565 INFO L276 IsEmpty]: Start isEmpty. Operand 3586 states and 4468 transitions. [2022-04-07 00:48:31,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 630 [2022-04-07 00:48:31,571 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:48:31,572 INFO L499 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 21, 19, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:48:31,605 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:48:31,787 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,SelfDestructingSolverStorable26 [2022-04-07 00:48:31,788 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:48:31,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:48:31,788 INFO L85 PathProgramCache]: Analyzing trace with hash -806626322, now seen corresponding path program 1 times [2022-04-07 00:48:31,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:31,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1086498043] [2022-04-07 00:48:31,790 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:48:31,790 INFO L85 PathProgramCache]: Analyzing trace with hash -806626322, now seen corresponding path program 2 times [2022-04-07 00:48:31,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:48:31,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000840037] [2022-04-07 00:48:31,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:48:31,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:48:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:31,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:48:31,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:48:31,868 INFO L134 CoverageAnalysis]: Checked inductivity of 4135 backedges. 2131 proven. 14 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2022-04-07 00:48:31,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:48:31,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000840037] [2022-04-07 00:48:31,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000840037] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 00:48:31,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417409286] [2022-04-07 00:48:31,869 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 00:48:31,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 00:48:31,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 00:48:31,870 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:48:31,887 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:48:32,029 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 00:48:32,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 00:48:32,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 1075 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-07 00:48:32,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 00:48:32,582 INFO L134 CoverageAnalysis]: Checked inductivity of 4135 backedges. 2131 proven. 14 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2022-04-07 00:48:32,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 00:48:33,326 INFO L134 CoverageAnalysis]: Checked inductivity of 4135 backedges. 2131 proven. 14 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2022-04-07 00:48:33,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417409286] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 00:48:33,326 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 00:48:33,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-04-07 00:48:33,327 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:48:33,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1086498043] [2022-04-07 00:48:33,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1086498043] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:48:33,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:48:33,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 00:48:33,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631241082] [2022-04-07 00:48:33,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:48:33,328 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 00:48:33,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:48:33,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 00:48:33,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-07 00:48:33,328 INFO L87 Difference]: Start difference. First operand 3586 states and 4468 transitions. Second operand has 5 states, 5 states have (on average 44.8) internal successors, (224), 4 states have internal predecessors, (224), 1 states have call successors, (3), 2 states have 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:33,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:48:33,634 INFO L93 Difference]: Finished difference Result 4428 states and 5511 transitions. [2022-04-07 00:48:33,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 00:48:33,635 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.8) internal successors, (224), 4 states have internal predecessors, (224), 1 states have call successors, (3), 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 629 [2022-04-07 00:48:33,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:48:33,635 INFO L225 Difference]: With dead ends: 4428 [2022-04-07 00:48:33,635 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 00:48:33,647 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 1267 GetRequests, 1258 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:48:33,648 INFO L913 BasicCegarLoop]: 225 mSDtfsCounter, 202 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:48:33,648 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 237 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 00:48:33,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 00:48:33,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 00:48:33,649 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:48:33,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 00:48:33,649 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 629 [2022-04-07 00:48:33,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:48:33,649 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 00:48:33,649 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.8) internal successors, (224), 4 states have internal predecessors, (224), 1 states have call successors, (3), 2 states have 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:33,649 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 00:48:33,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 00:48:33,652 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 00:48:33,673 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:48:33,859 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:48:33,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-07 00:50:03,218 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 13) no Hoare annotation was computed. [2022-04-07 00:50:03,219 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 13) no Hoare annotation was computed. [2022-04-07 00:50:03,219 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 13) no Hoare annotation was computed. [2022-04-07 00:50:03,219 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 564 574) the Hoare annotation is: true [2022-04-07 00:50:03,219 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 564 574) the Hoare annotation is: true [2022-04-07 00:50:03,219 INFO L878 garLoopResultBuilder]: At program point L570(line 570) the Hoare annotation is: (<= 12292 main_~s~0) [2022-04-07 00:50:03,219 INFO L885 garLoopResultBuilder]: At program point L570-1(line 570) the Hoare annotation is: true [2022-04-07 00:50:03,219 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 564 574) the Hoare annotation is: true [2022-04-07 00:50:03,219 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-07 00:50:03,219 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:03,219 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-07 00:50:03,220 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_~blastFlag~0 0)) (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:03,220 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:03,220 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_~blastFlag~0 0)) (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:03,220 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:03,220 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:03,220 INFO L878 garLoopResultBuilder]: At program point L532(lines 532 548) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse4)) (.cse11 (= ssl3_connect_~s__state~0 4464)) (.cse10 (= 4496 ssl3_connect_~s__state~0)) (.cse16 (<= 4352 ssl3_connect_~s__state~0)) (.cse17 (<= ssl3_connect_~s__state~0 4352)) (.cse13 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse12 (= 4400 ssl3_connect_~s__state~0)) (.cse9 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse14 (= ssl3_connect_~s__state~0 4416)) (.cse15 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse18 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse2 .cse4) (and .cse8 .cse4 .cse9) (and .cse8 .cse4 .cse10) (and .cse8 .cse4 .cse11) (and .cse8 .cse12 .cse4 .cse6) (and .cse2 .cse9) (and .cse0 .cse8 .cse1 .cse4 .cse13) (and .cse14 .cse8 .cse4 .cse6) (and .cse8 .cse4 .cse15) (and .cse16 .cse17 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse4 .cse11 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse10 .cse6) (and .cse16 .cse17 .cse8 .cse4 .cse13) (and .cse12 .cse2 .cse4) (and .cse14 .cse2 .cse4) (and .cse4 .cse9 .cse6) (and .cse8 .cse7) (and .cse18 .cse8 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse8 .cse4 .cse5) (and .cse14 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse15 .cse6) (and .cse18 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse18 .cse2)))) [2022-04-07 00:50:03,220 INFO L878 garLoopResultBuilder]: At program point L533(lines 533 547) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse4)) (.cse11 (= ssl3_connect_~s__state~0 4464)) (.cse10 (= 4496 ssl3_connect_~s__state~0)) (.cse16 (<= 4352 ssl3_connect_~s__state~0)) (.cse17 (<= ssl3_connect_~s__state~0 4352)) (.cse13 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse12 (= 4400 ssl3_connect_~s__state~0)) (.cse9 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse14 (= ssl3_connect_~s__state~0 4416)) (.cse15 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse18 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse2 .cse4) (and .cse8 .cse4 .cse9) (and .cse8 .cse4 .cse10) (and .cse8 .cse4 .cse11) (and .cse8 .cse12 .cse4 .cse6) (and .cse2 .cse9) (and .cse0 .cse8 .cse1 .cse4 .cse13) (and .cse14 .cse8 .cse4 .cse6) (and .cse8 .cse4 .cse15) (and .cse16 .cse17 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse4 .cse11 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse10 .cse6) (and .cse16 .cse17 .cse8 .cse4 .cse13) (and .cse12 .cse2 .cse4) (and .cse14 .cse2 .cse4) (and .cse4 .cse9 .cse6) (and .cse8 .cse7) (and .cse18 .cse8 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse8 .cse4 .cse5) (and .cse14 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse15 .cse6) (and .cse18 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse18 .cse2)))) [2022-04-07 00:50:03,220 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)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (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:03,220 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)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (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:03,220 INFO L878 garLoopResultBuilder]: At program point L302(lines 302 304) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (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:03,221 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:03,221 INFO L878 garLoopResultBuilder]: At program point L302-2(lines 300 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) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (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:03,221 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 .cse1 .cse2 (not .cse3) (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= 4432 ssl3_connect_~s__state~0) .cse1) (= ssl3_connect_~blastFlag~0 0) (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:03,221 INFO L878 garLoopResultBuilder]: At program point L170(lines 170 512) the Hoare annotation is: (let ((.cse5 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse5)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse12 (= 3 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4352)) (.cse4 (<= 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)) (.cse11 (<= ssl3_connect_~blastFlag~0 4)) (.cse13 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse4 .cse5 .cse7) (and .cse2 .cse6) (and .cse0 .cse4 .cse1 .cse5 .cse8) (and .cse4 .cse5 .cse9) (and .cse10 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse5 .cse7 .cse11) (and .cse10 .cse12 .cse2 .cse5) (and .cse5 .cse6 .cse11) (and .cse4 .cse12) (and .cse13 .cse4 .cse5) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse10 .cse4 .cse5 .cse8) (and .cse5 .cse9 .cse11) (and .cse13 .cse5 .cse11) (and .cse13 .cse2)))) [2022-04-07 00:50:03,221 INFO L878 garLoopResultBuilder]: At program point L137(lines 137 523) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse10 (= ssl3_connect_~s__state~0 4464)) (.cse3 (not .cse4)) (.cse9 (= 4496 ssl3_connect_~s__state~0)) (.cse11 (= 4400 ssl3_connect_~s__state~0)) (.cse8 (= 4512 ssl3_connect_~s__state~0)) (.cse16 (= 3 ssl3_connect_~s__state~0)) (.cse15 (<= ssl3_connect_~s__state~0 4352)) (.cse12 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse7 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse13 (= ssl3_connect_~s__state~0 4416)) (.cse14 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse17 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse4 .cse8) (and .cse7 .cse4 .cse9) (and .cse7 .cse4 .cse10) (and .cse7 .cse11 .cse4 .cse6) (and .cse2 .cse8) (and .cse0 .cse7 .cse1 .cse4 .cse12) (and .cse13 .cse7 .cse4 .cse6) (and .cse7 .cse4 .cse14) (and .cse4 .cse10 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (and .cse15 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse9 .cse6) (and .cse15 .cse16 .cse2 .cse4) (and .cse11 .cse2 .cse4) (and .cse13 .cse2 .cse4) (and .cse4 .cse8 .cse6) (and .cse7 .cse16) (and .cse17 .cse7 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse15 .cse7 .cse4 .cse12) (and .cse7 .cse4 .cse5) (and .cse13 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse14 .cse6) (and .cse17 .cse4 .cse6) (and .cse17 .cse2)))) [2022-04-07 00:50:03,221 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:03,221 INFO L878 garLoopResultBuilder]: At program point L534(lines 534 539) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse4)) (.cse11 (= ssl3_connect_~s__state~0 4464)) (.cse10 (= 4496 ssl3_connect_~s__state~0)) (.cse16 (<= 4352 ssl3_connect_~s__state~0)) (.cse17 (<= ssl3_connect_~s__state~0 4352)) (.cse13 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse12 (= 4400 ssl3_connect_~s__state~0)) (.cse9 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse14 (= ssl3_connect_~s__state~0 4416)) (.cse15 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse18 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse2 .cse4) (and .cse8 .cse4 .cse9) (and .cse8 .cse4 .cse10) (and .cse8 .cse4 .cse11) (and .cse8 .cse12 .cse4 .cse6) (and .cse2 .cse9) (and .cse0 .cse8 .cse1 .cse4 .cse13) (and .cse14 .cse8 .cse4 .cse6) (and .cse8 .cse4 .cse15) (and .cse16 .cse17 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse4 .cse11 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse10 .cse6) (and .cse16 .cse17 .cse8 .cse4 .cse13) (and .cse12 .cse2 .cse4) (and .cse14 .cse2 .cse4) (and .cse4 .cse9 .cse6) (and .cse8 .cse7) (and .cse18 .cse8 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse8 .cse4 .cse5) (and .cse14 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse15 .cse6) (and .cse18 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse18 .cse2)))) [2022-04-07 00:50:03,221 INFO L878 garLoopResultBuilder]: At program point L534-2(lines 533 547) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse4)) (.cse11 (= ssl3_connect_~s__state~0 4464)) (.cse10 (= 4496 ssl3_connect_~s__state~0)) (.cse16 (<= 4352 ssl3_connect_~s__state~0)) (.cse17 (<= ssl3_connect_~s__state~0 4352)) (.cse13 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse12 (= 4400 ssl3_connect_~s__state~0)) (.cse9 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse14 (= ssl3_connect_~s__state~0 4416)) (.cse15 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse18 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse2 .cse4) (and .cse8 .cse4 .cse9) (and .cse8 .cse4 .cse10) (and .cse8 .cse4 .cse11) (and .cse8 .cse12 .cse4 .cse6) (and .cse2 .cse9) (and .cse0 .cse8 .cse1 .cse4 .cse13) (and .cse14 .cse8 .cse4 .cse6) (and .cse8 .cse4 .cse15) (and .cse16 .cse17 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse4 .cse11 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse10 .cse6) (and .cse16 .cse17 .cse8 .cse4 .cse13) (and .cse12 .cse2 .cse4) (and .cse14 .cse2 .cse4) (and .cse4 .cse9 .cse6) (and .cse8 .cse7) (and .cse18 .cse8 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse8 .cse4 .cse5) (and .cse14 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse15 .cse6) (and .cse18 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse18 .cse2)))) [2022-04-07 00:50:03,221 INFO L878 garLoopResultBuilder]: At program point L204(lines 200 502) the Hoare annotation is: (let ((.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4560 ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) (not .cse2)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-07 00:50:03,222 INFO L878 garLoopResultBuilder]: At program point L138(lines 134 524) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 (= ssl3_connect_~blastFlag~0 1) .cse1) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-07 00:50:03,222 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:03,222 INFO L878 garLoopResultBuilder]: At program point L536(lines 536 538) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse4)) (.cse11 (= ssl3_connect_~s__state~0 4464)) (.cse10 (= 4496 ssl3_connect_~s__state~0)) (.cse16 (<= 4352 ssl3_connect_~s__state~0)) (.cse17 (<= ssl3_connect_~s__state~0 4352)) (.cse13 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse12 (= 4400 ssl3_connect_~s__state~0)) (.cse9 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse14 (= ssl3_connect_~s__state~0 4416)) (.cse15 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse18 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse2 .cse4) (and .cse8 .cse4 .cse9) (and .cse8 .cse4 .cse10) (and .cse8 .cse4 .cse11) (and .cse8 .cse12 .cse4 .cse6) (and .cse2 .cse9) (and .cse0 .cse8 .cse1 .cse4 .cse13) (and .cse14 .cse8 .cse4 .cse6) (and .cse8 .cse4 .cse15) (and .cse16 .cse17 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse4 .cse11 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse10 .cse6) (and .cse16 .cse17 .cse8 .cse4 .cse13) (and .cse12 .cse2 .cse4) (and .cse14 .cse2 .cse4) (and .cse4 .cse9 .cse6) (and .cse8 .cse7) (and .cse18 .cse8 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse8 .cse4 .cse5) (and .cse14 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse15 .cse6) (and .cse18 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse18 .cse2)))) [2022-04-07 00:50:03,222 INFO L878 garLoopResultBuilder]: At program point L206(lines 206 500) the Hoare annotation is: (let ((.cse1 (= 2 ssl3_connect_~blastFlag~0)) (.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))) (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 .cse1 (not .cse2) (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse3 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-07 00:50:03,222 INFO L878 garLoopResultBuilder]: At program point L173(lines 173 511) the Hoare annotation is: (let ((.cse5 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse5)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse12 (= 3 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4352)) (.cse4 (<= 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)) (.cse11 (<= ssl3_connect_~blastFlag~0 4)) (.cse13 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse4 .cse5 .cse7) (and .cse2 .cse6) (and .cse0 .cse4 .cse1 .cse5 .cse8) (and .cse4 .cse5 .cse9) (and .cse10 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse5 .cse7 .cse11) (and .cse10 .cse12 .cse2 .cse5) (and .cse5 .cse6 .cse11) (and .cse4 .cse12) (and .cse13 .cse4 .cse5) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse10 .cse4 .cse5 .cse8) (and .cse5 .cse9 .cse11) (and .cse13 .cse5 .cse11) (and .cse13 .cse2)))) [2022-04-07 00:50:03,222 INFO L878 garLoopResultBuilder]: At program point L140(lines 140 522) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse10 (= ssl3_connect_~s__state~0 4464)) (.cse3 (not .cse4)) (.cse9 (= 4496 ssl3_connect_~s__state~0)) (.cse11 (= 4400 ssl3_connect_~s__state~0)) (.cse8 (= 4512 ssl3_connect_~s__state~0)) (.cse16 (= 3 ssl3_connect_~s__state~0)) (.cse15 (<= ssl3_connect_~s__state~0 4352)) (.cse12 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse7 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse13 (= ssl3_connect_~s__state~0 4416)) (.cse14 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse17 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse4 .cse8) (and .cse7 .cse4 .cse9) (and .cse7 .cse4 .cse10) (and .cse7 .cse11 .cse4 .cse6) (and .cse2 .cse8) (and .cse0 .cse7 .cse1 .cse4 .cse12) (and .cse13 .cse7 .cse4 .cse6) (and .cse7 .cse4 .cse14) (and .cse4 .cse10 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (and .cse15 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse9 .cse6) (and .cse15 .cse16 .cse2 .cse4) (and .cse11 .cse2 .cse4) (and .cse13 .cse2 .cse4) (and .cse4 .cse8 .cse6) (and .cse7 .cse16) (and .cse17 .cse7 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse15 .cse7 .cse4 .cse12) (and .cse7 .cse4 .cse5) (and .cse13 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse14 .cse6) (and .cse17 .cse4 .cse6) (and .cse17 .cse2)))) [2022-04-07 00:50:03,222 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)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (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:03,222 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)) (.cse4 (= ssl3_connect_~blastFlag~0 0)) (.cse3 (= 4496 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (= 4512 ssl3_connect_~s__state~0)) (.cse5 (<= ssl3_connect_~blastFlag~0 4))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse3) (and .cse4 .cse3) (and .cse4 .cse2) (and .cse1 .cse3 .cse5) (and .cse1 .cse2 .cse5) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-07 00:50:03,222 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:03,222 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)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) (not .cse2) (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (and .cse0 .cse1 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-07 00:50:03,223 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)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (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:03,223 INFO L885 garLoopResultBuilder]: At program point L472-1(lines 472 474) the Hoare annotation is: true [2022-04-07 00:50:03,223 INFO L878 garLoopResultBuilder]: At program point L274(lines 274 276) 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:03,223 INFO L885 garLoopResultBuilder]: At program point L209(lines 209 499) the Hoare annotation is: true [2022-04-07 00:50:03,223 INFO L878 garLoopResultBuilder]: At program point L176(lines 176 510) the Hoare annotation is: (let ((.cse5 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse5)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse12 (= 3 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4352)) (.cse4 (<= 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)) (.cse11 (<= ssl3_connect_~blastFlag~0 4)) (.cse13 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse4 .cse5 .cse7) (and .cse2 .cse6) (and .cse0 .cse4 .cse1 .cse5 .cse8) (and .cse4 .cse5 .cse9) (and .cse10 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse5 .cse7 .cse11) (and .cse10 .cse12 .cse2 .cse5) (and .cse5 .cse6 .cse11) (and .cse4 .cse12) (and .cse13 .cse4 .cse5) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse10 .cse4 .cse5 .cse8) (and .cse5 .cse9 .cse11) (and .cse13 .cse5 .cse11) (and .cse13 .cse2)))) [2022-04-07 00:50:03,223 INFO L878 garLoopResultBuilder]: At program point L143(lines 143 521) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse10 (= ssl3_connect_~s__state~0 4464)) (.cse3 (not .cse4)) (.cse9 (= 4496 ssl3_connect_~s__state~0)) (.cse8 (= 4512 ssl3_connect_~s__state~0)) (.cse15 (= 3 ssl3_connect_~s__state~0)) (.cse14 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse7 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4416)) (.cse13 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse16 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse4 .cse8) (and .cse7 .cse4 .cse9) (and .cse7 .cse4 .cse10) (and .cse2 .cse8) (and .cse0 .cse7 .cse1 .cse4 .cse11) (and .cse12 .cse7 .cse4 .cse6) (and .cse7 .cse4 .cse13) (and .cse4 .cse10 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (and .cse14 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse9 .cse6) (and .cse14 .cse15 .cse2 .cse4) (and .cse12 .cse2 .cse4) (and .cse4 .cse8 .cse6) (and .cse7 .cse15) (and .cse16 .cse7 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse14 .cse7 .cse4 .cse11) (and .cse7 .cse4 .cse5) (and .cse12 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse13 .cse6) (and .cse16 .cse4 .cse6) (and .cse16 .cse2)))) [2022-04-07 00:50:03,223 INFO L878 garLoopResultBuilder]: At program point L110-1(lines 87 562) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse4)) (.cse11 (= ssl3_connect_~s__state~0 4464)) (.cse10 (= 4496 ssl3_connect_~s__state~0)) (.cse16 (<= 4352 ssl3_connect_~s__state~0)) (.cse17 (<= ssl3_connect_~s__state~0 4352)) (.cse13 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse12 (= 4400 ssl3_connect_~s__state~0)) (.cse9 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse14 (= ssl3_connect_~s__state~0 4416)) (.cse15 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse18 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse2 .cse4) (and .cse8 .cse4 .cse9) (and .cse8 .cse4 .cse10) (and .cse8 .cse4 .cse11) (and .cse8 .cse12 .cse4 .cse6) (and .cse2 .cse9) (and .cse0 .cse8 .cse1 .cse4 .cse13) (and .cse14 .cse8 .cse4 .cse6) (and .cse8 .cse4 .cse15) (and .cse16 .cse17 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse4 .cse11 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse10 .cse6) (and .cse16 .cse17 .cse8 .cse4 .cse13) (and .cse12 .cse2 .cse4) (and .cse14 .cse2 .cse4) (and .cse4 .cse9 .cse6) (and .cse8 .cse7) (and .cse18 .cse8 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse8 .cse4 .cse5) (and .cse14 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse15 .cse6) (and .cse18 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse18 .cse2)))) [2022-04-07 00:50:03,223 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_~blastFlag~0 0)) (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:03,223 INFO L885 garLoopResultBuilder]: At program point L210(lines 209 499) the Hoare annotation is: true [2022-04-07 00:50:03,223 INFO L878 garLoopResultBuilder]: At program point L144(lines 140 522) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (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:03,224 INFO L878 garLoopResultBuilder]: At program point L111(line 111) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse4)) (.cse11 (= ssl3_connect_~s__state~0 4464)) (.cse10 (= 4496 ssl3_connect_~s__state~0)) (.cse16 (<= 4352 ssl3_connect_~s__state~0)) (.cse17 (<= ssl3_connect_~s__state~0 4352)) (.cse13 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse12 (= 4400 ssl3_connect_~s__state~0)) (.cse9 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse14 (= ssl3_connect_~s__state~0 4416)) (.cse15 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse18 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse2 .cse4) (and .cse8 .cse4 .cse9) (and .cse8 .cse4 .cse10) (and .cse8 .cse4 .cse11) (and .cse8 .cse12 .cse4 .cse6) (and .cse2 .cse9) (and .cse0 .cse8 .cse1 .cse4 .cse13) (and .cse14 .cse8 .cse4 .cse6) (and .cse8 .cse4 .cse15) (and .cse16 .cse17 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse4 .cse11 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse10 .cse6) (and .cse16 .cse17 .cse8 .cse4 .cse13) (and .cse12 .cse2 .cse4) (and .cse14 .cse2 .cse4) (and .cse4 .cse9 .cse6) (and .cse8 .cse7) (and .cse18 .cse8 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse8 .cse4 .cse5) (and .cse14 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse15 .cse6) (and .cse18 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse18 .cse2)))) [2022-04-07 00:50:03,224 INFO L878 garLoopResultBuilder]: At program point L541(lines 541 545) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse4)) (.cse11 (= ssl3_connect_~s__state~0 4464)) (.cse10 (= 4496 ssl3_connect_~s__state~0)) (.cse16 (<= 4352 ssl3_connect_~s__state~0)) (.cse17 (<= ssl3_connect_~s__state~0 4352)) (.cse13 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse12 (= 4400 ssl3_connect_~s__state~0)) (.cse9 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse14 (= ssl3_connect_~s__state~0 4416)) (.cse15 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse18 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse2 .cse4) (and .cse8 .cse4 .cse9) (and .cse8 .cse4 .cse10) (and .cse8 .cse4 .cse11) (and .cse8 .cse12 .cse4 .cse6) (and .cse2 .cse9) (and .cse0 .cse8 .cse1 .cse4 .cse13) (and .cse14 .cse8 .cse4 .cse6) (and .cse8 .cse4 .cse15) (and .cse16 .cse17 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse4 .cse11 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse10 .cse6) (and .cse16 .cse17 .cse8 .cse4 .cse13) (and .cse12 .cse2 .cse4) (and .cse14 .cse2 .cse4) (and .cse4 .cse9 .cse6) (and .cse8 .cse7) (and .cse18 .cse8 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse8 .cse4 .cse5) (and .cse14 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse15 .cse6) (and .cse18 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse18 .cse2)))) [2022-04-07 00:50:03,224 INFO L878 garLoopResultBuilder]: At program point L443(lines 443 445) the Hoare annotation is: (let ((.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4560 ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) (not .cse2)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-07 00:50:03,224 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)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (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:03,224 INFO L885 garLoopResultBuilder]: At program point L212(lines 211 499) the Hoare annotation is: true [2022-04-07 00:50:03,224 INFO L878 garLoopResultBuilder]: At program point L179(lines 179 509) the Hoare annotation is: (let ((.cse5 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse5)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse11 (= 3 ssl3_connect_~s__state~0)) (.cse9 (<= ssl3_connect_~s__state~0 4352)) (.cse4 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse8 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse10 (<= ssl3_connect_~blastFlag~0 4)) (.cse12 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse4 .cse5 .cse7) (and .cse2 .cse6) (and .cse0 .cse4 .cse1 .cse5 .cse8) (and .cse9 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse5 .cse7 .cse10) (and .cse9 .cse11 .cse2 .cse5) (and .cse5 .cse6 .cse10) (and .cse4 .cse11) (and .cse12 .cse4 .cse5) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse9 .cse4 .cse5 .cse8) (and .cse12 .cse5 .cse10) (and .cse12 .cse2)))) [2022-04-07 00:50:03,224 INFO L878 garLoopResultBuilder]: At program point L146(lines 146 520) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse10 (= ssl3_connect_~s__state~0 4464)) (.cse3 (not .cse4)) (.cse9 (= 4496 ssl3_connect_~s__state~0)) (.cse8 (= 4512 ssl3_connect_~s__state~0)) (.cse15 (= 3 ssl3_connect_~s__state~0)) (.cse14 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse7 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4416)) (.cse13 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse16 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse4 .cse8) (and .cse7 .cse4 .cse9) (and .cse7 .cse4 .cse10) (and .cse2 .cse8) (and .cse0 .cse7 .cse1 .cse4 .cse11) (and .cse12 .cse7 .cse4 .cse6) (and .cse7 .cse4 .cse13) (and .cse4 .cse10 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (and .cse14 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse9 .cse6) (and .cse14 .cse15 .cse2 .cse4) (and .cse12 .cse2 .cse4) (and .cse4 .cse8 .cse6) (and .cse7 .cse15) (and .cse16 .cse7 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse14 .cse7 .cse4 .cse11) (and .cse7 .cse4 .cse5) (and .cse12 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse13 .cse6) (and .cse16 .cse4 .cse6) (and .cse16 .cse2)))) [2022-04-07 00:50:03,224 INFO L878 garLoopResultBuilder]: At program point L113(lines 113 531) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse4)) (.cse11 (= ssl3_connect_~s__state~0 4464)) (.cse10 (= 4496 ssl3_connect_~s__state~0)) (.cse16 (<= 4352 ssl3_connect_~s__state~0)) (.cse17 (<= ssl3_connect_~s__state~0 4352)) (.cse13 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse12 (= 4400 ssl3_connect_~s__state~0)) (.cse9 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse14 (= ssl3_connect_~s__state~0 4416)) (.cse15 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse18 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse2 .cse4) (and .cse8 .cse4 .cse9) (and .cse8 .cse4 .cse10) (and .cse8 .cse4 .cse11) (and .cse8 .cse12 .cse4 .cse6) (and .cse2 .cse9) (and .cse0 .cse8 .cse1 .cse4 .cse13) (and .cse14 .cse8 .cse4 .cse6) (and .cse8 .cse4 .cse15) (and .cse16 .cse17 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse4 .cse11 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse10 .cse6) (and .cse16 .cse17 .cse8 .cse4 .cse13) (and .cse12 .cse2 .cse4) (and .cse14 .cse2 .cse4) (and .cse4 .cse9 .cse6) (and .cse8 .cse7) (and .cse18 .cse8 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse8 .cse4 .cse5) (and .cse14 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse15 .cse6) (and .cse18 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse18 .cse2)))) [2022-04-07 00:50:03,224 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)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (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:03,225 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:03,225 INFO L885 garLoopResultBuilder]: At program point L478(lines 478 480) the Hoare annotation is: true [2022-04-07 00:50:03,225 INFO L885 garLoopResultBuilder]: At program point L478-2(lines 478 480) the Hoare annotation is: true [2022-04-07 00:50:03,225 INFO L878 garLoopResultBuilder]: At program point L446(lines 446 450) the Hoare annotation is: (let ((.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4560 ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) (not .cse2)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-07 00:50:03,225 INFO L878 garLoopResultBuilder]: At program point L446-2(lines 446 450) the Hoare annotation is: (let ((.cse2 (= ssl3_connect_~s__hit~0 0))) (let ((.cse3 (= ssl3_connect_~blastFlag~0 0)) (.cse0 (= 3 ssl3_connect_~s__state~0)) (.cse1 (= 2 ssl3_connect_~blastFlag~0)) (.cse4 (not .cse2)) (.cse5 (= 4512 ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse0 .cse3 .cse2) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse2) (and .cse1 .cse4 .cse5)))) [2022-04-07 00:50:03,225 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)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (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:03,225 INFO L878 garLoopResultBuilder]: At program point L281(lines 281 283) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 (= ssl3_connect_~blastFlag~0 1) .cse1) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-07 00:50:03,225 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_~blastFlag~0 0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__cert_req~0 0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse6 (= ssl3_connect_~s__state~0 4480)) (.cse3 (<= ssl3_connect_~blastFlag~0 4))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse5 .cse0 .cse1 .cse6) (and .cse5 .cse4 .cse6) (and .cse5 .cse1 .cse6 .cse3) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-07 00:50:03,225 INFO L878 garLoopResultBuilder]: At program point L281-2(lines 213 496) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0)))) [2022-04-07 00:50:03,225 INFO L878 garLoopResultBuilder]: At program point L182(lines 182 508) the Hoare annotation is: (let ((.cse5 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse5)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse11 (= 3 ssl3_connect_~s__state~0)) (.cse9 (<= ssl3_connect_~s__state~0 4352)) (.cse4 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse8 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse10 (<= ssl3_connect_~blastFlag~0 4)) (.cse12 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse4 .cse5 .cse7) (and .cse2 .cse6) (and .cse0 .cse4 .cse1 .cse5 .cse8) (and .cse9 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse5 .cse7 .cse10) (and .cse9 .cse11 .cse2 .cse5) (and .cse5 .cse6 .cse10) (and .cse4 .cse11) (and .cse12 .cse4 .cse5) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse9 .cse4 .cse5 .cse8) (and .cse12 .cse5 .cse10) (and .cse12 .cse2)))) [2022-04-07 00:50:03,225 INFO L878 garLoopResultBuilder]: At program point L149(lines 149 519) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse10 (= ssl3_connect_~s__state~0 4464)) (.cse3 (not .cse4)) (.cse9 (= 4496 ssl3_connect_~s__state~0)) (.cse8 (= 4512 ssl3_connect_~s__state~0)) (.cse14 (= 3 ssl3_connect_~s__state~0)) (.cse13 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse7 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse15 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse4 .cse8) (and .cse7 .cse4 .cse9) (and .cse7 .cse4 .cse10) (and .cse2 .cse8) (and .cse0 .cse7 .cse1 .cse4 .cse11) (and .cse7 .cse4 .cse12) (and .cse4 .cse10 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (and .cse13 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse9 .cse6) (and .cse13 .cse14 .cse2 .cse4) (and .cse4 .cse8 .cse6) (and .cse7 .cse14) (and .cse15 .cse7 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse13 .cse7 .cse4 .cse11) (and .cse7 .cse4 .cse5) (and .cse4 .cse12 .cse6) (and .cse15 .cse4 .cse6) (and .cse15 .cse2)))) [2022-04-07 00:50:03,226 INFO L878 garLoopResultBuilder]: At program point L116(lines 116 530) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse4)) (.cse11 (= ssl3_connect_~s__state~0 4464)) (.cse10 (= 4496 ssl3_connect_~s__state~0)) (.cse16 (<= 4352 ssl3_connect_~s__state~0)) (.cse17 (<= ssl3_connect_~s__state~0 4352)) (.cse13 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse12 (= 4400 ssl3_connect_~s__state~0)) (.cse9 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse14 (= ssl3_connect_~s__state~0 4416)) (.cse15 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse18 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse2 .cse4) (and .cse8 .cse4 .cse9) (and .cse8 .cse4 .cse10) (and .cse8 .cse4 .cse11) (and .cse8 .cse12 .cse4 .cse6) (and .cse2 .cse9) (and .cse0 .cse8 .cse1 .cse4 .cse13) (and .cse14 .cse8 .cse4 .cse6) (and .cse8 .cse4 .cse15) (and .cse16 .cse17 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse4 .cse11 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse10 .cse6) (and .cse16 .cse17 .cse8 .cse4 .cse13) (and .cse12 .cse2 .cse4) (and .cse14 .cse2 .cse4) (and .cse4 .cse9 .cse6) (and .cse8 .cse7) (and .cse18 .cse8 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse8 .cse4 .cse5) (and .cse14 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse15 .cse6) (and .cse18 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse18 .cse2)))) [2022-04-07 00:50:03,226 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) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (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:03,226 INFO L885 garLoopResultBuilder]: At program point ssl3_connectENTRY(lines 22 563) the Hoare annotation is: true [2022-04-07 00:50:03,226 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) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (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:03,226 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:03,226 INFO L878 garLoopResultBuilder]: At program point L316-2(lines 213 496) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~blastFlag~0 4)))) [2022-04-07 00:50:03,226 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)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (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:03,226 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)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (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:03,226 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:03,226 INFO L878 garLoopResultBuilder]: At program point L185(lines 185 507) the Hoare annotation is: (let ((.cse5 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse5)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse9 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__state~0 4352)) (.cse4 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse7 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse10 (<= ssl3_connect_~blastFlag~0 4)) (.cse11 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse2 .cse6) (and .cse0 .cse4 .cse1 .cse5 .cse7) (and .cse8 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse8 .cse9 .cse2 .cse5) (and .cse5 .cse6 .cse10) (and .cse4 .cse9) (and .cse11 .cse4 .cse5) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse8 .cse4 .cse5 .cse7) (and .cse11 .cse5 .cse10) (and .cse11 .cse2)))) [2022-04-07 00:50:03,226 INFO L878 garLoopResultBuilder]: At program point L152(lines 152 518) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse10 (= ssl3_connect_~s__state~0 4464)) (.cse3 (not .cse4)) (.cse9 (= 4496 ssl3_connect_~s__state~0)) (.cse8 (= 4512 ssl3_connect_~s__state~0)) (.cse14 (= 3 ssl3_connect_~s__state~0)) (.cse13 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse7 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse15 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse4 .cse8) (and .cse7 .cse4 .cse9) (and .cse7 .cse4 .cse10) (and .cse2 .cse8) (and .cse0 .cse7 .cse1 .cse4 .cse11) (and .cse7 .cse4 .cse12) (and .cse4 .cse10 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (and .cse13 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse9 .cse6) (and .cse13 .cse14 .cse2 .cse4) (and .cse4 .cse8 .cse6) (and .cse7 .cse14) (and .cse15 .cse7 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse13 .cse7 .cse4 .cse11) (and .cse7 .cse4 .cse5) (and .cse4 .cse12 .cse6) (and .cse15 .cse4 .cse6) (and .cse15 .cse2)))) [2022-04-07 00:50:03,227 INFO L878 garLoopResultBuilder]: At program point L119(lines 119 529) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse4)) (.cse11 (= ssl3_connect_~s__state~0 4464)) (.cse10 (= 4496 ssl3_connect_~s__state~0)) (.cse16 (<= 4352 ssl3_connect_~s__state~0)) (.cse17 (<= ssl3_connect_~s__state~0 4352)) (.cse13 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse12 (= 4400 ssl3_connect_~s__state~0)) (.cse9 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse14 (= ssl3_connect_~s__state~0 4416)) (.cse15 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse18 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse2 .cse4) (and .cse8 .cse4 .cse9) (and .cse8 .cse4 .cse10) (and .cse8 .cse4 .cse11) (and .cse8 .cse12 .cse4 .cse6) (and .cse2 .cse9) (and .cse0 .cse8 .cse1 .cse4 .cse13) (and .cse14 .cse8 .cse4 .cse6) (and .cse8 .cse4 .cse15) (and .cse16 .cse17 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse4 .cse11 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse10 .cse6) (and .cse16 .cse17 .cse8 .cse4 .cse13) (and .cse12 .cse2 .cse4) (and .cse14 .cse2 .cse4) (and .cse4 .cse9 .cse6) (and .cse8 .cse7) (and .cse18 .cse8 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse8 .cse4 .cse5) (and .cse14 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse15 .cse6) (and .cse18 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse18 .cse2)))) [2022-04-07 00:50:03,227 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)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (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:03,227 INFO L885 garLoopResultBuilder]: At program point L484(lines 484 486) the Hoare annotation is: true [2022-04-07 00:50:03,227 INFO L885 garLoopResultBuilder]: At program point L484-2(lines 484 486) the Hoare annotation is: true [2022-04-07 00:50:03,227 INFO L885 garLoopResultBuilder]: At program point L551(lines 109 552) the Hoare annotation is: true [2022-04-07 00:50:03,227 INFO L878 garLoopResultBuilder]: At program point L287(lines 287 291) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0)))) [2022-04-07 00:50:03,227 INFO L878 garLoopResultBuilder]: At program point L287-2(lines 287 291) the Hoare annotation is: (let ((.cse5 (= ssl3_connect_~s__hit~0 0))) (let ((.cse2 (= 2 ssl3_connect_~blastFlag~0)) (.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse5)) (.cse4 (= 4400 ssl3_connect_~s__state~0)) (.cse6 (= ssl3_connect_~blastFlag~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse4 .cse5 (<= ssl3_connect_~blastFlag~0 4)) (and .cse4 .cse2 .cse5) (and .cse0 .cse1 .cse6 .cse3) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse4 .cse6 .cse5)))) [2022-04-07 00:50:03,227 INFO L878 garLoopResultBuilder]: At program point L188(lines 188 506) the Hoare annotation is: (let ((.cse5 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse5)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse9 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__state~0 4352)) (.cse4 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse7 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse10 (<= ssl3_connect_~blastFlag~0 4)) (.cse11 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse2 .cse6) (and .cse0 .cse4 .cse1 .cse5 .cse7) (and .cse8 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse8 .cse9 .cse2 .cse5) (and .cse5 .cse6 .cse10) (and .cse4 .cse9) (and .cse11 .cse4 .cse5) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse8 .cse4 .cse5 .cse7) (and .cse11 .cse5 .cse10) (and .cse11 .cse2)))) [2022-04-07 00:50:03,227 INFO L878 garLoopResultBuilder]: At program point L155(lines 155 517) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse10 (= ssl3_connect_~s__state~0 4464)) (.cse3 (not .cse4)) (.cse9 (= 4496 ssl3_connect_~s__state~0)) (.cse8 (= 4512 ssl3_connect_~s__state~0)) (.cse14 (= 3 ssl3_connect_~s__state~0)) (.cse13 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse7 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse15 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse4 .cse8) (and .cse7 .cse4 .cse9) (and .cse7 .cse4 .cse10) (and .cse2 .cse8) (and .cse0 .cse7 .cse1 .cse4 .cse11) (and .cse7 .cse4 .cse12) (and .cse4 .cse10 .cse6) (and .cse13 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse9 .cse6) (and .cse13 .cse14 .cse2 .cse4) (and .cse4 .cse8 .cse6) (and .cse7 .cse14) (and .cse15 .cse7 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse13 .cse7 .cse4 .cse11) (and .cse7 .cse4 .cse5) (and .cse4 .cse12 .cse6) (and .cse15 .cse4 .cse6) (and .cse15 .cse2)))) [2022-04-07 00:50:03,227 INFO L878 garLoopResultBuilder]: At program point L122(lines 122 528) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse4)) (.cse11 (= ssl3_connect_~s__state~0 4464)) (.cse10 (= 4496 ssl3_connect_~s__state~0)) (.cse16 (<= 4352 ssl3_connect_~s__state~0)) (.cse17 (<= ssl3_connect_~s__state~0 4352)) (.cse13 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse12 (= 4400 ssl3_connect_~s__state~0)) (.cse9 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse14 (= ssl3_connect_~s__state~0 4416)) (.cse15 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse18 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse2 .cse4) (and .cse8 .cse4 .cse9) (and .cse8 .cse4 .cse10) (and .cse8 .cse4 .cse11) (and .cse8 .cse12 .cse4 .cse6) (and .cse2 .cse9) (and .cse0 .cse8 .cse1 .cse4 .cse13) (and .cse14 .cse8 .cse4 .cse6) (and .cse8 .cse4 .cse15) (and .cse16 .cse17 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse4 .cse11 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse10 .cse6) (and .cse16 .cse17 .cse8 .cse4 .cse13) (and .cse12 .cse2 .cse4) (and .cse14 .cse2 .cse4) (and .cse4 .cse9 .cse6) (and .cse8 .cse7) (and .cse18 .cse8 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse8 .cse4 .cse5) (and .cse14 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse15 .cse6) (and .cse18 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse18 .cse2)))) [2022-04-07 00:50:03,227 INFO L878 garLoopResultBuilder]: At program point L156(lines 152 518) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 .cse1 (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-07 00:50:03,227 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:03,228 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:03,228 INFO L878 garLoopResultBuilder]: At program point L191(lines 191 505) the Hoare annotation is: (let ((.cse5 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse5)) (.cse8 (= 3 ssl3_connect_~s__state~0)) (.cse7 (<= ssl3_connect_~s__state~0 4352)) (.cse4 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse6 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse9 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse1 .cse5 .cse6) (and .cse7 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse7 .cse8 .cse2 .cse5) (and .cse4 .cse8) (and .cse9 .cse4 .cse5) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse7 .cse4 .cse5 .cse6) (and .cse9 .cse5 (<= ssl3_connect_~blastFlag~0 4)) (and .cse9 .cse2)))) [2022-04-07 00:50:03,228 INFO L878 garLoopResultBuilder]: At program point L158(lines 158 516) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse10 (= ssl3_connect_~s__state~0 4464)) (.cse3 (not .cse4)) (.cse9 (= 4496 ssl3_connect_~s__state~0)) (.cse8 (= 4512 ssl3_connect_~s__state~0)) (.cse14 (= 3 ssl3_connect_~s__state~0)) (.cse13 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse7 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse15 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse4 .cse8) (and .cse7 .cse4 .cse9) (and .cse7 .cse4 .cse10) (and .cse2 .cse8) (and .cse0 .cse7 .cse1 .cse4 .cse11) (and .cse7 .cse4 .cse12) (and .cse4 .cse10 .cse6) (and .cse13 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse9 .cse6) (and .cse13 .cse14 .cse2 .cse4) (and .cse4 .cse8 .cse6) (and .cse7 .cse14) (and .cse15 .cse7 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse13 .cse7 .cse4 .cse11) (and .cse7 .cse4 .cse5) (and .cse4 .cse12 .cse6) (and .cse15 .cse4 .cse6) (and .cse15 .cse2)))) [2022-04-07 00:50:03,228 INFO L878 garLoopResultBuilder]: At program point L125(lines 125 527) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse4)) (.cse11 (= ssl3_connect_~s__state~0 4464)) (.cse10 (= 4496 ssl3_connect_~s__state~0)) (.cse16 (<= 4352 ssl3_connect_~s__state~0)) (.cse17 (<= ssl3_connect_~s__state~0 4352)) (.cse13 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse12 (= 4400 ssl3_connect_~s__state~0)) (.cse9 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse14 (= ssl3_connect_~s__state~0 4416)) (.cse15 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse18 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse2 .cse4) (and .cse8 .cse4 .cse9) (and .cse8 .cse4 .cse10) (and .cse8 .cse4 .cse11) (and .cse8 .cse12 .cse4 .cse6) (and .cse2 .cse9) (and .cse0 .cse8 .cse1 .cse4 .cse13) (and .cse14 .cse8 .cse4 .cse6) (and .cse8 .cse4 .cse15) (and .cse16 .cse17 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse4 .cse11 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse10 .cse6) (and .cse16 .cse17 .cse8 .cse4 .cse13) (and .cse12 .cse2 .cse4) (and .cse14 .cse2 .cse4) (and .cse4 .cse9 .cse6) (and .cse8 .cse7) (and .cse18 .cse8 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse8 .cse4 .cse5) (and .cse14 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse15 .cse6) (and .cse18 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse18 .cse2)))) [2022-04-07 00:50:03,228 INFO L885 garLoopResultBuilder]: At program point ssl3_connectEXIT(lines 22 563) the Hoare annotation is: true [2022-04-07 00:50:03,228 INFO L885 garLoopResultBuilder]: At program point L489(lines 489 491) the Hoare annotation is: true [2022-04-07 00:50:03,228 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)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) (not .cse2) (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (and .cse0 .cse1 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-07 00:50:03,228 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 (= ssl3_connect_~blastFlag~0 0)) (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:03,228 INFO L878 garLoopResultBuilder]: At program point L423-1(lines 423 437) the Hoare annotation is: (let ((.cse5 (= ssl3_connect_~s__hit~0 0))) (let ((.cse2 (not .cse5)) (.cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4352)) (.cse4 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560))) (or (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0) .cse2 .cse3) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) .cse2 .cse3) (and .cse0 .cse1 .cse4 .cse5 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse4 (= 3 ssl3_connect_~s__state~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|))))) [2022-04-07 00:50:03,228 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)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) (not .cse2) (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (and .cse0 .cse1 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-07 00:50:03,228 INFO L878 garLoopResultBuilder]: At program point L324(lines 324 327) the Hoare annotation is: (let ((.cse0 (= 4432 ssl3_connect_~s__state~0))) (or (and .cse0 (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~blastFlag~0 4)) (and (= ssl3_connect_~blastFlag~0 0) .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-07 00:50:03,228 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)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (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:03,228 INFO L885 garLoopResultBuilder]: At program point ssl3_connectFINAL(lines 22 563) the Hoare annotation is: true [2022-04-07 00:50:03,229 INFO L885 garLoopResultBuilder]: At program point L556(lines 556 558) the Hoare annotation is: true [2022-04-07 00:50:03,229 INFO L885 garLoopResultBuilder]: At program point L556-2(lines 556 558) the Hoare annotation is: true [2022-04-07 00:50:03,229 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)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (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:03,229 INFO L878 garLoopResultBuilder]: At program point L194(lines 194 504) the Hoare annotation is: (let ((.cse5 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse5)) (.cse8 (= 3 ssl3_connect_~s__state~0)) (.cse7 (<= ssl3_connect_~s__state~0 4352)) (.cse4 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse6 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse9 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse1 .cse5 .cse6) (and .cse7 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse7 .cse8 .cse2 .cse5) (and .cse4 .cse8) (and .cse9 .cse4 .cse5) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse7 .cse4 .cse5 .cse6) (and .cse9 .cse5 (<= ssl3_connect_~blastFlag~0 4)) (and .cse9 .cse2)))) [2022-04-07 00:50:03,229 INFO L878 garLoopResultBuilder]: At program point L161(lines 161 515) the Hoare annotation is: (let ((.cse5 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse3 (not .cse5)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse13 (= 3 ssl3_connect_~s__state~0)) (.cse12 (<= ssl3_connect_~s__state~0 4352)) (.cse4 (<= 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)) (.cse11 (<= ssl3_connect_~blastFlag~0 4)) (.cse14 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse4 .cse5 .cse7) (and .cse4 .cse5 .cse8) (and .cse2 .cse6) (and .cse0 .cse4 .cse1 .cse5 .cse9) (and .cse4 .cse5 .cse10) (and .cse5 .cse8 .cse11) (and .cse12 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse5 .cse7 .cse11) (and .cse12 .cse13 .cse2 .cse5) (and .cse5 .cse6 .cse11) (and .cse4 .cse13) (and .cse14 .cse4 .cse5) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse12 .cse4 .cse5 .cse9) (and .cse5 .cse10 .cse11) (and .cse14 .cse5 .cse11) (and .cse14 .cse2)))) [2022-04-07 00:50:03,229 INFO L878 garLoopResultBuilder]: At program point L128(lines 128 526) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse10 (= ssl3_connect_~s__state~0 4464)) (.cse3 (not .cse4)) (.cse9 (= 4496 ssl3_connect_~s__state~0)) (.cse11 (= 4400 ssl3_connect_~s__state~0)) (.cse8 (= 4512 ssl3_connect_~s__state~0)) (.cse16 (= 3 ssl3_connect_~s__state~0)) (.cse15 (<= ssl3_connect_~s__state~0 4352)) (.cse12 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse7 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse13 (= ssl3_connect_~s__state~0 4416)) (.cse14 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse17 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse4 .cse8) (and .cse7 .cse4 .cse9) (and .cse7 .cse4 .cse10) (and .cse7 .cse11 .cse4 .cse6) (and .cse2 .cse8) (and .cse0 .cse7 .cse1 .cse4 .cse12) (and .cse13 .cse7 .cse4 .cse6) (and .cse7 .cse4 .cse14) (and .cse4 .cse10 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (and .cse15 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse9 .cse6) (and .cse15 .cse16 .cse2 .cse4) (and .cse11 .cse2 .cse4) (and .cse13 .cse2 .cse4) (and .cse4 .cse8 .cse6) (and .cse7 .cse16) (and .cse17 .cse7 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse15 .cse7 .cse4 .cse12) (and .cse7 .cse4 .cse5) (and .cse13 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse14 .cse6) (and .cse17 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse17 .cse2)))) [2022-04-07 00:50:03,229 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)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (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:03,229 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:03,229 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)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (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:03,229 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:03,229 INFO L878 garLoopResultBuilder]: At program point L427(lines 427 433) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4352)) (.cse2 (not (= ssl3_connect_~s__hit~0 0))) (.cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0))) (or (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0) .cse2 .cse3) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) .cse2 .cse3) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-07 00:50:03,229 INFO L878 garLoopResultBuilder]: At program point L262(lines 262 268) the Hoare annotation is: (or (and (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560) (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-04-07 00:50:03,229 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:03,230 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)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) (not .cse2) (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (and .cse0 .cse1 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-07 00:50:03,230 INFO L878 garLoopResultBuilder]: At program point L197(lines 197 503) the Hoare annotation is: (let ((.cse5 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse5)) (.cse2 (= 2 ssl3_connect_~blastFlag~0)) (.cse8 (= 3 ssl3_connect_~s__state~0)) (.cse7 (<= ssl3_connect_~s__state~0 4352)) (.cse4 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse6 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse1 .cse5 .cse6) (and .cse7 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse7 .cse8 .cse2 .cse5) (and .cse4 .cse8) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse7 .cse4 .cse5 .cse6)))) [2022-04-07 00:50:03,230 INFO L878 garLoopResultBuilder]: At program point L164(lines 164 514) the Hoare annotation is: (let ((.cse5 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse3 (not .cse5)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse13 (= 3 ssl3_connect_~s__state~0)) (.cse12 (<= ssl3_connect_~s__state~0 4352)) (.cse4 (<= 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)) (.cse11 (<= ssl3_connect_~blastFlag~0 4)) (.cse14 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse4 .cse5 .cse7) (and .cse4 .cse5 .cse8) (and .cse2 .cse6) (and .cse0 .cse4 .cse1 .cse5 .cse9) (and .cse4 .cse5 .cse10) (and .cse5 .cse8 .cse11) (and .cse12 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse5 .cse7 .cse11) (and .cse12 .cse13 .cse2 .cse5) (and .cse5 .cse6 .cse11) (and .cse4 .cse13) (and .cse14 .cse4 .cse5) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse12 .cse4 .cse5 .cse9) (and .cse5 .cse10 .cse11) (and .cse14 .cse5 .cse11) (and .cse14 .cse2)))) [2022-04-07 00:50:03,230 INFO L878 garLoopResultBuilder]: At program point L131(lines 131 525) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse10 (= ssl3_connect_~s__state~0 4464)) (.cse3 (not .cse4)) (.cse9 (= 4496 ssl3_connect_~s__state~0)) (.cse11 (= 4400 ssl3_connect_~s__state~0)) (.cse8 (= 4512 ssl3_connect_~s__state~0)) (.cse16 (= 3 ssl3_connect_~s__state~0)) (.cse15 (<= ssl3_connect_~s__state~0 4352)) (.cse12 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse7 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse13 (= ssl3_connect_~s__state~0 4416)) (.cse14 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse17 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse4 .cse8) (and .cse7 .cse4 .cse9) (and .cse7 .cse4 .cse10) (and .cse7 .cse11 .cse4 .cse6) (and .cse2 .cse8) (and .cse0 .cse7 .cse1 .cse4 .cse12) (and .cse13 .cse7 .cse4 .cse6) (and .cse7 .cse4 .cse14) (and .cse4 .cse10 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (and .cse15 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse9 .cse6) (and .cse15 .cse16 .cse2 .cse4) (and .cse11 .cse2 .cse4) (and .cse13 .cse2 .cse4) (and .cse4 .cse8 .cse6) (and .cse7 .cse16) (and .cse17 .cse7 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse15 .cse7 .cse4 .cse12) (and .cse7 .cse4 .cse5) (and .cse13 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse14 .cse6) (and .cse17 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse17 .cse2)))) [2022-04-07 00:50:03,230 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)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (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:03,230 INFO L878 garLoopResultBuilder]: At program point L132(lines 128 526) the Hoare annotation is: (or (and (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560) (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-04-07 00:50:03,230 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:03,230 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:03,230 INFO L878 garLoopResultBuilder]: At program point L298(lines 298 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 .cse1 (= ssl3_connect_~blastFlag~0 0)) (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:03,230 INFO L878 garLoopResultBuilder]: At program point L265(lines 265 267) the Hoare annotation is: (not (<= 12292 |ssl3_connect_#in~initial_state|)) [2022-04-07 00:50:03,230 INFO L878 garLoopResultBuilder]: At program point L298-2(lines 298 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) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (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:03,230 INFO L878 garLoopResultBuilder]: At program point L265-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:03,231 INFO L878 garLoopResultBuilder]: At program point L497(lines 110 550) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse4)) (.cse11 (= ssl3_connect_~s__state~0 4464)) (.cse10 (= 4496 ssl3_connect_~s__state~0)) (.cse16 (<= 4352 ssl3_connect_~s__state~0)) (.cse17 (<= ssl3_connect_~s__state~0 4352)) (.cse13 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse12 (= 4400 ssl3_connect_~s__state~0)) (.cse9 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse14 (= ssl3_connect_~s__state~0 4416)) (.cse15 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse18 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse2 .cse4) (and .cse8 .cse4 .cse9) (and .cse8 .cse4 .cse10) (and .cse8 .cse4 .cse11) (and .cse8 .cse12 .cse4 .cse6) (and .cse2 .cse9) (and .cse0 .cse8 .cse1 .cse4 .cse13) (and .cse14 .cse8 .cse4 .cse6) (and .cse8 .cse4 .cse15) (and .cse16 .cse17 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse4 .cse11 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse10 .cse6) (and .cse16 .cse17 .cse8 .cse4 .cse13) (and .cse12 .cse2 .cse4) (and .cse14 .cse2 .cse4) (and .cse4 .cse9 .cse6) (and .cse8 .cse7) (and .cse18 .cse8 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse8 .cse4 .cse5) (and .cse14 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse15 .cse6) (and .cse18 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse18 .cse2)))) [2022-04-07 00:50:03,231 INFO L878 garLoopResultBuilder]: At program point L332(lines 332 334) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 .cse1 (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-07 00:50:03,231 INFO L878 garLoopResultBuilder]: At program point L200(lines 200 502) the Hoare annotation is: (let ((.cse5 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse5)) (.cse2 (= 2 ssl3_connect_~blastFlag~0)) (.cse8 (= 3 ssl3_connect_~s__state~0)) (.cse7 (<= ssl3_connect_~s__state~0 4352)) (.cse4 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse6 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse1 .cse5 .cse6) (and .cse7 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse7 .cse8 .cse2 .cse5) (and .cse4 .cse8) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse7 .cse4 .cse5 .cse6)))) [2022-04-07 00:50:03,231 INFO L878 garLoopResultBuilder]: At program point L167(lines 167 513) the Hoare annotation is: (let ((.cse5 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse5)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse12 (= 3 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4352)) (.cse4 (<= 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)) (.cse11 (<= ssl3_connect_~blastFlag~0 4)) (.cse13 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse4 .cse5 .cse7) (and .cse2 .cse6) (and .cse0 .cse4 .cse1 .cse5 .cse8) (and .cse4 .cse5 .cse9) (and .cse10 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse5 .cse7 .cse11) (and .cse10 .cse12 .cse2 .cse5) (and .cse5 .cse6 .cse11) (and .cse4 .cse12) (and .cse13 .cse4 .cse5) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse10 .cse4 .cse5 .cse8) (and .cse5 .cse9 .cse11) (and .cse13 .cse5 .cse11) (and .cse13 .cse2)))) [2022-04-07 00:50:03,231 INFO L878 garLoopResultBuilder]: At program point L134(lines 134 524) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse10 (= ssl3_connect_~s__state~0 4464)) (.cse3 (not .cse4)) (.cse9 (= 4496 ssl3_connect_~s__state~0)) (.cse11 (= 4400 ssl3_connect_~s__state~0)) (.cse8 (= 4512 ssl3_connect_~s__state~0)) (.cse16 (= 3 ssl3_connect_~s__state~0)) (.cse15 (<= ssl3_connect_~s__state~0 4352)) (.cse12 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse7 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse13 (= ssl3_connect_~s__state~0 4416)) (.cse14 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse17 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse4 .cse8) (and .cse7 .cse4 .cse9) (and .cse7 .cse4 .cse10) (and .cse7 .cse11 .cse4 .cse6) (and .cse2 .cse8) (and .cse0 .cse7 .cse1 .cse4 .cse12) (and .cse13 .cse7 .cse4 .cse6) (and .cse7 .cse4 .cse14) (and .cse4 .cse10 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (and .cse15 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse9 .cse6) (and .cse15 .cse16 .cse2 .cse4) (and .cse11 .cse2 .cse4) (and .cse13 .cse2 .cse4) (and .cse4 .cse8 .cse6) (and .cse7 .cse16) (and .cse17 .cse7 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse15 .cse7 .cse4 .cse12) (and .cse7 .cse4 .cse5) (and .cse13 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse14 .cse6) (and .cse17 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse17 .cse2)))) [2022-04-07 00:50:03,231 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-07 00:50:03,231 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-07 00:50:03,231 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-07 00:50:03,231 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-07 00:50:03,233 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:03,234 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 00:50:03,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 12:50:03 BoogieIcfgContainer [2022-04-07 00:50:03,249 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 00:50:03,250 INFO L158 Benchmark]: Toolchain (without parser) took 112907.07ms. Allocated memory was 194.0MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 143.0MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2022-04-07 00:50:03,250 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 194.0MB. Free memory is still 159.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 00:50:03,250 INFO L158 Benchmark]: CACSL2BoogieTranslator took 274.47ms. Allocated memory is still 194.0MB. Free memory was 142.7MB in the beginning and 166.5MB in the end (delta: -23.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-07 00:50:03,250 INFO L158 Benchmark]: Boogie Preprocessor took 54.10ms. Allocated memory is still 194.0MB. Free memory was 166.5MB in the beginning and 164.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 00:50:03,250 INFO L158 Benchmark]: RCFGBuilder took 575.77ms. Allocated memory is still 194.0MB. Free memory was 164.4MB in the beginning and 138.6MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-04-07 00:50:03,250 INFO L158 Benchmark]: TraceAbstraction took 111998.89ms. Allocated memory was 194.0MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 138.2MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2022-04-07 00:50:03,251 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.51ms. Allocated memory is still 194.0MB. Free memory is still 159.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 274.47ms. Allocated memory is still 194.0MB. Free memory was 142.7MB in the beginning and 166.5MB in the end (delta: -23.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.10ms. Allocated memory is still 194.0MB. Free memory was 166.5MB in the beginning and 164.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 575.77ms. Allocated memory is still 194.0MB. Free memory was 164.4MB in the beginning and 138.6MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 111998.89ms. Allocated memory was 194.0MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 138.2MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 1.3GB. 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: 111.9s, OverallIterations: 28, TraceHistogramMax: 22, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 9.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 89.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6895 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6893 mSDsluCounter, 6562 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 587 mSDsCounter, 541 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5705 IncrementalHoareTripleChecker+Invalid, 6246 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 541 mSolverCounterUnsat, 5975 mSDtfsCounter, 5705 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3823 GetRequests, 3719 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8599occurred in iteration=25, 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: 4.4s AutomataMinimizationTime, 28 MinimizatonAttempts, 6119 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 137 LocationsWithAnnotation, 137 PreInvPairs, 5003 NumberOfFragments, 11504 HoareAnnotationTreeSize, 137 FomulaSimplifications, 121856 FormulaSimplificationTreeSizeReduction, 27.5s HoareSimplificationTime, 137 FomulaSimplificationsInter, 228919 FormulaSimplificationTreeSizeReductionInter, 61.6s 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: ((((((((((((((((((((((((((((((4560 <= s__state && s__state <= 4560) && 2 == blastFlag) && !(s__hit == 0)) || ((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)) || (((s__s3__tmp__next_state___0 <= 4560 && 4400 == s__state) && s__hit == 0) && blastFlag <= 4)) || (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)) || ((((4352 <= s__state && s__state <= 4352) && 2 == blastFlag) && !(s__hit == 0)) && 3 == s__s3__tmp__next_state___0)) || ((s__hit == 0 && s__state == 4464) && blastFlag <= 4)) || ((4432 == s__state && s__hit == 0) && blastFlag <= 4)) || blastFlag == 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)) || (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) || ((4432 <= s__state && s__state <= 4560) && blastFlag == 0)) || !(12292 <= \old(initial_state)) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: ((4352 <= s__state && s__state <= 4560) && blastFlag == 0) || !(12292 <= \old(initial_state)) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((((((4352 <= s__state && 3 == blastFlag) && s__state <= 4560) && s__hit == 0) || ((4352 <= s__state && s__state <= 4560) && blastFlag == 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) && !(s__hit == 0)) && 3 == s__s3__tmp__next_state___0) || ((4352 <= s__state && s__state <= 4352) && blastFlag == 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) || ((4432 <= s__state && s__state <= 4560) && blastFlag == 0)) || !(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__state <= 4560) && 2 == blastFlag) && !(s__hit == 0)) || ((((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 && blastFlag == 0)) || !(12292 <= \old(initial_state)) - InvariantResult [Line: 211]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: ((((4352 <= s__state && s__state <= 4560) && blastFlag == 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: 164]: Loop Invariant Derived loop invariant: (((((4432 <= s__state && s__state <= 4560) && s__hit == 0) && blastFlag <= 4) || ((4432 <= s__state && s__state <= 4560) && blastFlag == 0)) || !(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) || ((4432 <= s__state && s__state <= 4560) && blastFlag == 0)) || !(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) || ((4432 <= s__state && s__state <= 4560) && blastFlag == 0)) || !(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)) || ((4432 <= s__state && s__state <= 4560) && blastFlag == 0)) || !(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)) || ((4432 <= s__state && s__state <= 4560) && blastFlag == 0)) || !(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) || ((4352 <= s__state && s__state <= 4560) && blastFlag == 0)) || !(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:03,293 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...