/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_srvr_4.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 00:50:21,900 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 00:50:21,901 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 00:50:21,938 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 00:50:21,938 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 00:50:21,939 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 00:50:21,941 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 00:50:21,942 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 00:50:21,944 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 00:50:21,945 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 00:50:21,945 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 00:50:21,946 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 00:50:21,947 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 00:50:21,948 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 00:50:21,949 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 00:50:21,950 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 00:50:21,950 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 00:50:21,956 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 00:50:21,965 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 00:50:21,970 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 00:50:21,971 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 00:50:21,975 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 00:50:21,976 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 00:50:21,977 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 00:50:21,977 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 00:50:21,979 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 00:50:21,980 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 00:50:21,980 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 00:50:21,981 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 00:50:21,981 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 00:50:21,982 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 00:50:21,982 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 00:50:21,983 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 00:50:21,983 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 00:50:21,984 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 00:50:21,985 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 00:50:21,985 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 00:50:21,986 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 00:50:21,987 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 00:50:21,987 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 00:50:21,988 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 00:50:21,995 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 00:50:21,996 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:50:22,004 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 00:50:22,004 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 00:50:22,005 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 00:50:22,005 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 00:50:22,005 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 00:50:22,005 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 00:50:22,006 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 00:50:22,006 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 00:50:22,006 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 00:50:22,006 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 00:50:22,006 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 00:50:22,007 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 00:50:22,007 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 00:50:22,017 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 00:50:22,017 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 00:50:22,017 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 00:50:22,017 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 00:50:22,017 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-07 00:50:22,018 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-07 00:50:22,018 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-07 00:50:22,018 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 00:50:22,018 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-07 00:50:22,018 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:50:22,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 00:50:22,263 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 00:50:22,265 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 00:50:22,266 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 00:50:22,268 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 00:50:22,269 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_4.cil.c [2022-04-07 00:50:22,321 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17e383943/11a1c80bc46843879bae091f1ffac80d/FLAG63591185a [2022-04-07 00:50:22,711 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 00:50:22,712 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_4.cil.c [2022-04-07 00:50:22,739 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17e383943/11a1c80bc46843879bae091f1ffac80d/FLAG63591185a [2022-04-07 00:50:22,759 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17e383943/11a1c80bc46843879bae091f1ffac80d [2022-04-07 00:50:22,762 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 00:50:22,765 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 00:50:22,767 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 00:50:22,767 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 00:50:22,771 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 00:50:22,772 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 12:50:22" (1/1) ... [2022-04-07 00:50:22,773 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ee7c45e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:50:22, skipping insertion in model container [2022-04-07 00:50:22,773 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 12:50:22" (1/1) ... [2022-04-07 00:50:22,779 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 00:50:22,816 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 00:50:23,103 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_srvr_4.cil.c[42875,42888] [2022-04-07 00:50:23,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 00:50:23,120 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 00:50:23,161 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_srvr_4.cil.c[42875,42888] [2022-04-07 00:50:23,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 00:50:23,182 INFO L208 MainTranslator]: Completed translation [2022-04-07 00:50:23,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:50:23 WrapperNode [2022-04-07 00:50:23,182 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 00:50:23,183 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 00:50:23,183 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 00:50:23,183 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 00:50:23,205 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:50:23" (1/1) ... [2022-04-07 00:50:23,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:50:23" (1/1) ... [2022-04-07 00:50:23,213 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:50:23" (1/1) ... [2022-04-07 00:50:23,213 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:50:23" (1/1) ... [2022-04-07 00:50:23,221 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:50:23" (1/1) ... [2022-04-07 00:50:23,243 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:50:23" (1/1) ... [2022-04-07 00:50:23,250 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:50:23" (1/1) ... [2022-04-07 00:50:23,257 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 00:50:23,260 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 00:50:23,260 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 00:50:23,260 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 00:50:23,261 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:50:23" (1/1) ... [2022-04-07 00:50:23,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 00:50:23,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 00:50:23,288 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:50:23,292 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:50:23,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 00:50:23,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 00:50:23,320 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 00:50:23,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-07 00:50:23,320 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 00:50:23,320 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 00:50:23,321 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 00:50:23,321 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 00:50:23,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 00:50:23,321 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-07 00:50:23,321 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 00:50:23,321 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-07 00:50:23,321 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-07 00:50:23,321 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 00:50:23,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 00:50:23,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 00:50:23,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 00:50:23,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 00:50:23,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 00:50:23,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 00:50:23,401 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 00:50:23,411 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 00:50:23,522 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-07 00:50:23,918 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-04-07 00:50:23,919 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-04-07 00:50:23,935 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 00:50:23,946 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 00:50:23,947 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 00:50:23,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 12:50:23 BoogieIcfgContainer [2022-04-07 00:50:23,949 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 00:50:23,952 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 00:50:23,952 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 00:50:23,955 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 00:50:23,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 12:50:22" (1/3) ... [2022-04-07 00:50:23,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28e30c5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 12:50:23, skipping insertion in model container [2022-04-07 00:50:23,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:50:23" (2/3) ... [2022-04-07 00:50:23,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28e30c5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 12:50:23, skipping insertion in model container [2022-04-07 00:50:23,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 12:50:23" (3/3) ... [2022-04-07 00:50:23,958 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_4.cil.c [2022-04-07 00:50:23,965 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-07 00:50:23,965 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 00:50:24,010 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 00:50:24,019 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:50:24,019 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 00:50:24,034 INFO L276 IsEmpty]: Start isEmpty. Operand has 150 states, 142 states have (on average 1.7112676056338028) internal successors, (243), 143 states have internal predecessors, (243), 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:50:24,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-07 00:50:24,042 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:24,043 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:50:24,043 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:24,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:24,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1867927467, now seen corresponding path program 1 times [2022-04-07 00:50:24,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:24,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [447054378] [2022-04-07 00:50:24,065 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:50:24,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1867927467, now seen corresponding path program 2 times [2022-04-07 00:50:24,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:24,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305635094] [2022-04-07 00:50:24,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:24,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:24,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:24,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:24,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:24,393 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:50:24,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:24,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305635094] [2022-04-07 00:50:24,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305635094] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:24,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:24,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:24,397 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:24,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [447054378] [2022-04-07 00:50:24,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [447054378] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:24,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:24,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:24,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353359613] [2022-04-07 00:50:24,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:24,404 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:24,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:24,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:24,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:24,440 INFO L87 Difference]: Start difference. First operand has 150 states, 142 states have (on average 1.7112676056338028) internal successors, (243), 143 states have internal predecessors, (243), 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 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have 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:50:25,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:25,061 INFO L93 Difference]: Finished difference Result 414 states and 701 transitions. [2022-04-07 00:50:25,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:25,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (3), 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 50 [2022-04-07 00:50:25,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:25,089 INFO L225 Difference]: With dead ends: 414 [2022-04-07 00:50:25,089 INFO L226 Difference]: Without dead ends: 251 [2022-04-07 00:50:25,094 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:50:25,098 INFO L913 BasicCegarLoop]: 240 mSDtfsCounter, 634 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:25,100 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [636 Valid, 249 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-07 00:50:25,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-04-07 00:50:25,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2022-04-07 00:50:25,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 246 states have (on average 1.524390243902439) internal successors, (375), 246 states have internal predecessors, (375), 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:50:25,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 379 transitions. [2022-04-07 00:50:25,184 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 379 transitions. Word has length 50 [2022-04-07 00:50:25,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:25,186 INFO L478 AbstractCegarLoop]: Abstraction has 251 states and 379 transitions. [2022-04-07 00:50:25,186 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have 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:50:25,186 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 379 transitions. [2022-04-07 00:50:25,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-07 00:50:25,195 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:25,195 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:50:25,196 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 00:50:25,196 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:25,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:25,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1459295990, now seen corresponding path program 1 times [2022-04-07 00:50:25,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:25,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [118415572] [2022-04-07 00:50:25,217 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-07 00:50:25,218 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:25,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1459295990, now seen corresponding path program 2 times [2022-04-07 00:50:25,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:25,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726635153] [2022-04-07 00:50:25,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:25,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:25,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:25,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:25,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:25,356 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 00:50:25,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:25,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726635153] [2022-04-07 00:50:25,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726635153] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:25,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:25,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:25,357 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:25,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [118415572] [2022-04-07 00:50:25,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [118415572] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:25,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:25,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:25,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377350830] [2022-04-07 00:50:25,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:25,359 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:25,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:25,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:25,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:25,360 INFO L87 Difference]: Start difference. First operand 251 states and 379 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:25,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:25,647 INFO L93 Difference]: Finished difference Result 400 states and 612 transitions. [2022-04-07 00:50:25,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:25,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-07 00:50:25,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:25,655 INFO L225 Difference]: With dead ends: 400 [2022-04-07 00:50:25,656 INFO L226 Difference]: Without dead ends: 280 [2022-04-07 00:50:25,663 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:50:25,665 INFO L913 BasicCegarLoop]: 213 mSDtfsCounter, 215 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:25,666 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 220 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 00:50:25,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-04-07 00:50:25,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 272. [2022-04-07 00:50:25,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 267 states have (on average 1.5018726591760299) internal successors, (401), 267 states have internal predecessors, (401), 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:50:25,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 405 transitions. [2022-04-07 00:50:25,700 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 405 transitions. Word has length 66 [2022-04-07 00:50:25,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:25,701 INFO L478 AbstractCegarLoop]: Abstraction has 272 states and 405 transitions. [2022-04-07 00:50:25,701 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:25,701 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 405 transitions. [2022-04-07 00:50:25,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-07 00:50:25,703 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:25,703 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:50:25,703 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 00:50:25,703 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:25,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:25,704 INFO L85 PathProgramCache]: Analyzing trace with hash -984809258, now seen corresponding path program 1 times [2022-04-07 00:50:25,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:25,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [473085208] [2022-04-07 00:50:25,708 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-07 00:50:25,708 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:25,708 INFO L85 PathProgramCache]: Analyzing trace with hash -984809258, now seen corresponding path program 2 times [2022-04-07 00:50:25,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:25,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204928263] [2022-04-07 00:50:25,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:25,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:25,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:25,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:25,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:25,816 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-07 00:50:25,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:25,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204928263] [2022-04-07 00:50:25,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204928263] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:25,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:25,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:25,817 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:25,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [473085208] [2022-04-07 00:50:25,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [473085208] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:25,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:25,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:25,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403180999] [2022-04-07 00:50:25,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:25,818 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:25,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:25,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:25,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:25,819 INFO L87 Difference]: Start difference. First operand 272 states and 405 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:26,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:26,091 INFO L93 Difference]: Finished difference Result 624 states and 960 transitions. [2022-04-07 00:50:26,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:26,092 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2022-04-07 00:50:26,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:26,094 INFO L225 Difference]: With dead ends: 624 [2022-04-07 00:50:26,094 INFO L226 Difference]: Without dead ends: 366 [2022-04-07 00:50:26,095 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:50:26,096 INFO L913 BasicCegarLoop]: 214 mSDtfsCounter, 220 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:26,097 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 221 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 00:50:26,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-04-07 00:50:26,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 356. [2022-04-07 00:50:26,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 351 states have (on average 1.4102564102564104) internal successors, (495), 351 states have internal predecessors, (495), 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:50:26,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 499 transitions. [2022-04-07 00:50:26,119 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 499 transitions. Word has length 87 [2022-04-07 00:50:26,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:26,120 INFO L478 AbstractCegarLoop]: Abstraction has 356 states and 499 transitions. [2022-04-07 00:50:26,120 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:26,120 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 499 transitions. [2022-04-07 00:50:26,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-07 00:50:26,121 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:26,121 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:50:26,121 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-07 00:50:26,122 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:26,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:26,122 INFO L85 PathProgramCache]: Analyzing trace with hash -736662764, now seen corresponding path program 1 times [2022-04-07 00:50:26,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:26,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1292493013] [2022-04-07 00:50:26,129 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-07 00:50:26,129 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:26,129 INFO L85 PathProgramCache]: Analyzing trace with hash -736662764, now seen corresponding path program 2 times [2022-04-07 00:50:26,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:26,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018628770] [2022-04-07 00:50:26,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:26,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:26,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:26,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:26,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:26,204 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-07 00:50:26,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:26,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018628770] [2022-04-07 00:50:26,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018628770] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:26,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:26,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:26,206 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:26,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1292493013] [2022-04-07 00:50:26,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1292493013] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:26,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:26,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:26,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447349961] [2022-04-07 00:50:26,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:26,207 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:26,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:26,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:26,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:26,208 INFO L87 Difference]: Start difference. First operand 356 states and 499 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:26,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:26,457 INFO L93 Difference]: Finished difference Result 752 states and 1074 transitions. [2022-04-07 00:50:26,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:26,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2022-04-07 00:50:26,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:26,461 INFO L225 Difference]: With dead ends: 752 [2022-04-07 00:50:26,461 INFO L226 Difference]: Without dead ends: 410 [2022-04-07 00:50:26,463 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:50:26,468 INFO L913 BasicCegarLoop]: 214 mSDtfsCounter, 214 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:26,470 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 221 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 00:50:26,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-04-07 00:50:26,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 402. [2022-04-07 00:50:26,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 397 states have (on average 1.3879093198992443) internal successors, (551), 397 states have internal predecessors, (551), 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:50:26,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 555 transitions. [2022-04-07 00:50:26,515 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 555 transitions. Word has length 87 [2022-04-07 00:50:26,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:26,516 INFO L478 AbstractCegarLoop]: Abstraction has 402 states and 555 transitions. [2022-04-07 00:50:26,516 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:26,516 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 555 transitions. [2022-04-07 00:50:26,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-04-07 00:50:26,523 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:26,524 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:50:26,525 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-07 00:50:26,525 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:26,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:26,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1230434312, now seen corresponding path program 1 times [2022-04-07 00:50:26,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:26,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [306303286] [2022-04-07 00:50:26,533 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-07 00:50:26,533 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:26,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1230434312, now seen corresponding path program 2 times [2022-04-07 00:50:26,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:26,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344092446] [2022-04-07 00:50:26,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:26,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:26,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:26,652 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-07 00:50:26,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:26,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344092446] [2022-04-07 00:50:26,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344092446] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:26,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:26,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:26,653 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:26,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [306303286] [2022-04-07 00:50:26,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [306303286] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:26,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:26,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:26,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783269851] [2022-04-07 00:50:26,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:26,654 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:26,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:26,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:26,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:26,655 INFO L87 Difference]: Start difference. First operand 402 states and 555 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:26,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:26,960 INFO L93 Difference]: Finished difference Result 866 states and 1226 transitions. [2022-04-07 00:50:26,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:26,961 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 108 [2022-04-07 00:50:26,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:26,963 INFO L225 Difference]: With dead ends: 866 [2022-04-07 00:50:26,963 INFO L226 Difference]: Without dead ends: 478 [2022-04-07 00:50:26,964 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:50:26,965 INFO L913 BasicCegarLoop]: 213 mSDtfsCounter, 246 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:26,965 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [246 Valid, 220 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 00:50:26,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2022-04-07 00:50:26,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 452. [2022-04-07 00:50:26,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 447 states have (on average 1.366890380313199) internal successors, (611), 447 states have internal predecessors, (611), 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:50:26,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 615 transitions. [2022-04-07 00:50:26,991 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 615 transitions. Word has length 108 [2022-04-07 00:50:26,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:26,992 INFO L478 AbstractCegarLoop]: Abstraction has 452 states and 615 transitions. [2022-04-07 00:50:26,992 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:26,992 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 615 transitions. [2022-04-07 00:50:26,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-07 00:50:26,994 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:26,994 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-04-07 00:50:26,994 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-07 00:50:26,994 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:26,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:26,995 INFO L85 PathProgramCache]: Analyzing trace with hash 779438989, now seen corresponding path program 1 times [2022-04-07 00:50:26,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:26,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1752985296] [2022-04-07 00:50:27,001 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-07 00:50:27,001 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:27,001 INFO L85 PathProgramCache]: Analyzing trace with hash 779438989, now seen corresponding path program 2 times [2022-04-07 00:50:27,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:27,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296589842] [2022-04-07 00:50:27,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:27,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:27,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:27,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:27,053 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-07 00:50:27,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:27,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296589842] [2022-04-07 00:50:27,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296589842] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:27,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:27,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:27,054 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:27,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1752985296] [2022-04-07 00:50:27,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1752985296] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:27,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:27,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:27,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823321931] [2022-04-07 00:50:27,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:27,054 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:27,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:27,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:27,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:27,055 INFO L87 Difference]: Start difference. First operand 452 states and 615 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:27,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:27,294 INFO L93 Difference]: Finished difference Result 912 states and 1244 transitions. [2022-04-07 00:50:27,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:27,294 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 127 [2022-04-07 00:50:27,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:27,299 INFO L225 Difference]: With dead ends: 912 [2022-04-07 00:50:27,299 INFO L226 Difference]: Without dead ends: 681 [2022-04-07 00:50:27,300 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:50:27,302 INFO L913 BasicCegarLoop]: 374 mSDtfsCounter, 334 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 381 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.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:27,302 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [334 Valid, 381 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 00:50:27,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2022-04-07 00:50:27,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 681. [2022-04-07 00:50:27,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 676 states have (on average 1.3609467455621302) internal successors, (920), 676 states have internal predecessors, (920), 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:50:27,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 924 transitions. [2022-04-07 00:50:27,343 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 924 transitions. Word has length 127 [2022-04-07 00:50:27,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:27,343 INFO L478 AbstractCegarLoop]: Abstraction has 681 states and 924 transitions. [2022-04-07 00:50:27,343 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:27,344 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 924 transitions. [2022-04-07 00:50:27,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-04-07 00:50:27,345 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:27,346 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-04-07 00:50:27,346 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-07 00:50:27,346 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:27,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:27,346 INFO L85 PathProgramCache]: Analyzing trace with hash -2004018146, now seen corresponding path program 1 times [2022-04-07 00:50:27,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:27,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [128073485] [2022-04-07 00:50:27,354 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-07 00:50:27,354 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:27,354 INFO L85 PathProgramCache]: Analyzing trace with hash -2004018146, now seen corresponding path program 2 times [2022-04-07 00:50:27,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:27,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123250504] [2022-04-07 00:50:27,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:27,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:27,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:27,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:27,425 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-07 00:50:27,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:27,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123250504] [2022-04-07 00:50:27,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123250504] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:27,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:27,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:27,426 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:27,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [128073485] [2022-04-07 00:50:27,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [128073485] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:27,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:27,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:27,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978409988] [2022-04-07 00:50:27,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:27,427 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:27,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:27,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:27,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:27,429 INFO L87 Difference]: Start difference. First operand 681 states and 924 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:27,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:27,707 INFO L93 Difference]: Finished difference Result 1367 states and 1858 transitions. [2022-04-07 00:50:27,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:27,708 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 128 [2022-04-07 00:50:27,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:27,711 INFO L225 Difference]: With dead ends: 1367 [2022-04-07 00:50:27,712 INFO L226 Difference]: Without dead ends: 907 [2022-04-07 00:50:27,713 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:50:27,714 INFO L913 BasicCegarLoop]: 372 mSDtfsCounter, 330 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:27,714 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [330 Valid, 379 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 00:50:27,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2022-04-07 00:50:27,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 907. [2022-04-07 00:50:27,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 902 states have (on average 1.3592017738359201) internal successors, (1226), 902 states have internal predecessors, (1226), 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:50:27,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1230 transitions. [2022-04-07 00:50:27,761 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1230 transitions. Word has length 128 [2022-04-07 00:50:27,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:27,762 INFO L478 AbstractCegarLoop]: Abstraction has 907 states and 1230 transitions. [2022-04-07 00:50:27,762 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:27,762 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1230 transitions. [2022-04-07 00:50:27,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-04-07 00:50:27,765 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:27,765 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-04-07 00:50:27,765 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-07 00:50:27,765 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:27,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:27,766 INFO L85 PathProgramCache]: Analyzing trace with hash -127535328, now seen corresponding path program 1 times [2022-04-07 00:50:27,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:27,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1333139054] [2022-04-07 00:50:27,771 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-07 00:50:27,771 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:27,771 INFO L85 PathProgramCache]: Analyzing trace with hash -127535328, now seen corresponding path program 2 times [2022-04-07 00:50:27,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:27,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131762775] [2022-04-07 00:50:27,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:27,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:27,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:27,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:27,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:27,808 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-07 00:50:27,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:27,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131762775] [2022-04-07 00:50:27,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131762775] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:27,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:27,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:27,809 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:27,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1333139054] [2022-04-07 00:50:27,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1333139054] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:27,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:27,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:27,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413396643] [2022-04-07 00:50:27,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:27,810 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:27,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:27,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:27,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:27,811 INFO L87 Difference]: Start difference. First operand 907 states and 1230 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:28,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:28,057 INFO L93 Difference]: Finished difference Result 1617 states and 2190 transitions. [2022-04-07 00:50:28,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:28,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 128 [2022-04-07 00:50:28,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:28,062 INFO L225 Difference]: With dead ends: 1617 [2022-04-07 00:50:28,062 INFO L226 Difference]: Without dead ends: 931 [2022-04-07 00:50:28,064 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:50:28,064 INFO L913 BasicCegarLoop]: 228 mSDtfsCounter, 207 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:28,065 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 235 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 00:50:28,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2022-04-07 00:50:28,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 931. [2022-04-07 00:50:28,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 926 states have (on average 1.355291576673866) internal successors, (1255), 926 states have internal predecessors, (1255), 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:50:28,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1259 transitions. [2022-04-07 00:50:28,106 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1259 transitions. Word has length 128 [2022-04-07 00:50:28,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:28,107 INFO L478 AbstractCegarLoop]: Abstraction has 931 states and 1259 transitions. [2022-04-07 00:50:28,107 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:28,107 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1259 transitions. [2022-04-07 00:50:28,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-04-07 00:50:28,110 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:28,110 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:50:28,110 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-07 00:50:28,110 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:28,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:28,111 INFO L85 PathProgramCache]: Analyzing trace with hash 387517255, now seen corresponding path program 1 times [2022-04-07 00:50:28,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:28,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1240880993] [2022-04-07 00:50:28,116 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-07 00:50:28,116 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:28,116 INFO L85 PathProgramCache]: Analyzing trace with hash 387517255, now seen corresponding path program 2 times [2022-04-07 00:50:28,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:28,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682817406] [2022-04-07 00:50:28,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:28,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:28,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:28,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:28,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:28,177 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-07 00:50:28,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:28,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682817406] [2022-04-07 00:50:28,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682817406] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:28,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:28,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:28,178 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:28,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1240880993] [2022-04-07 00:50:28,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1240880993] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:28,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:28,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:28,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356815101] [2022-04-07 00:50:28,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:28,179 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:28,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:28,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:28,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:28,179 INFO L87 Difference]: Start difference. First operand 931 states and 1259 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:28,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:28,520 INFO L93 Difference]: Finished difference Result 2017 states and 2795 transitions. [2022-04-07 00:50:28,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:28,521 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 168 [2022-04-07 00:50:28,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:28,525 INFO L225 Difference]: With dead ends: 2017 [2022-04-07 00:50:28,526 INFO L226 Difference]: Without dead ends: 1100 [2022-04-07 00:50:28,528 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:50:28,530 INFO L913 BasicCegarLoop]: 211 mSDtfsCounter, 236 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:28,530 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 218 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 00:50:28,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1100 states. [2022-04-07 00:50:28,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1100 to 1054. [2022-04-07 00:50:28,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1054 states, 1049 states have (on average 1.336510962821735) internal successors, (1402), 1049 states have internal predecessors, (1402), 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:50:28,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1406 transitions. [2022-04-07 00:50:28,593 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1406 transitions. Word has length 168 [2022-04-07 00:50:28,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:28,594 INFO L478 AbstractCegarLoop]: Abstraction has 1054 states and 1406 transitions. [2022-04-07 00:50:28,594 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:28,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1406 transitions. [2022-04-07 00:50:28,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-04-07 00:50:28,597 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:28,597 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:50:28,598 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-07 00:50:28,598 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:28,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:28,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1058050790, now seen corresponding path program 1 times [2022-04-07 00:50:28,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:28,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [247925435] [2022-04-07 00:50:29,685 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:29,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1058050790, now seen corresponding path program 2 times [2022-04-07 00:50:29,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:29,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761220828] [2022-04-07 00:50:29,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:29,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:29,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:29,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:29,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:29,736 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-04-07 00:50:29,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:29,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761220828] [2022-04-07 00:50:29,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761220828] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:29,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:29,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:29,737 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:29,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [247925435] [2022-04-07 00:50:29,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [247925435] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:29,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:29,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:29,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144960964] [2022-04-07 00:50:29,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:29,738 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:29,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:29,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:29,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:29,739 INFO L87 Difference]: Start difference. First operand 1054 states and 1406 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:30,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:30,022 INFO L93 Difference]: Finished difference Result 2320 states and 3184 transitions. [2022-04-07 00:50:30,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:30,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 181 [2022-04-07 00:50:30,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:30,027 INFO L225 Difference]: With dead ends: 2320 [2022-04-07 00:50:30,027 INFO L226 Difference]: Without dead ends: 1276 [2022-04-07 00:50:30,030 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:50:30,031 INFO L913 BasicCegarLoop]: 212 mSDtfsCounter, 332 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:30,032 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [332 Valid, 219 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 00:50:30,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2022-04-07 00:50:30,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1258. [2022-04-07 00:50:30,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 1253 states have (on average 1.3894652833200318) internal successors, (1741), 1253 states have internal predecessors, (1741), 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:50:30,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1745 transitions. [2022-04-07 00:50:30,130 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1745 transitions. Word has length 181 [2022-04-07 00:50:30,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:30,130 INFO L478 AbstractCegarLoop]: Abstraction has 1258 states and 1745 transitions. [2022-04-07 00:50:30,130 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:30,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1745 transitions. [2022-04-07 00:50:30,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-04-07 00:50:30,133 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:30,134 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:50:30,134 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-07 00:50:30,134 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:30,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:30,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1659327962, now seen corresponding path program 1 times [2022-04-07 00:50:30,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:30,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [979704937] [2022-04-07 00:50:31,203 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:31,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1659327962, now seen corresponding path program 2 times [2022-04-07 00:50:31,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:31,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640353470] [2022-04-07 00:50:31,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:31,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:31,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:31,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:31,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:31,279 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-04-07 00:50:31,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:31,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640353470] [2022-04-07 00:50:31,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640353470] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:31,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:31,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:31,280 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:31,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [979704937] [2022-04-07 00:50:31,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [979704937] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:31,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:31,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:31,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506646108] [2022-04-07 00:50:31,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:31,281 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:31,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:31,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:31,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:31,282 INFO L87 Difference]: Start difference. First operand 1258 states and 1745 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:50:31,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:31,634 INFO L93 Difference]: Finished difference Result 3638 states and 5071 transitions. [2022-04-07 00:50:31,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:31,635 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 210 [2022-04-07 00:50:31,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:31,645 INFO L225 Difference]: With dead ends: 3638 [2022-04-07 00:50:31,645 INFO L226 Difference]: Without dead ends: 2394 [2022-04-07 00:50:31,648 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:50:31,649 INFO L913 BasicCegarLoop]: 374 mSDtfsCounter, 333 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:31,649 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [333 Valid, 381 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 00:50:31,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2394 states. [2022-04-07 00:50:31,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2394 to 2392. [2022-04-07 00:50:31,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2392 states, 2387 states have (on average 1.3937997486384583) internal successors, (3327), 2387 states have internal predecessors, (3327), 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:50:31,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2392 states to 2392 states and 3331 transitions. [2022-04-07 00:50:31,794 INFO L78 Accepts]: Start accepts. Automaton has 2392 states and 3331 transitions. Word has length 210 [2022-04-07 00:50:31,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:31,794 INFO L478 AbstractCegarLoop]: Abstraction has 2392 states and 3331 transitions. [2022-04-07 00:50:31,794 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:50:31,794 INFO L276 IsEmpty]: Start isEmpty. Operand 2392 states and 3331 transitions. [2022-04-07 00:50:31,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-04-07 00:50:31,799 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:31,799 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:50:31,800 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-07 00:50:31,800 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:31,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:31,800 INFO L85 PathProgramCache]: Analyzing trace with hash 334471768, now seen corresponding path program 1 times [2022-04-07 00:50:31,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:31,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1479752217] [2022-04-07 00:50:33,153 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:33,153 INFO L85 PathProgramCache]: Analyzing trace with hash 334471768, now seen corresponding path program 2 times [2022-04-07 00:50:33,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:33,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795448263] [2022-04-07 00:50:33,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:33,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:33,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:33,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:33,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:33,199 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-04-07 00:50:33,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:33,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795448263] [2022-04-07 00:50:33,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795448263] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:33,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:33,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:33,200 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:33,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1479752217] [2022-04-07 00:50:33,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1479752217] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:33,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:33,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:33,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418065098] [2022-04-07 00:50:33,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:33,201 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:33,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:33,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:33,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:33,202 INFO L87 Difference]: Start difference. First operand 2392 states and 3331 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:33,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:33,577 INFO L93 Difference]: Finished difference Result 5018 states and 7084 transitions. [2022-04-07 00:50:33,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:33,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 210 [2022-04-07 00:50:33,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:33,588 INFO L225 Difference]: With dead ends: 5018 [2022-04-07 00:50:33,588 INFO L226 Difference]: Without dead ends: 2640 [2022-04-07 00:50:33,594 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:50:33,595 INFO L913 BasicCegarLoop]: 201 mSDtfsCounter, 220 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:33,595 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 208 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 00:50:33,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2640 states. [2022-04-07 00:50:33,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2640 to 2640. [2022-04-07 00:50:33,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2640 states, 2635 states have (on average 1.3719165085388993) internal successors, (3615), 2635 states have internal predecessors, (3615), 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:50:33,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2640 states to 2640 states and 3619 transitions. [2022-04-07 00:50:33,819 INFO L78 Accepts]: Start accepts. Automaton has 2640 states and 3619 transitions. Word has length 210 [2022-04-07 00:50:33,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:33,819 INFO L478 AbstractCegarLoop]: Abstraction has 2640 states and 3619 transitions. [2022-04-07 00:50:33,820 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:33,820 INFO L276 IsEmpty]: Start isEmpty. Operand 2640 states and 3619 transitions. [2022-04-07 00:50:33,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2022-04-07 00:50:33,825 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:33,825 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-04-07 00:50:33,825 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-07 00:50:33,826 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:33,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:33,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1365730685, now seen corresponding path program 1 times [2022-04-07 00:50:33,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:33,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [92651714] [2022-04-07 00:50:35,096 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:35,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1365730685, now seen corresponding path program 2 times [2022-04-07 00:50:35,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:35,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5068024] [2022-04-07 00:50:35,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:35,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:35,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:35,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:35,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:35,150 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-07 00:50:35,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:35,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5068024] [2022-04-07 00:50:35,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5068024] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 00:50:35,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037664363] [2022-04-07 00:50:35,151 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 00:50:35,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 00:50:35,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 00:50:35,153 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:50:35,156 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:50:35,269 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 00:50:35,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 00:50:35,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-07 00:50:35,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 00:50:35,892 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-07 00:50:35,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 00:50:36,334 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-07 00:50:36,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037664363] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 00:50:36,334 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 00:50:36,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-04-07 00:50:36,335 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:36,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [92651714] [2022-04-07 00:50:36,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [92651714] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:36,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:36,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 00:50:36,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770978725] [2022-04-07 00:50:36,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:36,336 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 00:50:36,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:36,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 00:50:36,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-07 00:50:36,337 INFO L87 Difference]: Start difference. First operand 2640 states and 3619 transitions. Second operand has 5 states, 5 states have (on average 35.0) internal successors, (175), 4 states have internal predecessors, (175), 1 states have call successors, (3), 2 states have 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:50:37,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:37,012 INFO L93 Difference]: Finished difference Result 6440 states and 8840 transitions. [2022-04-07 00:50:37,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 00:50:37,012 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.0) internal successors, (175), 4 states have internal predecessors, (175), 1 states have call successors, (3), 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 238 [2022-04-07 00:50:37,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:37,028 INFO L225 Difference]: With dead ends: 6440 [2022-04-07 00:50:37,028 INFO L226 Difference]: Without dead ends: 3726 [2022-04-07 00:50:37,053 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 479 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-07 00:50:37,054 INFO L913 BasicCegarLoop]: 311 mSDtfsCounter, 475 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:37,054 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [475 Valid, 323 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-07 00:50:37,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3726 states. [2022-04-07 00:50:37,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3726 to 2954. [2022-04-07 00:50:37,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2954 states, 2949 states have (on average 1.34587995930824) internal successors, (3969), 2949 states have internal predecessors, (3969), 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:50:37,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2954 states to 2954 states and 3973 transitions. [2022-04-07 00:50:37,252 INFO L78 Accepts]: Start accepts. Automaton has 2954 states and 3973 transitions. Word has length 238 [2022-04-07 00:50:37,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:37,252 INFO L478 AbstractCegarLoop]: Abstraction has 2954 states and 3973 transitions. [2022-04-07 00:50:37,253 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.0) internal successors, (175), 4 states have internal predecessors, (175), 1 states have call successors, (3), 2 states have 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:50:37,253 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 3973 transitions. [2022-04-07 00:50:37,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2022-04-07 00:50:37,262 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:37,262 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-04-07 00:50:37,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-07 00:50:37,486 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,SelfDestructingSolverStorable12 [2022-04-07 00:50:37,486 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:37,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:37,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1932184045, now seen corresponding path program 1 times [2022-04-07 00:50:37,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:37,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [785190279] [2022-04-07 00:50:38,903 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:38,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1932184045, now seen corresponding path program 2 times [2022-04-07 00:50:38,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:38,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898613349] [2022-04-07 00:50:38,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:38,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:38,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:39,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:39,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:39,021 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-04-07 00:50:39,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:39,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898613349] [2022-04-07 00:50:39,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898613349] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 00:50:39,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458688843] [2022-04-07 00:50:39,023 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 00:50:39,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 00:50:39,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 00:50:39,031 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:50:39,051 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:50:39,170 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 00:50:39,171 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 00:50:39,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-07 00:50:39,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 00:50:39,650 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-04-07 00:50:39,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 00:50:39,998 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-04-07 00:50:39,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458688843] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 00:50:39,998 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 00:50:39,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-04-07 00:50:39,999 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:39,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [785190279] [2022-04-07 00:50:39,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [785190279] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:39,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:39,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 00:50:39,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532584581] [2022-04-07 00:50:39,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:40,000 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 00:50:40,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:40,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 00:50:40,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-07 00:50:40,001 INFO L87 Difference]: Start difference. First operand 2954 states and 3973 transitions. Second operand has 5 states, 5 states have (on average 32.4) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (3), 2 states have 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:50:40,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:40,889 INFO L93 Difference]: Finished difference Result 7541 states and 10346 transitions. [2022-04-07 00:50:40,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 00:50:40,890 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (3), 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 259 [2022-04-07 00:50:40,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:40,908 INFO L225 Difference]: With dead ends: 7541 [2022-04-07 00:50:40,908 INFO L226 Difference]: Without dead ends: 4601 [2022-04-07 00:50:40,915 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 521 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:50:40,916 INFO L913 BasicCegarLoop]: 377 mSDtfsCounter, 419 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:40,916 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [419 Valid, 389 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-07 00:50:40,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4601 states. [2022-04-07 00:50:41,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4601 to 4118. [2022-04-07 00:50:41,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4118 states, 4113 states have (on average 1.323851203501094) internal successors, (5445), 4113 states have internal predecessors, (5445), 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:50:41,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4118 states to 4118 states and 5449 transitions. [2022-04-07 00:50:41,237 INFO L78 Accepts]: Start accepts. Automaton has 4118 states and 5449 transitions. Word has length 259 [2022-04-07 00:50:41,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:41,237 INFO L478 AbstractCegarLoop]: Abstraction has 4118 states and 5449 transitions. [2022-04-07 00:50:41,237 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (3), 2 states have 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:50:41,238 INFO L276 IsEmpty]: Start isEmpty. Operand 4118 states and 5449 transitions. [2022-04-07 00:50:41,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2022-04-07 00:50:41,247 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:41,247 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2022-04-07 00:50:41,271 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:50:41,462 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,SelfDestructingSolverStorable13 [2022-04-07 00:50:41,463 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:41,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:41,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1590295734, now seen corresponding path program 1 times [2022-04-07 00:50:41,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:41,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [791600128] [2022-04-07 00:50:43,079 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:43,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1590295734, now seen corresponding path program 2 times [2022-04-07 00:50:43,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:43,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319428140] [2022-04-07 00:50:43,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:43,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:43,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:43,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:43,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:43,134 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 449 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2022-04-07 00:50:43,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:43,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319428140] [2022-04-07 00:50:43,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319428140] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:43,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:43,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:43,135 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:43,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [791600128] [2022-04-07 00:50:43,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [791600128] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:43,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:43,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:43,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302135952] [2022-04-07 00:50:43,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:43,136 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:43,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:43,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:43,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:43,137 INFO L87 Difference]: Start difference. First operand 4118 states and 5449 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (3), 2 states have 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:50:43,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:43,575 INFO L93 Difference]: Finished difference Result 7154 states and 9612 transitions. [2022-04-07 00:50:43,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:43,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (3), 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 296 [2022-04-07 00:50:43,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:43,582 INFO L225 Difference]: With dead ends: 7154 [2022-04-07 00:50:43,583 INFO L226 Difference]: Without dead ends: 1935 [2022-04-07 00:50:43,598 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:50:43,599 INFO L913 BasicCegarLoop]: 213 mSDtfsCounter, 223 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:43,599 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [223 Valid, 220 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 00:50:43,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2022-04-07 00:50:43,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1845. [2022-04-07 00:50:43,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1845 states, 1840 states have (on average 1.298913043478261) internal successors, (2390), 1840 states have internal predecessors, (2390), 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:50:43,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1845 states to 1845 states and 2394 transitions. [2022-04-07 00:50:43,715 INFO L78 Accepts]: Start accepts. Automaton has 1845 states and 2394 transitions. Word has length 296 [2022-04-07 00:50:43,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:43,715 INFO L478 AbstractCegarLoop]: Abstraction has 1845 states and 2394 transitions. [2022-04-07 00:50:43,716 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (3), 2 states have 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:50:43,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 2394 transitions. [2022-04-07 00:50:43,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2022-04-07 00:50:43,722 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:43,722 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-04-07 00:50:43,722 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-07 00:50:43,722 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:43,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:43,723 INFO L85 PathProgramCache]: Analyzing trace with hash 2144653212, now seen corresponding path program 1 times [2022-04-07 00:50:43,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:43,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [963142923] [2022-04-07 00:50:46,008 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:46,008 INFO L85 PathProgramCache]: Analyzing trace with hash 2144653212, now seen corresponding path program 2 times [2022-04-07 00:50:46,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:46,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723600091] [2022-04-07 00:50:46,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:46,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:46,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:46,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:46,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:46,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1088 backedges. 454 proven. 0 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2022-04-07 00:50:46,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:46,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723600091] [2022-04-07 00:50:46,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723600091] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:46,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:46,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:46,059 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:46,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [963142923] [2022-04-07 00:50:46,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [963142923] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:46,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:46,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:46,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107629445] [2022-04-07 00:50:46,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:46,060 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:46,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:46,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:46,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:46,061 INFO L87 Difference]: Start difference. First operand 1845 states and 2394 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have 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:50:46,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:46,498 INFO L93 Difference]: Finished difference Result 5465 states and 7068 transitions. [2022-04-07 00:50:46,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:46,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (3), 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 334 [2022-04-07 00:50:46,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:46,510 INFO L225 Difference]: With dead ends: 5465 [2022-04-07 00:50:46,511 INFO L226 Difference]: Without dead ends: 3634 [2022-04-07 00:50:46,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:50:46,516 INFO L913 BasicCegarLoop]: 353 mSDtfsCounter, 366 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:46,517 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [366 Valid, 360 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 00:50:46,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3634 states. [2022-04-07 00:50:46,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3634 to 1851. [2022-04-07 00:50:46,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1851 states, 1846 states have (on average 1.2979414951245938) internal successors, (2396), 1846 states have internal predecessors, (2396), 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:50:46,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1851 states to 1851 states and 2400 transitions. [2022-04-07 00:50:46,673 INFO L78 Accepts]: Start accepts. Automaton has 1851 states and 2400 transitions. Word has length 334 [2022-04-07 00:50:46,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:46,673 INFO L478 AbstractCegarLoop]: Abstraction has 1851 states and 2400 transitions. [2022-04-07 00:50:46,673 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have 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:50:46,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 2400 transitions. [2022-04-07 00:50:46,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2022-04-07 00:50:46,679 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:46,679 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-04-07 00:50:46,680 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-07 00:50:46,680 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:46,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:46,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1580892611, now seen corresponding path program 1 times [2022-04-07 00:50:46,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:46,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [184676978] [2022-04-07 00:50:49,151 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:49,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1580892611, now seen corresponding path program 2 times [2022-04-07 00:50:49,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:49,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598326705] [2022-04-07 00:50:49,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:49,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:49,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:49,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:49,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1088 backedges. 580 proven. 0 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2022-04-07 00:50:49,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:49,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598326705] [2022-04-07 00:50:49,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598326705] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:49,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:49,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:49,206 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:49,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [184676978] [2022-04-07 00:50:49,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [184676978] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:49,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:49,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:49,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677589432] [2022-04-07 00:50:49,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:49,207 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:49,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:49,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:49,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:49,207 INFO L87 Difference]: Start difference. First operand 1851 states and 2400 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:49,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:49,534 INFO L93 Difference]: Finished difference Result 3894 states and 5132 transitions. [2022-04-07 00:50:49,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:49,535 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 334 [2022-04-07 00:50:49,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:49,541 INFO L225 Difference]: With dead ends: 3894 [2022-04-07 00:50:49,542 INFO L226 Difference]: Without dead ends: 2057 [2022-04-07 00:50:49,546 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:50:49,546 INFO L913 BasicCegarLoop]: 209 mSDtfsCounter, 223 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:49,546 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [223 Valid, 216 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 00:50:49,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2057 states. [2022-04-07 00:50:49,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2057 to 2013. [2022-04-07 00:50:49,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2013 states, 2008 states have (on average 1.2888446215139442) internal successors, (2588), 2008 states have internal predecessors, (2588), 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:50:49,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2013 states to 2013 states and 2592 transitions. [2022-04-07 00:50:49,694 INFO L78 Accepts]: Start accepts. Automaton has 2013 states and 2592 transitions. Word has length 334 [2022-04-07 00:50:49,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:49,694 INFO L478 AbstractCegarLoop]: Abstraction has 2013 states and 2592 transitions. [2022-04-07 00:50:49,694 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:49,694 INFO L276 IsEmpty]: Start isEmpty. Operand 2013 states and 2592 transitions. [2022-04-07 00:50:49,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2022-04-07 00:50:49,698 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:49,699 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:50:49,699 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-07 00:50:49,699 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:49,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:49,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1669274811, now seen corresponding path program 1 times [2022-04-07 00:50:49,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:49,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1235796485] [2022-04-07 00:50:52,049 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:52,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1669274811, now seen corresponding path program 2 times [2022-04-07 00:50:52,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:52,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982958075] [2022-04-07 00:50:52,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:52,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:52,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:52,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:52,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:52,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1301 backedges. 738 proven. 0 refuted. 0 times theorem prover too weak. 563 trivial. 0 not checked. [2022-04-07 00:50:52,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:52,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982958075] [2022-04-07 00:50:52,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982958075] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:52,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:52,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:52,115 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:52,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1235796485] [2022-04-07 00:50:52,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1235796485] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:52,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:52,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:52,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183664212] [2022-04-07 00:50:52,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:52,118 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:52,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:52,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:52,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:52,119 INFO L87 Difference]: Start difference. First operand 2013 states and 2592 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:52,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:52,476 INFO L93 Difference]: Finished difference Result 4056 states and 5260 transitions. [2022-04-07 00:50:52,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:52,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 357 [2022-04-07 00:50:52,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:52,482 INFO L225 Difference]: With dead ends: 4056 [2022-04-07 00:50:52,483 INFO L226 Difference]: Without dead ends: 2057 [2022-04-07 00:50:52,487 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:50:52,487 INFO L913 BasicCegarLoop]: 209 mSDtfsCounter, 204 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:52,487 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [204 Valid, 216 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 00:50:52,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2057 states. [2022-04-07 00:50:52,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2057 to 1759. [2022-04-07 00:50:52,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1759 states, 1754 states have (on average 1.2628278221208666) internal successors, (2215), 1754 states have internal predecessors, (2215), 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:50:52,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1759 states and 2219 transitions. [2022-04-07 00:50:52,608 INFO L78 Accepts]: Start accepts. Automaton has 1759 states and 2219 transitions. Word has length 357 [2022-04-07 00:50:52,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:52,608 INFO L478 AbstractCegarLoop]: Abstraction has 1759 states and 2219 transitions. [2022-04-07 00:50:52,608 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:52,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 2219 transitions. [2022-04-07 00:50:52,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2022-04-07 00:50:52,614 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:52,615 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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:50:52,615 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-07 00:50:52,615 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:52,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:52,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1550922707, now seen corresponding path program 1 times [2022-04-07 00:50:52,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:52,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1904205965] [2022-04-07 00:50:55,542 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:55,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1550922707, now seen corresponding path program 2 times [2022-04-07 00:50:55,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:55,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312105983] [2022-04-07 00:50:55,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:55,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:55,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:55,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:55,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:55,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 1011 proven. 26 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2022-04-07 00:50:55,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:55,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312105983] [2022-04-07 00:50:55,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312105983] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 00:50:55,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612855281] [2022-04-07 00:50:55,629 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 00:50:55,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 00:50:55,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 00:50:55,630 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:50:55,660 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:50:55,752 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 00:50:55,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 00:50:55,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-07 00:50:55,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 00:50:56,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2022-04-07 00:50:56,289 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 00:50:56,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612855281] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:56,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 00:50:56,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-04-07 00:50:56,290 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:56,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1904205965] [2022-04-07 00:50:56,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1904205965] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:56,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:56,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 00:50:56,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703472536] [2022-04-07 00:50:56,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:56,292 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 00:50:56,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:56,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 00:50:56,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 00:50:56,293 INFO L87 Difference]: Start difference. First operand 1759 states and 2219 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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:50:56,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:56,499 INFO L93 Difference]: Finished difference Result 2086 states and 2627 transitions. [2022-04-07 00:50:56,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 00:50:56,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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 399 [2022-04-07 00:50:56,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:56,508 INFO L225 Difference]: With dead ends: 2086 [2022-04-07 00:50:56,508 INFO L226 Difference]: Without dead ends: 1948 [2022-04-07 00:50:56,509 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 400 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:50:56,509 INFO L913 BasicCegarLoop]: 356 mSDtfsCounter, 90 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 541 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:50:56,510 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 541 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 00:50:56,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1948 states. [2022-04-07 00:50:56,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1948 to 1623. [2022-04-07 00:50:56,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1623 states, 1618 states have (on average 1.273794808405439) internal successors, (2061), 1618 states have internal predecessors, (2061), 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:50:56,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2065 transitions. [2022-04-07 00:50:56,683 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2065 transitions. Word has length 399 [2022-04-07 00:50:56,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:56,684 INFO L478 AbstractCegarLoop]: Abstraction has 1623 states and 2065 transitions. [2022-04-07 00:50:56,684 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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:50:56,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2065 transitions. [2022-04-07 00:50:56,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2022-04-07 00:50:56,688 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:56,688 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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:50:56,713 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:50:56,911 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 00:50:56,912 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:56,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:56,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1704567234, now seen corresponding path program 1 times [2022-04-07 00:50:56,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:56,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [760348812] [2022-04-07 00:50:58,975 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:58,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1704567234, now seen corresponding path program 2 times [2022-04-07 00:50:58,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:58,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530816885] [2022-04-07 00:50:58,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:58,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:58,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:59,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:59,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:59,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2022-04-07 00:50:59,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:59,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530816885] [2022-04-07 00:50:59,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530816885] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 00:50:59,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181601696] [2022-04-07 00:50:59,043 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 00:50:59,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 00:50:59,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 00:50:59,052 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:50:59,062 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:50:59,177 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 00:50:59,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 00:50:59,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-07 00:50:59,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 00:50:59,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2022-04-07 00:50:59,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 00:51:00,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2022-04-07 00:51:00,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181601696] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 00:51:00,425 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 00:51:00,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-04-07 00:51:00,426 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:51:00,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [760348812] [2022-04-07 00:51:00,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [760348812] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:51:00,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:51:00,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 00:51:00,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466264601] [2022-04-07 00:51:00,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:51:00,427 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 00:51:00,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:51:00,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 00:51:00,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-07 00:51:00,428 INFO L87 Difference]: Start difference. First operand 1623 states and 2065 transitions. Second operand has 5 states, 5 states have (on average 35.6) internal successors, (178), 4 states have internal predecessors, (178), 1 states have call successors, (3), 2 states have 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:51:01,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:51:01,046 INFO L93 Difference]: Finished difference Result 3881 states and 5001 transitions. [2022-04-07 00:51:01,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 00:51:01,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.6) internal successors, (178), 4 states have internal predecessors, (178), 1 states have call successors, (3), 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 415 [2022-04-07 00:51:01,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:51:01,054 INFO L225 Difference]: With dead ends: 3881 [2022-04-07 00:51:01,054 INFO L226 Difference]: Without dead ends: 2242 [2022-04-07 00:51:01,058 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 841 GetRequests, 833 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-07 00:51:01,060 INFO L913 BasicCegarLoop]: 308 mSDtfsCounter, 475 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-07 00:51:01,060 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [475 Valid, 320 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-07 00:51:01,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2242 states. [2022-04-07 00:51:01,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2242 to 1783. [2022-04-07 00:51:01,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1783 states, 1778 states have (on average 1.3138357705286838) internal successors, (2336), 1778 states have internal predecessors, (2336), 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:51:01,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 2340 transitions. [2022-04-07 00:51:01,264 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 2340 transitions. Word has length 415 [2022-04-07 00:51:01,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:51:01,264 INFO L478 AbstractCegarLoop]: Abstraction has 1783 states and 2340 transitions. [2022-04-07 00:51:01,264 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.6) internal successors, (178), 4 states have internal predecessors, (178), 1 states have call successors, (3), 2 states have 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:51:01,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 2340 transitions. [2022-04-07 00:51:01,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2022-04-07 00:51:01,269 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:51:01,269 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 6, 6, 6, 6, 6, 6, 4, 4, 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:51:01,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-07 00:51:01,487 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 00:51:01,488 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:51:01,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:51:01,488 INFO L85 PathProgramCache]: Analyzing trace with hash 979497196, now seen corresponding path program 1 times [2022-04-07 00:51:01,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:51:01,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [721654268] [2022-04-07 00:51:03,845 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:51:03,846 INFO L85 PathProgramCache]: Analyzing trace with hash 979497196, now seen corresponding path program 2 times [2022-04-07 00:51:03,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:51:03,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706252021] [2022-04-07 00:51:03,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:51:03,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:51:03,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:51:03,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:51:03,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:51:03,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2337 backedges. 1323 proven. 0 refuted. 0 times theorem prover too weak. 1014 trivial. 0 not checked. [2022-04-07 00:51:03,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:51:03,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706252021] [2022-04-07 00:51:03,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706252021] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:51:03,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:51:03,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:51:03,917 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:51:03,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [721654268] [2022-04-07 00:51:03,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [721654268] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:51:03,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:51:03,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:51:03,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273141690] [2022-04-07 00:51:03,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:51:03,918 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:51:03,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:51:03,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:51:03,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:51:03,918 INFO L87 Difference]: Start difference. First operand 1783 states and 2340 transitions. Second operand has 4 states, 4 states have (on average 41.0) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (3), 2 states have 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:51:04,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:51:04,357 INFO L93 Difference]: Finished difference Result 3732 states and 4972 transitions. [2022-04-07 00:51:04,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:51:04,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (3), 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 477 [2022-04-07 00:51:04,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:51:04,362 INFO L225 Difference]: With dead ends: 3732 [2022-04-07 00:51:04,362 INFO L226 Difference]: Without dead ends: 1963 [2022-04-07 00:51:04,366 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:51:04,366 INFO L913 BasicCegarLoop]: 208 mSDtfsCounter, 203 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:51:04,366 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 215 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 00:51:04,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1963 states. [2022-04-07 00:51:04,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1963 to 1953. [2022-04-07 00:51:04,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1953 states, 1948 states have (on average 1.2992813141683779) internal successors, (2531), 1948 states have internal predecessors, (2531), 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:51:04,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1953 states to 1953 states and 2535 transitions. [2022-04-07 00:51:04,533 INFO L78 Accepts]: Start accepts. Automaton has 1953 states and 2535 transitions. Word has length 477 [2022-04-07 00:51:04,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:51:04,534 INFO L478 AbstractCegarLoop]: Abstraction has 1953 states and 2535 transitions. [2022-04-07 00:51:04,534 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (3), 2 states have 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:51:04,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1953 states and 2535 transitions. [2022-04-07 00:51:04,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2022-04-07 00:51:04,539 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:51:04,539 INFO L499 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 6, 6, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:04,539 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-07 00:51:04,540 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:51:04,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:51:04,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1843033278, now seen corresponding path program 1 times [2022-04-07 00:51:04,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:51:04,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1531121613] [2022-04-07 00:51:07,041 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:51:07,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1843033278, now seen corresponding path program 2 times [2022-04-07 00:51:07,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:51:07,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916018230] [2022-04-07 00:51:07,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:51:07,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:51:07,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:51:07,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:51:07,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:51:07,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3102 backedges. 1760 proven. 0 refuted. 0 times theorem prover too weak. 1342 trivial. 0 not checked. [2022-04-07 00:51:07,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:51:07,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916018230] [2022-04-07 00:51:07,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916018230] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:51:07,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:51:07,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:51:07,117 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:51:07,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1531121613] [2022-04-07 00:51:07,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1531121613] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:51:07,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:51:07,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:51:07,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736572043] [2022-04-07 00:51:07,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:51:07,118 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:51:07,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:51:07,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:51:07,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:51:07,118 INFO L87 Difference]: Start difference. First operand 1953 states and 2535 transitions. Second operand has 4 states, 4 states have (on average 43.5) internal successors, (174), 3 states have internal predecessors, (174), 1 states have call successors, (3), 2 states have 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:51:07,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:51:07,458 INFO L93 Difference]: Finished difference Result 3890 states and 5046 transitions. [2022-04-07 00:51:07,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:51:07,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 3 states have internal predecessors, (174), 1 states have call successors, (3), 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 539 [2022-04-07 00:51:07,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:51:07,463 INFO L225 Difference]: With dead ends: 3890 [2022-04-07 00:51:07,463 INFO L226 Difference]: Without dead ends: 1951 [2022-04-07 00:51:07,466 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:51:07,467 INFO L913 BasicCegarLoop]: 208 mSDtfsCounter, 203 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:51:07,467 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 215 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 00:51:07,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1951 states. [2022-04-07 00:51:07,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1951 to 1877. [2022-04-07 00:51:07,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1877 states, 1872 states have (on average 1.2430555555555556) internal successors, (2327), 1872 states have internal predecessors, (2327), 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:51:07,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 2331 transitions. [2022-04-07 00:51:07,608 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 2331 transitions. Word has length 539 [2022-04-07 00:51:07,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:51:07,609 INFO L478 AbstractCegarLoop]: Abstraction has 1877 states and 2331 transitions. [2022-04-07 00:51:07,609 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 3 states have internal predecessors, (174), 1 states have call successors, (3), 2 states have 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:51:07,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2331 transitions. [2022-04-07 00:51:07,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 606 [2022-04-07 00:51:07,614 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:51:07,614 INFO L499 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 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, 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:51:07,614 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-07 00:51:07,615 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:51:07,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:51:07,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1734536330, now seen corresponding path program 1 times [2022-04-07 00:51:07,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:51:07,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1377104835] [2022-04-07 00:51:10,324 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:51:10,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1734536330, now seen corresponding path program 2 times [2022-04-07 00:51:10,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:51:10,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053330265] [2022-04-07 00:51:10,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:51:10,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:51:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:51:10,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:51:10,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:51:10,425 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2022-04-07 00:51:10,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:51:10,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053330265] [2022-04-07 00:51:10,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053330265] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 00:51:10,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577636859] [2022-04-07 00:51:10,426 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 00:51:10,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 00:51:10,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 00:51:10,451 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:51:10,457 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:51:10,612 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 00:51:10,612 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 00:51:10,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 994 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-07 00:51:10,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 00:51:11,339 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2022-04-07 00:51:11,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 00:51:11,959 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2022-04-07 00:51:11,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577636859] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 00:51:11,959 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 00:51:11,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-04-07 00:51:11,960 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:51:11,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1377104835] [2022-04-07 00:51:11,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1377104835] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:51:11,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:51:11,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 00:51:11,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46778735] [2022-04-07 00:51:11,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:51:11,961 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 00:51:11,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:51:11,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 00:51:11,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-07 00:51:11,962 INFO L87 Difference]: Start difference. First operand 1877 states and 2331 transitions. Second operand has 5 states, 5 states have (on average 44.0) internal successors, (220), 4 states have internal predecessors, (220), 1 states have call successors, (3), 2 states have 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:51:12,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:51:12,367 INFO L93 Difference]: Finished difference Result 2914 states and 3618 transitions. [2022-04-07 00:51:12,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 00:51:12,367 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.0) internal successors, (220), 4 states have internal predecessors, (220), 1 states have call successors, (3), 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 605 [2022-04-07 00:51:12,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:51:12,368 INFO L225 Difference]: With dead ends: 2914 [2022-04-07 00:51:12,368 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 00:51:12,376 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 1219 GetRequests, 1210 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:51:12,377 INFO L913 BasicCegarLoop]: 244 mSDtfsCounter, 211 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 00:51:12,377 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 256 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 00:51:12,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 00:51:12,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 00:51:12,378 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:51:12,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 00:51:12,378 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 605 [2022-04-07 00:51:12,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:51:12,378 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 00:51:12,379 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.0) internal successors, (220), 4 states have internal predecessors, (220), 1 states have call successors, (3), 2 states have 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:51:12,379 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 00:51:12,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 00:51:12,382 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 00:51:12,425 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:51:12,583 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,SelfDestructingSolverStorable22 [2022-04-07 00:51:12,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-07 00:51:56,198 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 13) no Hoare annotation was computed. [2022-04-07 00:51:56,198 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 13) no Hoare annotation was computed. [2022-04-07 00:51:56,199 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 13) no Hoare annotation was computed. [2022-04-07 00:51:56,199 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 623 634) the Hoare annotation is: true [2022-04-07 00:51:56,199 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 623 634) the Hoare annotation is: true [2022-04-07 00:51:56,199 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 623 634) the Hoare annotation is: true [2022-04-07 00:51:56,199 INFO L885 garLoopResultBuilder]: At program point L630(line 630) the Hoare annotation is: true [2022-04-07 00:51:56,199 INFO L885 garLoopResultBuilder]: At program point L630-1(line 630) the Hoare annotation is: true [2022-04-07 00:51:56,199 INFO L878 garLoopResultBuilder]: At program point L531(lines 531 535) the Hoare annotation is: (let ((.cse1 (not (= ssl3_accept_~s__hit~0 0))) (.cse0 (= 8448 ssl3_accept_~s__state~0)) (.cse2 (= 3 ssl3_accept_~blastFlag~0))) (or (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse0 .cse1) (and .cse0 .cse1 .cse2) (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and .cse0 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse2))) [2022-04-07 00:51:56,199 INFO L878 garLoopResultBuilder]: At program point L531-2(lines 531 535) the Hoare annotation is: (let ((.cse0 (= 8448 ssl3_accept_~s__state~0)) (.cse1 (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse2 (= ssl3_accept_~s__hit~0 0))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0 .cse1 .cse2) (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse0 (not .cse2) (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse1 .cse2 (= 3 ssl3_accept_~blastFlag~0)))) [2022-04-07 00:51:56,200 INFO L878 garLoopResultBuilder]: At program point L399(lines 399 417) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and .cse0 (= 2 ssl3_accept_~blastFlag~0) (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:56,200 INFO L878 garLoopResultBuilder]: At program point L201(lines 197 562) the Hoare annotation is: (let ((.cse1 (<= ssl3_accept_~s__state~0 8672)) (.cse0 (<= 8640 ssl3_accept_~s__state~0)) (.cse2 (= ssl3_accept_~s__hit~0 0))) (or (and .cse0 (= 2 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse1 .cse2) (and .cse0 (= ssl3_accept_~blastFlag~0 0) .cse1) (and .cse0 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640) (not .cse2) (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0) (<= ssl3_accept_~s__state~0 8640)))) [2022-04-07 00:51:56,200 INFO L878 garLoopResultBuilder]: At program point L168(lines 164 573) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and .cse0 (= 2 ssl3_accept_~blastFlag~0) (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:56,200 INFO L878 garLoopResultBuilder]: At program point L135(lines 134 583) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8640))) (or (and (= 2 ssl3_accept_~blastFlag~0) .cse0) (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse0))) [2022-04-07 00:51:56,200 INFO L878 garLoopResultBuilder]: At program point L102(lines 102 104) the Hoare annotation is: (= ssl3_accept_~blastFlag~0 0) [2022-04-07 00:51:56,200 INFO L878 garLoopResultBuilder]: At program point L499(lines 499 502) the Hoare annotation is: (let ((.cse1 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (<= 8640 ssl3_accept_~s__state~0)) (.cse2 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse2) (and .cse0 .cse1 (not (= ssl3_accept_~s__hit~0 0)) .cse2) (and .cse0 (= ssl3_accept_~blastFlag~0 0) .cse2))) [2022-04-07 00:51:56,200 INFO L878 garLoopResultBuilder]: At program point L400(lines 400 406) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and .cse0 (= 2 ssl3_accept_~blastFlag~0) (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:56,200 INFO L878 garLoopResultBuilder]: At program point L203(lines 203 560) the Hoare annotation is: (let ((.cse1 (<= ssl3_accept_~s__state~0 8640)) (.cse2 (= ssl3_accept_~s__state~0 8656)) (.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse3 (not (= ssl3_accept_~s__hit~0 0))) (.cse5 (<= ssl3_accept_~s__state~0 8672)) (.cse6 (<= 8672 ssl3_accept_~s__state~0)) (.cse7 (= 3 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse2 .cse0 .cse3) (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse1) (and .cse4 .cse5 .cse6 .cse7) (and .cse2 .cse0 .cse4) (and .cse3 .cse5 .cse6 .cse7))) [2022-04-07 00:51:56,200 INFO L878 garLoopResultBuilder]: At program point L170(lines 170 571) the Hoare annotation is: (let ((.cse7 (= ssl3_accept_~s__hit~0 0))) (let ((.cse1 (= ssl3_accept_~s__state~0 3)) (.cse2 (= ssl3_accept_~s__state~0 8656)) (.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse5 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse11 (<= 8640 ssl3_accept_~s__state~0)) (.cse6 (<= ssl3_accept_~s__state~0 8640)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse12 (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse13 (= 8448 ssl3_accept_~s__state~0)) (.cse3 (not .cse7)) (.cse8 (<= ssl3_accept_~s__state~0 8672)) (.cse9 (<= 8672 ssl3_accept_~s__state~0)) (.cse10 (= 3 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse2 .cse0 .cse3) (and .cse4 (<= ssl3_accept_~s__state~0 8576) .cse0 .cse5 .cse6 .cse7) (and .cse4 .cse1) (and .cse0 (= 8560 ssl3_accept_~s__state~0) .cse7) (and .cse4 .cse0 .cse5 (= ssl3_accept_~s__state~0 8592) .cse6 .cse7) (and .cse4 .cse0 .cse5 .cse6 (= ssl3_accept_~s__state~0 8608) .cse7) (and .cse5 .cse8 .cse9 .cse10) (and .cse2 .cse0 .cse5) (and .cse11 .cse0 .cse5 .cse6 .cse7) (and .cse11 .cse4 .cse3 .cse12 .cse6) (and .cse4 .cse13 .cse3 .cse12) (and .cse13 (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse7 .cse10) (and .cse3 .cse8 .cse9 .cse10)))) [2022-04-07 00:51:56,201 INFO L878 garLoopResultBuilder]: At program point L137(lines 137 582) the Hoare annotation is: (let ((.cse7 (= ssl3_accept_~s__hit~0 0))) (let ((.cse1 (= ssl3_accept_~s__state~0 3)) (.cse2 (= ssl3_accept_~s__state~0 8656)) (.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse5 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse11 (<= 8640 ssl3_accept_~s__state~0)) (.cse6 (<= ssl3_accept_~s__state~0 8640)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse12 (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse13 (= 8448 ssl3_accept_~s__state~0)) (.cse3 (not .cse7)) (.cse8 (<= ssl3_accept_~s__state~0 8672)) (.cse9 (<= 8672 ssl3_accept_~s__state~0)) (.cse10 (= 3 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse2 .cse0 .cse3) (and .cse4 (<= ssl3_accept_~s__state~0 8576) .cse0 .cse5 .cse6 .cse7) (and .cse4 .cse1) (and (= ssl3_accept_~blastFlag~0 1) (= 8496 ssl3_accept_~s__state~0)) (and .cse4 .cse0 .cse5 (= ssl3_accept_~s__state~0 8592) .cse6 .cse7) (and .cse0 .cse6 (= 8560 ssl3_accept_~s__state~0) .cse7) (and .cse4 .cse0 .cse5 .cse6 (= ssl3_accept_~s__state~0 8608) .cse7) (and .cse5 .cse8 .cse9 .cse10) (and (= ssl3_accept_~s__state~0 8544) .cse0 .cse6 .cse7) (and .cse2 .cse0 .cse5) (and .cse0 (= ssl3_accept_~s__state~0 8528) .cse7) (and .cse0 (= ssl3_accept_~s__state~0 8512) .cse7) (and .cse11 .cse0 .cse5 .cse6 .cse7) (and .cse11 .cse4 .cse3 .cse12 .cse6) (and .cse4 .cse13 .cse3 .cse12) (and .cse13 (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse7 .cse10) (and .cse3 .cse8 .cse9 .cse10)))) [2022-04-07 00:51:56,201 INFO L878 garLoopResultBuilder]: At program point L600(lines 600 604) the Hoare annotation is: (let ((.cse7 (= ssl3_accept_~s__hit~0 0))) (let ((.cse1 (= ssl3_accept_~s__state~0 3)) (.cse2 (= ssl3_accept_~s__state~0 8656)) (.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse5 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse11 (<= 8640 ssl3_accept_~s__state~0)) (.cse6 (<= ssl3_accept_~s__state~0 8640)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse12 (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse13 (= 8448 ssl3_accept_~s__state~0)) (.cse3 (not .cse7)) (.cse8 (<= ssl3_accept_~s__state~0 8672)) (.cse9 (<= 8672 ssl3_accept_~s__state~0)) (.cse10 (= 3 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse2 .cse0 .cse3) (and .cse4 (<= ssl3_accept_~s__state~0 8576) .cse0 .cse5 .cse6 .cse7) (and .cse4 .cse1) (and (= ssl3_accept_~blastFlag~0 1) (= 8496 ssl3_accept_~s__state~0)) (and .cse4 .cse0 .cse5 (= ssl3_accept_~s__state~0 8592) .cse6 .cse7) (and .cse0 .cse6 (= 8560 ssl3_accept_~s__state~0) .cse7) (and .cse4 .cse0 .cse5 .cse6 (= ssl3_accept_~s__state~0 8608) .cse7) (and .cse5 .cse8 .cse9 .cse10) (and (= ssl3_accept_~s__state~0 8544) .cse0 .cse6 .cse7) (and .cse2 .cse0 .cse5) (and .cse0 (= ssl3_accept_~s__state~0 8528) .cse7) (and .cse0 (= ssl3_accept_~s__state~0 8512) .cse7) (and .cse11 .cse0 .cse5 .cse6 .cse7) (and .cse11 .cse4 .cse3 .cse12 .cse6) (and .cse4 .cse13 .cse3 .cse12) (and .cse13 (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse7 .cse10) (and .cse3 .cse8 .cse9 .cse10)))) [2022-04-07 00:51:56,201 INFO L878 garLoopResultBuilder]: At program point L468(lines 468 470) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8640))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and (= 2 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:56,201 INFO L878 garLoopResultBuilder]: At program point L270(lines 270 272) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and .cse0 (= 2 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:56,201 INFO L878 garLoopResultBuilder]: At program point L237(lines 237 248) the Hoare annotation is: (let ((.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse1 (<= ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1) (and (<= 8640 ssl3_accept_~s__state~0) .cse0) (and .cse1 (= 2 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:56,201 INFO L878 garLoopResultBuilder]: At program point L237-2(lines 219 553) the Hoare annotation is: (let ((.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse1 (<= ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1) (and (<= 8640 ssl3_accept_~s__state~0) .cse0) (and .cse1 (= 2 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:56,201 INFO L878 garLoopResultBuilder]: At program point L304(lines 304 308) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and .cse0 (= 2 ssl3_accept_~blastFlag~0)))) [2022-04-07 00:51:56,202 INFO L878 garLoopResultBuilder]: At program point L304-2(lines 304 308) the Hoare annotation is: (let ((.cse5 (= ssl3_accept_~s__hit~0 0))) (let ((.cse1 (= ssl3_accept_~s__state~0 8656)) (.cse2 (not .cse5)) (.cse3 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse4 (= ssl3_accept_~s__state~0 8512))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse2) (and .cse3 .cse4 .cse5) (and .cse0 .cse4 .cse5)))) [2022-04-07 00:51:56,202 INFO L878 garLoopResultBuilder]: At program point L437-1(lines 437 445) the Hoare annotation is: (let ((.cse0 (= 8448 ssl3_accept_~s__state~0)) (.cse1 (= ssl3_accept_~s__hit~0 0))) (or (and .cse0 (= 2 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse1) (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse0 (not .cse1) (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0)) (and .cse0 (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse1 (= 3 ssl3_accept_~blastFlag~0)))) [2022-04-07 00:51:56,202 INFO L878 garLoopResultBuilder]: At program point L239(lines 239 242) the Hoare annotation is: (let ((.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse1 (<= ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1) (and (<= 8640 ssl3_accept_~s__state~0) .cse0) (and .cse1 (= 2 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:56,202 INFO L878 garLoopResultBuilder]: At program point L206(lines 206 559) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8640)) (.cse1 (<= ssl3_accept_~s__state~0 8672)) (.cse2 (<= 8672 ssl3_accept_~s__state~0)) (.cse3 (= 3 ssl3_accept_~blastFlag~0))) (or (and (= 2 ssl3_accept_~blastFlag~0) .cse0) (= ssl3_accept_~blastFlag~0 0) (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse0) (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse1 .cse2 .cse3) (and (not (= ssl3_accept_~s__hit~0 0)) .cse1 .cse2 .cse3))) [2022-04-07 00:51:56,202 INFO L878 garLoopResultBuilder]: At program point L173(lines 173 570) the Hoare annotation is: (let ((.cse7 (= ssl3_accept_~s__hit~0 0))) (let ((.cse1 (= ssl3_accept_~s__state~0 3)) (.cse2 (= ssl3_accept_~s__state~0 8656)) (.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse5 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse11 (<= 8640 ssl3_accept_~s__state~0)) (.cse6 (<= ssl3_accept_~s__state~0 8640)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse12 (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse13 (= 8448 ssl3_accept_~s__state~0)) (.cse3 (not .cse7)) (.cse8 (<= ssl3_accept_~s__state~0 8672)) (.cse9 (<= 8672 ssl3_accept_~s__state~0)) (.cse10 (= 3 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse2 .cse0 .cse3) (and .cse4 (<= ssl3_accept_~s__state~0 8576) .cse0 .cse5 .cse6 .cse7) (and .cse4 .cse1) (and .cse4 .cse0 .cse5 (= ssl3_accept_~s__state~0 8592) .cse6 .cse7) (and .cse4 .cse0 .cse5 .cse6 (= ssl3_accept_~s__state~0 8608) .cse7) (and .cse5 .cse8 .cse9 .cse10) (and .cse2 .cse0 .cse5) (and .cse11 .cse0 .cse5 .cse6 .cse7) (and .cse11 .cse4 .cse3 .cse12 .cse6) (and .cse4 .cse13 .cse3 .cse12) (and .cse13 (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse7 .cse10) (and .cse3 .cse8 .cse9 .cse10)))) [2022-04-07 00:51:56,202 INFO L878 garLoopResultBuilder]: At program point L140(lines 140 581) the Hoare annotation is: (let ((.cse7 (= ssl3_accept_~s__hit~0 0))) (let ((.cse1 (= ssl3_accept_~s__state~0 3)) (.cse2 (= ssl3_accept_~s__state~0 8656)) (.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse5 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse11 (<= 8640 ssl3_accept_~s__state~0)) (.cse6 (<= ssl3_accept_~s__state~0 8640)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse12 (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse13 (= 8448 ssl3_accept_~s__state~0)) (.cse3 (not .cse7)) (.cse8 (<= ssl3_accept_~s__state~0 8672)) (.cse9 (<= 8672 ssl3_accept_~s__state~0)) (.cse10 (= 3 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse2 .cse0 .cse3) (and .cse4 (<= ssl3_accept_~s__state~0 8576) .cse0 .cse5 .cse6 .cse7) (and .cse4 .cse1) (and (= ssl3_accept_~blastFlag~0 1) (= 8496 ssl3_accept_~s__state~0)) (and .cse4 .cse0 .cse5 (= ssl3_accept_~s__state~0 8592) .cse6 .cse7) (and .cse0 .cse6 (= 8560 ssl3_accept_~s__state~0) .cse7) (and .cse4 .cse0 .cse5 .cse6 (= ssl3_accept_~s__state~0 8608) .cse7) (and .cse5 .cse8 .cse9 .cse10) (and (= ssl3_accept_~s__state~0 8544) .cse0 .cse6 .cse7) (and .cse2 .cse0 .cse5) (and .cse0 (= ssl3_accept_~s__state~0 8528) .cse7) (and .cse0 (= ssl3_accept_~s__state~0 8512) .cse7) (and .cse11 .cse0 .cse5 .cse6 .cse7) (and .cse11 .cse4 .cse3 .cse12 .cse6) (and .cse4 .cse13 .cse3 .cse12) (and .cse13 (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse7 .cse10) (and .cse3 .cse8 .cse9 .cse10)))) [2022-04-07 00:51:56,203 INFO L878 garLoopResultBuilder]: At program point L504(lines 504 510) the Hoare annotation is: (let ((.cse1 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (<= 8640 ssl3_accept_~s__state~0)) (.cse2 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse2) (and .cse0 .cse1 (not (= ssl3_accept_~s__hit~0 0)) .cse2) (and .cse0 (= ssl3_accept_~blastFlag~0 0) .cse2))) [2022-04-07 00:51:56,203 INFO L878 garLoopResultBuilder]: At program point L207(lines 203 560) the Hoare annotation is: (let ((.cse1 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (<= 8640 ssl3_accept_~s__state~0)) (.cse2 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse2) (and .cse0 .cse1 (not (= ssl3_accept_~s__hit~0 0)) .cse2) (and .cse0 (= ssl3_accept_~blastFlag~0 0) .cse2))) [2022-04-07 00:51:56,203 INFO L878 garLoopResultBuilder]: At program point L174(lines 170 571) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and .cse0 (= 2 ssl3_accept_~blastFlag~0) (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:56,203 INFO L885 garLoopResultBuilder]: At program point ssl3_acceptENTRY(lines 22 622) the Hoare annotation is: true [2022-04-07 00:51:56,203 INFO L878 garLoopResultBuilder]: At program point L440(lines 440 443) the Hoare annotation is: (let ((.cse0 (= 8448 ssl3_accept_~s__state~0)) (.cse1 (= ssl3_accept_~s__hit~0 0))) (or (and .cse0 (= 2 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse1) (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse0 (not .cse1) (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0)) (and .cse0 (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse1 (= 3 ssl3_accept_~blastFlag~0)))) [2022-04-07 00:51:56,203 INFO L878 garLoopResultBuilder]: At program point L341(lines 341 379) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and .cse0 (= 2 ssl3_accept_~blastFlag~0) (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:56,203 INFO L878 garLoopResultBuilder]: At program point L209(lines 209 558) the Hoare annotation is: (let ((.cse1 (<= ssl3_accept_~s__state~0 8672)) (.cse2 (= 3 ssl3_accept_~blastFlag~0)) (.cse0 (<= ssl3_accept_~s__state~0 8640))) (or (and (= 2 ssl3_accept_~blastFlag~0) .cse0) (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse1 .cse2) (and (<= 8640 ssl3_accept_~s__state~0) (not (= ssl3_accept_~s__hit~0 0)) .cse1 .cse2) (= ssl3_accept_~blastFlag~0 0) (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse0))) [2022-04-07 00:51:56,203 INFO L878 garLoopResultBuilder]: At program point L176(lines 176 569) the Hoare annotation is: (let ((.cse7 (= ssl3_accept_~s__hit~0 0))) (let ((.cse1 (= ssl3_accept_~s__state~0 3)) (.cse2 (= ssl3_accept_~s__state~0 8656)) (.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse5 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse11 (<= 8640 ssl3_accept_~s__state~0)) (.cse6 (<= ssl3_accept_~s__state~0 8640)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse12 (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse13 (= 8448 ssl3_accept_~s__state~0)) (.cse3 (not .cse7)) (.cse8 (<= ssl3_accept_~s__state~0 8672)) (.cse9 (<= 8672 ssl3_accept_~s__state~0)) (.cse10 (= 3 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse2 .cse0 .cse3) (and .cse4 (<= ssl3_accept_~s__state~0 8576) .cse0 .cse5 .cse6 .cse7) (and .cse4 .cse1) (and .cse4 .cse0 .cse5 (= ssl3_accept_~s__state~0 8592) .cse6 .cse7) (and .cse4 .cse0 .cse5 .cse6 (= ssl3_accept_~s__state~0 8608) .cse7) (and .cse5 .cse8 .cse9 .cse10) (and .cse2 .cse0 .cse5) (and .cse11 .cse0 .cse5 .cse6 .cse7) (and .cse11 .cse4 .cse3 .cse12 .cse6) (and .cse4 .cse13 .cse3 .cse12) (and .cse13 (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse7 .cse10) (and .cse3 .cse8 .cse9 .cse10)))) [2022-04-07 00:51:56,204 INFO L878 garLoopResultBuilder]: At program point L143(lines 143 580) the Hoare annotation is: (let ((.cse7 (= ssl3_accept_~s__hit~0 0))) (let ((.cse1 (= ssl3_accept_~s__state~0 3)) (.cse2 (= ssl3_accept_~s__state~0 8656)) (.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse5 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse11 (<= 8640 ssl3_accept_~s__state~0)) (.cse6 (<= ssl3_accept_~s__state~0 8640)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse12 (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse13 (= 8448 ssl3_accept_~s__state~0)) (.cse3 (not .cse7)) (.cse8 (<= ssl3_accept_~s__state~0 8672)) (.cse9 (<= 8672 ssl3_accept_~s__state~0)) (.cse10 (= 3 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse2 .cse0 .cse3) (and .cse4 (<= ssl3_accept_~s__state~0 8576) .cse0 .cse5 .cse6 .cse7) (and .cse4 .cse1) (and (= ssl3_accept_~blastFlag~0 1) (= 8496 ssl3_accept_~s__state~0)) (and .cse4 .cse0 .cse5 (= ssl3_accept_~s__state~0 8592) .cse6 .cse7) (and .cse0 .cse6 (= 8560 ssl3_accept_~s__state~0) .cse7) (and .cse4 .cse0 .cse5 .cse6 (= ssl3_accept_~s__state~0 8608) .cse7) (and .cse5 .cse8 .cse9 .cse10) (and (= ssl3_accept_~s__state~0 8544) .cse0 .cse6 .cse7) (and .cse2 .cse0 .cse5) (and .cse0 (= ssl3_accept_~s__state~0 8528) .cse7) (and .cse0 (= ssl3_accept_~s__state~0 8512) .cse7) (and .cse11 .cse0 .cse5 .cse6 .cse7) (and .cse11 .cse4 .cse3 .cse12 .cse6) (and .cse4 .cse13 .cse3 .cse12) (and .cse13 (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse7 .cse10) (and .cse3 .cse8 .cse9 .cse10)))) [2022-04-07 00:51:56,204 INFO L878 garLoopResultBuilder]: At program point L110-2(lines 110 609) the Hoare annotation is: (let ((.cse7 (= ssl3_accept_~s__hit~0 0))) (let ((.cse1 (= ssl3_accept_~s__state~0 3)) (.cse2 (= ssl3_accept_~s__state~0 8656)) (.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse5 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse11 (<= 8640 ssl3_accept_~s__state~0)) (.cse6 (<= ssl3_accept_~s__state~0 8640)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse12 (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse13 (= 8448 ssl3_accept_~s__state~0)) (.cse3 (not .cse7)) (.cse8 (<= ssl3_accept_~s__state~0 8672)) (.cse9 (<= 8672 ssl3_accept_~s__state~0)) (.cse10 (= 3 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse2 .cse0 .cse3) (and .cse4 (<= ssl3_accept_~s__state~0 8576) .cse0 .cse5 .cse6 .cse7) (and .cse4 .cse1) (and (= ssl3_accept_~blastFlag~0 1) (= 8496 ssl3_accept_~s__state~0)) (and .cse4 .cse0 .cse5 (= ssl3_accept_~s__state~0 8592) .cse6 .cse7) (and .cse0 .cse6 (= 8560 ssl3_accept_~s__state~0) .cse7) (and .cse4 .cse0 .cse5 .cse6 (= ssl3_accept_~s__state~0 8608) .cse7) (and .cse5 .cse8 .cse9 .cse10) (and (= ssl3_accept_~s__state~0 8544) .cse0 .cse6 .cse7) (and .cse2 .cse0 .cse5) (and .cse0 (= ssl3_accept_~s__state~0 8528) .cse7) (and .cse0 (= ssl3_accept_~s__state~0 8512) .cse7) (and .cse11 .cse0 .cse5 .cse6 .cse7) (and .cse11 .cse4 .cse3 .cse12 .cse6) (and .cse4 .cse13 .cse3 .cse12) (and .cse13 (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse7 .cse10) (and .cse3 .cse8 .cse9 .cse10)))) [2022-04-07 00:51:56,204 INFO L878 garLoopResultBuilder]: At program point L507(lines 507 509) the Hoare annotation is: (and (<= 8640 ssl3_accept_~s__state~0) (= ssl3_accept_~blastFlag~0 0) (<= ssl3_accept_~s__state~0 8672)) [2022-04-07 00:51:56,204 INFO L878 garLoopResultBuilder]: At program point L507-2(lines 219 553) the Hoare annotation is: (let ((.cse2 (= 3 ssl3_accept_~blastFlag~0)) (.cse0 (<= 8640 ssl3_accept_~s__state~0)) (.cse1 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 (not (= ssl3_accept_~s__hit~0 0)) .cse1 .cse2) (and .cse0 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse1 .cse2) (and .cse0 (= ssl3_accept_~blastFlag~0 0) .cse1))) [2022-04-07 00:51:56,204 INFO L878 garLoopResultBuilder]: At program point L408(lines 399 417) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and .cse0 (= 2 ssl3_accept_~blastFlag~0) (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:56,204 INFO L878 garLoopResultBuilder]: At program point L243(lines 243 246) the Hoare annotation is: (let ((.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse1 (<= ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1) (and (<= 8640 ssl3_accept_~s__state~0) .cse0) (and .cse1 (= 2 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:56,204 INFO L878 garLoopResultBuilder]: At program point L177(lines 176 569) the Hoare annotation is: (let ((.cse0 (= 8448 ssl3_accept_~s__state~0)) (.cse1 (= ssl3_accept_~s__hit~0 0))) (or (and .cse0 (= 2 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse1) (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse0 (not .cse1) (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0)) (and .cse0 (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse1 (= 3 ssl3_accept_~blastFlag~0)))) [2022-04-07 00:51:56,205 INFO L878 garLoopResultBuilder]: At program point L144(lines 137 582) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and .cse0 (= 2 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:56,205 INFO L878 garLoopResultBuilder]: At program point L111(line 111) the Hoare annotation is: (let ((.cse7 (= ssl3_accept_~s__hit~0 0))) (let ((.cse1 (= ssl3_accept_~s__state~0 3)) (.cse2 (= ssl3_accept_~s__state~0 8656)) (.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse5 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse11 (<= 8640 ssl3_accept_~s__state~0)) (.cse6 (<= ssl3_accept_~s__state~0 8640)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse12 (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse13 (= 8448 ssl3_accept_~s__state~0)) (.cse3 (not .cse7)) (.cse8 (<= ssl3_accept_~s__state~0 8672)) (.cse9 (<= 8672 ssl3_accept_~s__state~0)) (.cse10 (= 3 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse2 .cse0 .cse3) (and .cse4 (<= ssl3_accept_~s__state~0 8576) .cse0 .cse5 .cse6 .cse7) (and .cse4 .cse1) (and (= ssl3_accept_~blastFlag~0 1) (= 8496 ssl3_accept_~s__state~0)) (and .cse4 .cse0 .cse5 (= ssl3_accept_~s__state~0 8592) .cse6 .cse7) (and .cse0 .cse6 (= 8560 ssl3_accept_~s__state~0) .cse7) (and .cse4 .cse0 .cse5 .cse6 (= ssl3_accept_~s__state~0 8608) .cse7) (and .cse5 .cse8 .cse9 .cse10) (and (= ssl3_accept_~s__state~0 8544) .cse0 .cse6 .cse7) (and .cse2 .cse0 .cse5) (and .cse0 (= ssl3_accept_~s__state~0 8528) .cse7) (and .cse0 (= ssl3_accept_~s__state~0 8512) .cse7) (and .cse11 .cse0 .cse5 .cse6 .cse7) (and .cse11 .cse4 .cse3 .cse12 .cse6) (and .cse4 .cse13 .cse3 .cse12) (and .cse13 (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse7 .cse10) (and .cse3 .cse8 .cse9 .cse10)))) [2022-04-07 00:51:56,205 INFO L885 garLoopResultBuilder]: At program point L541(lines 541 547) the Hoare annotation is: true [2022-04-07 00:51:56,205 INFO L885 garLoopResultBuilder]: At program point L541-1(lines 541 547) the Hoare annotation is: true [2022-04-07 00:51:56,205 INFO L878 garLoopResultBuilder]: At program point L344(lines 344 378) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and .cse0 (= 2 ssl3_accept_~blastFlag~0) (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:56,205 INFO L878 garLoopResultBuilder]: At program point L344-1(lines 344 378) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and .cse0 (= 2 ssl3_accept_~blastFlag~0) (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:56,205 INFO L878 garLoopResultBuilder]: At program point L212(lines 212 557) the Hoare annotation is: (or (= ssl3_accept_~blastFlag~0 0) (<= ssl3_accept_~s__state~0 8672)) [2022-04-07 00:51:56,205 INFO L878 garLoopResultBuilder]: At program point L179(lines 179 568) the Hoare annotation is: (let ((.cse7 (= ssl3_accept_~s__hit~0 0))) (let ((.cse1 (= ssl3_accept_~s__state~0 3)) (.cse2 (= ssl3_accept_~s__state~0 8656)) (.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse5 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse11 (<= 8640 ssl3_accept_~s__state~0)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse6 (<= ssl3_accept_~s__state~0 8640)) (.cse3 (not .cse7)) (.cse8 (<= ssl3_accept_~s__state~0 8672)) (.cse9 (<= 8672 ssl3_accept_~s__state~0)) (.cse10 (= 3 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse2 .cse0 .cse3) (and .cse4 (<= ssl3_accept_~s__state~0 8576) .cse0 .cse5 .cse6 .cse7) (and .cse4 .cse1) (and .cse4 .cse0 .cse5 (= ssl3_accept_~s__state~0 8592) .cse6 .cse7) (and .cse4 .cse0 .cse5 .cse6 (= ssl3_accept_~s__state~0 8608) .cse7) (and .cse5 .cse8 .cse9 .cse10) (and .cse2 .cse0 .cse5) (and .cse11 .cse0 .cse5 .cse6 .cse7) (and .cse11 .cse4 .cse3 (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse6) (and .cse3 .cse8 .cse9 .cse10)))) [2022-04-07 00:51:56,206 INFO L878 garLoopResultBuilder]: At program point L146(lines 146 579) the Hoare annotation is: (let ((.cse7 (= ssl3_accept_~s__hit~0 0))) (let ((.cse1 (= ssl3_accept_~s__state~0 3)) (.cse2 (= ssl3_accept_~s__state~0 8656)) (.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse5 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse11 (<= 8640 ssl3_accept_~s__state~0)) (.cse6 (<= ssl3_accept_~s__state~0 8640)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse12 (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse13 (= 8448 ssl3_accept_~s__state~0)) (.cse3 (not .cse7)) (.cse8 (<= ssl3_accept_~s__state~0 8672)) (.cse9 (<= 8672 ssl3_accept_~s__state~0)) (.cse10 (= 3 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse2 .cse0 .cse3) (and .cse4 (<= ssl3_accept_~s__state~0 8576) .cse0 .cse5 .cse6 .cse7) (and .cse4 .cse1) (and (= ssl3_accept_~blastFlag~0 1) (= 8496 ssl3_accept_~s__state~0)) (and .cse4 .cse0 .cse5 (= ssl3_accept_~s__state~0 8592) .cse6 .cse7) (and .cse0 .cse6 (= 8560 ssl3_accept_~s__state~0) .cse7) (and .cse4 .cse0 .cse5 .cse6 (= ssl3_accept_~s__state~0 8608) .cse7) (and .cse5 .cse8 .cse9 .cse10) (and (= ssl3_accept_~s__state~0 8544) .cse0 .cse6 .cse7) (and .cse2 .cse0 .cse5) (and .cse0 (= ssl3_accept_~s__state~0 8528) .cse7) (and .cse0 (= ssl3_accept_~s__state~0 8512) .cse7) (and .cse11 .cse0 .cse5 .cse6 .cse7) (and .cse11 .cse4 .cse3 .cse12 .cse6) (and .cse4 .cse13 .cse3 .cse12) (and .cse13 (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse7 .cse10) (and .cse3 .cse8 .cse9 .cse10)))) [2022-04-07 00:51:56,206 INFO L878 garLoopResultBuilder]: At program point L113(lines 113 590) the Hoare annotation is: (let ((.cse7 (= ssl3_accept_~s__hit~0 0))) (let ((.cse1 (= ssl3_accept_~s__state~0 3)) (.cse2 (= ssl3_accept_~s__state~0 8656)) (.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse5 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse11 (<= 8640 ssl3_accept_~s__state~0)) (.cse6 (<= ssl3_accept_~s__state~0 8640)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse12 (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse13 (= 8448 ssl3_accept_~s__state~0)) (.cse3 (not .cse7)) (.cse8 (<= ssl3_accept_~s__state~0 8672)) (.cse9 (<= 8672 ssl3_accept_~s__state~0)) (.cse10 (= 3 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse2 .cse0 .cse3) (and .cse4 (<= ssl3_accept_~s__state~0 8576) .cse0 .cse5 .cse6 .cse7) (and .cse4 .cse1) (and (= ssl3_accept_~blastFlag~0 1) (= 8496 ssl3_accept_~s__state~0)) (and .cse4 .cse0 .cse5 (= ssl3_accept_~s__state~0 8592) .cse6 .cse7) (and .cse0 .cse6 (= 8560 ssl3_accept_~s__state~0) .cse7) (and .cse4 .cse0 .cse5 .cse6 (= ssl3_accept_~s__state~0 8608) .cse7) (and .cse5 .cse8 .cse9 .cse10) (and (= ssl3_accept_~s__state~0 8544) .cse0 .cse6 .cse7) (and .cse2 .cse0 .cse5) (and .cse0 (= ssl3_accept_~s__state~0 8528) .cse7) (and .cse0 (= ssl3_accept_~s__state~0 8512) .cse7) (and .cse11 .cse0 .cse5 .cse6 .cse7) (and .cse11 .cse4 .cse3 .cse12 .cse6) (and .cse4 .cse13 .cse3 .cse12) (and .cse13 (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse7 .cse10) (and .cse3 .cse8 .cse9 .cse10)))) [2022-04-07 00:51:56,206 INFO L878 garLoopResultBuilder]: At program point L477(lines 477 479) the Hoare annotation is: (or (and (= ssl3_accept_~blastFlag~0 0) (<= ssl3_accept_~s__state~0 8640)) (and (= 2 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= ssl3_accept_~s__state~0 8608) (= ssl3_accept_~s__hit~0 0))) [2022-04-07 00:51:56,206 INFO L878 garLoopResultBuilder]: At program point L411(lines 411 413) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and .cse0 (= 2 ssl3_accept_~blastFlag~0) (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:56,206 INFO L878 garLoopResultBuilder]: At program point L345(lines 345 375) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and .cse0 (= 2 ssl3_accept_~blastFlag~0) (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:56,206 INFO L878 garLoopResultBuilder]: At program point L213(lines 209 558) the Hoare annotation is: (let ((.cse0 (<= 8672 ssl3_accept_~s__state~0)) (.cse1 (= 3 ssl3_accept_~blastFlag~0))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse1) (and (not (= ssl3_accept_~s__hit~0 0)) .cse0 .cse1))) [2022-04-07 00:51:56,206 INFO L878 garLoopResultBuilder]: At program point L114(lines 113 590) the Hoare annotation is: (and (= ssl3_accept_~blastFlag~0 0) (<= 8672 ssl3_accept_~s__state~0)) [2022-04-07 00:51:56,206 INFO L885 garLoopResultBuilder]: At program point L610(lines 109 611) the Hoare annotation is: true [2022-04-07 00:51:56,207 INFO L885 garLoopResultBuilder]: At program point L544(lines 544 546) the Hoare annotation is: true [2022-04-07 00:51:56,207 INFO L885 garLoopResultBuilder]: At program point L215(lines 215 556) the Hoare annotation is: true [2022-04-07 00:51:56,207 INFO L878 garLoopResultBuilder]: At program point L182(lines 182 567) the Hoare annotation is: (let ((.cse7 (= ssl3_accept_~s__hit~0 0))) (let ((.cse1 (= ssl3_accept_~s__state~0 3)) (.cse2 (= ssl3_accept_~s__state~0 8656)) (.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse5 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse11 (<= 8640 ssl3_accept_~s__state~0)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse6 (<= ssl3_accept_~s__state~0 8640)) (.cse3 (not .cse7)) (.cse8 (<= ssl3_accept_~s__state~0 8672)) (.cse9 (<= 8672 ssl3_accept_~s__state~0)) (.cse10 (= 3 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse2 .cse0 .cse3) (and .cse4 .cse1) (and .cse4 .cse0 .cse5 (= ssl3_accept_~s__state~0 8592) .cse6 .cse7) (and (<= ssl3_accept_~s__state~0 8576) .cse5 .cse7) (and .cse4 .cse0 .cse5 .cse6 (= ssl3_accept_~s__state~0 8608) .cse7) (and .cse5 .cse8 .cse9 .cse10) (and .cse2 .cse0 .cse5) (and .cse11 .cse0 .cse5 .cse6 .cse7) (and .cse11 .cse4 .cse3 (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse6) (and .cse3 .cse8 .cse9 .cse10)))) [2022-04-07 00:51:56,207 INFO L878 garLoopResultBuilder]: At program point L149(lines 149 578) the Hoare annotation is: (let ((.cse7 (= ssl3_accept_~s__hit~0 0))) (let ((.cse1 (= ssl3_accept_~s__state~0 3)) (.cse2 (= ssl3_accept_~s__state~0 8656)) (.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse5 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse11 (<= 8640 ssl3_accept_~s__state~0)) (.cse6 (<= ssl3_accept_~s__state~0 8640)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse12 (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse13 (= 8448 ssl3_accept_~s__state~0)) (.cse3 (not .cse7)) (.cse8 (<= ssl3_accept_~s__state~0 8672)) (.cse9 (<= 8672 ssl3_accept_~s__state~0)) (.cse10 (= 3 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse2 .cse0 .cse3) (and .cse4 (<= ssl3_accept_~s__state~0 8576) .cse0 .cse5 .cse6 .cse7) (and .cse4 .cse1) (and .cse4 .cse0 .cse5 (= ssl3_accept_~s__state~0 8592) .cse6 .cse7) (and .cse0 .cse6 (= 8560 ssl3_accept_~s__state~0) .cse7) (and .cse4 .cse0 .cse5 .cse6 (= ssl3_accept_~s__state~0 8608) .cse7) (and .cse5 .cse8 .cse9 .cse10) (and (= ssl3_accept_~s__state~0 8544) .cse0 .cse6 .cse7) (and .cse2 .cse0 .cse5) (and .cse0 (= ssl3_accept_~s__state~0 8528) .cse7) (and .cse0 (= ssl3_accept_~s__state~0 8512) .cse7) (and .cse11 .cse0 .cse5 .cse6 .cse7) (and .cse11 .cse4 .cse3 .cse12 .cse6) (and .cse4 .cse13 .cse3 .cse12) (and .cse13 (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse7 .cse10) (and .cse3 .cse8 .cse9 .cse10)))) [2022-04-07 00:51:56,207 INFO L878 garLoopResultBuilder]: At program point L116(lines 116 589) the Hoare annotation is: (let ((.cse7 (= ssl3_accept_~s__hit~0 0))) (let ((.cse1 (= ssl3_accept_~s__state~0 3)) (.cse2 (= ssl3_accept_~s__state~0 8656)) (.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse5 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse11 (<= 8640 ssl3_accept_~s__state~0)) (.cse6 (<= ssl3_accept_~s__state~0 8640)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse12 (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse13 (= 8448 ssl3_accept_~s__state~0)) (.cse3 (not .cse7)) (.cse8 (<= ssl3_accept_~s__state~0 8672)) (.cse9 (<= 8672 ssl3_accept_~s__state~0)) (.cse10 (= 3 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse2 .cse0 .cse3) (and .cse4 (<= ssl3_accept_~s__state~0 8576) .cse0 .cse5 .cse6 .cse7) (and .cse4 .cse1) (and (= ssl3_accept_~blastFlag~0 1) (= 8496 ssl3_accept_~s__state~0)) (and .cse4 .cse0 .cse5 (= ssl3_accept_~s__state~0 8592) .cse6 .cse7) (and .cse0 .cse6 (= 8560 ssl3_accept_~s__state~0) .cse7) (and .cse4 .cse0 .cse5 .cse6 (= ssl3_accept_~s__state~0 8608) .cse7) (and .cse5 .cse8 .cse9 .cse10) (and (= ssl3_accept_~s__state~0 8544) .cse0 .cse6 .cse7) (and .cse2 .cse0 .cse5) (and .cse0 (= ssl3_accept_~s__state~0 8528) .cse7) (and .cse0 (= ssl3_accept_~s__state~0 8512) .cse7) (and .cse11 .cse0 .cse5 .cse6 .cse7) (and .cse11 .cse4 .cse3 .cse12 .cse6) (and .cse4 .cse13 .cse3 .cse12) (and .cse13 (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse7 .cse10) (and .cse3 .cse8 .cse9 .cse10)))) [2022-04-07 00:51:56,207 INFO L878 garLoopResultBuilder]: At program point L315(lines 315 322) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and .cse0 (= 2 ssl3_accept_~blastFlag~0) (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:56,207 INFO L878 garLoopResultBuilder]: At program point L315-2(lines 315 322) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and .cse0 (= 2 ssl3_accept_~blastFlag~0) (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:56,207 INFO L885 garLoopResultBuilder]: At program point L216(lines 215 556) the Hoare annotation is: true [2022-04-07 00:51:56,207 INFO L878 garLoopResultBuilder]: At program point L183(lines 179 568) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8640))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and (= 2 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:56,208 INFO L878 garLoopResultBuilder]: At program point L150(lines 146 579) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and .cse0 (= 2 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= ssl3_accept_~s__hit~0 0)) (and (= ssl3_accept_~blastFlag~0 1) .cse0))) [2022-04-07 00:51:56,208 INFO L878 garLoopResultBuilder]: At program point L350(lines 350 373) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and .cse0 (= 2 ssl3_accept_~blastFlag~0) (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:56,208 INFO L885 garLoopResultBuilder]: At program point L218(lines 217 556) the Hoare annotation is: true [2022-04-07 00:51:56,208 INFO L878 garLoopResultBuilder]: At program point L185(lines 185 566) the Hoare annotation is: (let ((.cse7 (= ssl3_accept_~s__hit~0 0))) (let ((.cse1 (= ssl3_accept_~s__state~0 3)) (.cse2 (= ssl3_accept_~s__state~0 8656)) (.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse5 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse11 (<= 8640 ssl3_accept_~s__state~0)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse6 (<= ssl3_accept_~s__state~0 8640)) (.cse3 (not .cse7)) (.cse8 (<= ssl3_accept_~s__state~0 8672)) (.cse9 (<= 8672 ssl3_accept_~s__state~0)) (.cse10 (= 3 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse2 .cse0 .cse3) (and .cse4 .cse1) (and .cse4 .cse0 .cse5 (= ssl3_accept_~s__state~0 8592) .cse6 .cse7) (and (<= ssl3_accept_~s__state~0 8576) .cse5 .cse7) (and .cse4 .cse0 .cse5 .cse6 (= ssl3_accept_~s__state~0 8608) .cse7) (and .cse5 .cse8 .cse9 .cse10) (and .cse2 .cse0 .cse5) (and .cse11 .cse0 .cse5 .cse6 .cse7) (and .cse11 .cse4 .cse3 (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse6) (and .cse3 .cse8 .cse9 .cse10)))) [2022-04-07 00:51:56,208 INFO L878 garLoopResultBuilder]: At program point L152(lines 152 577) the Hoare annotation is: (let ((.cse7 (= ssl3_accept_~s__hit~0 0))) (let ((.cse1 (= ssl3_accept_~s__state~0 3)) (.cse2 (= ssl3_accept_~s__state~0 8656)) (.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse5 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse11 (<= 8640 ssl3_accept_~s__state~0)) (.cse6 (<= ssl3_accept_~s__state~0 8640)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse12 (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse13 (= 8448 ssl3_accept_~s__state~0)) (.cse3 (not .cse7)) (.cse8 (<= ssl3_accept_~s__state~0 8672)) (.cse9 (<= 8672 ssl3_accept_~s__state~0)) (.cse10 (= 3 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse2 .cse0 .cse3) (and .cse4 (<= ssl3_accept_~s__state~0 8576) .cse0 .cse5 .cse6 .cse7) (and .cse4 .cse1) (and .cse4 .cse0 .cse5 (= ssl3_accept_~s__state~0 8592) .cse6 .cse7) (and .cse0 .cse6 (= 8560 ssl3_accept_~s__state~0) .cse7) (and .cse4 .cse0 .cse5 .cse6 (= ssl3_accept_~s__state~0 8608) .cse7) (and .cse5 .cse8 .cse9 .cse10) (and (= ssl3_accept_~s__state~0 8544) .cse0 .cse6 .cse7) (and .cse2 .cse0 .cse5) (and .cse0 (= ssl3_accept_~s__state~0 8528) .cse7) (and .cse0 (= ssl3_accept_~s__state~0 8512) .cse7) (and .cse11 .cse0 .cse5 .cse6 .cse7) (and .cse11 .cse4 .cse3 .cse12 .cse6) (and .cse4 .cse13 .cse3 .cse12) (and .cse13 (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse7 .cse10) (and .cse3 .cse8 .cse9 .cse10)))) [2022-04-07 00:51:56,208 INFO L878 garLoopResultBuilder]: At program point L119(lines 119 588) the Hoare annotation is: (let ((.cse7 (= ssl3_accept_~s__hit~0 0))) (let ((.cse1 (= ssl3_accept_~s__state~0 3)) (.cse2 (= ssl3_accept_~s__state~0 8656)) (.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse5 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse11 (<= 8640 ssl3_accept_~s__state~0)) (.cse6 (<= ssl3_accept_~s__state~0 8640)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse12 (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse13 (= 8448 ssl3_accept_~s__state~0)) (.cse3 (not .cse7)) (.cse8 (<= ssl3_accept_~s__state~0 8672)) (.cse9 (<= 8672 ssl3_accept_~s__state~0)) (.cse10 (= 3 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse2 .cse0 .cse3) (and .cse4 (<= ssl3_accept_~s__state~0 8576) .cse0 .cse5 .cse6 .cse7) (and .cse4 .cse1) (and (= ssl3_accept_~blastFlag~0 1) (= 8496 ssl3_accept_~s__state~0)) (and .cse4 .cse0 .cse5 (= ssl3_accept_~s__state~0 8592) .cse6 .cse7) (and .cse0 .cse6 (= 8560 ssl3_accept_~s__state~0) .cse7) (and .cse4 .cse0 .cse5 .cse6 (= ssl3_accept_~s__state~0 8608) .cse7) (and .cse5 .cse8 .cse9 .cse10) (and (= ssl3_accept_~s__state~0 8544) .cse0 .cse6 .cse7) (and .cse2 .cse0 .cse5) (and .cse0 (= ssl3_accept_~s__state~0 8528) .cse7) (and .cse0 (= ssl3_accept_~s__state~0 8512) .cse7) (and .cse11 .cse0 .cse5 .cse6 .cse7) (and .cse11 .cse4 .cse3 .cse12 .cse6) (and .cse4 .cse13 .cse3 .cse12) (and .cse13 (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse7 .cse10) (and .cse3 .cse8 .cse9 .cse10)))) [2022-04-07 00:51:56,208 INFO L885 garLoopResultBuilder]: At program point L615(lines 615 617) the Hoare annotation is: true [2022-04-07 00:51:56,208 INFO L885 garLoopResultBuilder]: At program point L615-2(lines 615 617) the Hoare annotation is: true [2022-04-07 00:51:56,209 INFO L878 garLoopResultBuilder]: At program point L516(lines 516 519) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8672)) (.cse1 (<= 8672 ssl3_accept_~s__state~0)) (.cse2 (= 3 ssl3_accept_~blastFlag~0))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0 .cse1) (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse1 .cse2) (and (not (= ssl3_accept_~s__hit~0 0)) .cse0 .cse1 .cse2))) [2022-04-07 00:51:56,209 INFO L878 garLoopResultBuilder]: At program point L285(lines 285 287) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and .cse0 (= 2 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:56,209 INFO L878 garLoopResultBuilder]: At program point L285-2(lines 219 553) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576))) (or (and .cse0 (= 2 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= ssl3_accept_~s__hit~0 0)) (and (= ssl3_accept_~blastFlag~0 1) .cse0))) [2022-04-07 00:51:56,209 INFO L878 garLoopResultBuilder]: At program point L451(lines 451 453) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8640))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and (= 2 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:56,209 INFO L878 garLoopResultBuilder]: At program point L319(lines 319 321) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and .cse0 (= 2 ssl3_accept_~blastFlag~0) (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:56,209 INFO L878 garLoopResultBuilder]: At program point L353(lines 353 357) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and .cse0 (= 2 ssl3_accept_~blastFlag~0) (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:56,209 INFO L878 garLoopResultBuilder]: At program point L353-2(lines 353 357) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and .cse0 (= 2 ssl3_accept_~blastFlag~0) (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:56,209 INFO L878 garLoopResultBuilder]: At program point L254(lines 254 264) the Hoare annotation is: (let ((.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse1 (<= ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1) (and (<= 8640 ssl3_accept_~s__state~0) .cse0) (and .cse1 (= 2 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:56,209 INFO L878 garLoopResultBuilder]: At program point L188(lines 188 565) the Hoare annotation is: (let ((.cse6 (= ssl3_accept_~s__hit~0 0))) (let ((.cse1 (= ssl3_accept_~s__state~0 3)) (.cse2 (= ssl3_accept_~s__state~0 8656)) (.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse5 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse10 (<= 8640 ssl3_accept_~s__state~0)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse11 (<= ssl3_accept_~s__state~0 8640)) (.cse3 (not .cse6)) (.cse7 (<= ssl3_accept_~s__state~0 8672)) (.cse8 (<= 8672 ssl3_accept_~s__state~0)) (.cse9 (= 3 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse2 .cse0 .cse3) (and .cse4 .cse1) (and (<= ssl3_accept_~s__state~0 8576) .cse5 .cse6) (and .cse5 .cse7 .cse8 .cse9) (and .cse2 .cse0 .cse5) (and .cse0 .cse5 (= ssl3_accept_~s__state~0 8608) .cse6) (and .cse10 .cse0 .cse5 .cse11 .cse6) (and .cse10 .cse4 .cse3 (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse11) (and .cse3 .cse7 .cse8 .cse9)))) [2022-04-07 00:51:56,209 INFO L878 garLoopResultBuilder]: At program point L155(lines 155 576) the Hoare annotation is: (let ((.cse7 (= ssl3_accept_~s__hit~0 0))) (let ((.cse1 (= ssl3_accept_~s__state~0 3)) (.cse2 (= ssl3_accept_~s__state~0 8656)) (.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse5 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse11 (<= 8640 ssl3_accept_~s__state~0)) (.cse6 (<= ssl3_accept_~s__state~0 8640)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse12 (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse13 (= 8448 ssl3_accept_~s__state~0)) (.cse3 (not .cse7)) (.cse8 (<= ssl3_accept_~s__state~0 8672)) (.cse9 (<= 8672 ssl3_accept_~s__state~0)) (.cse10 (= 3 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse2 .cse0 .cse3) (and .cse4 (<= ssl3_accept_~s__state~0 8576) .cse0 .cse5 .cse6 .cse7) (and .cse4 .cse1) (and .cse4 .cse0 .cse5 (= ssl3_accept_~s__state~0 8592) .cse6 .cse7) (and .cse0 .cse6 (= 8560 ssl3_accept_~s__state~0) .cse7) (and .cse4 .cse0 .cse5 .cse6 (= ssl3_accept_~s__state~0 8608) .cse7) (and .cse5 .cse8 .cse9 .cse10) (and (= ssl3_accept_~s__state~0 8544) .cse0 .cse6 .cse7) (and .cse2 .cse0 .cse5) (and .cse0 (= ssl3_accept_~s__state~0 8528) .cse7) (and .cse11 .cse0 .cse5 .cse6 .cse7) (and .cse11 .cse4 .cse3 .cse12 .cse6) (and .cse4 .cse13 .cse3 .cse12) (and .cse13 (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse7 .cse10) (and .cse3 .cse8 .cse9 .cse10)))) [2022-04-07 00:51:56,210 INFO L878 garLoopResultBuilder]: At program point L122(lines 122 587) the Hoare annotation is: (let ((.cse7 (= ssl3_accept_~s__hit~0 0))) (let ((.cse1 (= ssl3_accept_~s__state~0 3)) (.cse2 (= ssl3_accept_~s__state~0 8656)) (.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse5 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse11 (<= 8640 ssl3_accept_~s__state~0)) (.cse6 (<= ssl3_accept_~s__state~0 8640)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse12 (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse13 (= 8448 ssl3_accept_~s__state~0)) (.cse3 (not .cse7)) (.cse8 (<= ssl3_accept_~s__state~0 8672)) (.cse9 (<= 8672 ssl3_accept_~s__state~0)) (.cse10 (= 3 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse2 .cse0 .cse3) (and .cse4 (<= ssl3_accept_~s__state~0 8576) .cse0 .cse5 .cse6 .cse7) (and .cse4 .cse1) (and (= ssl3_accept_~blastFlag~0 1) (= 8496 ssl3_accept_~s__state~0)) (and .cse4 .cse0 .cse5 (= ssl3_accept_~s__state~0 8592) .cse6 .cse7) (and .cse0 .cse6 (= 8560 ssl3_accept_~s__state~0) .cse7) (and .cse4 .cse0 .cse5 .cse6 (= ssl3_accept_~s__state~0 8608) .cse7) (and .cse5 .cse8 .cse9 .cse10) (and (= ssl3_accept_~s__state~0 8544) .cse0 .cse6 .cse7) (and .cse2 .cse0 .cse5) (and .cse0 (= ssl3_accept_~s__state~0 8528) .cse7) (and .cse0 (= ssl3_accept_~s__state~0 8512) .cse7) (and .cse11 .cse0 .cse5 .cse6 .cse7) (and .cse11 .cse4 .cse3 .cse12 .cse6) (and .cse4 .cse13 .cse3 .cse12) (and .cse13 (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse7 .cse10) (and .cse3 .cse8 .cse9 .cse10)))) [2022-04-07 00:51:56,210 INFO L885 garLoopResultBuilder]: At program point ssl3_acceptEXIT(lines 22 622) the Hoare annotation is: true [2022-04-07 00:51:56,210 INFO L878 garLoopResultBuilder]: At program point L486(lines 486 488) the Hoare annotation is: (let ((.cse1 (<= ssl3_accept_~s__state~0 8672)) (.cse0 (<= 8640 ssl3_accept_~s__state~0)) (.cse2 (= ssl3_accept_~s__hit~0 0))) (or (and .cse0 (= 2 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse1 .cse2) (and .cse0 (= ssl3_accept_~blastFlag~0 0) .cse1) (and .cse0 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640) (not .cse2) (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0) (<= ssl3_accept_~s__state~0 8640)))) [2022-04-07 00:51:56,210 INFO L878 garLoopResultBuilder]: At program point L387(lines 387 419) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and .cse0 (= 2 ssl3_accept_~blastFlag~0) (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:56,210 INFO L878 garLoopResultBuilder]: At program point L255(lines 255 258) the Hoare annotation is: (or (= ssl3_accept_~blastFlag~0 0) (and (<= ssl3_accept_~s__state~0 8576) (= 2 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= ssl3_accept_~s__hit~0 0))) [2022-04-07 00:51:56,210 INFO L878 garLoopResultBuilder]: At program point L222(lines 116 589) the Hoare annotation is: (let ((.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse1 (<= ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1) (and (<= 8640 ssl3_accept_~s__state~0) .cse0) (and .cse1 (= 2 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:56,210 INFO L878 garLoopResultBuilder]: At program point L189(lines 185 566) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8640))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and (= 2 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:56,210 INFO L878 garLoopResultBuilder]: At program point L156(lines 152 577) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and .cse0 (= 2 ssl3_accept_~blastFlag~0) (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:56,210 INFO L878 garLoopResultBuilder]: At program point L454(lines 454 463) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8640))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and (= 2 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:56,210 INFO L878 garLoopResultBuilder]: At program point L388(lines 388 394) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and .cse0 (= 2 ssl3_accept_~blastFlag~0) (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:56,211 INFO L878 garLoopResultBuilder]: At program point L554(lines 110 609) the Hoare annotation is: (let ((.cse7 (= ssl3_accept_~s__hit~0 0))) (let ((.cse1 (= ssl3_accept_~s__state~0 3)) (.cse2 (= ssl3_accept_~s__state~0 8656)) (.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse5 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse11 (<= 8640 ssl3_accept_~s__state~0)) (.cse6 (<= ssl3_accept_~s__state~0 8640)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse12 (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse13 (= 8448 ssl3_accept_~s__state~0)) (.cse3 (not .cse7)) (.cse8 (<= ssl3_accept_~s__state~0 8672)) (.cse9 (<= 8672 ssl3_accept_~s__state~0)) (.cse10 (= 3 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse2 .cse0 .cse3) (and .cse4 (<= ssl3_accept_~s__state~0 8576) .cse0 .cse5 .cse6 .cse7) (and .cse4 .cse1) (and (= ssl3_accept_~blastFlag~0 1) (= 8496 ssl3_accept_~s__state~0)) (and .cse4 .cse0 .cse5 (= ssl3_accept_~s__state~0 8592) .cse6 .cse7) (and .cse0 .cse6 (= 8560 ssl3_accept_~s__state~0) .cse7) (and .cse4 .cse0 .cse5 .cse6 (= ssl3_accept_~s__state~0 8608) .cse7) (and .cse5 .cse8 .cse9 .cse10) (and (= ssl3_accept_~s__state~0 8544) .cse0 .cse6 .cse7) (and .cse2 .cse0 .cse5) (and .cse0 (= ssl3_accept_~s__state~0 8528) .cse7) (and .cse0 (= ssl3_accept_~s__state~0 8512) .cse7) (and .cse11 .cse0 .cse5 .cse6 .cse7) (and .cse11 .cse4 .cse3 .cse12 .cse6) (and .cse4 .cse13 .cse3 .cse12) (and .cse13 (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse7 .cse10) (and .cse3 .cse8 .cse9 .cse10)))) [2022-04-07 00:51:56,211 INFO L878 garLoopResultBuilder]: At program point L191(lines 191 564) the Hoare annotation is: (let ((.cse6 (= ssl3_accept_~s__hit~0 0))) (let ((.cse1 (= ssl3_accept_~s__state~0 3)) (.cse2 (= ssl3_accept_~s__state~0 8656)) (.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse5 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse10 (<= 8640 ssl3_accept_~s__state~0)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse11 (<= ssl3_accept_~s__state~0 8640)) (.cse3 (not .cse6)) (.cse7 (<= ssl3_accept_~s__state~0 8672)) (.cse8 (<= 8672 ssl3_accept_~s__state~0)) (.cse9 (= 3 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse2 .cse0 .cse3) (and .cse4 .cse1) (and (<= ssl3_accept_~s__state~0 8576) .cse5 .cse6) (and .cse5 .cse7 .cse8 .cse9) (and .cse2 .cse0 .cse5) (and .cse0 .cse5 (= ssl3_accept_~s__state~0 8608) .cse6) (and .cse10 .cse0 .cse5 .cse11 .cse6) (and .cse10 .cse4 .cse3 (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse11) (and .cse3 .cse7 .cse8 .cse9)))) [2022-04-07 00:51:56,211 INFO L878 garLoopResultBuilder]: At program point L158(lines 158 575) the Hoare annotation is: (let ((.cse7 (= ssl3_accept_~s__hit~0 0))) (let ((.cse1 (= ssl3_accept_~s__state~0 3)) (.cse2 (= ssl3_accept_~s__state~0 8656)) (.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse5 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse11 (<= 8640 ssl3_accept_~s__state~0)) (.cse6 (<= ssl3_accept_~s__state~0 8640)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse12 (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse13 (= 8448 ssl3_accept_~s__state~0)) (.cse3 (not .cse7)) (.cse8 (<= ssl3_accept_~s__state~0 8672)) (.cse9 (<= 8672 ssl3_accept_~s__state~0)) (.cse10 (= 3 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse2 .cse0 .cse3) (and .cse4 (<= ssl3_accept_~s__state~0 8576) .cse0 .cse5 .cse6 .cse7) (and .cse4 .cse1) (and .cse4 .cse0 .cse5 (= ssl3_accept_~s__state~0 8592) .cse6 .cse7) (and .cse0 .cse6 (= 8560 ssl3_accept_~s__state~0) .cse7) (and .cse4 .cse0 .cse5 .cse6 (= ssl3_accept_~s__state~0 8608) .cse7) (and .cse5 .cse8 .cse9 .cse10) (and (= ssl3_accept_~s__state~0 8544) .cse0 .cse6 .cse7) (and .cse2 .cse0 .cse5) (and .cse0 (= ssl3_accept_~s__state~0 8528) .cse7) (and .cse11 .cse0 .cse5 .cse6 .cse7) (and .cse11 .cse4 .cse3 .cse12 .cse6) (and .cse4 .cse13 .cse3 .cse12) (and .cse13 (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse7 .cse10) (and .cse3 .cse8 .cse9 .cse10)))) [2022-04-07 00:51:56,211 INFO L878 garLoopResultBuilder]: At program point L125(lines 125 586) the Hoare annotation is: (let ((.cse7 (= ssl3_accept_~s__hit~0 0))) (let ((.cse1 (= ssl3_accept_~s__state~0 3)) (.cse2 (= ssl3_accept_~s__state~0 8656)) (.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse5 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse11 (<= 8640 ssl3_accept_~s__state~0)) (.cse6 (<= ssl3_accept_~s__state~0 8640)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse12 (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse13 (= 8448 ssl3_accept_~s__state~0)) (.cse3 (not .cse7)) (.cse8 (<= ssl3_accept_~s__state~0 8672)) (.cse9 (<= 8672 ssl3_accept_~s__state~0)) (.cse10 (= 3 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse2 .cse0 .cse3) (and .cse4 (<= ssl3_accept_~s__state~0 8576) .cse0 .cse5 .cse6 .cse7) (and .cse4 .cse1) (and (= ssl3_accept_~blastFlag~0 1) (= 8496 ssl3_accept_~s__state~0)) (and .cse4 .cse0 .cse5 (= ssl3_accept_~s__state~0 8592) .cse6 .cse7) (and .cse0 .cse6 (= 8560 ssl3_accept_~s__state~0) .cse7) (and .cse4 .cse0 .cse5 .cse6 (= ssl3_accept_~s__state~0 8608) .cse7) (and .cse5 .cse8 .cse9 .cse10) (and (= ssl3_accept_~s__state~0 8544) .cse0 .cse6 .cse7) (and .cse2 .cse0 .cse5) (and .cse0 (= ssl3_accept_~s__state~0 8528) .cse7) (and .cse0 (= ssl3_accept_~s__state~0 8512) .cse7) (and .cse11 .cse0 .cse5 .cse6 .cse7) (and .cse11 .cse4 .cse3 .cse12 .cse6) (and .cse4 .cse13 .cse3 .cse12) (and .cse13 (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse7 .cse10) (and .cse3 .cse8 .cse9 .cse10)))) [2022-04-07 00:51:56,211 INFO L885 garLoopResultBuilder]: At program point ssl3_acceptFINAL(lines 22 622) the Hoare annotation is: true [2022-04-07 00:51:56,211 INFO L878 garLoopResultBuilder]: At program point L489(lines 489 493) the Hoare annotation is: (let ((.cse1 (<= ssl3_accept_~s__state~0 8672)) (.cse0 (<= 8640 ssl3_accept_~s__state~0)) (.cse2 (= ssl3_accept_~s__hit~0 0))) (or (and .cse0 (= 2 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse1 .cse2) (and .cse0 (= ssl3_accept_~blastFlag~0 0) .cse1) (and .cse0 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640) (not .cse2) (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0) (<= ssl3_accept_~s__state~0 8640)))) [2022-04-07 00:51:56,211 INFO L878 garLoopResultBuilder]: At program point L489-2(lines 489 493) the Hoare annotation is: (let ((.cse2 (= ssl3_accept_~s__hit~0 0))) (let ((.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse4 (not .cse2)) (.cse5 (= ssl3_accept_~s__state~0 3)) (.cse1 (= ssl3_accept_~s__state~0 8656)) (.cse3 (= 2 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse4 .cse5) (and .cse0 .cse4 .cse5) (and .cse1 .cse3 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse2)))) [2022-04-07 00:51:56,211 INFO L878 garLoopResultBuilder]: At program point L93(lines 93 99) the Hoare annotation is: (= ssl3_accept_~blastFlag~0 0) [2022-04-07 00:51:56,212 INFO L878 garLoopResultBuilder]: At program point L524(lines 524 526) the Hoare annotation is: (let ((.cse0 (<= 8672 ssl3_accept_~s__state~0)) (.cse1 (= 3 ssl3_accept_~blastFlag~0))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse1) (and (not (= ssl3_accept_~s__hit~0 0)) .cse0 .cse1))) [2022-04-07 00:51:56,212 INFO L878 garLoopResultBuilder]: At program point L458(lines 458 460) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8640))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and (= 2 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:56,212 INFO L878 garLoopResultBuilder]: At program point L227(lines 227 229) the Hoare annotation is: (let ((.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse1 (<= ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1) (and (<= 8640 ssl3_accept_~s__state~0) .cse0) (and .cse1 (= 2 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:56,212 INFO L878 garLoopResultBuilder]: At program point L194(lines 194 563) the Hoare annotation is: (let ((.cse6 (= ssl3_accept_~s__hit~0 0))) (let ((.cse1 (= ssl3_accept_~s__state~0 3)) (.cse2 (= ssl3_accept_~s__state~0 8656)) (.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse5 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse10 (<= 8640 ssl3_accept_~s__state~0)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse11 (<= ssl3_accept_~s__state~0 8640)) (.cse3 (not .cse6)) (.cse7 (<= ssl3_accept_~s__state~0 8672)) (.cse8 (<= 8672 ssl3_accept_~s__state~0)) (.cse9 (= 3 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse2 .cse0 .cse3) (and .cse4 .cse1) (and (<= ssl3_accept_~s__state~0 8576) .cse5 .cse6) (and .cse5 .cse7 .cse8 .cse9) (and .cse2 .cse0 .cse5) (and .cse10 .cse0 .cse5 .cse11 .cse6) (and .cse10 .cse4 .cse3 (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse11) (and .cse3 .cse7 .cse8 .cse9)))) [2022-04-07 00:51:56,212 INFO L878 garLoopResultBuilder]: At program point L161(lines 161 574) the Hoare annotation is: (let ((.cse7 (= ssl3_accept_~s__hit~0 0))) (let ((.cse1 (= ssl3_accept_~s__state~0 3)) (.cse2 (= ssl3_accept_~s__state~0 8656)) (.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse5 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse11 (<= 8640 ssl3_accept_~s__state~0)) (.cse6 (<= ssl3_accept_~s__state~0 8640)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse12 (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse13 (= 8448 ssl3_accept_~s__state~0)) (.cse3 (not .cse7)) (.cse8 (<= ssl3_accept_~s__state~0 8672)) (.cse9 (<= 8672 ssl3_accept_~s__state~0)) (.cse10 (= 3 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse2 .cse0 .cse3) (and .cse4 (<= ssl3_accept_~s__state~0 8576) .cse0 .cse5 .cse6 .cse7) (and .cse4 .cse1) (and .cse4 .cse0 .cse5 (= ssl3_accept_~s__state~0 8592) .cse6 .cse7) (and .cse0 .cse6 (= 8560 ssl3_accept_~s__state~0) .cse7) (and .cse4 .cse0 .cse5 .cse6 (= ssl3_accept_~s__state~0 8608) .cse7) (and .cse5 .cse8 .cse9 .cse10) (and (= ssl3_accept_~s__state~0 8544) .cse0 .cse6 .cse7) (and .cse2 .cse0 .cse5) (and .cse11 .cse0 .cse5 .cse6 .cse7) (and .cse11 .cse4 .cse3 .cse12 .cse6) (and .cse4 .cse13 .cse3 .cse12) (and .cse13 (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse7 .cse10) (and .cse3 .cse8 .cse9 .cse10)))) [2022-04-07 00:51:56,212 INFO L878 garLoopResultBuilder]: At program point L227-2(lines 227 229) the Hoare annotation is: (let ((.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse1 (<= ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1) (and (<= 8640 ssl3_accept_~s__state~0) .cse0) (and .cse1 (= 2 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:56,212 INFO L878 garLoopResultBuilder]: At program point L128(lines 128 585) the Hoare annotation is: (let ((.cse7 (= ssl3_accept_~s__hit~0 0))) (let ((.cse1 (= ssl3_accept_~s__state~0 3)) (.cse2 (= ssl3_accept_~s__state~0 8656)) (.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse5 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse11 (<= 8640 ssl3_accept_~s__state~0)) (.cse6 (<= ssl3_accept_~s__state~0 8640)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse12 (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse13 (= 8448 ssl3_accept_~s__state~0)) (.cse3 (not .cse7)) (.cse8 (<= ssl3_accept_~s__state~0 8672)) (.cse9 (<= 8672 ssl3_accept_~s__state~0)) (.cse10 (= 3 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse2 .cse0 .cse3) (and .cse4 (<= ssl3_accept_~s__state~0 8576) .cse0 .cse5 .cse6 .cse7) (and .cse4 .cse1) (and (= ssl3_accept_~blastFlag~0 1) (= 8496 ssl3_accept_~s__state~0)) (and .cse4 .cse0 .cse5 (= ssl3_accept_~s__state~0 8592) .cse6 .cse7) (and .cse0 .cse6 (= 8560 ssl3_accept_~s__state~0) .cse7) (and .cse4 .cse0 .cse5 .cse6 (= ssl3_accept_~s__state~0 8608) .cse7) (and .cse5 .cse8 .cse9 .cse10) (and (= ssl3_accept_~s__state~0 8544) .cse0 .cse6 .cse7) (and .cse2 .cse0 .cse5) (and .cse0 (= ssl3_accept_~s__state~0 8528) .cse7) (and .cse0 (= ssl3_accept_~s__state~0 8512) .cse7) (and .cse11 .cse0 .cse5 .cse6 .cse7) (and .cse11 .cse4 .cse3 .cse12 .cse6) (and .cse4 .cse13 .cse3 .cse12) (and .cse13 (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse7 .cse10) (and .cse3 .cse8 .cse9 .cse10)))) [2022-04-07 00:51:56,212 INFO L878 garLoopResultBuilder]: At program point L591(lines 591 607) the Hoare annotation is: (let ((.cse7 (= ssl3_accept_~s__hit~0 0))) (let ((.cse1 (= ssl3_accept_~s__state~0 3)) (.cse2 (= ssl3_accept_~s__state~0 8656)) (.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse5 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse11 (<= 8640 ssl3_accept_~s__state~0)) (.cse6 (<= ssl3_accept_~s__state~0 8640)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse12 (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse13 (= 8448 ssl3_accept_~s__state~0)) (.cse3 (not .cse7)) (.cse8 (<= ssl3_accept_~s__state~0 8672)) (.cse9 (<= 8672 ssl3_accept_~s__state~0)) (.cse10 (= 3 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse2 .cse0 .cse3) (and .cse4 (<= ssl3_accept_~s__state~0 8576) .cse0 .cse5 .cse6 .cse7) (and .cse4 .cse1) (and (= ssl3_accept_~blastFlag~0 1) (= 8496 ssl3_accept_~s__state~0)) (and .cse4 .cse0 .cse5 (= ssl3_accept_~s__state~0 8592) .cse6 .cse7) (and .cse0 .cse6 (= 8560 ssl3_accept_~s__state~0) .cse7) (and .cse4 .cse0 .cse5 .cse6 (= ssl3_accept_~s__state~0 8608) .cse7) (and .cse5 .cse8 .cse9 .cse10) (and (= ssl3_accept_~s__state~0 8544) .cse0 .cse6 .cse7) (and .cse2 .cse0 .cse5) (and .cse0 (= ssl3_accept_~s__state~0 8528) .cse7) (and .cse0 (= ssl3_accept_~s__state~0 8512) .cse7) (and .cse11 .cse0 .cse5 .cse6 .cse7) (and .cse11 .cse4 .cse3 .cse12 .cse6) (and .cse4 .cse13 .cse3 .cse12) (and .cse13 (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse7 .cse10) (and .cse3 .cse8 .cse9 .cse10)))) [2022-04-07 00:51:56,213 INFO L878 garLoopResultBuilder]: At program point L525(lines 83 621) the Hoare annotation is: false [2022-04-07 00:51:56,213 INFO L878 garLoopResultBuilder]: At program point L195(lines 191 564) the Hoare annotation is: (or (and (= ssl3_accept_~blastFlag~0 0) (<= ssl3_accept_~s__state~0 8640)) (and (= 2 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= ssl3_accept_~s__state~0 8608) (= ssl3_accept_~s__hit~0 0))) [2022-04-07 00:51:56,213 INFO L878 garLoopResultBuilder]: At program point L162(lines 158 575) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and .cse0 (= 2 ssl3_accept_~blastFlag~0) (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:56,213 INFO L878 garLoopResultBuilder]: At program point L96(lines 96 98) the Hoare annotation is: (= ssl3_accept_~blastFlag~0 0) [2022-04-07 00:51:56,213 INFO L878 garLoopResultBuilder]: At program point L96-2(lines 93 99) the Hoare annotation is: (= ssl3_accept_~blastFlag~0 0) [2022-04-07 00:51:56,213 INFO L878 garLoopResultBuilder]: At program point L592(lines 592 606) the Hoare annotation is: (let ((.cse7 (= ssl3_accept_~s__hit~0 0))) (let ((.cse1 (= ssl3_accept_~s__state~0 3)) (.cse2 (= ssl3_accept_~s__state~0 8656)) (.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse5 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse11 (<= 8640 ssl3_accept_~s__state~0)) (.cse6 (<= ssl3_accept_~s__state~0 8640)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse12 (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse13 (= 8448 ssl3_accept_~s__state~0)) (.cse3 (not .cse7)) (.cse8 (<= ssl3_accept_~s__state~0 8672)) (.cse9 (<= 8672 ssl3_accept_~s__state~0)) (.cse10 (= 3 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse2 .cse0 .cse3) (and .cse4 (<= ssl3_accept_~s__state~0 8576) .cse0 .cse5 .cse6 .cse7) (and .cse4 .cse1) (and (= ssl3_accept_~blastFlag~0 1) (= 8496 ssl3_accept_~s__state~0)) (and .cse4 .cse0 .cse5 (= ssl3_accept_~s__state~0 8592) .cse6 .cse7) (and .cse0 .cse6 (= 8560 ssl3_accept_~s__state~0) .cse7) (and .cse4 .cse0 .cse5 .cse6 (= ssl3_accept_~s__state~0 8608) .cse7) (and .cse5 .cse8 .cse9 .cse10) (and (= ssl3_accept_~s__state~0 8544) .cse0 .cse6 .cse7) (and .cse2 .cse0 .cse5) (and .cse0 (= ssl3_accept_~s__state~0 8528) .cse7) (and .cse0 (= ssl3_accept_~s__state~0 8512) .cse7) (and .cse11 .cse0 .cse5 .cse6 .cse7) (and .cse11 .cse4 .cse3 .cse12 .cse6) (and .cse4 .cse13 .cse3 .cse12) (and .cse13 (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse7 .cse10) (and .cse3 .cse8 .cse9 .cse10)))) [2022-04-07 00:51:56,213 INFO L878 garLoopResultBuilder]: At program point L361(lines 361 369) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and .cse0 (= 2 ssl3_accept_~blastFlag~0) (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:56,213 INFO L878 garLoopResultBuilder]: At program point L593(lines 593 598) the Hoare annotation is: (let ((.cse7 (= ssl3_accept_~s__hit~0 0))) (let ((.cse1 (= ssl3_accept_~s__state~0 3)) (.cse2 (= ssl3_accept_~s__state~0 8656)) (.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse5 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse11 (<= 8640 ssl3_accept_~s__state~0)) (.cse6 (<= ssl3_accept_~s__state~0 8640)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse12 (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse13 (= 8448 ssl3_accept_~s__state~0)) (.cse3 (not .cse7)) (.cse8 (<= ssl3_accept_~s__state~0 8672)) (.cse9 (<= 8672 ssl3_accept_~s__state~0)) (.cse10 (= 3 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse2 .cse0 .cse3) (and .cse4 (<= ssl3_accept_~s__state~0 8576) .cse0 .cse5 .cse6 .cse7) (and .cse4 .cse1) (and (= ssl3_accept_~blastFlag~0 1) (= 8496 ssl3_accept_~s__state~0)) (and .cse4 .cse0 .cse5 (= ssl3_accept_~s__state~0 8592) .cse6 .cse7) (and .cse0 .cse6 (= 8560 ssl3_accept_~s__state~0) .cse7) (and .cse4 .cse0 .cse5 .cse6 (= ssl3_accept_~s__state~0 8608) .cse7) (and .cse5 .cse8 .cse9 .cse10) (and (= ssl3_accept_~s__state~0 8544) .cse0 .cse6 .cse7) (and .cse2 .cse0 .cse5) (and .cse0 (= ssl3_accept_~s__state~0 8528) .cse7) (and .cse0 (= ssl3_accept_~s__state~0 8512) .cse7) (and .cse11 .cse0 .cse5 .cse6 .cse7) (and .cse11 .cse4 .cse3 .cse12 .cse6) (and .cse4 .cse13 .cse3 .cse12) (and .cse13 (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse7 .cse10) (and .cse3 .cse8 .cse9 .cse10)))) [2022-04-07 00:51:56,214 INFO L878 garLoopResultBuilder]: At program point L527(lines 527 529) the Hoare annotation is: (let ((.cse1 (= 3 ssl3_accept_~blastFlag~0)) (.cse2 (not (= ssl3_accept_~s__hit~0 0))) (.cse0 (<= 8672 ssl3_accept_~s__state~0))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse1) (and .cse2 .cse0 .cse1) (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse2 .cse0))) [2022-04-07 00:51:56,214 INFO L878 garLoopResultBuilder]: At program point L593-2(lines 592 606) the Hoare annotation is: (let ((.cse7 (= ssl3_accept_~s__hit~0 0))) (let ((.cse1 (= ssl3_accept_~s__state~0 3)) (.cse2 (= ssl3_accept_~s__state~0 8656)) (.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse5 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse11 (<= 8640 ssl3_accept_~s__state~0)) (.cse6 (<= ssl3_accept_~s__state~0 8640)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse12 (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse13 (= 8448 ssl3_accept_~s__state~0)) (.cse3 (not .cse7)) (.cse8 (<= ssl3_accept_~s__state~0 8672)) (.cse9 (<= 8672 ssl3_accept_~s__state~0)) (.cse10 (= 3 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse2 .cse0 .cse3) (and .cse4 (<= ssl3_accept_~s__state~0 8576) .cse0 .cse5 .cse6 .cse7) (and .cse4 .cse1) (and (= ssl3_accept_~blastFlag~0 1) (= 8496 ssl3_accept_~s__state~0)) (and .cse4 .cse0 .cse5 (= ssl3_accept_~s__state~0 8592) .cse6 .cse7) (and .cse0 .cse6 (= 8560 ssl3_accept_~s__state~0) .cse7) (and .cse4 .cse0 .cse5 .cse6 (= ssl3_accept_~s__state~0 8608) .cse7) (and .cse5 .cse8 .cse9 .cse10) (and (= ssl3_accept_~s__state~0 8544) .cse0 .cse6 .cse7) (and .cse2 .cse0 .cse5) (and .cse0 (= ssl3_accept_~s__state~0 8528) .cse7) (and .cse0 (= ssl3_accept_~s__state~0 8512) .cse7) (and .cse11 .cse0 .cse5 .cse6 .cse7) (and .cse11 .cse4 .cse3 .cse12 .cse6) (and .cse4 .cse13 .cse3 .cse12) (and .cse13 (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse7 .cse10) (and .cse3 .cse8 .cse9 .cse10)))) [2022-04-07 00:51:56,214 INFO L878 garLoopResultBuilder]: At program point L362(lines 338 380) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and .cse0 (= 2 ssl3_accept_~blastFlag~0) (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:56,214 INFO L878 garLoopResultBuilder]: At program point L197(lines 197 562) the Hoare annotation is: (let ((.cse4 (= ssl3_accept_~s__hit~0 0))) (let ((.cse1 (= ssl3_accept_~s__state~0 3)) (.cse7 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse3 (<= ssl3_accept_~s__state~0 8640)) (.cse5 (= ssl3_accept_~s__state~0 8656)) (.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse2 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse6 (not .cse4)) (.cse8 (<= ssl3_accept_~s__state~0 8672)) (.cse9 (<= 8672 ssl3_accept_~s__state~0)) (.cse10 (= 3 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse0 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse6) (and .cse7 .cse1) (and (<= ssl3_accept_~s__state~0 8576) .cse2 .cse4) (and .cse7 .cse6 (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse3) (and .cse2 .cse8 .cse9 .cse10) (and .cse5 .cse0 .cse2) (and .cse6 .cse8 .cse9 .cse10)))) [2022-04-07 00:51:56,214 INFO L878 garLoopResultBuilder]: At program point L164(lines 164 573) the Hoare annotation is: (let ((.cse7 (= ssl3_accept_~s__hit~0 0))) (let ((.cse1 (= ssl3_accept_~s__state~0 3)) (.cse2 (= ssl3_accept_~s__state~0 8656)) (.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse5 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse11 (<= 8640 ssl3_accept_~s__state~0)) (.cse6 (<= ssl3_accept_~s__state~0 8640)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse12 (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse13 (= 8448 ssl3_accept_~s__state~0)) (.cse3 (not .cse7)) (.cse8 (<= ssl3_accept_~s__state~0 8672)) (.cse9 (<= 8672 ssl3_accept_~s__state~0)) (.cse10 (= 3 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse2 .cse0 .cse3) (and .cse4 (<= ssl3_accept_~s__state~0 8576) .cse0 .cse5 .cse6 .cse7) (and .cse4 .cse1) (and .cse4 .cse0 .cse5 (= ssl3_accept_~s__state~0 8592) .cse6 .cse7) (and .cse0 .cse6 (= 8560 ssl3_accept_~s__state~0) .cse7) (and .cse4 .cse0 .cse5 .cse6 (= ssl3_accept_~s__state~0 8608) .cse7) (and .cse5 .cse8 .cse9 .cse10) (and (= ssl3_accept_~s__state~0 8544) .cse0 .cse6 .cse7) (and .cse2 .cse0 .cse5) (and .cse11 .cse0 .cse5 .cse6 .cse7) (and .cse11 .cse4 .cse3 .cse12 .cse6) (and .cse4 .cse13 .cse3 .cse12) (and .cse13 (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse7 .cse10) (and .cse3 .cse8 .cse9 .cse10)))) [2022-04-07 00:51:56,214 INFO L878 garLoopResultBuilder]: At program point L131(lines 131 584) the Hoare annotation is: (let ((.cse7 (= ssl3_accept_~s__hit~0 0))) (let ((.cse1 (= ssl3_accept_~s__state~0 3)) (.cse2 (= ssl3_accept_~s__state~0 8656)) (.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse5 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse11 (<= 8640 ssl3_accept_~s__state~0)) (.cse6 (<= ssl3_accept_~s__state~0 8640)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse12 (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse13 (= 8448 ssl3_accept_~s__state~0)) (.cse3 (not .cse7)) (.cse8 (<= ssl3_accept_~s__state~0 8672)) (.cse9 (<= 8672 ssl3_accept_~s__state~0)) (.cse10 (= 3 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse2 .cse0 .cse3) (and .cse4 (<= ssl3_accept_~s__state~0 8576) .cse0 .cse5 .cse6 .cse7) (and .cse4 .cse1) (and (= ssl3_accept_~blastFlag~0 1) (= 8496 ssl3_accept_~s__state~0)) (and .cse4 .cse0 .cse5 (= ssl3_accept_~s__state~0 8592) .cse6 .cse7) (and .cse0 .cse6 (= 8560 ssl3_accept_~s__state~0) .cse7) (and .cse4 .cse0 .cse5 .cse6 (= ssl3_accept_~s__state~0 8608) .cse7) (and .cse5 .cse8 .cse9 .cse10) (and (= ssl3_accept_~s__state~0 8544) .cse0 .cse6 .cse7) (and .cse2 .cse0 .cse5) (and .cse0 (= ssl3_accept_~s__state~0 8528) .cse7) (and .cse0 (= ssl3_accept_~s__state~0 8512) .cse7) (and .cse11 .cse0 .cse5 .cse6 .cse7) (and .cse11 .cse4 .cse3 .cse12 .cse6) (and .cse4 .cse13 .cse3 .cse12) (and .cse13 (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse7 .cse10) (and .cse3 .cse8 .cse9 .cse10)))) [2022-04-07 00:51:56,214 INFO L878 garLoopResultBuilder]: At program point ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION(line 619) the Hoare annotation is: false [2022-04-07 00:51:56,215 INFO L878 garLoopResultBuilder]: At program point L429(lines 429 431) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and .cse0 (= 2 ssl3_accept_~blastFlag~0) (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:56,215 INFO L878 garLoopResultBuilder]: At program point L396(lines 387 419) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and .cse0 (= 2 ssl3_accept_~blastFlag~0) (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:56,215 INFO L878 garLoopResultBuilder]: At program point L132(lines 128 585) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and .cse0 (= 2 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:56,215 INFO L878 garLoopResultBuilder]: At program point L595(lines 595 597) the Hoare annotation is: (let ((.cse7 (= ssl3_accept_~s__hit~0 0))) (let ((.cse1 (= ssl3_accept_~s__state~0 3)) (.cse2 (= ssl3_accept_~s__state~0 8656)) (.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse5 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse11 (<= 8640 ssl3_accept_~s__state~0)) (.cse6 (<= ssl3_accept_~s__state~0 8640)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse12 (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse13 (= 8448 ssl3_accept_~s__state~0)) (.cse3 (not .cse7)) (.cse8 (<= ssl3_accept_~s__state~0 8672)) (.cse9 (<= 8672 ssl3_accept_~s__state~0)) (.cse10 (= 3 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse2 .cse0 .cse3) (and .cse4 (<= ssl3_accept_~s__state~0 8576) .cse0 .cse5 .cse6 .cse7) (and .cse4 .cse1) (and (= ssl3_accept_~blastFlag~0 1) (= 8496 ssl3_accept_~s__state~0)) (and .cse4 .cse0 .cse5 (= ssl3_accept_~s__state~0 8592) .cse6 .cse7) (and .cse0 .cse6 (= 8560 ssl3_accept_~s__state~0) .cse7) (and .cse4 .cse0 .cse5 .cse6 (= ssl3_accept_~s__state~0 8608) .cse7) (and .cse5 .cse8 .cse9 .cse10) (and (= ssl3_accept_~s__state~0 8544) .cse0 .cse6 .cse7) (and .cse2 .cse0 .cse5) (and .cse0 (= ssl3_accept_~s__state~0 8528) .cse7) (and .cse0 (= ssl3_accept_~s__state~0 8512) .cse7) (and .cse11 .cse0 .cse5 .cse6 .cse7) (and .cse11 .cse4 .cse3 .cse12 .cse6) (and .cse4 .cse13 .cse3 .cse12) (and .cse13 (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse7 .cse10) (and .cse3 .cse8 .cse9 .cse10)))) [2022-04-07 00:51:56,215 INFO L878 garLoopResultBuilder]: At program point L364(lines 364 366) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and .cse0 (= 2 ssl3_accept_~blastFlag~0) (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:56,215 INFO L878 garLoopResultBuilder]: At program point L298(lines 298 300) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and .cse0 (= 2 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= ssl3_accept_~s__hit~0 0)) (and (= ssl3_accept_~blastFlag~0 1) .cse0))) [2022-04-07 00:51:56,215 INFO L878 garLoopResultBuilder]: At program point L232(lines 232 234) the Hoare annotation is: (let ((.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse1 (<= ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1) (and (<= 8640 ssl3_accept_~s__state~0) .cse0) (and .cse1 (= 2 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:56,215 INFO L878 garLoopResultBuilder]: At program point L298-2(lines 219 553) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and .cse0 (= 2 ssl3_accept_~blastFlag~0)))) [2022-04-07 00:51:56,215 INFO L878 garLoopResultBuilder]: At program point L332(lines 332 336) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and .cse0 (= 2 ssl3_accept_~blastFlag~0) (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:56,215 INFO L878 garLoopResultBuilder]: At program point L332-2(lines 219 553) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and .cse0 (= 2 ssl3_accept_~blastFlag~0) (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:56,216 INFO L878 garLoopResultBuilder]: At program point L200(lines 200 561) the Hoare annotation is: (let ((.cse1 (<= ssl3_accept_~s__state~0 8640)) (.cse2 (= ssl3_accept_~s__state~0 8656)) (.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse3 (not (= ssl3_accept_~s__hit~0 0))) (.cse5 (<= ssl3_accept_~s__state~0 8672)) (.cse6 (<= 8672 ssl3_accept_~s__state~0)) (.cse7 (= 3 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse2 .cse0 .cse3) (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse1) (and .cse4 .cse5 .cse6 .cse7) (and .cse2 .cse0 .cse4) (and .cse3 .cse5 .cse6 .cse7))) [2022-04-07 00:51:56,216 INFO L878 garLoopResultBuilder]: At program point L167(lines 167 572) the Hoare annotation is: (let ((.cse7 (= ssl3_accept_~s__hit~0 0))) (let ((.cse1 (= ssl3_accept_~s__state~0 3)) (.cse2 (= ssl3_accept_~s__state~0 8656)) (.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse5 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse11 (<= 8640 ssl3_accept_~s__state~0)) (.cse6 (<= ssl3_accept_~s__state~0 8640)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse12 (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse13 (= 8448 ssl3_accept_~s__state~0)) (.cse3 (not .cse7)) (.cse8 (<= ssl3_accept_~s__state~0 8672)) (.cse9 (<= 8672 ssl3_accept_~s__state~0)) (.cse10 (= 3 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse2 .cse0 .cse3) (and .cse4 (<= ssl3_accept_~s__state~0 8576) .cse0 .cse5 .cse6 .cse7) (and .cse4 .cse1) (and .cse0 (= 8560 ssl3_accept_~s__state~0) .cse7) (and .cse4 .cse0 .cse5 (= ssl3_accept_~s__state~0 8592) .cse6 .cse7) (and .cse4 .cse0 .cse5 .cse6 (= ssl3_accept_~s__state~0 8608) .cse7) (and .cse5 .cse8 .cse9 .cse10) (and .cse2 .cse0 .cse5) (and .cse11 .cse0 .cse5 .cse6 .cse7) (and .cse11 .cse4 .cse3 .cse12 .cse6) (and .cse4 .cse13 .cse3 .cse12) (and .cse13 (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse7 .cse10) (and .cse3 .cse8 .cse9 .cse10)))) [2022-04-07 00:51:56,216 INFO L878 garLoopResultBuilder]: At program point L134(lines 134 583) the Hoare annotation is: (let ((.cse7 (= ssl3_accept_~s__hit~0 0))) (let ((.cse1 (= ssl3_accept_~s__state~0 3)) (.cse2 (= ssl3_accept_~s__state~0 8656)) (.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse5 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse11 (<= 8640 ssl3_accept_~s__state~0)) (.cse6 (<= ssl3_accept_~s__state~0 8640)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse12 (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse13 (= 8448 ssl3_accept_~s__state~0)) (.cse3 (not .cse7)) (.cse8 (<= ssl3_accept_~s__state~0 8672)) (.cse9 (<= 8672 ssl3_accept_~s__state~0)) (.cse10 (= 3 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse2 .cse0 .cse3) (and .cse4 (<= ssl3_accept_~s__state~0 8576) .cse0 .cse5 .cse6 .cse7) (and .cse4 .cse1) (and (= ssl3_accept_~blastFlag~0 1) (= 8496 ssl3_accept_~s__state~0)) (and .cse4 .cse0 .cse5 (= ssl3_accept_~s__state~0 8592) .cse6 .cse7) (and .cse0 .cse6 (= 8560 ssl3_accept_~s__state~0) .cse7) (and .cse4 .cse0 .cse5 .cse6 (= ssl3_accept_~s__state~0 8608) .cse7) (and .cse5 .cse8 .cse9 .cse10) (and (= ssl3_accept_~s__state~0 8544) .cse0 .cse6 .cse7) (and .cse2 .cse0 .cse5) (and .cse0 (= ssl3_accept_~s__state~0 8528) .cse7) (and .cse0 (= ssl3_accept_~s__state~0 8512) .cse7) (and .cse11 .cse0 .cse5 .cse6 .cse7) (and .cse11 .cse4 .cse3 .cse12 .cse6) (and .cse4 .cse13 .cse3 .cse12) (and .cse13 (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse7 .cse10) (and .cse3 .cse8 .cse9 .cse10)))) [2022-04-07 00:51:56,216 INFO L878 garLoopResultBuilder]: At program point L101(lines 101 105) the Hoare annotation is: (= ssl3_accept_~blastFlag~0 0) [2022-04-07 00:51:56,216 INFO L878 garLoopResultBuilder]: At program point L101-1(lines 83 621) the Hoare annotation is: (= ssl3_accept_~blastFlag~0 0) [2022-04-07 00:51:56,216 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-07 00:51:56,216 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:51:56,216 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-07 00:51:56,216 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-07 00:51:56,216 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-07 00:51:56,216 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-07 00:51:56,217 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-07 00:51:56,220 INFO L719 BasicCegarLoop]: Path program histogram: [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:51:56,221 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 00:51:56,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 12:51:56 BoogieIcfgContainer [2022-04-07 00:51:56,241 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 00:51:56,241 INFO L158 Benchmark]: Toolchain (without parser) took 93476.32ms. Allocated memory was 211.8MB in the beginning and 857.7MB in the end (delta: 645.9MB). Free memory was 160.7MB in the beginning and 681.0MB in the end (delta: -520.2MB). Peak memory consumption was 509.5MB. Max. memory is 8.0GB. [2022-04-07 00:51:56,241 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 211.8MB. Free memory is still 177.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 00:51:56,241 INFO L158 Benchmark]: CACSL2BoogieTranslator took 415.84ms. Allocated memory was 211.8MB in the beginning and 278.9MB in the end (delta: 67.1MB). Free memory was 160.5MB in the beginning and 251.5MB in the end (delta: -90.9MB). Peak memory consumption was 14.2MB. Max. memory is 8.0GB. [2022-04-07 00:51:56,242 INFO L158 Benchmark]: Boogie Preprocessor took 74.08ms. Allocated memory is still 278.9MB. Free memory was 251.5MB in the beginning and 249.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 00:51:56,242 INFO L158 Benchmark]: RCFGBuilder took 689.77ms. Allocated memory is still 278.9MB. Free memory was 249.0MB in the beginning and 221.4MB in the end (delta: 27.6MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-04-07 00:51:56,242 INFO L158 Benchmark]: TraceAbstraction took 92288.39ms. Allocated memory was 278.9MB in the beginning and 857.7MB in the end (delta: 578.8MB). Free memory was 220.7MB in the beginning and 681.0MB in the end (delta: -460.3MB). Peak memory consumption was 502.6MB. Max. memory is 8.0GB. [2022-04-07 00:51:56,243 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.15ms. Allocated memory is still 211.8MB. Free memory is still 177.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 415.84ms. Allocated memory was 211.8MB in the beginning and 278.9MB in the end (delta: 67.1MB). Free memory was 160.5MB in the beginning and 251.5MB in the end (delta: -90.9MB). Peak memory consumption was 14.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 74.08ms. Allocated memory is still 278.9MB. Free memory was 251.5MB in the beginning and 249.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 689.77ms. Allocated memory is still 278.9MB. Free memory was 249.0MB in the beginning and 221.4MB in the end (delta: 27.6MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * TraceAbstraction took 92288.39ms. Allocated memory was 278.9MB in the beginning and 857.7MB in the end (delta: 578.8MB). Free memory was 220.7MB in the beginning and 681.0MB in the end (delta: -460.3MB). Peak memory consumption was 502.6MB. 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: 619]: 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, 153 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 92.2s, OverallIterations: 23, TraceHistogramMax: 19, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 43.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6615 SdHoareTripleChecker+Valid, 5.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6613 mSDsluCounter, 6423 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 361 mSDsCounter, 535 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5904 IncrementalHoareTripleChecker+Invalid, 6439 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 535 mSolverCounterUnsat, 6062 mSDtfsCounter, 5904 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3605 GetRequests, 3514 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4118occurred in iteration=14, InterpolantAutomatonStates: 98, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 23 MinimizatonAttempts, 4456 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 150 LocationsWithAnnotation, 150 PreInvPairs, 2552 NumberOfFragments, 10102 HoareAnnotationTreeSize, 150 FomulaSimplifications, 105332 FormulaSimplificationTreeSizeReduction, 11.9s HoareSimplificationTime, 150 FomulaSimplificationsInter, 131340 FormulaSimplificationTreeSizeReductionInter, 31.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: 109]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: (blastFlag == 0 && s__state <= 8640) || (((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8640) && s__hit == 0) - InvariantResult [Line: 338]: Loop Invariant Derived loop invariant: (blastFlag == 0 && s__state <= 8576) || ((s__state <= 8576 && 2 == blastFlag) && s__hit == 0) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: (blastFlag == 0 && s__state <= 8576) || ((s__state <= 8576 && 2 == blastFlag) && s__hit == 0) - InvariantResult [Line: 215]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: (blastFlag == 0 && s__state <= 8576) || ((s__state <= 8576 && 2 == blastFlag) && s__hit == 0) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((((8448 == s__state && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__hit == 0) || (blastFlag == 0 && 8448 == s__state)) || (((s__s3__tmp__next_state___0 <= 8640 && 8448 == s__state) && !(s__hit == 0)) && 8640 <= s__s3__tmp__next_state___0)) || (((8448 == s__state && 3 == s__s3__tmp__next_state___0) && s__hit == 0) && 3 == blastFlag) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((((((((((((((((((2 == blastFlag && s__state == 3) || blastFlag == 0) || ((s__state == 8656 && 2 == blastFlag) && !(s__hit == 0))) || (((((s__s3__tmp__next_state___0 <= 8640 && s__state <= 8576) && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8640) && s__hit == 0)) || (s__s3__tmp__next_state___0 <= 8640 && s__state == 3)) || (blastFlag == 1 && 8496 == s__state)) || (((((s__s3__tmp__next_state___0 <= 8640 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state == 8592) && s__state <= 8640) && s__hit == 0)) || (((2 == blastFlag && s__state <= 8640) && 8560 == s__state) && s__hit == 0)) || (((((s__s3__tmp__next_state___0 <= 8640 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8640) && s__state == 8608) && s__hit == 0)) || (((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8672) && 8672 <= s__state) && 3 == blastFlag)) || (((s__state == 8544 && 2 == blastFlag) && s__state <= 8640) && s__hit == 0)) || ((s__state == 8656 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576)) || ((2 == blastFlag && s__state == 8528) && s__hit == 0)) || ((2 == blastFlag && s__state == 8512) && s__hit == 0)) || ((((8640 <= s__state && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8640) && s__hit == 0)) || ((((8640 <= s__state && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && 8640 <= s__s3__tmp__next_state___0) && s__state <= 8640)) || (((s__s3__tmp__next_state___0 <= 8640 && 8448 == s__state) && !(s__hit == 0)) && 8640 <= s__s3__tmp__next_state___0)) || (((8448 == s__state && 3 == s__s3__tmp__next_state___0) && s__hit == 0) && 3 == blastFlag)) || (((!(s__hit == 0) && s__state <= 8672) && 8672 <= s__state) && 3 == blastFlag) - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: (blastFlag == 0 && s__state <= 8576) || (((s__state <= 8576 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__hit == 0) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: (blastFlag == 0 && s__state <= 8640) || (((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && s__state == 8608) && s__hit == 0) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((blastFlag == 0 && s__state <= 8576) || (((s__state <= 8576 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__hit == 0)) || (blastFlag == 1 && s__state <= 8576) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: (((((8640 <= s__state && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672) && s__hit == 0) || ((8640 <= s__state && blastFlag == 0) && s__state <= 8672)) || ((((8640 <= s__state && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && 8640 <= s__s3__tmp__next_state___0) && s__state <= 8640) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: ((blastFlag == 0 && 8672 <= s__state) || ((s__s3__tmp__next_state___0 <= 8576 && 8672 <= s__state) && 3 == blastFlag)) || ((!(s__hit == 0) && 8672 <= s__state) && 3 == blastFlag) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((2 == blastFlag && s__state <= 8640) || (blastFlag == 0 && s__state <= 8640)) || (s__s3__tmp__next_state___0 <= 8640 && s__state <= 8640) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((8640 <= s__state && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672) || (((8640 <= s__state && 2 == blastFlag) && !(s__hit == 0)) && s__state <= 8672)) || ((8640 <= s__state && blastFlag == 0) && s__state <= 8672) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: (blastFlag == 0 && s__state <= 8576) || (((s__state <= 8576 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__hit == 0) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: (blastFlag == 0 && s__state <= 8576) || ((s__state <= 8576 && 2 == blastFlag) && s__hit == 0) - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: (blastFlag == 0 && s__state <= 8576) || ((s__state <= 8576 && 2 == blastFlag) && s__hit == 0) - InvariantResult [Line: 399]: Loop Invariant Derived loop invariant: (blastFlag == 0 && s__state <= 8576) || ((s__state <= 8576 && 2 == blastFlag) && s__hit == 0) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: blastFlag == 0 && 8672 <= s__state - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: ((blastFlag == 0 && s__state <= 8576) || (8640 <= s__state && blastFlag == 0)) || (((s__state <= 8576 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__hit == 0) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: (blastFlag == 0 && s__state <= 8640) || (((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8640) && s__hit == 0) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((((((((((((((((((2 == blastFlag && s__state == 3) || blastFlag == 0) || ((s__state == 8656 && 2 == blastFlag) && !(s__hit == 0))) || (((((s__s3__tmp__next_state___0 <= 8640 && s__state <= 8576) && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8640) && s__hit == 0)) || (s__s3__tmp__next_state___0 <= 8640 && s__state == 3)) || (blastFlag == 1 && 8496 == s__state)) || (((((s__s3__tmp__next_state___0 <= 8640 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state == 8592) && s__state <= 8640) && s__hit == 0)) || (((2 == blastFlag && s__state <= 8640) && 8560 == s__state) && s__hit == 0)) || (((((s__s3__tmp__next_state___0 <= 8640 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8640) && s__state == 8608) && s__hit == 0)) || (((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8672) && 8672 <= s__state) && 3 == blastFlag)) || (((s__state == 8544 && 2 == blastFlag) && s__state <= 8640) && s__hit == 0)) || ((s__state == 8656 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576)) || ((2 == blastFlag && s__state == 8528) && s__hit == 0)) || ((2 == blastFlag && s__state == 8512) && s__hit == 0)) || ((((8640 <= s__state && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8640) && s__hit == 0)) || ((((8640 <= s__state && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && 8640 <= s__s3__tmp__next_state___0) && s__state <= 8640)) || (((s__s3__tmp__next_state___0 <= 8640 && 8448 == s__state) && !(s__hit == 0)) && 8640 <= s__s3__tmp__next_state___0)) || (((8448 == s__state && 3 == s__s3__tmp__next_state___0) && s__hit == 0) && 3 == blastFlag)) || (((!(s__hit == 0) && s__state <= 8672) && 8672 <= s__state) && 3 == blastFlag) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: (blastFlag == 0 && s__state <= 8576) || ((s__state <= 8576 && 2 == blastFlag) && s__hit == 0) - ProcedureContractResult [Line: 623]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 22]: Procedure Contract for ssl3_accept Derived contract for procedure ssl3_accept: 1 RESULT: Ultimate proved your program to be correct! [2022-04-07 00:51:56,297 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...