/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_3.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 00:50:16,247 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 00:50:16,248 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 00:50:16,278 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 00:50:16,278 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 00:50:16,279 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 00:50:16,281 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 00:50:16,285 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 00:50:16,287 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 00:50:16,290 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 00:50:16,291 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 00:50:16,291 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 00:50:16,291 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 00:50:16,292 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 00:50:16,293 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 00:50:16,293 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 00:50:16,294 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 00:50:16,294 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 00:50:16,295 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 00:50:16,296 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 00:50:16,297 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 00:50:16,299 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 00:50:16,300 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 00:50:16,303 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 00:50:16,304 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 00:50:16,312 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 00:50:16,312 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 00:50:16,312 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 00:50:16,313 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 00:50:16,313 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 00:50:16,314 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 00:50:16,314 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 00:50:16,315 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 00:50:16,316 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 00:50:16,316 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 00:50:16,317 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 00:50:16,317 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 00:50:16,317 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 00:50:16,318 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 00:50:16,318 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 00:50:16,318 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 00:50:16,320 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 00:50:16,320 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:16,330 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 00:50:16,330 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 00:50:16,331 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 00:50:16,331 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 00:50:16,331 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 00:50:16,331 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 00:50:16,331 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 00:50:16,332 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 00:50:16,332 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 00:50:16,332 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 00:50:16,332 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 00:50:16,333 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 00:50:16,333 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 00:50:16,333 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 00:50:16,333 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 00:50:16,333 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 00:50:16,333 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 00:50:16,333 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-07 00:50:16,333 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-07 00:50:16,333 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-07 00:50:16,334 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 00:50:16,334 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-07 00:50:16,334 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:16,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 00:50:16,557 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 00:50:16,559 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 00:50:16,559 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 00:50:16,560 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 00:50:16,561 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_3.cil.c [2022-04-07 00:50:16,605 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d17a9f3db/fe516d8a78f84686a18feab2018bc0ac/FLAGf722e383a [2022-04-07 00:50:17,002 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 00:50:17,003 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_3.cil.c [2022-04-07 00:50:17,022 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d17a9f3db/fe516d8a78f84686a18feab2018bc0ac/FLAGf722e383a [2022-04-07 00:50:17,042 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d17a9f3db/fe516d8a78f84686a18feab2018bc0ac [2022-04-07 00:50:17,044 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 00:50:17,046 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 00:50:17,048 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 00:50:17,048 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 00:50:17,050 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 00:50:17,051 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 12:50:17" (1/1) ... [2022-04-07 00:50:17,052 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49e85ae5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:50:17, skipping insertion in model container [2022-04-07 00:50:17,052 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 12:50:17" (1/1) ... [2022-04-07 00:50:17,057 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 00:50:17,113 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 00:50:17,333 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_3.cil.c[42783,42796] [2022-04-07 00:50:17,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 00:50:17,342 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 00:50:17,370 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_3.cil.c[42783,42796] [2022-04-07 00:50:17,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 00:50:17,387 INFO L208 MainTranslator]: Completed translation [2022-04-07 00:50:17,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:50:17 WrapperNode [2022-04-07 00:50:17,388 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 00:50:17,389 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 00:50:17,389 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 00:50:17,389 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 00:50:17,397 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:17" (1/1) ... [2022-04-07 00:50:17,397 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:17" (1/1) ... [2022-04-07 00:50:17,414 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:17" (1/1) ... [2022-04-07 00:50:17,415 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:17" (1/1) ... [2022-04-07 00:50:17,422 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:17" (1/1) ... [2022-04-07 00:50:17,436 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:17" (1/1) ... [2022-04-07 00:50:17,438 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:17" (1/1) ... [2022-04-07 00:50:17,441 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 00:50:17,441 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 00:50:17,442 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 00:50:17,442 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 00:50:17,453 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:50:17" (1/1) ... [2022-04-07 00:50:17,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 00:50:17,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 00:50:17,476 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:17,486 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:17,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 00:50:17,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 00:50:17,513 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 00:50:17,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-07 00:50:17,513 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 00:50:17,513 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 00:50:17,513 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 00:50:17,513 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 00:50:17,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 00:50:17,513 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-07 00:50:17,513 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 00:50:17,513 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-07 00:50:17,514 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-07 00:50:17,514 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 00:50:17,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 00:50:17,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 00:50:17,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 00:50:17,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 00:50:17,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 00:50:17,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 00:50:17,582 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 00:50:17,583 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 00:50:17,654 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-07 00:50:18,002 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-04-07 00:50:18,002 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-04-07 00:50:18,006 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 00:50:18,016 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 00:50:18,016 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 00:50:18,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 12:50:18 BoogieIcfgContainer [2022-04-07 00:50:18,018 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 00:50:18,021 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 00:50:18,021 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 00:50:18,024 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 00:50:18,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 12:50:17" (1/3) ... [2022-04-07 00:50:18,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57ad319e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 12:50:18, skipping insertion in model container [2022-04-07 00:50:18,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:50:17" (2/3) ... [2022-04-07 00:50:18,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57ad319e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 12:50:18, skipping insertion in model container [2022-04-07 00:50:18,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 12:50:18" (3/3) ... [2022-04-07 00:50:18,026 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_3.cil.c [2022-04-07 00:50:18,032 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-07 00:50:18,032 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 00:50:18,067 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 00:50:18,072 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:18,072 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 00:50:18,085 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:18,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-07 00:50:18,092 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:18,093 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:18,093 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:18,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:18,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1942859062, now seen corresponding path program 1 times [2022-04-07 00:50:18,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:18,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1313371524] [2022-04-07 00:50:18,108 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:50:18,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1942859062, now seen corresponding path program 2 times [2022-04-07 00:50:18,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:18,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024012520] [2022-04-07 00:50:18,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:18,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:18,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:18,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:18,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:18,320 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:18,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:18,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024012520] [2022-04-07 00:50:18,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024012520] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:18,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:18,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:18,323 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:18,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1313371524] [2022-04-07 00:50:18,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1313371524] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:18,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:18,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:18,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910677059] [2022-04-07 00:50:18,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:18,327 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:18,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:18,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:18,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:18,352 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:18,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:18,714 INFO L93 Difference]: Finished difference Result 414 states and 701 transitions. [2022-04-07 00:50:18,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:18,716 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:18,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:18,727 INFO L225 Difference]: With dead ends: 414 [2022-04-07 00:50:18,727 INFO L226 Difference]: Without dead ends: 251 [2022-04-07 00:50:18,731 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:18,736 INFO L913 BasicCegarLoop]: 240 mSDtfsCounter, 634 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:18,737 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.2s Time] [2022-04-07 00:50:18,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-04-07 00:50:18,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2022-04-07 00:50:18,795 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:18,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 379 transitions. [2022-04-07 00:50:18,798 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 379 transitions. Word has length 50 [2022-04-07 00:50:18,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:18,798 INFO L478 AbstractCegarLoop]: Abstraction has 251 states and 379 transitions. [2022-04-07 00:50:18,799 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:18,799 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 379 transitions. [2022-04-07 00:50:18,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-07 00:50:18,806 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:18,806 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:18,806 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 00:50:18,807 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:18,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:18,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1924818871, now seen corresponding path program 1 times [2022-04-07 00:50:18,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:18,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [406855344] [2022-04-07 00:50:18,829 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-07 00:50:18,830 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:18,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1924818871, now seen corresponding path program 2 times [2022-04-07 00:50:18,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:18,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255648655] [2022-04-07 00:50:18,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:18,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:18,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:18,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:18,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:18,927 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:18,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:18,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255648655] [2022-04-07 00:50:18,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255648655] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:18,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:18,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:18,927 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:18,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [406855344] [2022-04-07 00:50:18,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [406855344] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:18,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:18,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:18,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606791008] [2022-04-07 00:50:18,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:18,929 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:18,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:18,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:18,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:18,929 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:19,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:19,178 INFO L93 Difference]: Finished difference Result 400 states and 612 transitions. [2022-04-07 00:50:19,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:19,179 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:19,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:19,183 INFO L225 Difference]: With dead ends: 400 [2022-04-07 00:50:19,184 INFO L226 Difference]: Without dead ends: 280 [2022-04-07 00:50:19,189 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:19,191 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:19,192 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:19,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-04-07 00:50:19,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 272. [2022-04-07 00:50:19,215 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:19,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 405 transitions. [2022-04-07 00:50:19,216 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 405 transitions. Word has length 66 [2022-04-07 00:50:19,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:19,216 INFO L478 AbstractCegarLoop]: Abstraction has 272 states and 405 transitions. [2022-04-07 00:50:19,216 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:19,216 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 405 transitions. [2022-04-07 00:50:19,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-07 00:50:19,218 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:19,218 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:19,218 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 00:50:19,218 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:19,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:19,218 INFO L85 PathProgramCache]: Analyzing trace with hash -504453063, now seen corresponding path program 1 times [2022-04-07 00:50:19,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:19,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1538229776] [2022-04-07 00:50:19,222 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-07 00:50:19,222 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:19,222 INFO L85 PathProgramCache]: Analyzing trace with hash -504453063, now seen corresponding path program 2 times [2022-04-07 00:50:19,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:19,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866620132] [2022-04-07 00:50:19,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:19,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:19,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:19,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:19,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:19,322 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:19,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:19,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866620132] [2022-04-07 00:50:19,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866620132] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:19,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:19,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:19,323 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:19,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1538229776] [2022-04-07 00:50:19,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1538229776] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:19,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:19,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:19,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876347809] [2022-04-07 00:50:19,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:19,324 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:19,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:19,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:19,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:19,325 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:19,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:19,548 INFO L93 Difference]: Finished difference Result 622 states and 957 transitions. [2022-04-07 00:50:19,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:19,548 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:19,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:19,551 INFO L225 Difference]: With dead ends: 622 [2022-04-07 00:50:19,551 INFO L226 Difference]: Without dead ends: 364 [2022-04-07 00:50:19,552 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:19,554 INFO L913 BasicCegarLoop]: 214 mSDtfsCounter, 216 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 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:19,567 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [216 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:19,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-04-07 00:50:19,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 356. [2022-04-07 00:50:19,583 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:19,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 499 transitions. [2022-04-07 00:50:19,584 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 499 transitions. Word has length 87 [2022-04-07 00:50:19,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:19,584 INFO L478 AbstractCegarLoop]: Abstraction has 356 states and 499 transitions. [2022-04-07 00:50:19,584 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:19,584 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 499 transitions. [2022-04-07 00:50:19,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-07 00:50:19,585 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:19,585 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:19,585 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-07 00:50:19,586 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:19,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:19,586 INFO L85 PathProgramCache]: Analyzing trace with hash -256306569, now seen corresponding path program 1 times [2022-04-07 00:50:19,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:19,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2022736700] [2022-04-07 00:50:19,589 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-07 00:50:19,589 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:19,589 INFO L85 PathProgramCache]: Analyzing trace with hash -256306569, now seen corresponding path program 2 times [2022-04-07 00:50:19,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:19,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457614056] [2022-04-07 00:50:19,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:19,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:19,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:19,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:19,649 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:19,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:19,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457614056] [2022-04-07 00:50:19,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457614056] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:19,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:19,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:19,651 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:19,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2022736700] [2022-04-07 00:50:19,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2022736700] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:19,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:19,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:19,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164830195] [2022-04-07 00:50:19,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:19,652 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:19,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:19,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:19,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:19,652 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:19,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:19,846 INFO L93 Difference]: Finished difference Result 752 states and 1074 transitions. [2022-04-07 00:50:19,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:19,847 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:19,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:19,849 INFO L225 Difference]: With dead ends: 752 [2022-04-07 00:50:19,849 INFO L226 Difference]: Without dead ends: 410 [2022-04-07 00:50:19,859 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:50:19,860 INFO L913 BasicCegarLoop]: 214 mSDtfsCounter, 214 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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:19,860 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:19,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-04-07 00:50:19,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 402. [2022-04-07 00:50:19,897 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:19,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 555 transitions. [2022-04-07 00:50:19,898 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 555 transitions. Word has length 87 [2022-04-07 00:50:19,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:19,899 INFO L478 AbstractCegarLoop]: Abstraction has 402 states and 555 transitions. [2022-04-07 00:50:19,899 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:19,899 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 555 transitions. [2022-04-07 00:50:19,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-04-07 00:50:19,904 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:19,904 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:19,905 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-07 00:50:19,905 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:19,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:19,906 INFO L85 PathProgramCache]: Analyzing trace with hash 243465655, now seen corresponding path program 1 times [2022-04-07 00:50:19,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:19,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [964591337] [2022-04-07 00:50:19,915 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-07 00:50:19,915 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:19,916 INFO L85 PathProgramCache]: Analyzing trace with hash 243465655, now seen corresponding path program 2 times [2022-04-07 00:50:19,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:19,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871742741] [2022-04-07 00:50:19,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:19,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:19,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:19,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:19,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:19,991 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:19,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:19,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871742741] [2022-04-07 00:50:19,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871742741] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:19,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:19,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:19,992 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:19,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [964591337] [2022-04-07 00:50:19,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [964591337] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:19,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:19,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:19,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959198783] [2022-04-07 00:50:19,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:19,993 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:19,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:19,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:19,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:19,993 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:20,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:20,228 INFO L93 Difference]: Finished difference Result 866 states and 1226 transitions. [2022-04-07 00:50:20,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:20,228 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:20,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:20,232 INFO L225 Difference]: With dead ends: 866 [2022-04-07 00:50:20,232 INFO L226 Difference]: Without dead ends: 478 [2022-04-07 00:50:20,233 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:20,233 INFO L913 BasicCegarLoop]: 213 mSDtfsCounter, 246 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:20,234 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.2s Time] [2022-04-07 00:50:20,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2022-04-07 00:50:20,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 452. [2022-04-07 00:50:20,271 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:20,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 615 transitions. [2022-04-07 00:50:20,273 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 615 transitions. Word has length 108 [2022-04-07 00:50:20,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:20,274 INFO L478 AbstractCegarLoop]: Abstraction has 452 states and 615 transitions. [2022-04-07 00:50:20,274 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:20,274 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 615 transitions. [2022-04-07 00:50:20,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-07 00:50:20,277 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:20,278 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:20,278 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-07 00:50:20,278 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:20,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:20,278 INFO L85 PathProgramCache]: Analyzing trace with hash -3559178, now seen corresponding path program 1 times [2022-04-07 00:50:20,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:20,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [366956395] [2022-04-07 00:50:20,287 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-07 00:50:20,287 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:20,287 INFO L85 PathProgramCache]: Analyzing trace with hash -3559178, now seen corresponding path program 2 times [2022-04-07 00:50:20,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:20,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993164936] [2022-04-07 00:50:20,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:20,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:20,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:20,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:20,356 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:20,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:20,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993164936] [2022-04-07 00:50:20,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993164936] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:20,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:20,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:20,356 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:20,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [366956395] [2022-04-07 00:50:20,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [366956395] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:20,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:20,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:20,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750302121] [2022-04-07 00:50:20,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:20,357 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:20,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:20,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:20,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:20,357 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:20,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:20,542 INFO L93 Difference]: Finished difference Result 908 states and 1239 transitions. [2022-04-07 00:50:20,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:20,542 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:20,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:20,545 INFO L225 Difference]: With dead ends: 908 [2022-04-07 00:50:20,545 INFO L226 Difference]: Without dead ends: 677 [2022-04-07 00:50:20,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:20,547 INFO L913 BasicCegarLoop]: 369 mSDtfsCounter, 330 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:20,547 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [330 Valid, 376 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 00:50:20,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2022-04-07 00:50:20,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 677. [2022-04-07 00:50:20,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 672 states have (on average 1.3616071428571428) internal successors, (915), 672 states have internal predecessors, (915), 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:20,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 919 transitions. [2022-04-07 00:50:20,574 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 919 transitions. Word has length 127 [2022-04-07 00:50:20,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:20,574 INFO L478 AbstractCegarLoop]: Abstraction has 677 states and 919 transitions. [2022-04-07 00:50:20,574 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:20,574 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 919 transitions. [2022-04-07 00:50:20,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-07 00:50:20,576 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:20,576 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:20,576 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-07 00:50:20,576 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:20,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:20,576 INFO L85 PathProgramCache]: Analyzing trace with hash -900952456, now seen corresponding path program 1 times [2022-04-07 00:50:20,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:20,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [719743438] [2022-04-07 00:50:20,581 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-07 00:50:20,581 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:20,581 INFO L85 PathProgramCache]: Analyzing trace with hash -900952456, now seen corresponding path program 2 times [2022-04-07 00:50:20,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:20,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581057416] [2022-04-07 00:50:20,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:20,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:20,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:20,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:20,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:20,622 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:20,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:20,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581057416] [2022-04-07 00:50:20,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581057416] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:20,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:20,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:20,623 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:20,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [719743438] [2022-04-07 00:50:20,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [719743438] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:20,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:20,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:20,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166980977] [2022-04-07 00:50:20,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:20,623 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:20,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:20,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:20,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:20,624 INFO L87 Difference]: Start difference. First operand 677 states and 919 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:20,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:20,816 INFO L93 Difference]: Finished difference Result 1360 states and 1850 transitions. [2022-04-07 00:50:20,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:20,817 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 127 [2022-04-07 00:50:20,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:20,820 INFO L225 Difference]: With dead ends: 1360 [2022-04-07 00:50:20,820 INFO L226 Difference]: Without dead ends: 904 [2022-04-07 00:50:20,821 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:20,821 INFO L913 BasicCegarLoop]: 372 mSDtfsCounter, 331 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:20,821 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [331 Valid, 379 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 00:50:20,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2022-04-07 00:50:20,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 904. [2022-04-07 00:50:20,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 899 states have (on average 1.3592880978865407) internal successors, (1222), 899 states have internal predecessors, (1222), 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:20,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1226 transitions. [2022-04-07 00:50:20,855 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1226 transitions. Word has length 127 [2022-04-07 00:50:20,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:20,855 INFO L478 AbstractCegarLoop]: Abstraction has 904 states and 1226 transitions. [2022-04-07 00:50:20,855 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:20,855 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1226 transitions. [2022-04-07 00:50:20,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-07 00:50:20,857 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:20,857 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:20,857 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-07 00:50:20,857 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:20,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:20,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1514883894, now seen corresponding path program 1 times [2022-04-07 00:50:20,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:20,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [566644905] [2022-04-07 00:50:20,861 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-07 00:50:20,861 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:20,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1514883894, now seen corresponding path program 2 times [2022-04-07 00:50:20,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:20,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040939977] [2022-04-07 00:50:20,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:20,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:20,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:20,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:20,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:20,891 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:20,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:20,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040939977] [2022-04-07 00:50:20,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040939977] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:20,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:20,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:20,892 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:20,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [566644905] [2022-04-07 00:50:20,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [566644905] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:20,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:20,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:20,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118421331] [2022-04-07 00:50:20,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:20,892 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:20,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:20,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:20,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:20,893 INFO L87 Difference]: Start difference. First operand 904 states and 1226 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:21,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:21,082 INFO L93 Difference]: Finished difference Result 1611 states and 2182 transitions. [2022-04-07 00:50:21,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:21,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 127 [2022-04-07 00:50:21,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:21,085 INFO L225 Difference]: With dead ends: 1611 [2022-04-07 00:50:21,085 INFO L226 Difference]: Without dead ends: 928 [2022-04-07 00:50:21,087 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:21,087 INFO L913 BasicCegarLoop]: 228 mSDtfsCounter, 207 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:21,087 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.1s Time] [2022-04-07 00:50:21,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2022-04-07 00:50:21,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 928. [2022-04-07 00:50:21,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 923 states have (on average 1.3553629469122428) internal successors, (1251), 923 states have internal predecessors, (1251), 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:21,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1255 transitions. [2022-04-07 00:50:21,120 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1255 transitions. Word has length 127 [2022-04-07 00:50:21,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:21,120 INFO L478 AbstractCegarLoop]: Abstraction has 928 states and 1255 transitions. [2022-04-07 00:50:21,121 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:21,121 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1255 transitions. [2022-04-07 00:50:21,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-04-07 00:50:21,123 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:21,123 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, 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:21,123 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-07 00:50:21,123 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:21,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:21,123 INFO L85 PathProgramCache]: Analyzing trace with hash 443051624, now seen corresponding path program 1 times [2022-04-07 00:50:21,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:21,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1098515531] [2022-04-07 00:50:21,128 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-07 00:50:21,128 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:21,128 INFO L85 PathProgramCache]: Analyzing trace with hash 443051624, now seen corresponding path program 2 times [2022-04-07 00:50:21,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:21,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50978836] [2022-04-07 00:50:21,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:21,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:21,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:21,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:21,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:21,195 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-07 00:50:21,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:21,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50978836] [2022-04-07 00:50:21,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50978836] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:21,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:21,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:21,196 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:21,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1098515531] [2022-04-07 00:50:21,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1098515531] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:21,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:21,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:21,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216862794] [2022-04-07 00:50:21,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:21,196 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:21,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:21,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:21,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:21,197 INFO L87 Difference]: Start difference. First operand 928 states and 1255 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:21,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:21,440 INFO L93 Difference]: Finished difference Result 2011 states and 2787 transitions. [2022-04-07 00:50:21,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:21,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 165 [2022-04-07 00:50:21,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:21,444 INFO L225 Difference]: With dead ends: 2011 [2022-04-07 00:50:21,444 INFO L226 Difference]: Without dead ends: 1097 [2022-04-07 00:50:21,446 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:21,446 INFO L913 BasicCegarLoop]: 211 mSDtfsCounter, 238 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 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:21,446 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [238 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:21,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2022-04-07 00:50:21,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1051. [2022-04-07 00:50:21,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1051 states, 1046 states have (on average 1.3365200764818355) internal successors, (1398), 1046 states have internal predecessors, (1398), 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:21,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1402 transitions. [2022-04-07 00:50:21,486 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1402 transitions. Word has length 165 [2022-04-07 00:50:21,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:21,486 INFO L478 AbstractCegarLoop]: Abstraction has 1051 states and 1402 transitions. [2022-04-07 00:50:21,487 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:21,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1402 transitions. [2022-04-07 00:50:21,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-04-07 00:50:21,489 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:21,489 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, 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:21,489 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-07 00:50:21,489 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:21,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:21,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1153497401, now seen corresponding path program 1 times [2022-04-07 00:50:21,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:21,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [266700953] [2022-04-07 00:50:21,495 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-07 00:50:21,495 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:21,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1153497401, now seen corresponding path program 2 times [2022-04-07 00:50:21,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:21,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363778527] [2022-04-07 00:50:21,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:21,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:21,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:21,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:21,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:21,531 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-04-07 00:50:21,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:21,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363778527] [2022-04-07 00:50:21,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363778527] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:21,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:21,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:21,532 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:21,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [266700953] [2022-04-07 00:50:21,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [266700953] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:21,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:21,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:21,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324616084] [2022-04-07 00:50:21,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:21,532 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:21,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:21,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:21,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:21,533 INFO L87 Difference]: Start difference. First operand 1051 states and 1402 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (3), 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:21,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:21,763 INFO L93 Difference]: Finished difference Result 2314 states and 3176 transitions. [2022-04-07 00:50:21,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:21,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (3), 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 178 [2022-04-07 00:50:21,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:21,767 INFO L225 Difference]: With dead ends: 2314 [2022-04-07 00:50:21,767 INFO L226 Difference]: Without dead ends: 1273 [2022-04-07 00:50:21,768 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:21,769 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:21,769 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:21,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1273 states. [2022-04-07 00:50:21,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1273 to 1255. [2022-04-07 00:50:21,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1250 states have (on average 1.3896) internal successors, (1737), 1250 states have internal predecessors, (1737), 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:21,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1741 transitions. [2022-04-07 00:50:21,831 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1741 transitions. Word has length 178 [2022-04-07 00:50:21,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:21,831 INFO L478 AbstractCegarLoop]: Abstraction has 1255 states and 1741 transitions. [2022-04-07 00:50:21,831 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (3), 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:21,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1741 transitions. [2022-04-07 00:50:21,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-04-07 00:50:21,833 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:21,833 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, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:50:21,834 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-07 00:50:21,834 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:21,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:21,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1914069272, now seen corresponding path program 1 times [2022-04-07 00:50:21,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:21,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [325035527] [2022-04-07 00:50:21,848 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-07 00:50:21,848 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:21,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1914069272, now seen corresponding path program 2 times [2022-04-07 00:50:21,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:21,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570615303] [2022-04-07 00:50:21,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:21,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:21,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:21,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:21,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:21,903 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2022-04-07 00:50:21,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:21,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570615303] [2022-04-07 00:50:21,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570615303] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:21,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:21,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:21,904 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:21,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [325035527] [2022-04-07 00:50:21,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [325035527] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:21,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:21,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:21,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687533517] [2022-04-07 00:50:21,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:21,904 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:21,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:21,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:21,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:21,905 INFO L87 Difference]: Start difference. First operand 1255 states and 1741 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:22,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:22,162 INFO L93 Difference]: Finished difference Result 2620 states and 3684 transitions. [2022-04-07 00:50:22,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:22,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 207 [2022-04-07 00:50:22,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:22,166 INFO L225 Difference]: With dead ends: 2620 [2022-04-07 00:50:22,166 INFO L226 Difference]: Without dead ends: 1379 [2022-04-07 00:50:22,169 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:22,169 INFO L913 BasicCegarLoop]: 201 mSDtfsCounter, 220 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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:22,169 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:22,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2022-04-07 00:50:22,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1379. [2022-04-07 00:50:22,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1379 states, 1374 states have (on average 1.3689956331877728) internal successors, (1881), 1374 states have internal predecessors, (1881), 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:22,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1379 states to 1379 states and 1885 transitions. [2022-04-07 00:50:22,246 INFO L78 Accepts]: Start accepts. Automaton has 1379 states and 1885 transitions. Word has length 207 [2022-04-07 00:50:22,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:22,246 INFO L478 AbstractCegarLoop]: Abstraction has 1379 states and 1885 transitions. [2022-04-07 00:50:22,246 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:22,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1379 states and 1885 transitions. [2022-04-07 00:50:22,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2022-04-07 00:50:22,249 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:22,249 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, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:50:22,249 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-07 00:50:22,249 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:22,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:22,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1419518131, now seen corresponding path program 1 times [2022-04-07 00:50:22,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:22,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [930333429] [2022-04-07 00:50:22,256 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-07 00:50:22,256 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:22,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1419518131, now seen corresponding path program 2 times [2022-04-07 00:50:22,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:22,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678519248] [2022-04-07 00:50:22,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:22,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:22,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:22,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:22,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:22,297 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2022-04-07 00:50:22,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:22,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678519248] [2022-04-07 00:50:22,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678519248] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:22,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:22,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:22,298 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:22,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [930333429] [2022-04-07 00:50:22,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [930333429] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:22,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:22,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:22,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577083347] [2022-04-07 00:50:22,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:22,298 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:22,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:22,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:22,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:22,299 INFO L87 Difference]: Start difference. First operand 1379 states and 1885 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 1 states have call successors, (3), 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:22,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:22,583 INFO L93 Difference]: Finished difference Result 2912 states and 4056 transitions. [2022-04-07 00:50:22,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:22,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 235 [2022-04-07 00:50:22,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:22,588 INFO L225 Difference]: With dead ends: 2912 [2022-04-07 00:50:22,588 INFO L226 Difference]: Without dead ends: 1372 [2022-04-07 00:50:22,590 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:22,591 INFO L913 BasicCegarLoop]: 213 mSDtfsCounter, 206 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:22,591 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [206 Valid, 220 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 00:50:22,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2022-04-07 00:50:22,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1372. [2022-04-07 00:50:22,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1372 states, 1367 states have (on average 1.3628383321141184) internal successors, (1863), 1367 states have internal predecessors, (1863), 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:22,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1867 transitions. [2022-04-07 00:50:22,647 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1867 transitions. Word has length 235 [2022-04-07 00:50:22,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:22,647 INFO L478 AbstractCegarLoop]: Abstraction has 1372 states and 1867 transitions. [2022-04-07 00:50:22,647 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 1 states have call successors, (3), 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:22,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1867 transitions. [2022-04-07 00:50:22,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2022-04-07 00:50:22,650 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:22,650 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22,650 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-07 00:50:22,650 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:22,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:22,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1042720464, now seen corresponding path program 1 times [2022-04-07 00:50:22,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:22,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1968810079] [2022-04-07 00:50:24,119 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:24,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1042720464, now seen corresponding path program 2 times [2022-04-07 00:50:24,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:24,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852312748] [2022-04-07 00:50:24,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:24,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:24,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:24,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:24,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:24,189 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2022-04-07 00:50:24,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:24,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852312748] [2022-04-07 00:50:24,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852312748] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:24,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:24,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:24,190 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:24,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1968810079] [2022-04-07 00:50:24,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1968810079] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:24,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:24,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:24,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181969207] [2022-04-07 00:50:24,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:24,191 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:24,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:24,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:24,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:24,191 INFO L87 Difference]: Start difference. First operand 1372 states and 1867 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:24,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:24,526 INFO L93 Difference]: Finished difference Result 3945 states and 5397 transitions. [2022-04-07 00:50:24,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:24,527 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 275 [2022-04-07 00:50:24,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:24,531 INFO L225 Difference]: With dead ends: 3945 [2022-04-07 00:50:24,532 INFO L226 Difference]: Without dead ends: 1651 [2022-04-07 00:50:24,535 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:24,536 INFO L913 BasicCegarLoop]: 370 mSDtfsCounter, 317 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:24,536 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [317 Valid, 377 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 00:50:24,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2022-04-07 00:50:24,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1649. [2022-04-07 00:50:24,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1649 states, 1644 states have (on average 1.3637469586374695) internal successors, (2242), 1644 states have internal predecessors, (2242), 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:24,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2246 transitions. [2022-04-07 00:50:24,599 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2246 transitions. Word has length 275 [2022-04-07 00:50:24,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:24,599 INFO L478 AbstractCegarLoop]: Abstraction has 1649 states and 2246 transitions. [2022-04-07 00:50:24,599 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:24,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2246 transitions. [2022-04-07 00:50:24,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2022-04-07 00:50:24,602 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:24,603 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:50:24,603 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-07 00:50:24,603 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:24,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:24,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1080683744, now seen corresponding path program 1 times [2022-04-07 00:50:24,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:24,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2046665991] [2022-04-07 00:50:26,191 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:26,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1080683744, now seen corresponding path program 2 times [2022-04-07 00:50:26,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:26,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045261208] [2022-04-07 00:50:26,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:26,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:26,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:26,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:26,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:26,238 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 564 trivial. 0 not checked. [2022-04-07 00:50:26,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:26,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045261208] [2022-04-07 00:50:26,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045261208] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:26,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:26,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:26,238 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:26,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2046665991] [2022-04-07 00:50:26,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2046665991] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:26,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:26,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:26,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537678893] [2022-04-07 00:50:26,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:26,239 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:26,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:26,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:26,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:26,240 INFO L87 Difference]: Start difference. First operand 1649 states and 2246 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (3), 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,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:26,503 INFO L93 Difference]: Finished difference Result 4884 states and 6637 transitions. [2022-04-07 00:50:26,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:26,503 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (3), 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 322 [2022-04-07 00:50:26,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:26,513 INFO L225 Difference]: With dead ends: 4884 [2022-04-07 00:50:26,514 INFO L226 Difference]: Without dead ends: 3249 [2022-04-07 00:50:26,518 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,518 INFO L913 BasicCegarLoop]: 354 mSDtfsCounter, 369 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:26,518 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [369 Valid, 361 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 00:50:26,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3249 states. [2022-04-07 00:50:26,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3249 to 1654. [2022-04-07 00:50:26,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1654 states, 1649 states have (on average 1.3626440266828381) internal successors, (2247), 1649 states have internal predecessors, (2247), 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,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 2251 transitions. [2022-04-07 00:50:26,630 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 2251 transitions. Word has length 322 [2022-04-07 00:50:26,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:26,630 INFO L478 AbstractCegarLoop]: Abstraction has 1654 states and 2251 transitions. [2022-04-07 00:50:26,630 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (3), 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,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 2251 transitions. [2022-04-07 00:50:26,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2022-04-07 00:50:26,633 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:26,634 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:50:26,634 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-07 00:50:26,634 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:26,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:26,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1831267137, now seen corresponding path program 1 times [2022-04-07 00:50:26,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:26,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1847811224] [2022-04-07 00:50:28,290 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:28,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1831267137, now seen corresponding path program 2 times [2022-04-07 00:50:28,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:28,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922610903] [2022-04-07 00:50:28,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:28,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:28,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:28,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:28,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:28,331 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 500 proven. 0 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2022-04-07 00:50:28,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:28,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922610903] [2022-04-07 00:50:28,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922610903] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:28,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:28,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:28,332 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:28,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1847811224] [2022-04-07 00:50:28,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1847811224] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:28,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:28,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:28,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800512075] [2022-04-07 00:50:28,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:28,333 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:28,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:28,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:28,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:28,333 INFO L87 Difference]: Start difference. First operand 1654 states and 2251 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (3), 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,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:28,598 INFO L93 Difference]: Finished difference Result 3469 states and 4779 transitions. [2022-04-07 00:50:28,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:28,599 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (3), 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 322 [2022-04-07 00:50:28,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:28,604 INFO L225 Difference]: With dead ends: 3469 [2022-04-07 00:50:28,605 INFO L226 Difference]: Without dead ends: 1829 [2022-04-07 00:50:28,608 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,608 INFO L913 BasicCegarLoop]: 210 mSDtfsCounter, 224 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:28,608 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 217 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 00:50:28,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2022-04-07 00:50:28,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1789. [2022-04-07 00:50:28,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1789 states, 1784 states have (on average 1.3492152466367713) internal successors, (2407), 1784 states have internal predecessors, (2407), 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,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1789 states and 2411 transitions. [2022-04-07 00:50:28,748 INFO L78 Accepts]: Start accepts. Automaton has 1789 states and 2411 transitions. Word has length 322 [2022-04-07 00:50:28,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:28,748 INFO L478 AbstractCegarLoop]: Abstraction has 1789 states and 2411 transitions. [2022-04-07 00:50:28,749 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (3), 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,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 2411 transitions. [2022-04-07 00:50:28,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2022-04-07 00:50:28,753 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:28,753 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:50:28,753 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-07 00:50:28,753 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:28,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:28,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1509386323, now seen corresponding path program 1 times [2022-04-07 00:50:28,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:28,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [431102338] [2022-04-07 00:50:30,370 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:30,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1509386323, now seen corresponding path program 2 times [2022-04-07 00:50:30,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:30,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174402915] [2022-04-07 00:50:30,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:30,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:30,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:30,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:30,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:30,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1151 backedges. 642 proven. 0 refuted. 0 times theorem prover too weak. 509 trivial. 0 not checked. [2022-04-07 00:50:30,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:30,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174402915] [2022-04-07 00:50:30,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174402915] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:30,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:30,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:30,464 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:30,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [431102338] [2022-04-07 00:50:30,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [431102338] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:30,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:30,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:30,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522482527] [2022-04-07 00:50:30,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:30,465 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:30,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:30,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:30,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:30,466 INFO L87 Difference]: Start difference. First operand 1789 states and 2411 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:30,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:30,743 INFO L93 Difference]: Finished difference Result 3719 states and 5064 transitions. [2022-04-07 00:50:30,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:30,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 345 [2022-04-07 00:50:30,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:30,751 INFO L225 Difference]: With dead ends: 3719 [2022-04-07 00:50:30,751 INFO L226 Difference]: Without dead ends: 1944 [2022-04-07 00:50:30,755 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,756 INFO L913 BasicCegarLoop]: 210 mSDtfsCounter, 205 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:30,756 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 217 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 00:50:30,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1944 states. [2022-04-07 00:50:30,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1944 to 1934. [2022-04-07 00:50:30,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1934 states, 1929 states have (on average 1.3359253499222394) internal successors, (2577), 1929 states have internal predecessors, (2577), 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,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1934 states and 2581 transitions. [2022-04-07 00:50:30,869 INFO L78 Accepts]: Start accepts. Automaton has 1934 states and 2581 transitions. Word has length 345 [2022-04-07 00:50:30,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:30,870 INFO L478 AbstractCegarLoop]: Abstraction has 1934 states and 2581 transitions. [2022-04-07 00:50:30,870 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:30,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1934 states and 2581 transitions. [2022-04-07 00:50:30,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2022-04-07 00:50:30,874 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:30,874 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,874 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-07 00:50:30,875 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:30,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:30,875 INFO L85 PathProgramCache]: Analyzing trace with hash -2037735355, now seen corresponding path program 1 times [2022-04-07 00:50:30,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:30,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [958977358] [2022-04-07 00:50:32,642 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:32,643 INFO L85 PathProgramCache]: Analyzing trace with hash -2037735355, now seen corresponding path program 2 times [2022-04-07 00:50:32,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:32,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226558720] [2022-04-07 00:50:32,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:32,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:32,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:32,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:32,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:32,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2022-04-07 00:50:32,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:32,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226558720] [2022-04-07 00:50:32,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226558720] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 00:50:32,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054603024] [2022-04-07 00:50:32,733 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 00:50:32,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 00:50:32,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 00:50:32,740 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:32,743 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:32,857 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 00:50:32,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 00:50:32,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-07 00:50:32,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 00:50:33,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2022-04-07 00:50:33,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 00:50:33,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2022-04-07 00:50:33,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054603024] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 00:50:33,787 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 00:50:33,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-04-07 00:50:33,787 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:33,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [958977358] [2022-04-07 00:50:33,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [958977358] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:33,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:33,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 00:50:33,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633402985] [2022-04-07 00:50:33,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:33,788 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 00:50:33,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:33,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 00:50:33,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-07 00:50:33,789 INFO L87 Difference]: Start difference. First operand 1934 states and 2581 transitions. Second operand has 5 states, 5 states have (on average 36.0) internal successors, (180), 4 states have internal predecessors, (180), 1 states have call successors, (3), 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:34,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:34,380 INFO L93 Difference]: Finished difference Result 5018 states and 6809 transitions. [2022-04-07 00:50:34,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 00:50:34,381 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 36.0) internal successors, (180), 4 states have internal predecessors, (180), 1 states have call successors, (3), 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 378 [2022-04-07 00:50:34,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:34,389 INFO L225 Difference]: With dead ends: 5018 [2022-04-07 00:50:34,389 INFO L226 Difference]: Without dead ends: 2973 [2022-04-07 00:50:34,392 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 767 GetRequests, 759 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:34,392 INFO L913 BasicCegarLoop]: 309 mSDtfsCounter, 499 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:34,392 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [499 Valid, 321 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-07 00:50:34,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2973 states. [2022-04-07 00:50:34,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2973 to 2146. [2022-04-07 00:50:34,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2146 states, 2141 states have (on average 1.3549743110695935) internal successors, (2901), 2141 states have internal predecessors, (2901), 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:34,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 2146 states and 2905 transitions. [2022-04-07 00:50:34,513 INFO L78 Accepts]: Start accepts. Automaton has 2146 states and 2905 transitions. Word has length 378 [2022-04-07 00:50:34,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:34,513 INFO L478 AbstractCegarLoop]: Abstraction has 2146 states and 2905 transitions. [2022-04-07 00:50:34,513 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.0) internal successors, (180), 4 states have internal predecessors, (180), 1 states have call successors, (3), 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:34,514 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 2905 transitions. [2022-04-07 00:50:34,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2022-04-07 00:50:34,517 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:34,517 INFO L499 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 7, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1] [2022-04-07 00:50:34,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-07 00:50:34,731 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,SelfDestructingSolverStorable16 [2022-04-07 00:50:34,732 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:34,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:34,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1749073497, now seen corresponding path program 1 times [2022-04-07 00:50:34,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:34,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1196759823] [2022-04-07 00:50:36,832 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:36,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1749073497, now seen corresponding path program 2 times [2022-04-07 00:50:36,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:36,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458393589] [2022-04-07 00:50:36,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:36,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:36,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:36,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1975 backedges. 1154 proven. 0 refuted. 0 times theorem prover too weak. 821 trivial. 0 not checked. [2022-04-07 00:50:36,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:36,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458393589] [2022-04-07 00:50:36,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458393589] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:36,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:36,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:36,898 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:36,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1196759823] [2022-04-07 00:50:36,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1196759823] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:36,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:36,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:36,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640726691] [2022-04-07 00:50:36,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:36,899 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:36,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:36,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:36,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:36,899 INFO L87 Difference]: Start difference. First operand 2146 states and 2905 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:50:37,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:37,254 INFO L93 Difference]: Finished difference Result 4530 states and 6226 transitions. [2022-04-07 00:50:37,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:37,255 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 440 [2022-04-07 00:50:37,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:37,262 INFO L225 Difference]: With dead ends: 4530 [2022-04-07 00:50:37,262 INFO L226 Difference]: Without dead ends: 2398 [2022-04-07 00:50:37,267 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:50:37,268 INFO L913 BasicCegarLoop]: 210 mSDtfsCounter, 205 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:37,269 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 217 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 00:50:37,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2398 states. [2022-04-07 00:50:37,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2398 to 2384. [2022-04-07 00:50:37,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2384 states, 2379 states have (on average 1.334174022698613) internal successors, (3174), 2379 states have internal predecessors, (3174), 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,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2384 states to 2384 states and 3178 transitions. [2022-04-07 00:50:37,410 INFO L78 Accepts]: Start accepts. Automaton has 2384 states and 3178 transitions. Word has length 440 [2022-04-07 00:50:37,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:37,410 INFO L478 AbstractCegarLoop]: Abstraction has 2384 states and 3178 transitions. [2022-04-07 00:50:37,410 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:50:37,411 INFO L276 IsEmpty]: Start isEmpty. Operand 2384 states and 3178 transitions. [2022-04-07 00:50:37,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2022-04-07 00:50:37,414 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:37,414 INFO L499 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 11, 11, 9, 7, 7, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:50:37,414 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-07 00:50:37,414 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:37,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:37,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1688744379, now seen corresponding path program 1 times [2022-04-07 00:50:37,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:37,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2105288290] [2022-04-07 00:50:39,593 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:39,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1688744379, now seen corresponding path program 2 times [2022-04-07 00:50:39,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:39,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18561171] [2022-04-07 00:50:39,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:39,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:39,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:39,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:39,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:39,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2682 backedges. 1560 proven. 0 refuted. 0 times theorem prover too weak. 1122 trivial. 0 not checked. [2022-04-07 00:50:39,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:39,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18561171] [2022-04-07 00:50:39,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18561171] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:39,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:39,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:39,652 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:39,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2105288290] [2022-04-07 00:50:39,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2105288290] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:39,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:39,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:39,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448517337] [2022-04-07 00:50:39,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:39,652 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:39,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:39,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:39,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:39,653 INFO L87 Difference]: Start difference. First operand 2384 states and 3178 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:50:40,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:40,087 INFO L93 Difference]: Finished difference Result 5020 states and 6800 transitions. [2022-04-07 00:50:40,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:40,087 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 502 [2022-04-07 00:50:40,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:40,098 INFO L225 Difference]: With dead ends: 5020 [2022-04-07 00:50:40,098 INFO L226 Difference]: Without dead ends: 2650 [2022-04-07 00:50:40,102 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:40,103 INFO L913 BasicCegarLoop]: 210 mSDtfsCounter, 205 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:40,103 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 217 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 00:50:40,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2022-04-07 00:50:40,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2636. [2022-04-07 00:50:40,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2636 states, 2631 states have (on average 1.315469403268719) internal successors, (3461), 2631 states have internal predecessors, (3461), 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:40,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2636 states to 2636 states and 3465 transitions. [2022-04-07 00:50:40,262 INFO L78 Accepts]: Start accepts. Automaton has 2636 states and 3465 transitions. Word has length 502 [2022-04-07 00:50:40,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:40,262 INFO L478 AbstractCegarLoop]: Abstraction has 2636 states and 3465 transitions. [2022-04-07 00:50:40,263 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:50:40,263 INFO L276 IsEmpty]: Start isEmpty. Operand 2636 states and 3465 transitions. [2022-04-07 00:50:40,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2022-04-07 00:50:40,267 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:40,267 INFO L499 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 11, 9, 9, 7, 7, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,267 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-07 00:50:40,267 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:40,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:40,267 INFO L85 PathProgramCache]: Analyzing trace with hash -964789639, now seen corresponding path program 1 times [2022-04-07 00:50:40,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:40,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1586244645] [2022-04-07 00:50:42,532 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:42,532 INFO L85 PathProgramCache]: Analyzing trace with hash -964789639, now seen corresponding path program 2 times [2022-04-07 00:50:42,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:42,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383115494] [2022-04-07 00:50:42,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:42,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:42,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:42,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:42,599 INFO L134 CoverageAnalysis]: Checked inductivity of 3527 backedges. 2038 proven. 0 refuted. 0 times theorem prover too weak. 1489 trivial. 0 not checked. [2022-04-07 00:50:42,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:42,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383115494] [2022-04-07 00:50:42,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383115494] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:42,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:42,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:42,600 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:42,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1586244645] [2022-04-07 00:50:42,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1586244645] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:42,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:42,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:42,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966852251] [2022-04-07 00:50:42,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:42,600 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:42,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:42,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:42,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:42,601 INFO L87 Difference]: Start difference. First operand 2636 states and 3465 transitions. Second operand has 4 states, 4 states have (on average 46.0) internal successors, (184), 3 states have internal predecessors, (184), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:43,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:43,115 INFO L93 Difference]: Finished difference Result 5238 states and 6878 transitions. [2022-04-07 00:50:43,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:43,116 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.0) internal successors, (184), 3 states have internal predecessors, (184), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 568 [2022-04-07 00:50:43,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:43,128 INFO L225 Difference]: With dead ends: 5238 [2022-04-07 00:50:43,128 INFO L226 Difference]: Without dead ends: 2391 [2022-04-07 00:50:43,133 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:50:43,134 INFO L913 BasicCegarLoop]: 210 mSDtfsCounter, 210 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:43,134 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [210 Valid, 217 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 00:50:43,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2391 states. [2022-04-07 00:50:43,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2391 to 2275. [2022-04-07 00:50:43,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2275 states, 2270 states have (on average 1.2612334801762115) internal successors, (2863), 2270 states have internal predecessors, (2863), 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,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2275 states to 2275 states and 2867 transitions. [2022-04-07 00:50:43,276 INFO L78 Accepts]: Start accepts. Automaton has 2275 states and 2867 transitions. Word has length 568 [2022-04-07 00:50:43,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:43,276 INFO L478 AbstractCegarLoop]: Abstraction has 2275 states and 2867 transitions. [2022-04-07 00:50:43,276 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.0) internal successors, (184), 3 states have internal predecessors, (184), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:50:43,276 INFO L276 IsEmpty]: Start isEmpty. Operand 2275 states and 2867 transitions. [2022-04-07 00:50:43,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 607 [2022-04-07 00:50:43,281 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:43,281 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, 1] [2022-04-07 00:50:43,281 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-07 00:50:43,281 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:43,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:43,281 INFO L85 PathProgramCache]: Analyzing trace with hash 2093760971, now seen corresponding path program 1 times [2022-04-07 00:50:43,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:43,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [966627212] [2022-04-07 00:50:45,812 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:45,812 INFO L85 PathProgramCache]: Analyzing trace with hash 2093760971, now seen corresponding path program 2 times [2022-04-07 00:50:45,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:45,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604406843] [2022-04-07 00:50:45,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:45,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:45,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:45,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:45,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:45,896 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2022-04-07 00:50:45,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:45,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604406843] [2022-04-07 00:50:45,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604406843] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 00:50:45,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827807324] [2022-04-07 00:50:45,897 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 00:50:45,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 00:50:45,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 00:50:45,898 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:45,899 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:46,040 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 00:50:46,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 00:50:46,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 995 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-07 00:50:46,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 00:50:46,667 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2022-04-07 00:50:46,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 00:50:47,284 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2022-04-07 00:50:47,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827807324] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 00:50:47,284 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 00:50:47,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-04-07 00:50:47,285 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:47,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [966627212] [2022-04-07 00:50:47,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [966627212] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:47,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:47,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 00:50:47,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734077117] [2022-04-07 00:50:47,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:47,286 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 00:50:47,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:47,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 00:50:47,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-07 00:50:47,287 INFO L87 Difference]: Start difference. First operand 2275 states and 2867 transitions. Second operand has 5 states, 5 states have (on average 44.2) internal successors, (221), 4 states have internal predecessors, (221), 1 states have call successors, (3), 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:47,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:47,633 INFO L93 Difference]: Finished difference Result 3313 states and 4155 transitions. [2022-04-07 00:50:47,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 00:50:47,634 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.2) internal successors, (221), 4 states have internal predecessors, (221), 1 states have call successors, (3), 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 606 [2022-04-07 00:50:47,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:47,634 INFO L225 Difference]: With dead ends: 3313 [2022-04-07 00:50:47,634 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 00:50:47,640 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 1221 GetRequests, 1212 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:50:47,640 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.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:47,641 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.2s Time] [2022-04-07 00:50:47,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 00:50:47,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 00:50:47,641 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:50:47,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 00:50:47,641 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 606 [2022-04-07 00:50:47,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:47,641 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 00:50:47,641 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.2) internal successors, (221), 4 states have internal predecessors, (221), 1 states have call successors, (3), 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:47,641 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 00:50:47,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 00:50:47,643 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 00:50:47,663 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:47,859 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,SelfDestructingSolverStorable20 [2022-04-07 00:50:47,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-07 00:51:11,159 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 13) no Hoare annotation was computed. [2022-04-07 00:51:11,160 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 13) no Hoare annotation was computed. [2022-04-07 00:51:11,160 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 13) no Hoare annotation was computed. [2022-04-07 00:51:11,160 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 622 633) the Hoare annotation is: true [2022-04-07 00:51:11,160 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 622 633) the Hoare annotation is: true [2022-04-07 00:51:11,160 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 622 633) the Hoare annotation is: true [2022-04-07 00:51:11,160 INFO L885 garLoopResultBuilder]: At program point L629(line 629) the Hoare annotation is: true [2022-04-07 00:51:11,160 INFO L885 garLoopResultBuilder]: At program point L629-1(line 629) the Hoare annotation is: true [2022-04-07 00:51:11,160 INFO L878 garLoopResultBuilder]: At program point L399(lines 399 417) the Hoare annotation is: (let ((.cse1 (<= ssl3_accept_~s__state~0 8576)) (.cse2 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse3 (not (= ssl3_accept_~s__hit~0 0))) (.cse4 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_accept_~blastFlag~0)) (and .cse2 .cse3 .cse4) (and .cse0 .cse3 .cse4))) [2022-04-07 00:51:11,160 INFO L878 garLoopResultBuilder]: At program point L201(lines 197 561) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8672))) (or (and (not (= ssl3_accept_~s__hit~0 0)) .cse0) (and (= ssl3_accept_~s__state~0 8640) (= 2 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and (= ssl3_accept_~blastFlag~0 0) .cse0))) [2022-04-07 00:51:11,160 INFO L878 garLoopResultBuilder]: At program point L168(lines 164 572) the Hoare annotation is: (let ((.cse1 (<= ssl3_accept_~s__state~0 8576)) (.cse2 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse3 (not (= ssl3_accept_~s__hit~0 0))) (.cse4 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_accept_~blastFlag~0)) (and .cse2 .cse3 .cse4) (and .cse0 .cse3 .cse4))) [2022-04-07 00:51:11,160 INFO L878 garLoopResultBuilder]: At program point L135(lines 134 582) the Hoare annotation is: (<= ssl3_accept_~s__state~0 8672) [2022-04-07 00:51:11,160 INFO L878 garLoopResultBuilder]: At program point L102(lines 102 104) the Hoare annotation is: (= ssl3_accept_~blastFlag~0 0) [2022-04-07 00:51:11,160 INFO L878 garLoopResultBuilder]: At program point L400(lines 400 406) the Hoare annotation is: (let ((.cse1 (<= ssl3_accept_~s__state~0 8576)) (.cse2 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse3 (not (= ssl3_accept_~s__hit~0 0))) (.cse4 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_accept_~blastFlag~0)) (and .cse2 .cse3 .cse4) (and .cse0 .cse3 .cse4))) [2022-04-07 00:51:11,161 INFO L878 garLoopResultBuilder]: At program point L599(lines 599 603) the Hoare annotation is: (let ((.cse5 (= ssl3_accept_~s__state~0 8592)) (.cse6 (= 3 ssl3_accept_~blastFlag~0)) (.cse3 (= 2 ssl3_accept_~blastFlag~0)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (= ssl3_accept_~s__state~0 8608)) (.cse7 (= ssl3_accept_~s__state~0 8640)) (.cse0 (not (= ssl3_accept_~s__hit~0 0))) (.cse1 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 .cse2) (and (<= ssl3_accept_~s__state~0 8576) .cse3 .cse4) (and .cse0 .cse5 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse3 (= ssl3_accept_~s__state~0 8512)) (and .cse3 .cse1 (= 8560 ssl3_accept_~s__state~0)) (and .cse3 .cse4 .cse5 .cse1) (and (= ssl3_accept_~blastFlag~0 1) (= 8496 ssl3_accept_~s__state~0)) (and .cse3 (= ssl3_accept_~s__state~0 8528)) (and .cse0 .cse6) (and .cse4 .cse1 (<= 8672 ssl3_accept_~s__state~0) .cse6) (and .cse7 .cse3 .cse4 .cse1) (and (= ssl3_accept_~s__state~0 8544) .cse3 .cse1) (and (= ssl3_accept_~s__state~0 8656) .cse3 .cse4) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse6) (= ssl3_accept_~s__state~0 3) (and .cse3 .cse0) (and .cse3 .cse4 .cse1 .cse2) (and .cse7 .cse0 .cse1))) [2022-04-07 00:51:11,161 INFO L878 garLoopResultBuilder]: At program point L203(lines 203 559) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576)) (.cse3 (= 3 ssl3_accept_~blastFlag~0)) (.cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse4 (= 2 ssl3_accept_~blastFlag~0)) (.cse2 (not (= ssl3_accept_~s__hit~0 0)))) (or (= ssl3_accept_~blastFlag~0 0) (and .cse0 .cse1) (and .cse0 .cse2) (and .cse2 .cse3) (and .cse1 (<= ssl3_accept_~s__state~0 8672) (<= 8672 ssl3_accept_~s__state~0) .cse3) (and (= ssl3_accept_~s__state~0 8656) .cse4 .cse1) (= ssl3_accept_~s__state~0 3) (and .cse4 .cse2))) [2022-04-07 00:51:11,161 INFO L878 garLoopResultBuilder]: At program point L170(lines 170 570) the Hoare annotation is: (let ((.cse5 (= ssl3_accept_~s__state~0 8592)) (.cse6 (= 3 ssl3_accept_~blastFlag~0)) (.cse3 (= 2 ssl3_accept_~blastFlag~0)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (= ssl3_accept_~s__state~0 8608)) (.cse7 (= ssl3_accept_~s__state~0 8640)) (.cse0 (not (= ssl3_accept_~s__hit~0 0))) (.cse1 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 .cse2) (and (<= ssl3_accept_~s__state~0 8576) .cse3 .cse4) (and .cse0 .cse5 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse3 .cse1 (= 8560 ssl3_accept_~s__state~0)) (and .cse3 .cse4 .cse5 .cse1) (and .cse0 .cse6) (and .cse4 .cse1 (<= 8672 ssl3_accept_~s__state~0) .cse6) (and .cse7 .cse3 .cse4 .cse1) (and (= ssl3_accept_~s__state~0 8656) .cse3 .cse4) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse6) (= ssl3_accept_~s__state~0 3) (and .cse3 .cse0) (and .cse3 .cse4 .cse1 .cse2) (and .cse7 .cse0 .cse1))) [2022-04-07 00:51:11,161 INFO L878 garLoopResultBuilder]: At program point L137(lines 137 581) the Hoare annotation is: (let ((.cse5 (= ssl3_accept_~s__state~0 8592)) (.cse6 (= 3 ssl3_accept_~blastFlag~0)) (.cse3 (= 2 ssl3_accept_~blastFlag~0)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (= ssl3_accept_~s__state~0 8608)) (.cse7 (= ssl3_accept_~s__state~0 8640)) (.cse0 (not (= ssl3_accept_~s__hit~0 0))) (.cse1 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 .cse2) (and (<= ssl3_accept_~s__state~0 8576) .cse3 .cse4) (and .cse0 .cse5 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse3 (= ssl3_accept_~s__state~0 8512)) (and .cse3 .cse1 (= 8560 ssl3_accept_~s__state~0)) (and .cse3 .cse4 .cse5 .cse1) (and (= ssl3_accept_~blastFlag~0 1) (= 8496 ssl3_accept_~s__state~0)) (and .cse3 (= ssl3_accept_~s__state~0 8528)) (and .cse0 .cse6) (and .cse4 .cse1 (<= 8672 ssl3_accept_~s__state~0) .cse6) (and .cse7 .cse3 .cse4 .cse1) (and (= ssl3_accept_~s__state~0 8544) .cse3 .cse1) (and (= ssl3_accept_~s__state~0 8656) .cse3 .cse4) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse6) (= ssl3_accept_~s__state~0 3) (and .cse3 .cse0) (and .cse3 .cse4 .cse1 .cse2) (and .cse7 .cse0 .cse1))) [2022-04-07 00:51:11,161 INFO L878 garLoopResultBuilder]: At program point L468(lines 468 470) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8672))) (or (and (not (= ssl3_accept_~s__hit~0 0)) .cse0) (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and (= 2 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0))) [2022-04-07 00:51:11,161 INFO L878 garLoopResultBuilder]: At program point L270(lines 270 272) the Hoare annotation is: (let ((.cse1 (<= ssl3_accept_~s__state~0 8576)) (.cse2 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse3 (not (= ssl3_accept_~s__hit~0 0))) (.cse4 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1) (and .cse1 .cse2 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and .cse3 .cse4 (= 3 ssl3_accept_~blastFlag~0)) (and .cse2 .cse3 .cse4) (and .cse0 .cse3 .cse4))) [2022-04-07 00:51:11,161 INFO L878 garLoopResultBuilder]: At program point L237(lines 237 248) the Hoare annotation is: (let ((.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse1 (not (= ssl3_accept_~s__hit~0 0)))) (or (and (<= ssl3_accept_~s__state~0 8576) .cse0 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (= ssl3_accept_~blastFlag~0 0) (and .cse1 (= 3 ssl3_accept_~blastFlag~0)) (and .cse0 .cse1))) [2022-04-07 00:51:11,161 INFO L878 garLoopResultBuilder]: At program point L237-2(lines 219 552) the Hoare annotation is: (let ((.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse1 (not (= ssl3_accept_~s__hit~0 0)))) (or (and (<= ssl3_accept_~s__state~0 8576) .cse0 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (= ssl3_accept_~blastFlag~0 0) (and .cse1 (= 3 ssl3_accept_~blastFlag~0)) (and .cse0 .cse1))) [2022-04-07 00:51:11,161 INFO L878 garLoopResultBuilder]: At program point L502(lines 502 505) the Hoare annotation is: (let ((.cse1 (not (= ssl3_accept_~s__hit~0 0))) (.cse2 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (<= ssl3_accept_~s__state~0 8672))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and .cse1 .cse0 (= 3 ssl3_accept_~blastFlag~0)) (and .cse2 .cse1 .cse0) (and .cse2 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0))) [2022-04-07 00:51:11,161 INFO L878 garLoopResultBuilder]: At program point L304(lines 304 308) the Hoare annotation is: (let ((.cse1 (<= ssl3_accept_~s__state~0 8576)) (.cse2 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse3 (not (= ssl3_accept_~s__hit~0 0))) (.cse4 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_accept_~blastFlag~0)) (and .cse2 .cse3 .cse4) (and .cse0 .cse3 .cse4))) [2022-04-07 00:51:11,161 INFO L878 garLoopResultBuilder]: At program point L304-2(lines 304 308) the Hoare annotation is: (let ((.cse3 (= 2 ssl3_accept_~blastFlag~0)) (.cse1 (= ssl3_accept_~s__state~0 8656)) (.cse2 (not (= ssl3_accept_~s__hit~0 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) (and .cse1 .cse2 (= 3 ssl3_accept_~blastFlag~0)) (and .cse0 .cse4))) [2022-04-07 00:51:11,161 INFO L878 garLoopResultBuilder]: At program point L437-1(lines 437 445) the Hoare annotation is: (let ((.cse1 (= 2 ssl3_accept_~blastFlag~0)) (.cse2 (not (= ssl3_accept_~s__hit~0 0))) (.cse0 (= 8448 ssl3_accept_~s__state~0)) (.cse3 (= 3 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and .cse0 .cse2 .cse3) (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and .cse0 (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse3))) [2022-04-07 00:51:11,161 INFO L878 garLoopResultBuilder]: At program point L239(lines 239 242) the Hoare annotation is: (let ((.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse1 (not (= ssl3_accept_~s__hit~0 0)))) (or (and (<= ssl3_accept_~s__state~0 8576) .cse0 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (= ssl3_accept_~blastFlag~0 0) (and .cse1 (= 3 ssl3_accept_~blastFlag~0)) (and .cse0 .cse1))) [2022-04-07 00:51:11,161 INFO L878 garLoopResultBuilder]: At program point L206(lines 206 558) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576)) (.cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse3 (= 3 ssl3_accept_~blastFlag~0)) (.cse2 (not (= ssl3_accept_~s__hit~0 0)))) (or (= ssl3_accept_~blastFlag~0 0) (and .cse0 .cse1) (and .cse0 .cse2) (and .cse2 .cse3) (and .cse1 (<= ssl3_accept_~s__state~0 8672) (<= 8672 ssl3_accept_~s__state~0) .cse3) (= ssl3_accept_~s__state~0 3) (and (= 2 ssl3_accept_~blastFlag~0) .cse2))) [2022-04-07 00:51:11,162 INFO L878 garLoopResultBuilder]: At program point L173(lines 173 569) the Hoare annotation is: (let ((.cse5 (= ssl3_accept_~s__state~0 8592)) (.cse6 (= 3 ssl3_accept_~blastFlag~0)) (.cse3 (= 2 ssl3_accept_~blastFlag~0)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (= ssl3_accept_~s__state~0 8608)) (.cse7 (= ssl3_accept_~s__state~0 8640)) (.cse0 (not (= ssl3_accept_~s__hit~0 0))) (.cse1 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 .cse2) (and (<= ssl3_accept_~s__state~0 8576) .cse3 .cse4) (and .cse0 .cse5 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse3 .cse4 .cse5 .cse1) (and .cse0 .cse6) (and .cse4 .cse1 (<= 8672 ssl3_accept_~s__state~0) .cse6) (and .cse7 .cse3 .cse4 .cse1) (and (= ssl3_accept_~s__state~0 8656) .cse3 .cse4) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse6) (= ssl3_accept_~s__state~0 3) (and .cse3 .cse0) (and .cse3 .cse4 .cse1 .cse2) (and .cse7 .cse0 .cse1))) [2022-04-07 00:51:11,162 INFO L878 garLoopResultBuilder]: At program point L140(lines 140 580) the Hoare annotation is: (let ((.cse5 (= ssl3_accept_~s__state~0 8592)) (.cse6 (= 3 ssl3_accept_~blastFlag~0)) (.cse3 (= 2 ssl3_accept_~blastFlag~0)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (= ssl3_accept_~s__state~0 8608)) (.cse7 (= ssl3_accept_~s__state~0 8640)) (.cse0 (not (= ssl3_accept_~s__hit~0 0))) (.cse1 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 .cse2) (and (<= ssl3_accept_~s__state~0 8576) .cse3 .cse4) (and .cse0 .cse5 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse3 (= ssl3_accept_~s__state~0 8512)) (and .cse3 .cse1 (= 8560 ssl3_accept_~s__state~0)) (and .cse3 .cse4 .cse5 .cse1) (and (= ssl3_accept_~blastFlag~0 1) (= 8496 ssl3_accept_~s__state~0)) (and .cse3 (= ssl3_accept_~s__state~0 8528)) (and .cse0 .cse6) (and .cse4 .cse1 (<= 8672 ssl3_accept_~s__state~0) .cse6) (and .cse7 .cse3 .cse4 .cse1) (and (= ssl3_accept_~s__state~0 8544) .cse3 .cse1) (and (= ssl3_accept_~s__state~0 8656) .cse3 .cse4) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse6) (= ssl3_accept_~s__state~0 3) (and .cse3 .cse0) (and .cse3 .cse4 .cse1 .cse2) (and .cse7 .cse0 .cse1))) [2022-04-07 00:51:11,162 INFO L878 garLoopResultBuilder]: At program point L207(lines 203 559) the Hoare annotation is: (let ((.cse1 (not (= ssl3_accept_~s__hit~0 0))) (.cse2 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (<= ssl3_accept_~s__state~0 8672))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and .cse1 .cse0 (= 3 ssl3_accept_~blastFlag~0)) (and .cse2 .cse1 .cse0) (and .cse2 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0))) [2022-04-07 00:51:11,162 INFO L878 garLoopResultBuilder]: At program point L174(lines 170 570) the Hoare annotation is: (let ((.cse1 (<= ssl3_accept_~s__state~0 8576)) (.cse2 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse3 (not (= ssl3_accept_~s__hit~0 0))) (.cse4 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_accept_~blastFlag~0)) (and .cse2 .cse3 .cse4) (and .cse0 .cse3 .cse4))) [2022-04-07 00:51:11,162 INFO L885 garLoopResultBuilder]: At program point ssl3_acceptENTRY(lines 22 621) the Hoare annotation is: true [2022-04-07 00:51:11,162 INFO L878 garLoopResultBuilder]: At program point L440(lines 440 443) the Hoare annotation is: (let ((.cse1 (= 2 ssl3_accept_~blastFlag~0)) (.cse2 (not (= ssl3_accept_~s__hit~0 0))) (.cse0 (= 8448 ssl3_accept_~s__state~0)) (.cse3 (= 3 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and .cse0 .cse2 .cse3) (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and .cse0 (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse3))) [2022-04-07 00:51:11,162 INFO L878 garLoopResultBuilder]: At program point L341(lines 341 379) the Hoare annotation is: (let ((.cse1 (<= ssl3_accept_~s__state~0 8576)) (.cse2 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse3 (not (= ssl3_accept_~s__hit~0 0))) (.cse4 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_accept_~blastFlag~0)) (and .cse2 .cse3 .cse4) (and .cse0 .cse3 .cse4))) [2022-04-07 00:51:11,162 INFO L878 garLoopResultBuilder]: At program point L209(lines 209 557) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (<= ssl3_accept_~s__state~0 8576)) (.cse1 (= 3 ssl3_accept_~blastFlag~0)) (.cse3 (not (= ssl3_accept_~s__hit~0 0)))) (or (and .cse0 (<= ssl3_accept_~s__state~0 8672) .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse2 .cse0) (and .cse2 .cse3) (and .cse3 .cse1) (= ssl3_accept_~s__state~0 3) (and (= 2 ssl3_accept_~blastFlag~0) .cse3))) [2022-04-07 00:51:11,162 INFO L878 garLoopResultBuilder]: At program point L176(lines 176 568) the Hoare annotation is: (let ((.cse5 (= ssl3_accept_~s__state~0 8592)) (.cse6 (= 3 ssl3_accept_~blastFlag~0)) (.cse3 (= 2 ssl3_accept_~blastFlag~0)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (= ssl3_accept_~s__state~0 8608)) (.cse7 (= ssl3_accept_~s__state~0 8640)) (.cse0 (not (= ssl3_accept_~s__hit~0 0))) (.cse1 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 .cse2) (and (<= ssl3_accept_~s__state~0 8576) .cse3 .cse4) (and .cse0 .cse5 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse3 .cse4 .cse5 .cse1) (and .cse0 .cse6) (and .cse4 .cse1 (<= 8672 ssl3_accept_~s__state~0) .cse6) (and .cse7 .cse3 .cse4 .cse1) (and (= ssl3_accept_~s__state~0 8656) .cse3 .cse4) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse6) (= ssl3_accept_~s__state~0 3) (and .cse3 .cse0) (and .cse3 .cse4 .cse1 .cse2) (and .cse7 .cse0 .cse1))) [2022-04-07 00:51:11,162 INFO L878 garLoopResultBuilder]: At program point L143(lines 143 579) the Hoare annotation is: (let ((.cse5 (= ssl3_accept_~s__state~0 8592)) (.cse6 (= 3 ssl3_accept_~blastFlag~0)) (.cse3 (= 2 ssl3_accept_~blastFlag~0)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (= ssl3_accept_~s__state~0 8608)) (.cse7 (= ssl3_accept_~s__state~0 8640)) (.cse0 (not (= ssl3_accept_~s__hit~0 0))) (.cse1 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 .cse2) (and (<= ssl3_accept_~s__state~0 8576) .cse3 .cse4) (and .cse0 .cse5 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse3 (= ssl3_accept_~s__state~0 8512)) (and .cse3 .cse1 (= 8560 ssl3_accept_~s__state~0)) (and .cse3 .cse4 .cse5 .cse1) (and (= ssl3_accept_~blastFlag~0 1) (= 8496 ssl3_accept_~s__state~0)) (and .cse3 (= ssl3_accept_~s__state~0 8528)) (and .cse0 .cse6) (and .cse4 .cse1 (<= 8672 ssl3_accept_~s__state~0) .cse6) (and .cse7 .cse3 .cse4 .cse1) (and (= ssl3_accept_~s__state~0 8544) .cse3 .cse1) (and (= ssl3_accept_~s__state~0 8656) .cse3 .cse4) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse6) (= ssl3_accept_~s__state~0 3) (and .cse3 .cse0) (and .cse3 .cse4 .cse1 .cse2) (and .cse7 .cse0 .cse1))) [2022-04-07 00:51:11,162 INFO L878 garLoopResultBuilder]: At program point L110-2(lines 110 608) the Hoare annotation is: (let ((.cse5 (= ssl3_accept_~s__state~0 8592)) (.cse6 (= 3 ssl3_accept_~blastFlag~0)) (.cse3 (= 2 ssl3_accept_~blastFlag~0)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (= ssl3_accept_~s__state~0 8608)) (.cse7 (= ssl3_accept_~s__state~0 8640)) (.cse0 (not (= ssl3_accept_~s__hit~0 0))) (.cse1 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 .cse2) (and (<= ssl3_accept_~s__state~0 8576) .cse3 .cse4) (and .cse0 .cse5 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse3 (= ssl3_accept_~s__state~0 8512)) (and .cse3 .cse1 (= 8560 ssl3_accept_~s__state~0)) (and .cse3 .cse4 .cse5 .cse1) (and (= ssl3_accept_~blastFlag~0 1) (= 8496 ssl3_accept_~s__state~0)) (and .cse3 (= ssl3_accept_~s__state~0 8528)) (and .cse0 .cse6) (and .cse4 .cse1 (<= 8672 ssl3_accept_~s__state~0) .cse6) (and .cse7 .cse3 .cse4 .cse1) (and (= ssl3_accept_~s__state~0 8544) .cse3 .cse1) (and (= ssl3_accept_~s__state~0 8656) .cse3 .cse4) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse6) (= ssl3_accept_~s__state~0 3) (and .cse3 .cse0) (and .cse3 .cse4 .cse1 .cse2) (and .cse7 .cse0 .cse1))) [2022-04-07 00:51:11,163 INFO L885 garLoopResultBuilder]: At program point L540(lines 540 546) the Hoare annotation is: true [2022-04-07 00:51:11,163 INFO L878 garLoopResultBuilder]: At program point L507(lines 507 509) the Hoare annotation is: (let ((.cse1 (not (= ssl3_accept_~s__hit~0 0))) (.cse2 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (<= ssl3_accept_~s__state~0 8672))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and .cse1 .cse0 (= 3 ssl3_accept_~blastFlag~0)) (and .cse2 .cse1 .cse0) (and .cse2 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0))) [2022-04-07 00:51:11,163 INFO L885 garLoopResultBuilder]: At program point L540-1(lines 540 546) the Hoare annotation is: true [2022-04-07 00:51:11,163 INFO L878 garLoopResultBuilder]: At program point L507-2(lines 219 552) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8672)) (.cse1 (= 3 ssl3_accept_~blastFlag~0))) (or (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse1) (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and (not (= ssl3_accept_~s__hit~0 0)) .cse0 .cse1))) [2022-04-07 00:51:11,163 INFO L878 garLoopResultBuilder]: At program point L408(lines 399 417) the Hoare annotation is: (let ((.cse1 (<= ssl3_accept_~s__state~0 8576)) (.cse2 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse3 (not (= ssl3_accept_~s__hit~0 0))) (.cse4 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_accept_~blastFlag~0)) (and .cse2 .cse3 .cse4) (and .cse0 .cse3 .cse4))) [2022-04-07 00:51:11,163 INFO L878 garLoopResultBuilder]: At program point L243(lines 243 246) the Hoare annotation is: (let ((.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse1 (not (= ssl3_accept_~s__hit~0 0)))) (or (and (<= ssl3_accept_~s__state~0 8576) .cse0 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (= ssl3_accept_~blastFlag~0 0) (and .cse1 (= 3 ssl3_accept_~blastFlag~0)) (and .cse0 .cse1))) [2022-04-07 00:51:11,163 INFO L878 garLoopResultBuilder]: At program point L177(lines 176 568) the Hoare annotation is: (let ((.cse1 (= 2 ssl3_accept_~blastFlag~0)) (.cse2 (not (= ssl3_accept_~s__hit~0 0))) (.cse0 (= 8448 ssl3_accept_~s__state~0)) (.cse3 (= 3 ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and .cse0 .cse2 .cse3) (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and .cse0 (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse3))) [2022-04-07 00:51:11,163 INFO L878 garLoopResultBuilder]: At program point L144(lines 137 581) the Hoare annotation is: (let ((.cse1 (<= ssl3_accept_~s__state~0 8576)) (.cse2 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse3 (not (= ssl3_accept_~s__hit~0 0))) (.cse4 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1) (and .cse1 .cse2 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and .cse3 .cse4 (= 3 ssl3_accept_~blastFlag~0)) (and .cse2 .cse3 .cse4) (and .cse0 .cse3 .cse4))) [2022-04-07 00:51:11,163 INFO L878 garLoopResultBuilder]: At program point L111(line 111) the Hoare annotation is: (let ((.cse5 (= ssl3_accept_~s__state~0 8592)) (.cse6 (= 3 ssl3_accept_~blastFlag~0)) (.cse3 (= 2 ssl3_accept_~blastFlag~0)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (= ssl3_accept_~s__state~0 8608)) (.cse7 (= ssl3_accept_~s__state~0 8640)) (.cse0 (not (= ssl3_accept_~s__hit~0 0))) (.cse1 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 .cse2) (and (<= ssl3_accept_~s__state~0 8576) .cse3 .cse4) (and .cse0 .cse5 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse3 (= ssl3_accept_~s__state~0 8512)) (and .cse3 .cse1 (= 8560 ssl3_accept_~s__state~0)) (and .cse3 .cse4 .cse5 .cse1) (and (= ssl3_accept_~blastFlag~0 1) (= 8496 ssl3_accept_~s__state~0)) (and .cse3 (= ssl3_accept_~s__state~0 8528)) (and .cse0 .cse6) (and .cse4 .cse1 (<= 8672 ssl3_accept_~s__state~0) .cse6) (and .cse7 .cse3 .cse4 .cse1) (and (= ssl3_accept_~s__state~0 8544) .cse3 .cse1) (and (= ssl3_accept_~s__state~0 8656) .cse3 .cse4) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse6) (= ssl3_accept_~s__state~0 3) (and .cse3 .cse0) (and .cse3 .cse4 .cse1 .cse2) (and .cse7 .cse0 .cse1))) [2022-04-07 00:51:11,163 INFO L878 garLoopResultBuilder]: At program point L344(lines 344 378) the Hoare annotation is: (let ((.cse1 (<= ssl3_accept_~s__state~0 8576)) (.cse2 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse3 (not (= ssl3_accept_~s__hit~0 0))) (.cse4 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_accept_~blastFlag~0)) (and .cse2 .cse3 .cse4) (and .cse0 .cse3 .cse4))) [2022-04-07 00:51:11,163 INFO L878 garLoopResultBuilder]: At program point L344-1(lines 344 378) the Hoare annotation is: (let ((.cse1 (<= ssl3_accept_~s__state~0 8576)) (.cse2 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse3 (not (= ssl3_accept_~s__hit~0 0))) (.cse4 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_accept_~blastFlag~0)) (and .cse2 .cse3 .cse4) (and .cse0 .cse3 .cse4))) [2022-04-07 00:51:11,163 INFO L878 garLoopResultBuilder]: At program point L212(lines 212 556) the Hoare annotation is: (let ((.cse0 (not (= ssl3_accept_~s__hit~0 0)))) (or (= ssl3_accept_~blastFlag~0 0) (<= ssl3_accept_~s__state~0 8672) (and .cse0 (= 3 ssl3_accept_~blastFlag~0)) (and (= 2 ssl3_accept_~blastFlag~0) .cse0))) [2022-04-07 00:51:11,163 INFO L878 garLoopResultBuilder]: At program point L179(lines 179 567) the Hoare annotation is: (let ((.cse5 (= ssl3_accept_~s__state~0 8592)) (.cse6 (= 3 ssl3_accept_~blastFlag~0)) (.cse3 (= 2 ssl3_accept_~blastFlag~0)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (= ssl3_accept_~s__state~0 8608)) (.cse7 (= ssl3_accept_~s__state~0 8640)) (.cse0 (not (= ssl3_accept_~s__hit~0 0))) (.cse1 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 .cse2) (and (<= ssl3_accept_~s__state~0 8576) .cse3 .cse4) (and .cse0 .cse5 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse3 .cse4 .cse5 .cse1) (and .cse0 .cse6) (and .cse4 .cse1 (<= 8672 ssl3_accept_~s__state~0) .cse6) (and .cse7 .cse3 .cse4 .cse1) (and (= ssl3_accept_~s__state~0 8656) .cse3 .cse4) (= ssl3_accept_~s__state~0 3) (and .cse3 .cse0) (and .cse3 .cse4 .cse1 .cse2) (and .cse7 .cse0 .cse1))) [2022-04-07 00:51:11,163 INFO L878 garLoopResultBuilder]: At program point L146(lines 146 578) the Hoare annotation is: (let ((.cse5 (= ssl3_accept_~s__state~0 8592)) (.cse6 (= 3 ssl3_accept_~blastFlag~0)) (.cse3 (= 2 ssl3_accept_~blastFlag~0)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (= ssl3_accept_~s__state~0 8608)) (.cse7 (= ssl3_accept_~s__state~0 8640)) (.cse0 (not (= ssl3_accept_~s__hit~0 0))) (.cse1 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 .cse2) (and (<= ssl3_accept_~s__state~0 8576) .cse3 .cse4) (and .cse0 .cse5 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse3 (= ssl3_accept_~s__state~0 8512)) (and .cse3 .cse1 (= 8560 ssl3_accept_~s__state~0)) (and .cse3 .cse4 .cse5 .cse1) (and (= ssl3_accept_~blastFlag~0 1) (= 8496 ssl3_accept_~s__state~0)) (and .cse3 (= ssl3_accept_~s__state~0 8528)) (and .cse0 .cse6) (and .cse4 .cse1 (<= 8672 ssl3_accept_~s__state~0) .cse6) (and .cse7 .cse3 .cse4 .cse1) (and (= ssl3_accept_~s__state~0 8544) .cse3 .cse1) (and (= ssl3_accept_~s__state~0 8656) .cse3 .cse4) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse6) (= ssl3_accept_~s__state~0 3) (and .cse3 .cse0) (and .cse3 .cse4 .cse1 .cse2) (and .cse7 .cse0 .cse1))) [2022-04-07 00:51:11,163 INFO L878 garLoopResultBuilder]: At program point L113(lines 113 589) the Hoare annotation is: (let ((.cse5 (= ssl3_accept_~s__state~0 8592)) (.cse6 (= 3 ssl3_accept_~blastFlag~0)) (.cse3 (= 2 ssl3_accept_~blastFlag~0)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (= ssl3_accept_~s__state~0 8608)) (.cse7 (= ssl3_accept_~s__state~0 8640)) (.cse0 (not (= ssl3_accept_~s__hit~0 0))) (.cse1 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 .cse2) (and (<= ssl3_accept_~s__state~0 8576) .cse3 .cse4) (and .cse0 .cse5 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse3 (= ssl3_accept_~s__state~0 8512)) (and .cse3 .cse1 (= 8560 ssl3_accept_~s__state~0)) (and .cse3 .cse4 .cse5 .cse1) (and (= ssl3_accept_~blastFlag~0 1) (= 8496 ssl3_accept_~s__state~0)) (and .cse3 (= ssl3_accept_~s__state~0 8528)) (and .cse0 .cse6) (and .cse4 .cse1 (<= 8672 ssl3_accept_~s__state~0) .cse6) (and .cse7 .cse3 .cse4 .cse1) (and (= ssl3_accept_~s__state~0 8544) .cse3 .cse1) (and (= ssl3_accept_~s__state~0 8656) .cse3 .cse4) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse6) (= ssl3_accept_~s__state~0 3) (and .cse3 .cse0) (and .cse3 .cse4 .cse1 .cse2) (and .cse7 .cse0 .cse1))) [2022-04-07 00:51:11,164 INFO L885 garLoopResultBuilder]: At program point L609(lines 109 610) the Hoare annotation is: true [2022-04-07 00:51:11,164 INFO L885 garLoopResultBuilder]: At program point L543(lines 543 545) the Hoare annotation is: true [2022-04-07 00:51:11,164 INFO L878 garLoopResultBuilder]: At program point L477(lines 477 479) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8672))) (or (and (not (= ssl3_accept_~s__hit~0 0)) .cse0) (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and (= 2 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0))) [2022-04-07 00:51:11,164 INFO L878 garLoopResultBuilder]: At program point L411(lines 411 413) the Hoare annotation is: (let ((.cse1 (<= ssl3_accept_~s__state~0 8576)) (.cse2 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse3 (not (= ssl3_accept_~s__hit~0 0))) (.cse4 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_accept_~blastFlag~0)) (and .cse2 .cse3 .cse4) (and .cse0 .cse3 .cse4))) [2022-04-07 00:51:11,164 INFO L878 garLoopResultBuilder]: At program point L345(lines 345 375) the Hoare annotation is: (let ((.cse1 (<= ssl3_accept_~s__state~0 8576)) (.cse2 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse3 (not (= ssl3_accept_~s__hit~0 0))) (.cse4 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_accept_~blastFlag~0)) (and .cse2 .cse3 .cse4) (and .cse0 .cse3 .cse4))) [2022-04-07 00:51:11,164 INFO L878 garLoopResultBuilder]: At program point L213(lines 209 557) the Hoare annotation is: (let ((.cse1 (not (= ssl3_accept_~s__hit~0 0))) (.cse0 (<= 8672 ssl3_accept_~s__state~0)) (.cse2 (= 3 ssl3_accept_~blastFlag~0))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and (= 2 ssl3_accept_~blastFlag~0) .cse1 .cse0) (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse2) (and .cse1 .cse0 .cse2))) [2022-04-07 00:51:11,164 INFO L878 garLoopResultBuilder]: At program point L114(lines 113 589) the Hoare annotation is: (let ((.cse1 (not (= ssl3_accept_~s__hit~0 0))) (.cse0 (<= 8672 ssl3_accept_~s__state~0))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and (= 2 ssl3_accept_~blastFlag~0) .cse1 .cse0) (and .cse1 .cse0 (= 3 ssl3_accept_~blastFlag~0)))) [2022-04-07 00:51:11,164 INFO L885 garLoopResultBuilder]: At program point L215(lines 215 555) the Hoare annotation is: true [2022-04-07 00:51:11,164 INFO L878 garLoopResultBuilder]: At program point L182(lines 182 566) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576)) (.cse4 (= ssl3_accept_~s__state~0 8592)) (.cse7 (= 3 ssl3_accept_~blastFlag~0)) (.cse6 (= 2 ssl3_accept_~blastFlag~0)) (.cse5 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse3 (= ssl3_accept_~s__state~0 8608)) (.cse8 (= ssl3_accept_~s__state~0 8640)) (.cse1 (not (= ssl3_accept_~s__hit~0 0))) (.cse2 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse2 .cse3) (and .cse1 .cse4 .cse2) (= ssl3_accept_~blastFlag~0 0) (and .cse0 .cse5) (and .cse6 .cse5 .cse4 .cse2) (and .cse1 .cse7) (and .cse5 .cse2 (<= 8672 ssl3_accept_~s__state~0) .cse7) (and .cse8 .cse6 .cse5 .cse2) (and (= ssl3_accept_~s__state~0 8656) .cse6 .cse5) (= ssl3_accept_~s__state~0 3) (and .cse6 .cse1) (and .cse6 .cse5 .cse2 .cse3) (and .cse8 .cse1 .cse2))) [2022-04-07 00:51:11,164 INFO L878 garLoopResultBuilder]: At program point L149(lines 149 577) the Hoare annotation is: (let ((.cse5 (= ssl3_accept_~s__state~0 8592)) (.cse6 (= 3 ssl3_accept_~blastFlag~0)) (.cse3 (= 2 ssl3_accept_~blastFlag~0)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (= ssl3_accept_~s__state~0 8608)) (.cse7 (= ssl3_accept_~s__state~0 8640)) (.cse0 (not (= ssl3_accept_~s__hit~0 0))) (.cse1 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 .cse2) (and (<= ssl3_accept_~s__state~0 8576) .cse3 .cse4) (and .cse0 .cse5 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse3 (= ssl3_accept_~s__state~0 8512)) (and .cse3 .cse1 (= 8560 ssl3_accept_~s__state~0)) (and .cse3 .cse4 .cse5 .cse1) (and .cse3 (= ssl3_accept_~s__state~0 8528)) (and .cse0 .cse6) (and .cse4 .cse1 (<= 8672 ssl3_accept_~s__state~0) .cse6) (and .cse7 .cse3 .cse4 .cse1) (and (= ssl3_accept_~s__state~0 8544) .cse3 .cse1) (and (= ssl3_accept_~s__state~0 8656) .cse3 .cse4) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse6) (= ssl3_accept_~s__state~0 3) (and .cse3 .cse0) (and .cse3 .cse4 .cse1 .cse2) (and .cse7 .cse0 .cse1))) [2022-04-07 00:51:11,164 INFO L878 garLoopResultBuilder]: At program point L116(lines 116 588) the Hoare annotation is: (let ((.cse5 (= ssl3_accept_~s__state~0 8592)) (.cse6 (= 3 ssl3_accept_~blastFlag~0)) (.cse3 (= 2 ssl3_accept_~blastFlag~0)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (= ssl3_accept_~s__state~0 8608)) (.cse7 (= ssl3_accept_~s__state~0 8640)) (.cse0 (not (= ssl3_accept_~s__hit~0 0))) (.cse1 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 .cse2) (and (<= ssl3_accept_~s__state~0 8576) .cse3 .cse4) (and .cse0 .cse5 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse3 (= ssl3_accept_~s__state~0 8512)) (and .cse3 .cse1 (= 8560 ssl3_accept_~s__state~0)) (and .cse3 .cse4 .cse5 .cse1) (and (= ssl3_accept_~blastFlag~0 1) (= 8496 ssl3_accept_~s__state~0)) (and .cse3 (= ssl3_accept_~s__state~0 8528)) (and .cse0 .cse6) (and .cse4 .cse1 (<= 8672 ssl3_accept_~s__state~0) .cse6) (and .cse7 .cse3 .cse4 .cse1) (and (= ssl3_accept_~s__state~0 8544) .cse3 .cse1) (and (= ssl3_accept_~s__state~0 8656) .cse3 .cse4) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse6) (= ssl3_accept_~s__state~0 3) (and .cse3 .cse0) (and .cse3 .cse4 .cse1 .cse2) (and .cse7 .cse0 .cse1))) [2022-04-07 00:51:11,164 INFO L878 garLoopResultBuilder]: At program point L315(lines 315 322) the Hoare annotation is: (let ((.cse1 (<= ssl3_accept_~s__state~0 8576)) (.cse2 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse3 (not (= ssl3_accept_~s__hit~0 0))) (.cse4 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_accept_~blastFlag~0)) (and .cse2 .cse3 .cse4) (and .cse0 .cse3 .cse4))) [2022-04-07 00:51:11,164 INFO L878 garLoopResultBuilder]: At program point L315-2(lines 315 322) the Hoare annotation is: (let ((.cse1 (<= ssl3_accept_~s__state~0 8576)) (.cse2 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse3 (not (= ssl3_accept_~s__hit~0 0))) (.cse4 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_accept_~blastFlag~0)) (and .cse2 .cse3 .cse4) (and .cse0 .cse3 .cse4))) [2022-04-07 00:51:11,164 INFO L885 garLoopResultBuilder]: At program point L216(lines 215 555) the Hoare annotation is: true [2022-04-07 00:51:11,164 INFO L878 garLoopResultBuilder]: At program point L183(lines 179 567) the Hoare annotation is: (let ((.cse1 (not (= ssl3_accept_~s__hit~0 0))) (.cse2 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (<= ssl3_accept_~s__state~0 8672))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and .cse1 .cse0 (= 3 ssl3_accept_~blastFlag~0)) (and .cse2 .cse1 .cse0) (and .cse2 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0))) [2022-04-07 00:51:11,164 INFO L878 garLoopResultBuilder]: At program point L150(lines 146 578) the Hoare annotation is: (let ((.cse2 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse3 (not (= ssl3_accept_~s__hit~0 0))) (.cse4 (<= ssl3_accept_~s__state~0 8672)) (.cse5 (= ssl3_accept_~blastFlag~0 1)) (.cse1 (<= ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1) (and .cse1 .cse2 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and .cse3 .cse4 (= 3 ssl3_accept_~blastFlag~0)) (and .cse2 .cse3 .cse4) (and .cse5 .cse3 .cse4) (and .cse0 .cse3 .cse4) (and .cse5 .cse1))) [2022-04-07 00:51:11,165 INFO L885 garLoopResultBuilder]: At program point L614(lines 614 616) the Hoare annotation is: true [2022-04-07 00:51:11,165 INFO L885 garLoopResultBuilder]: At program point L614-2(lines 614 616) the Hoare annotation is: true [2022-04-07 00:51:11,165 INFO L878 garLoopResultBuilder]: At program point L515(lines 515 518) 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:11,165 INFO L878 garLoopResultBuilder]: At program point L350(lines 350 373) the Hoare annotation is: (let ((.cse1 (<= ssl3_accept_~s__state~0 8576)) (.cse2 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse3 (not (= ssl3_accept_~s__hit~0 0))) (.cse4 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_accept_~blastFlag~0)) (and .cse2 .cse3 .cse4) (and .cse0 .cse3 .cse4))) [2022-04-07 00:51:11,165 INFO L885 garLoopResultBuilder]: At program point L218(lines 217 555) the Hoare annotation is: true [2022-04-07 00:51:11,165 INFO L878 garLoopResultBuilder]: At program point L185(lines 185 565) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576)) (.cse4 (= ssl3_accept_~s__state~0 8592)) (.cse7 (= 3 ssl3_accept_~blastFlag~0)) (.cse6 (= 2 ssl3_accept_~blastFlag~0)) (.cse5 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse3 (= ssl3_accept_~s__state~0 8608)) (.cse8 (= ssl3_accept_~s__state~0 8640)) (.cse1 (not (= ssl3_accept_~s__hit~0 0))) (.cse2 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse2 .cse3) (and .cse1 .cse4 .cse2) (= ssl3_accept_~blastFlag~0 0) (and .cse0 .cse5) (and .cse6 .cse5 .cse4 .cse2) (and .cse1 .cse7) (and .cse5 .cse2 (<= 8672 ssl3_accept_~s__state~0) .cse7) (and .cse8 .cse6 .cse5 .cse2) (and (= ssl3_accept_~s__state~0 8656) .cse6 .cse5) (= ssl3_accept_~s__state~0 3) (and .cse6 .cse1) (and .cse6 .cse5 .cse2 .cse3) (and .cse8 .cse1 .cse2))) [2022-04-07 00:51:11,165 INFO L878 garLoopResultBuilder]: At program point L152(lines 152 576) the Hoare annotation is: (let ((.cse5 (= ssl3_accept_~s__state~0 8592)) (.cse6 (= 3 ssl3_accept_~blastFlag~0)) (.cse3 (= 2 ssl3_accept_~blastFlag~0)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (= ssl3_accept_~s__state~0 8608)) (.cse7 (= ssl3_accept_~s__state~0 8640)) (.cse0 (not (= ssl3_accept_~s__hit~0 0))) (.cse1 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 .cse2) (and (<= ssl3_accept_~s__state~0 8576) .cse3 .cse4) (and .cse0 .cse5 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse3 (= ssl3_accept_~s__state~0 8512)) (and .cse3 .cse1 (= 8560 ssl3_accept_~s__state~0)) (and .cse3 .cse4 .cse5 .cse1) (and .cse3 (= ssl3_accept_~s__state~0 8528)) (and .cse0 .cse6) (and .cse4 .cse1 (<= 8672 ssl3_accept_~s__state~0) .cse6) (and .cse7 .cse3 .cse4 .cse1) (and (= ssl3_accept_~s__state~0 8544) .cse3 .cse1) (and (= ssl3_accept_~s__state~0 8656) .cse3 .cse4) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse6) (= ssl3_accept_~s__state~0 3) (and .cse3 .cse0) (and .cse3 .cse4 .cse1 .cse2) (and .cse7 .cse0 .cse1))) [2022-04-07 00:51:11,165 INFO L878 garLoopResultBuilder]: At program point L119(lines 119 587) the Hoare annotation is: (let ((.cse5 (= ssl3_accept_~s__state~0 8592)) (.cse6 (= 3 ssl3_accept_~blastFlag~0)) (.cse3 (= 2 ssl3_accept_~blastFlag~0)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (= ssl3_accept_~s__state~0 8608)) (.cse7 (= ssl3_accept_~s__state~0 8640)) (.cse0 (not (= ssl3_accept_~s__hit~0 0))) (.cse1 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 .cse2) (and (<= ssl3_accept_~s__state~0 8576) .cse3 .cse4) (and .cse0 .cse5 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse3 (= ssl3_accept_~s__state~0 8512)) (and .cse3 .cse1 (= 8560 ssl3_accept_~s__state~0)) (and .cse3 .cse4 .cse5 .cse1) (and (= ssl3_accept_~blastFlag~0 1) (= 8496 ssl3_accept_~s__state~0)) (and .cse3 (= ssl3_accept_~s__state~0 8528)) (and .cse0 .cse6) (and .cse4 .cse1 (<= 8672 ssl3_accept_~s__state~0) .cse6) (and .cse7 .cse3 .cse4 .cse1) (and (= ssl3_accept_~s__state~0 8544) .cse3 .cse1) (and (= ssl3_accept_~s__state~0 8656) .cse3 .cse4) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse6) (= ssl3_accept_~s__state~0 3) (and .cse3 .cse0) (and .cse3 .cse4 .cse1 .cse2) (and .cse7 .cse0 .cse1))) [2022-04-07 00:51:11,165 INFO L878 garLoopResultBuilder]: At program point L285(lines 285 287) the Hoare annotation is: (let ((.cse1 (<= ssl3_accept_~s__state~0 8576)) (.cse2 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse3 (not (= ssl3_accept_~s__hit~0 0))) (.cse4 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1) (and .cse1 .cse2 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and .cse3 .cse4 (= 3 ssl3_accept_~blastFlag~0)) (and .cse2 .cse3 .cse4) (and .cse0 .cse3 .cse4))) [2022-04-07 00:51:11,165 INFO L878 garLoopResultBuilder]: At program point L285-2(lines 219 552) the Hoare annotation is: (let ((.cse1 (= 2 ssl3_accept_~blastFlag~0)) (.cse2 (not (= ssl3_accept_~s__hit~0 0))) (.cse3 (<= ssl3_accept_~s__state~0 8672)) (.cse4 (= ssl3_accept_~blastFlag~0 1)) (.cse0 (<= ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and .cse2 .cse3 (= 3 ssl3_accept_~blastFlag~0)) (and .cse1 .cse2 .cse3) (and .cse4 .cse2 .cse3) (and .cse4 .cse0))) [2022-04-07 00:51:11,165 INFO L878 garLoopResultBuilder]: At program point L451(lines 451 453) the Hoare annotation is: (let ((.cse1 (not (= ssl3_accept_~s__hit~0 0))) (.cse2 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (<= ssl3_accept_~s__state~0 8672))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and .cse1 .cse0 (= 3 ssl3_accept_~blastFlag~0)) (and .cse2 .cse1 .cse0) (and .cse2 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0))) [2022-04-07 00:51:11,165 INFO L878 garLoopResultBuilder]: At program point L319(lines 319 321) the Hoare annotation is: (let ((.cse1 (<= ssl3_accept_~s__state~0 8576)) (.cse2 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse3 (not (= ssl3_accept_~s__hit~0 0))) (.cse4 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_accept_~blastFlag~0)) (and .cse2 .cse3 .cse4) (and .cse0 .cse3 .cse4))) [2022-04-07 00:51:11,165 INFO L878 garLoopResultBuilder]: At program point L353(lines 353 357) the Hoare annotation is: (let ((.cse1 (<= ssl3_accept_~s__state~0 8576)) (.cse2 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse3 (not (= ssl3_accept_~s__hit~0 0))) (.cse4 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_accept_~blastFlag~0)) (and .cse2 .cse3 .cse4) (and .cse0 .cse3 .cse4))) [2022-04-07 00:51:11,165 INFO L878 garLoopResultBuilder]: At program point L353-2(lines 353 357) the Hoare annotation is: (let ((.cse1 (<= ssl3_accept_~s__state~0 8576)) (.cse2 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse3 (not (= ssl3_accept_~s__hit~0 0))) (.cse4 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_accept_~blastFlag~0)) (and .cse2 .cse3 .cse4) (and .cse0 .cse3 .cse4))) [2022-04-07 00:51:11,165 INFO L878 garLoopResultBuilder]: At program point L254(lines 254 264) the Hoare annotation is: (let ((.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse1 (not (= ssl3_accept_~s__hit~0 0)))) (or (and (<= ssl3_accept_~s__state~0 8576) .cse0 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (= ssl3_accept_~blastFlag~0 0) (and .cse1 (= 3 ssl3_accept_~blastFlag~0)) (and .cse0 .cse1))) [2022-04-07 00:51:11,166 INFO L878 garLoopResultBuilder]: At program point L188(lines 188 564) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576)) (.cse5 (= 3 ssl3_accept_~blastFlag~0)) (.cse7 (= 2 ssl3_accept_~blastFlag~0)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse3 (= ssl3_accept_~s__state~0 8608)) (.cse6 (= ssl3_accept_~s__state~0 8640)) (.cse1 (not (= ssl3_accept_~s__hit~0 0))) (.cse2 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse2 .cse3) (= ssl3_accept_~blastFlag~0 0) (and .cse0 .cse4) (and .cse1 .cse5) (and .cse4 .cse2 (<= 8672 ssl3_accept_~s__state~0) .cse5) (and .cse6 .cse7 .cse4 .cse2) (and (= ssl3_accept_~s__state~0 8656) .cse7 .cse4) (= ssl3_accept_~s__state~0 3) (and .cse7 .cse1) (and .cse7 .cse4 .cse2 .cse3) (and .cse6 .cse1 .cse2))) [2022-04-07 00:51:11,166 INFO L878 garLoopResultBuilder]: At program point L155(lines 155 575) the Hoare annotation is: (let ((.cse5 (= ssl3_accept_~s__state~0 8592)) (.cse6 (= 3 ssl3_accept_~blastFlag~0)) (.cse3 (= 2 ssl3_accept_~blastFlag~0)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (= ssl3_accept_~s__state~0 8608)) (.cse7 (= ssl3_accept_~s__state~0 8640)) (.cse0 (not (= ssl3_accept_~s__hit~0 0))) (.cse1 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 .cse2) (and (<= ssl3_accept_~s__state~0 8576) .cse3 .cse4) (and .cse0 .cse5 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse3 .cse1 (= 8560 ssl3_accept_~s__state~0)) (and .cse3 .cse4 .cse5 .cse1) (and .cse3 (= ssl3_accept_~s__state~0 8528)) (and .cse0 .cse6) (and .cse4 .cse1 (<= 8672 ssl3_accept_~s__state~0) .cse6) (and .cse7 .cse3 .cse4 .cse1) (and (= ssl3_accept_~s__state~0 8544) .cse3 .cse1) (and (= ssl3_accept_~s__state~0 8656) .cse3 .cse4) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse6) (= ssl3_accept_~s__state~0 3) (and .cse3 .cse0) (and .cse3 .cse4 .cse1 .cse2) (and .cse7 .cse0 .cse1))) [2022-04-07 00:51:11,166 INFO L878 garLoopResultBuilder]: At program point L122(lines 122 586) the Hoare annotation is: (let ((.cse5 (= ssl3_accept_~s__state~0 8592)) (.cse6 (= 3 ssl3_accept_~blastFlag~0)) (.cse3 (= 2 ssl3_accept_~blastFlag~0)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (= ssl3_accept_~s__state~0 8608)) (.cse7 (= ssl3_accept_~s__state~0 8640)) (.cse0 (not (= ssl3_accept_~s__hit~0 0))) (.cse1 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 .cse2) (and (<= ssl3_accept_~s__state~0 8576) .cse3 .cse4) (and .cse0 .cse5 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse3 (= ssl3_accept_~s__state~0 8512)) (and .cse3 .cse1 (= 8560 ssl3_accept_~s__state~0)) (and .cse3 .cse4 .cse5 .cse1) (and (= ssl3_accept_~blastFlag~0 1) (= 8496 ssl3_accept_~s__state~0)) (and .cse3 (= ssl3_accept_~s__state~0 8528)) (and .cse0 .cse6) (and .cse4 .cse1 (<= 8672 ssl3_accept_~s__state~0) .cse6) (and .cse7 .cse3 .cse4 .cse1) (and (= ssl3_accept_~s__state~0 8544) .cse3 .cse1) (and (= ssl3_accept_~s__state~0 8656) .cse3 .cse4) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse6) (= ssl3_accept_~s__state~0 3) (and .cse3 .cse0) (and .cse3 .cse4 .cse1 .cse2) (and .cse7 .cse0 .cse1))) [2022-04-07 00:51:11,166 INFO L885 garLoopResultBuilder]: At program point ssl3_acceptEXIT(lines 22 621) the Hoare annotation is: true [2022-04-07 00:51:11,166 INFO L878 garLoopResultBuilder]: At program point L486(lines 486 488) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8672))) (or (and (not (= ssl3_accept_~s__hit~0 0)) .cse0) (and (= ssl3_accept_~s__state~0 8640) (= 2 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and (= ssl3_accept_~blastFlag~0 0) .cse0))) [2022-04-07 00:51:11,166 INFO L878 garLoopResultBuilder]: At program point L486-2(lines 219 552) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8672))) (or (and (not (= ssl3_accept_~s__hit~0 0)) .cse0) (and (= ssl3_accept_~s__state~0 8640) (= 2 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and (= ssl3_accept_~blastFlag~0 0) .cse0))) [2022-04-07 00:51:11,166 INFO L878 garLoopResultBuilder]: At program point L387(lines 387 419) the Hoare annotation is: (let ((.cse1 (<= ssl3_accept_~s__state~0 8576)) (.cse2 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse3 (not (= ssl3_accept_~s__hit~0 0))) (.cse4 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_accept_~blastFlag~0)) (and .cse2 .cse3 .cse4) (and .cse0 .cse3 .cse4))) [2022-04-07 00:51:11,166 INFO L878 garLoopResultBuilder]: At program point L255(lines 255 258) the Hoare annotation is: (let ((.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse1 (not (= ssl3_accept_~s__hit~0 0)))) (or (and (<= ssl3_accept_~s__state~0 8576) .cse0 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (= ssl3_accept_~blastFlag~0 0) (and .cse1 (= 3 ssl3_accept_~blastFlag~0)) (and .cse0 .cse1))) [2022-04-07 00:51:11,166 INFO L878 garLoopResultBuilder]: At program point L222(lines 116 588) the Hoare annotation is: (let ((.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse1 (not (= ssl3_accept_~s__hit~0 0)))) (or (and (<= ssl3_accept_~s__state~0 8576) .cse0 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (= ssl3_accept_~blastFlag~0 0) (and .cse1 (= 3 ssl3_accept_~blastFlag~0)) (and .cse0 .cse1))) [2022-04-07 00:51:11,166 INFO L878 garLoopResultBuilder]: At program point L189(lines 185 565) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8672))) (or (and (not (= ssl3_accept_~s__hit~0 0)) .cse0) (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and (= 2 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0))) [2022-04-07 00:51:11,166 INFO L878 garLoopResultBuilder]: At program point L156(lines 152 576) the Hoare annotation is: (let ((.cse1 (<= ssl3_accept_~s__state~0 8576)) (.cse2 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse3 (not (= ssl3_accept_~s__hit~0 0))) (.cse4 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_accept_~blastFlag~0)) (and .cse2 .cse3 .cse4) (and .cse0 .cse3 .cse4))) [2022-04-07 00:51:11,166 INFO L878 garLoopResultBuilder]: At program point L553(lines 110 608) the Hoare annotation is: (let ((.cse5 (= ssl3_accept_~s__state~0 8592)) (.cse6 (= 3 ssl3_accept_~blastFlag~0)) (.cse3 (= 2 ssl3_accept_~blastFlag~0)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (= ssl3_accept_~s__state~0 8608)) (.cse7 (= ssl3_accept_~s__state~0 8640)) (.cse0 (not (= ssl3_accept_~s__hit~0 0))) (.cse1 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 .cse2) (and (<= ssl3_accept_~s__state~0 8576) .cse3 .cse4) (and .cse0 .cse5 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse3 (= ssl3_accept_~s__state~0 8512)) (and .cse3 .cse1 (= 8560 ssl3_accept_~s__state~0)) (and .cse3 .cse4 .cse5 .cse1) (and (= ssl3_accept_~blastFlag~0 1) (= 8496 ssl3_accept_~s__state~0)) (and .cse3 (= ssl3_accept_~s__state~0 8528)) (and .cse0 .cse6) (and .cse4 .cse1 (<= 8672 ssl3_accept_~s__state~0) .cse6) (and .cse7 .cse3 .cse4 .cse1) (and (= ssl3_accept_~s__state~0 8544) .cse3 .cse1) (and (= ssl3_accept_~s__state~0 8656) .cse3 .cse4) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse6) (= ssl3_accept_~s__state~0 3) (and .cse3 .cse0) (and .cse3 .cse4 .cse1 .cse2) (and .cse7 .cse0 .cse1))) [2022-04-07 00:51:11,166 INFO L878 garLoopResultBuilder]: At program point L454(lines 454 463) the Hoare annotation is: (let ((.cse1 (not (= ssl3_accept_~s__hit~0 0))) (.cse2 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (<= ssl3_accept_~s__state~0 8672))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and .cse1 .cse0 (= 3 ssl3_accept_~blastFlag~0)) (and .cse2 .cse1 .cse0) (and .cse2 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0))) [2022-04-07 00:51:11,166 INFO L878 garLoopResultBuilder]: At program point L388(lines 388 394) the Hoare annotation is: (let ((.cse1 (<= ssl3_accept_~s__state~0 8576)) (.cse2 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse3 (not (= ssl3_accept_~s__hit~0 0))) (.cse4 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_accept_~blastFlag~0)) (and .cse2 .cse3 .cse4) (and .cse0 .cse3 .cse4))) [2022-04-07 00:51:11,166 INFO L878 garLoopResultBuilder]: At program point L191(lines 191 563) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576)) (.cse5 (= 3 ssl3_accept_~blastFlag~0)) (.cse7 (= 2 ssl3_accept_~blastFlag~0)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse3 (= ssl3_accept_~s__state~0 8608)) (.cse6 (= ssl3_accept_~s__state~0 8640)) (.cse1 (not (= ssl3_accept_~s__hit~0 0))) (.cse2 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse2 .cse3) (= ssl3_accept_~blastFlag~0 0) (and .cse0 .cse4) (and .cse1 .cse5) (and .cse4 .cse2 (<= 8672 ssl3_accept_~s__state~0) .cse5) (and .cse6 .cse7 .cse4 .cse2) (and (= ssl3_accept_~s__state~0 8656) .cse7 .cse4) (= ssl3_accept_~s__state~0 3) (and .cse7 .cse1) (and .cse7 .cse4 .cse2 .cse3) (and .cse6 .cse1 .cse2))) [2022-04-07 00:51:11,167 INFO L878 garLoopResultBuilder]: At program point L158(lines 158 574) the Hoare annotation is: (let ((.cse5 (= ssl3_accept_~s__state~0 8592)) (.cse6 (= 3 ssl3_accept_~blastFlag~0)) (.cse3 (= 2 ssl3_accept_~blastFlag~0)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (= ssl3_accept_~s__state~0 8608)) (.cse7 (= ssl3_accept_~s__state~0 8640)) (.cse0 (not (= ssl3_accept_~s__hit~0 0))) (.cse1 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 .cse2) (and (<= ssl3_accept_~s__state~0 8576) .cse3 .cse4) (and .cse0 .cse5 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse3 .cse1 (= 8560 ssl3_accept_~s__state~0)) (and .cse3 .cse4 .cse5 .cse1) (and .cse3 (= ssl3_accept_~s__state~0 8528)) (and .cse0 .cse6) (and .cse4 .cse1 (<= 8672 ssl3_accept_~s__state~0) .cse6) (and .cse7 .cse3 .cse4 .cse1) (and (= ssl3_accept_~s__state~0 8544) .cse3 .cse1) (and (= ssl3_accept_~s__state~0 8656) .cse3 .cse4) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse6) (= ssl3_accept_~s__state~0 3) (and .cse3 .cse0) (and .cse3 .cse4 .cse1 .cse2) (and .cse7 .cse0 .cse1))) [2022-04-07 00:51:11,167 INFO L878 garLoopResultBuilder]: At program point L125(lines 125 585) the Hoare annotation is: (let ((.cse5 (= ssl3_accept_~s__state~0 8592)) (.cse6 (= 3 ssl3_accept_~blastFlag~0)) (.cse3 (= 2 ssl3_accept_~blastFlag~0)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (= ssl3_accept_~s__state~0 8608)) (.cse7 (= ssl3_accept_~s__state~0 8640)) (.cse0 (not (= ssl3_accept_~s__hit~0 0))) (.cse1 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 .cse2) (and (<= ssl3_accept_~s__state~0 8576) .cse3 .cse4) (and .cse0 .cse5 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse3 (= ssl3_accept_~s__state~0 8512)) (and .cse3 .cse1 (= 8560 ssl3_accept_~s__state~0)) (and .cse3 .cse4 .cse5 .cse1) (and (= ssl3_accept_~blastFlag~0 1) (= 8496 ssl3_accept_~s__state~0)) (and .cse3 (= ssl3_accept_~s__state~0 8528)) (and .cse0 .cse6) (and .cse4 .cse1 (<= 8672 ssl3_accept_~s__state~0) .cse6) (and .cse7 .cse3 .cse4 .cse1) (and (= ssl3_accept_~s__state~0 8544) .cse3 .cse1) (and (= ssl3_accept_~s__state~0 8656) .cse3 .cse4) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse6) (= ssl3_accept_~s__state~0 3) (and .cse3 .cse0) (and .cse3 .cse4 .cse1 .cse2) (and .cse7 .cse0 .cse1))) [2022-04-07 00:51:11,167 INFO L885 garLoopResultBuilder]: At program point ssl3_acceptFINAL(lines 22 621) the Hoare annotation is: true [2022-04-07 00:51:11,167 INFO L878 garLoopResultBuilder]: At program point L93(lines 93 99) the Hoare annotation is: (= ssl3_accept_~blastFlag~0 0) [2022-04-07 00:51:11,167 INFO L878 garLoopResultBuilder]: At program point L523(lines 523 525) the Hoare annotation is: (let ((.cse1 (not (= ssl3_accept_~s__hit~0 0))) (.cse0 (<= 8672 ssl3_accept_~s__state~0)) (.cse2 (= 3 ssl3_accept_~blastFlag~0))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and (= 2 ssl3_accept_~blastFlag~0) .cse1 .cse0) (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse2) (and .cse1 .cse0 .cse2))) [2022-04-07 00:51:11,167 INFO L878 garLoopResultBuilder]: At program point L590(lines 590 606) the Hoare annotation is: (let ((.cse5 (= ssl3_accept_~s__state~0 8592)) (.cse6 (= 3 ssl3_accept_~blastFlag~0)) (.cse3 (= 2 ssl3_accept_~blastFlag~0)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (= ssl3_accept_~s__state~0 8608)) (.cse7 (= ssl3_accept_~s__state~0 8640)) (.cse0 (not (= ssl3_accept_~s__hit~0 0))) (.cse1 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 .cse2) (and (<= ssl3_accept_~s__state~0 8576) .cse3 .cse4) (and .cse0 .cse5 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse3 (= ssl3_accept_~s__state~0 8512)) (and .cse3 .cse1 (= 8560 ssl3_accept_~s__state~0)) (and .cse3 .cse4 .cse5 .cse1) (and (= ssl3_accept_~blastFlag~0 1) (= 8496 ssl3_accept_~s__state~0)) (and .cse3 (= ssl3_accept_~s__state~0 8528)) (and .cse0 .cse6) (and .cse4 .cse1 (<= 8672 ssl3_accept_~s__state~0) .cse6) (and .cse7 .cse3 .cse4 .cse1) (and (= ssl3_accept_~s__state~0 8544) .cse3 .cse1) (and (= ssl3_accept_~s__state~0 8656) .cse3 .cse4) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse6) (= ssl3_accept_~s__state~0 3) (and .cse3 .cse0) (and .cse3 .cse4 .cse1 .cse2) (and .cse7 .cse0 .cse1))) [2022-04-07 00:51:11,167 INFO L878 garLoopResultBuilder]: At program point L524(lines 83 620) the Hoare annotation is: false [2022-04-07 00:51:11,167 INFO L878 garLoopResultBuilder]: At program point L458(lines 458 460) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8672))) (or (and (not (= ssl3_accept_~s__hit~0 0)) .cse0) (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and (= 2 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0))) [2022-04-07 00:51:11,167 INFO L878 garLoopResultBuilder]: At program point L227(lines 227 229) the Hoare annotation is: (let ((.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse1 (not (= ssl3_accept_~s__hit~0 0)))) (or (and (<= ssl3_accept_~s__state~0 8576) .cse0 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (= ssl3_accept_~blastFlag~0 0) (and .cse1 (= 3 ssl3_accept_~blastFlag~0)) (and .cse0 .cse1))) [2022-04-07 00:51:11,167 INFO L878 garLoopResultBuilder]: At program point L194(lines 194 562) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576)) (.cse6 (= 3 ssl3_accept_~blastFlag~0)) (.cse5 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse4 (= 2 ssl3_accept_~blastFlag~0)) (.cse3 (= ssl3_accept_~s__state~0 8640)) (.cse1 (not (= ssl3_accept_~s__hit~0 0))) (.cse2 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (= ssl3_accept_~blastFlag~0 0) (and .cse0 .cse5) (and .cse1 .cse6) (and .cse5 .cse2 (<= 8672 ssl3_accept_~s__state~0) .cse6) (and (= ssl3_accept_~s__state~0 8656) .cse4 .cse5) (= ssl3_accept_~s__state~0 3) (and .cse4 .cse1) (and .cse3 .cse1 .cse2))) [2022-04-07 00:51:11,167 INFO L878 garLoopResultBuilder]: At program point L161(lines 161 573) the Hoare annotation is: (let ((.cse5 (= ssl3_accept_~s__state~0 8592)) (.cse6 (= 3 ssl3_accept_~blastFlag~0)) (.cse3 (= 2 ssl3_accept_~blastFlag~0)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (= ssl3_accept_~s__state~0 8608)) (.cse7 (= ssl3_accept_~s__state~0 8640)) (.cse0 (not (= ssl3_accept_~s__hit~0 0))) (.cse1 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 .cse2) (and (<= ssl3_accept_~s__state~0 8576) .cse3 .cse4) (and .cse0 .cse5 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse3 .cse1 (= 8560 ssl3_accept_~s__state~0)) (and .cse3 .cse4 .cse5 .cse1) (and .cse0 .cse6) (and .cse4 .cse1 (<= 8672 ssl3_accept_~s__state~0) .cse6) (and .cse7 .cse3 .cse4 .cse1) (and (= ssl3_accept_~s__state~0 8544) .cse3 .cse1) (and (= ssl3_accept_~s__state~0 8656) .cse3 .cse4) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse6) (= ssl3_accept_~s__state~0 3) (and .cse3 .cse0) (and .cse3 .cse4 .cse1 .cse2) (and .cse7 .cse0 .cse1))) [2022-04-07 00:51:11,167 INFO L878 garLoopResultBuilder]: At program point L227-2(lines 227 229) the Hoare annotation is: (let ((.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse1 (not (= ssl3_accept_~s__hit~0 0)))) (or (and (<= ssl3_accept_~s__state~0 8576) .cse0 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (= ssl3_accept_~blastFlag~0 0) (and .cse1 (= 3 ssl3_accept_~blastFlag~0)) (and .cse0 .cse1))) [2022-04-07 00:51:11,167 INFO L878 garLoopResultBuilder]: At program point L128(lines 128 584) the Hoare annotation is: (let ((.cse5 (= ssl3_accept_~s__state~0 8592)) (.cse6 (= 3 ssl3_accept_~blastFlag~0)) (.cse3 (= 2 ssl3_accept_~blastFlag~0)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (= ssl3_accept_~s__state~0 8608)) (.cse7 (= ssl3_accept_~s__state~0 8640)) (.cse0 (not (= ssl3_accept_~s__hit~0 0))) (.cse1 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 .cse2) (and (<= ssl3_accept_~s__state~0 8576) .cse3 .cse4) (and .cse0 .cse5 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse3 (= ssl3_accept_~s__state~0 8512)) (and .cse3 .cse1 (= 8560 ssl3_accept_~s__state~0)) (and .cse3 .cse4 .cse5 .cse1) (and (= ssl3_accept_~blastFlag~0 1) (= 8496 ssl3_accept_~s__state~0)) (and .cse3 (= ssl3_accept_~s__state~0 8528)) (and .cse0 .cse6) (and .cse4 .cse1 (<= 8672 ssl3_accept_~s__state~0) .cse6) (and .cse7 .cse3 .cse4 .cse1) (and (= ssl3_accept_~s__state~0 8544) .cse3 .cse1) (and (= ssl3_accept_~s__state~0 8656) .cse3 .cse4) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse6) (= ssl3_accept_~s__state~0 3) (and .cse3 .cse0) (and .cse3 .cse4 .cse1 .cse2) (and .cse7 .cse0 .cse1))) [2022-04-07 00:51:11,168 INFO L878 garLoopResultBuilder]: At program point L591(lines 591 605) the Hoare annotation is: (let ((.cse5 (= ssl3_accept_~s__state~0 8592)) (.cse6 (= 3 ssl3_accept_~blastFlag~0)) (.cse3 (= 2 ssl3_accept_~blastFlag~0)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (= ssl3_accept_~s__state~0 8608)) (.cse7 (= ssl3_accept_~s__state~0 8640)) (.cse0 (not (= ssl3_accept_~s__hit~0 0))) (.cse1 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 .cse2) (and (<= ssl3_accept_~s__state~0 8576) .cse3 .cse4) (and .cse0 .cse5 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse3 (= ssl3_accept_~s__state~0 8512)) (and .cse3 .cse1 (= 8560 ssl3_accept_~s__state~0)) (and .cse3 .cse4 .cse5 .cse1) (and (= ssl3_accept_~blastFlag~0 1) (= 8496 ssl3_accept_~s__state~0)) (and .cse3 (= ssl3_accept_~s__state~0 8528)) (and .cse0 .cse6) (and .cse4 .cse1 (<= 8672 ssl3_accept_~s__state~0) .cse6) (and .cse7 .cse3 .cse4 .cse1) (and (= ssl3_accept_~s__state~0 8544) .cse3 .cse1) (and (= ssl3_accept_~s__state~0 8656) .cse3 .cse4) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse6) (= ssl3_accept_~s__state~0 3) (and .cse3 .cse0) (and .cse3 .cse4 .cse1 .cse2) (and .cse7 .cse0 .cse1))) [2022-04-07 00:51:11,168 INFO L878 garLoopResultBuilder]: At program point L492(lines 492 496) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8672))) (or (and (not (= ssl3_accept_~s__hit~0 0)) .cse0) (and (= ssl3_accept_~s__state~0 8640) (= 2 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and (= ssl3_accept_~blastFlag~0 0) .cse0))) [2022-04-07 00:51:11,168 INFO L878 garLoopResultBuilder]: At program point L492-2(lines 492 496) the Hoare annotation is: (let ((.cse0 (= ssl3_accept_~s__state~0 8656))) (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__state~0 3))) [2022-04-07 00:51:11,168 INFO L878 garLoopResultBuilder]: At program point L195(lines 191 563) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8672))) (or (and (not (= ssl3_accept_~s__hit~0 0)) .cse0) (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and (= 2 ssl3_accept_~blastFlag~0) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0))) [2022-04-07 00:51:11,168 INFO L878 garLoopResultBuilder]: At program point L162(lines 158 574) the Hoare annotation is: (let ((.cse1 (<= ssl3_accept_~s__state~0 8576)) (.cse2 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse3 (not (= ssl3_accept_~s__hit~0 0))) (.cse4 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_accept_~blastFlag~0)) (and .cse2 .cse3 .cse4) (and .cse0 .cse3 .cse4))) [2022-04-07 00:51:11,168 INFO L878 garLoopResultBuilder]: At program point L96(lines 96 98) the Hoare annotation is: (= ssl3_accept_~blastFlag~0 0) [2022-04-07 00:51:11,168 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:11,168 INFO L878 garLoopResultBuilder]: At program point L592(lines 592 597) the Hoare annotation is: (let ((.cse5 (= ssl3_accept_~s__state~0 8592)) (.cse6 (= 3 ssl3_accept_~blastFlag~0)) (.cse3 (= 2 ssl3_accept_~blastFlag~0)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (= ssl3_accept_~s__state~0 8608)) (.cse7 (= ssl3_accept_~s__state~0 8640)) (.cse0 (not (= ssl3_accept_~s__hit~0 0))) (.cse1 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 .cse2) (and (<= ssl3_accept_~s__state~0 8576) .cse3 .cse4) (and .cse0 .cse5 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse3 (= ssl3_accept_~s__state~0 8512)) (and .cse3 .cse1 (= 8560 ssl3_accept_~s__state~0)) (and .cse3 .cse4 .cse5 .cse1) (and (= ssl3_accept_~blastFlag~0 1) (= 8496 ssl3_accept_~s__state~0)) (and .cse3 (= ssl3_accept_~s__state~0 8528)) (and .cse0 .cse6) (and .cse4 .cse1 (<= 8672 ssl3_accept_~s__state~0) .cse6) (and .cse7 .cse3 .cse4 .cse1) (and (= ssl3_accept_~s__state~0 8544) .cse3 .cse1) (and (= ssl3_accept_~s__state~0 8656) .cse3 .cse4) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse6) (= ssl3_accept_~s__state~0 3) (and .cse3 .cse0) (and .cse3 .cse4 .cse1 .cse2) (and .cse7 .cse0 .cse1))) [2022-04-07 00:51:11,168 INFO L878 garLoopResultBuilder]: At program point L526(lines 526 528) the Hoare annotation is: (let ((.cse1 (not (= ssl3_accept_~s__hit~0 0))) (.cse0 (<= 8672 ssl3_accept_~s__state~0)) (.cse2 (= 3 ssl3_accept_~blastFlag~0))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and (= 2 ssl3_accept_~blastFlag~0) .cse1 .cse0) (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse2) (and .cse1 .cse0 .cse2))) [2022-04-07 00:51:11,168 INFO L878 garLoopResultBuilder]: At program point L592-2(lines 591 605) the Hoare annotation is: (let ((.cse5 (= ssl3_accept_~s__state~0 8592)) (.cse6 (= 3 ssl3_accept_~blastFlag~0)) (.cse3 (= 2 ssl3_accept_~blastFlag~0)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (= ssl3_accept_~s__state~0 8608)) (.cse7 (= ssl3_accept_~s__state~0 8640)) (.cse0 (not (= ssl3_accept_~s__hit~0 0))) (.cse1 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 .cse2) (and (<= ssl3_accept_~s__state~0 8576) .cse3 .cse4) (and .cse0 .cse5 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse3 (= ssl3_accept_~s__state~0 8512)) (and .cse3 .cse1 (= 8560 ssl3_accept_~s__state~0)) (and .cse3 .cse4 .cse5 .cse1) (and (= ssl3_accept_~blastFlag~0 1) (= 8496 ssl3_accept_~s__state~0)) (and .cse3 (= ssl3_accept_~s__state~0 8528)) (and .cse0 .cse6) (and .cse4 .cse1 (<= 8672 ssl3_accept_~s__state~0) .cse6) (and .cse7 .cse3 .cse4 .cse1) (and (= ssl3_accept_~s__state~0 8544) .cse3 .cse1) (and (= ssl3_accept_~s__state~0 8656) .cse3 .cse4) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse6) (= ssl3_accept_~s__state~0 3) (and .cse3 .cse0) (and .cse3 .cse4 .cse1 .cse2) (and .cse7 .cse0 .cse1))) [2022-04-07 00:51:11,168 INFO L878 garLoopResultBuilder]: At program point L361(lines 361 369) the Hoare annotation is: (let ((.cse1 (<= ssl3_accept_~s__state~0 8576)) (.cse2 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse3 (not (= ssl3_accept_~s__hit~0 0))) (.cse4 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_accept_~blastFlag~0)) (and .cse2 .cse3 .cse4) (and .cse0 .cse3 .cse4))) [2022-04-07 00:51:11,168 INFO L878 garLoopResultBuilder]: At program point L362(lines 338 380) the Hoare annotation is: (let ((.cse1 (<= ssl3_accept_~s__state~0 8576)) (.cse2 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse3 (not (= ssl3_accept_~s__hit~0 0))) (.cse4 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_accept_~blastFlag~0)) (and .cse2 .cse3 .cse4) (and .cse0 .cse3 .cse4))) [2022-04-07 00:51:11,168 INFO L878 garLoopResultBuilder]: At program point L197(lines 197 561) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576)) (.cse6 (= 3 ssl3_accept_~blastFlag~0)) (.cse5 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse4 (= 2 ssl3_accept_~blastFlag~0)) (.cse3 (= ssl3_accept_~s__state~0 8640)) (.cse1 (not (= ssl3_accept_~s__hit~0 0))) (.cse2 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (= ssl3_accept_~blastFlag~0 0) (and .cse0 .cse5) (and .cse1 .cse6) (and .cse5 .cse2 (<= 8672 ssl3_accept_~s__state~0) .cse6) (and (= ssl3_accept_~s__state~0 8656) .cse4 .cse5) (= ssl3_accept_~s__state~0 3) (and .cse4 .cse1) (and .cse3 .cse1 .cse2))) [2022-04-07 00:51:11,168 INFO L878 garLoopResultBuilder]: At program point L164(lines 164 572) the Hoare annotation is: (let ((.cse5 (= ssl3_accept_~s__state~0 8592)) (.cse6 (= 3 ssl3_accept_~blastFlag~0)) (.cse3 (= 2 ssl3_accept_~blastFlag~0)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (= ssl3_accept_~s__state~0 8608)) (.cse7 (= ssl3_accept_~s__state~0 8640)) (.cse0 (not (= ssl3_accept_~s__hit~0 0))) (.cse1 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 .cse2) (and (<= ssl3_accept_~s__state~0 8576) .cse3 .cse4) (and .cse0 .cse5 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse3 .cse1 (= 8560 ssl3_accept_~s__state~0)) (and .cse3 .cse4 .cse5 .cse1) (and .cse0 .cse6) (and .cse4 .cse1 (<= 8672 ssl3_accept_~s__state~0) .cse6) (and .cse7 .cse3 .cse4 .cse1) (and (= ssl3_accept_~s__state~0 8544) .cse3 .cse1) (and (= ssl3_accept_~s__state~0 8656) .cse3 .cse4) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse6) (= ssl3_accept_~s__state~0 3) (and .cse3 .cse0) (and .cse3 .cse4 .cse1 .cse2) (and .cse7 .cse0 .cse1))) [2022-04-07 00:51:11,168 INFO L878 garLoopResultBuilder]: At program point L131(lines 131 583) the Hoare annotation is: (let ((.cse5 (= ssl3_accept_~s__state~0 8592)) (.cse6 (= 3 ssl3_accept_~blastFlag~0)) (.cse3 (= 2 ssl3_accept_~blastFlag~0)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (= ssl3_accept_~s__state~0 8608)) (.cse7 (= ssl3_accept_~s__state~0 8640)) (.cse0 (not (= ssl3_accept_~s__hit~0 0))) (.cse1 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 .cse2) (and (<= ssl3_accept_~s__state~0 8576) .cse3 .cse4) (and .cse0 .cse5 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse3 (= ssl3_accept_~s__state~0 8512)) (and .cse3 .cse1 (= 8560 ssl3_accept_~s__state~0)) (and .cse3 .cse4 .cse5 .cse1) (and (= ssl3_accept_~blastFlag~0 1) (= 8496 ssl3_accept_~s__state~0)) (and .cse3 (= ssl3_accept_~s__state~0 8528)) (and .cse0 .cse6) (and .cse4 .cse1 (<= 8672 ssl3_accept_~s__state~0) .cse6) (and .cse7 .cse3 .cse4 .cse1) (and (= ssl3_accept_~s__state~0 8544) .cse3 .cse1) (and (= ssl3_accept_~s__state~0 8656) .cse3 .cse4) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse6) (= ssl3_accept_~s__state~0 3) (and .cse3 .cse0) (and .cse3 .cse4 .cse1 .cse2) (and .cse7 .cse0 .cse1))) [2022-04-07 00:51:11,169 INFO L878 garLoopResultBuilder]: At program point ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION(line 618) the Hoare annotation is: false [2022-04-07 00:51:11,169 INFO L878 garLoopResultBuilder]: At program point L594(lines 594 596) the Hoare annotation is: (let ((.cse5 (= ssl3_accept_~s__state~0 8592)) (.cse6 (= 3 ssl3_accept_~blastFlag~0)) (.cse3 (= 2 ssl3_accept_~blastFlag~0)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (= ssl3_accept_~s__state~0 8608)) (.cse7 (= ssl3_accept_~s__state~0 8640)) (.cse0 (not (= ssl3_accept_~s__hit~0 0))) (.cse1 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 .cse2) (and (<= ssl3_accept_~s__state~0 8576) .cse3 .cse4) (and .cse0 .cse5 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse3 (= ssl3_accept_~s__state~0 8512)) (and .cse3 .cse1 (= 8560 ssl3_accept_~s__state~0)) (and .cse3 .cse4 .cse5 .cse1) (and (= ssl3_accept_~blastFlag~0 1) (= 8496 ssl3_accept_~s__state~0)) (and .cse3 (= ssl3_accept_~s__state~0 8528)) (and .cse0 .cse6) (and .cse4 .cse1 (<= 8672 ssl3_accept_~s__state~0) .cse6) (and .cse7 .cse3 .cse4 .cse1) (and (= ssl3_accept_~s__state~0 8544) .cse3 .cse1) (and (= ssl3_accept_~s__state~0 8656) .cse3 .cse4) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse6) (= ssl3_accept_~s__state~0 3) (and .cse3 .cse0) (and .cse3 .cse4 .cse1 .cse2) (and .cse7 .cse0 .cse1))) [2022-04-07 00:51:11,169 INFO L878 garLoopResultBuilder]: At program point L429(lines 429 431) the Hoare annotation is: (let ((.cse1 (<= ssl3_accept_~s__state~0 8576)) (.cse2 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse3 (not (= ssl3_accept_~s__hit~0 0))) (.cse4 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_accept_~blastFlag~0)) (and .cse2 .cse3 .cse4) (and .cse0 .cse3 .cse4))) [2022-04-07 00:51:11,169 INFO L878 garLoopResultBuilder]: At program point L396(lines 387 419) the Hoare annotation is: (let ((.cse1 (<= ssl3_accept_~s__state~0 8576)) (.cse2 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse3 (not (= ssl3_accept_~s__hit~0 0))) (.cse4 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_accept_~blastFlag~0)) (and .cse2 .cse3 .cse4) (and .cse0 .cse3 .cse4))) [2022-04-07 00:51:11,169 INFO L878 garLoopResultBuilder]: At program point L132(lines 128 584) the Hoare annotation is: (let ((.cse1 (<= ssl3_accept_~s__state~0 8576)) (.cse2 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse3 (not (= ssl3_accept_~s__hit~0 0))) (.cse4 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1) (and .cse1 .cse2 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and .cse3 .cse4 (= 3 ssl3_accept_~blastFlag~0)) (and .cse2 .cse3 .cse4) (and .cse0 .cse3 .cse4))) [2022-04-07 00:51:11,169 INFO L878 garLoopResultBuilder]: At program point L364(lines 364 366) the Hoare annotation is: (let ((.cse1 (<= ssl3_accept_~s__state~0 8576)) (.cse2 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse3 (not (= ssl3_accept_~s__hit~0 0))) (.cse4 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_accept_~blastFlag~0)) (and .cse2 .cse3 .cse4) (and .cse0 .cse3 .cse4))) [2022-04-07 00:51:11,169 INFO L878 garLoopResultBuilder]: At program point L298(lines 298 300) the Hoare annotation is: (let ((.cse2 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse3 (not (= ssl3_accept_~s__hit~0 0))) (.cse4 (<= ssl3_accept_~s__state~0 8672)) (.cse5 (= ssl3_accept_~blastFlag~0 1)) (.cse1 (<= ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1) (and .cse1 .cse2 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and .cse3 .cse4 (= 3 ssl3_accept_~blastFlag~0)) (and .cse2 .cse3 .cse4) (and .cse5 .cse3 .cse4) (and .cse0 .cse3 .cse4) (and .cse5 .cse1))) [2022-04-07 00:51:11,169 INFO L878 garLoopResultBuilder]: At program point L232(lines 232 234) the Hoare annotation is: (let ((.cse0 (= 2 ssl3_accept_~blastFlag~0)) (.cse1 (not (= ssl3_accept_~s__hit~0 0)))) (or (and (<= ssl3_accept_~s__state~0 8576) .cse0 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (= ssl3_accept_~blastFlag~0 0) (and .cse1 (= 3 ssl3_accept_~blastFlag~0)) (and .cse0 .cse1))) [2022-04-07 00:51:11,169 INFO L878 garLoopResultBuilder]: At program point L298-2(lines 219 552) the Hoare annotation is: (let ((.cse1 (<= ssl3_accept_~s__state~0 8576)) (.cse2 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse3 (not (= ssl3_accept_~s__hit~0 0))) (.cse4 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_accept_~blastFlag~0)) (and .cse2 .cse3 .cse4) (and .cse0 .cse3 .cse4))) [2022-04-07 00:51:11,169 INFO L878 garLoopResultBuilder]: At program point L530(lines 530 534) 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 .cse0 (= 2 ssl3_accept_~blastFlag~0) .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:11,169 INFO L878 garLoopResultBuilder]: At program point L530-2(lines 530 534) the Hoare annotation is: (let ((.cse2 (= 3 ssl3_accept_~blastFlag~0)) (.cse3 (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse4 (= ssl3_accept_~blastFlag~0 0)) (.cse0 (= 8448 ssl3_accept_~s__state~0)) (.cse1 (not (= ssl3_accept_~s__hit~0 0)))) (or (and .cse0 (= 2 ssl3_accept_~blastFlag~0) .cse1) (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse2) (and .cse4 .cse0 .cse3) (and .cse4 .cse0 .cse1))) [2022-04-07 00:51:11,169 INFO L878 garLoopResultBuilder]: At program point L332(lines 332 336) the Hoare annotation is: (let ((.cse1 (<= ssl3_accept_~s__state~0 8576)) (.cse2 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse3 (not (= ssl3_accept_~s__hit~0 0))) (.cse4 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_accept_~blastFlag~0)) (and .cse2 .cse3 .cse4) (and .cse0 .cse3 .cse4))) [2022-04-07 00:51:11,169 INFO L878 garLoopResultBuilder]: At program point L332-2(lines 219 552) the Hoare annotation is: (let ((.cse1 (<= ssl3_accept_~s__state~0 8576)) (.cse2 (= 2 ssl3_accept_~blastFlag~0)) (.cse0 (= ssl3_accept_~blastFlag~0 0)) (.cse3 (not (= ssl3_accept_~s__hit~0 0))) (.cse4 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_accept_~blastFlag~0)) (and .cse2 .cse3 .cse4) (and .cse0 .cse3 .cse4))) [2022-04-07 00:51:11,169 INFO L878 garLoopResultBuilder]: At program point L200(lines 200 560) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576)) (.cse3 (= 3 ssl3_accept_~blastFlag~0)) (.cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse4 (= 2 ssl3_accept_~blastFlag~0)) (.cse2 (not (= ssl3_accept_~s__hit~0 0)))) (or (= ssl3_accept_~blastFlag~0 0) (and .cse0 .cse1) (and .cse0 .cse2) (and .cse2 .cse3) (and .cse1 (<= ssl3_accept_~s__state~0 8672) (<= 8672 ssl3_accept_~s__state~0) .cse3) (and (= ssl3_accept_~s__state~0 8656) .cse4 .cse1) (= ssl3_accept_~s__state~0 3) (and .cse4 .cse2))) [2022-04-07 00:51:11,169 INFO L878 garLoopResultBuilder]: At program point L167(lines 167 571) the Hoare annotation is: (let ((.cse5 (= ssl3_accept_~s__state~0 8592)) (.cse6 (= 3 ssl3_accept_~blastFlag~0)) (.cse3 (= 2 ssl3_accept_~blastFlag~0)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (= ssl3_accept_~s__state~0 8608)) (.cse7 (= ssl3_accept_~s__state~0 8640)) (.cse0 (not (= ssl3_accept_~s__hit~0 0))) (.cse1 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 .cse2) (and (<= ssl3_accept_~s__state~0 8576) .cse3 .cse4) (and .cse0 .cse5 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse3 .cse1 (= 8560 ssl3_accept_~s__state~0)) (and .cse3 .cse4 .cse5 .cse1) (and .cse0 .cse6) (and .cse4 .cse1 (<= 8672 ssl3_accept_~s__state~0) .cse6) (and .cse7 .cse3 .cse4 .cse1) (and (= ssl3_accept_~s__state~0 8656) .cse3 .cse4) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse6) (= ssl3_accept_~s__state~0 3) (and .cse3 .cse0) (and .cse3 .cse4 .cse1 .cse2) (and .cse7 .cse0 .cse1))) [2022-04-07 00:51:11,170 INFO L878 garLoopResultBuilder]: At program point L134(lines 134 582) the Hoare annotation is: (let ((.cse5 (= ssl3_accept_~s__state~0 8592)) (.cse6 (= 3 ssl3_accept_~blastFlag~0)) (.cse3 (= 2 ssl3_accept_~blastFlag~0)) (.cse4 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (= ssl3_accept_~s__state~0 8608)) (.cse7 (= ssl3_accept_~s__state~0 8640)) (.cse0 (not (= ssl3_accept_~s__hit~0 0))) (.cse1 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 .cse2) (and (<= ssl3_accept_~s__state~0 8576) .cse3 .cse4) (and .cse0 .cse5 .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse3 (= ssl3_accept_~s__state~0 8512)) (and .cse3 .cse1 (= 8560 ssl3_accept_~s__state~0)) (and .cse3 .cse4 .cse5 .cse1) (and (= ssl3_accept_~blastFlag~0 1) (= 8496 ssl3_accept_~s__state~0)) (and .cse3 (= ssl3_accept_~s__state~0 8528)) (and .cse0 .cse6) (and .cse4 .cse1 (<= 8672 ssl3_accept_~s__state~0) .cse6) (and .cse7 .cse3 .cse4 .cse1) (and (= ssl3_accept_~s__state~0 8544) .cse3 .cse1) (and (= ssl3_accept_~s__state~0 8656) .cse3 .cse4) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse6) (= ssl3_accept_~s__state~0 3) (and .cse3 .cse0) (and .cse3 .cse4 .cse1 .cse2) (and .cse7 .cse0 .cse1))) [2022-04-07 00:51:11,170 INFO L878 garLoopResultBuilder]: At program point L101(lines 101 105) the Hoare annotation is: (= ssl3_accept_~blastFlag~0 0) [2022-04-07 00:51:11,170 INFO L878 garLoopResultBuilder]: At program point L101-1(lines 83 620) the Hoare annotation is: (= ssl3_accept_~blastFlag~0 0) [2022-04-07 00:51:11,170 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-07 00:51:11,170 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:11,170 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-07 00:51:11,170 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-07 00:51:11,170 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-07 00:51:11,170 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-07 00:51:11,170 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-07 00:51:11,172 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] [2022-04-07 00:51:11,173 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 00:51:11,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 12:51:11 BoogieIcfgContainer [2022-04-07 00:51:11,191 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 00:51:11,192 INFO L158 Benchmark]: Toolchain (without parser) took 54145.97ms. Allocated memory was 178.3MB in the beginning and 767.6MB in the end (delta: 589.3MB). Free memory was 119.4MB in the beginning and 544.0MB in the end (delta: -424.7MB). Peak memory consumption was 451.5MB. Max. memory is 8.0GB. [2022-04-07 00:51:11,192 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 178.3MB. Free memory is still 136.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 00:51:11,192 INFO L158 Benchmark]: CACSL2BoogieTranslator took 340.54ms. Allocated memory was 178.3MB in the beginning and 255.9MB in the end (delta: 77.6MB). Free memory was 119.2MB in the beginning and 222.2MB in the end (delta: -103.0MB). Peak memory consumption was 10.4MB. Max. memory is 8.0GB. [2022-04-07 00:51:11,192 INFO L158 Benchmark]: Boogie Preprocessor took 52.03ms. Allocated memory is still 255.9MB. Free memory was 222.2MB in the beginning and 219.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-04-07 00:51:11,192 INFO L158 Benchmark]: RCFGBuilder took 576.60ms. Allocated memory is still 255.9MB. Free memory was 219.6MB in the beginning and 191.8MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-04-07 00:51:11,192 INFO L158 Benchmark]: TraceAbstraction took 53170.13ms. Allocated memory was 255.9MB in the beginning and 767.6MB in the end (delta: 511.7MB). Free memory was 191.3MB in the beginning and 544.0MB in the end (delta: -352.8MB). Peak memory consumption was 445.7MB. Max. memory is 8.0GB. [2022-04-07 00:51:11,193 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.13ms. Allocated memory is still 178.3MB. Free memory is still 136.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 340.54ms. Allocated memory was 178.3MB in the beginning and 255.9MB in the end (delta: 77.6MB). Free memory was 119.2MB in the beginning and 222.2MB in the end (delta: -103.0MB). Peak memory consumption was 10.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.03ms. Allocated memory is still 255.9MB. Free memory was 222.2MB in the beginning and 219.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 576.60ms. Allocated memory is still 255.9MB. Free memory was 219.6MB in the beginning and 191.8MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * TraceAbstraction took 53170.13ms. Allocated memory was 255.9MB in the beginning and 767.6MB in the end (delta: 511.7MB). Free memory was 191.3MB in the beginning and 544.0MB in the end (delta: -352.8MB). Peak memory consumption was 445.7MB. 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: 618]: 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: 53.1s, OverallIterations: 21, TraceHistogramMax: 19, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 23.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5836 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5834 mSDsluCounter, 5386 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 159 mSDsCounter, 468 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4988 IncrementalHoareTripleChecker+Invalid, 5456 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 468 mSolverCounterUnsat, 5227 mSDtfsCounter, 4988 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2120 GetRequests, 2046 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2636occurred in iteration=19, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 21 MinimizatonAttempts, 2732 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 150 LocationsWithAnnotation, 150 PreInvPairs, 2781 NumberOfFragments, 9501 HoareAnnotationTreeSize, 150 FomulaSimplifications, 10252 FormulaSimplificationTreeSizeReduction, 4.8s HoareSimplificationTime, 150 FomulaSimplificationsInter, 55621 FormulaSimplificationTreeSizeReductionInter, 18.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: (((blastFlag == 0 && s__state <= 8672) || ((!(s__hit == 0) && s__state <= 8672) && 3 == blastFlag)) || ((2 == blastFlag && !(s__hit == 0)) && s__state <= 8672)) || ((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672) - InvariantResult [Line: 338]: Loop Invariant Derived loop invariant: ((((blastFlag == 0 && s__state <= 8576) || (s__state <= 8576 && 2 == blastFlag)) || ((!(s__hit == 0) && s__state <= 8672) && 3 == blastFlag)) || ((2 == blastFlag && !(s__hit == 0)) && s__state <= 8672)) || ((blastFlag == 0 && !(s__hit == 0)) && s__state <= 8672) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(s__hit == 0) && s__state <= 8672) && s__state == 8608) || ((s__state <= 8576 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576)) || ((!(s__hit == 0) && s__state == 8592) && s__state <= 8672)) || blastFlag == 0) || (2 == blastFlag && s__state == 8512)) || ((2 == blastFlag && s__state <= 8672) && 8560 == s__state)) || (((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && s__state == 8592) && s__state <= 8672)) || (blastFlag == 1 && 8496 == s__state)) || (2 == blastFlag && s__state == 8528)) || (!(s__hit == 0) && 3 == blastFlag)) || (((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8672) && 8672 <= s__state) && 3 == blastFlag)) || (((s__state == 8640 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672)) || ((s__state == 8544 && 2 == blastFlag) && s__state <= 8672)) || ((s__state == 8656 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576)) || ((8448 == s__state && 3 == s__s3__tmp__next_state___0) && 3 == blastFlag)) || s__state == 3) || (2 == blastFlag && !(s__hit == 0))) || (((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672) && s__state == 8608)) || ((s__state == 8640 && !(s__hit == 0)) && s__state <= 8672) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: ((((blastFlag == 0 && s__state <= 8576) || (s__state <= 8576 && 2 == blastFlag)) || ((!(s__hit == 0) && s__state <= 8672) && 3 == blastFlag)) || ((2 == blastFlag && !(s__hit == 0)) && s__state <= 8672)) || ((blastFlag == 0 && !(s__hit == 0)) && s__state <= 8672) - 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) && s__state <= 8672) && 3 == blastFlag)) || ((2 == blastFlag && !(s__hit == 0)) && s__state <= 8672)) || ((blastFlag == 0 && !(s__hit == 0)) && s__state <= 8672) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((((8448 == s__state && 2 == blastFlag) && !(s__hit == 0)) || ((8448 == s__state && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576)) || ((8448 == s__state && !(s__hit == 0)) && 3 == blastFlag)) || (blastFlag == 0 && 8448 == s__state)) || ((8448 == s__state && 3 == s__s3__tmp__next_state___0) && 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) && s__state <= 8672) && 3 == blastFlag)) || ((2 == blastFlag && !(s__hit == 0)) && s__state <= 8672)) || ((blastFlag == 0 && !(s__hit == 0)) && s__state <= 8672) - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: ((!(s__hit == 0) && s__state <= 8672) || (blastFlag == 0 && s__state <= 8672)) || ((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672) - 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) && s__state <= 8672) && 3 == blastFlag)) || ((2 == blastFlag && !(s__hit == 0)) && s__state <= 8672)) || ((blastFlag == 1 && !(s__hit == 0)) && s__state <= 8672)) || ((blastFlag == 0 && !(s__hit == 0)) && s__state <= 8672)) || (blastFlag == 1 && s__state <= 8576) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: ((!(s__hit == 0) && s__state <= 8672) || ((s__state == 8640 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576)) || (blastFlag == 0 && s__state <= 8672) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: (((blastFlag == 0 && 8672 <= s__state) || ((2 == blastFlag && !(s__hit == 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: s__state <= 8672 - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((blastFlag == 0 && s__state <= 8672) || ((!(s__hit == 0) && s__state <= 8672) && 3 == blastFlag)) || ((2 == blastFlag && !(s__hit == 0)) && s__state <= 8672)) || ((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && 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) && s__state <= 8672) && 3 == blastFlag)) || ((2 == blastFlag && !(s__hit == 0)) && s__state <= 8672)) || ((blastFlag == 0 && !(s__hit == 0)) && s__state <= 8672) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: ((((blastFlag == 0 && s__state <= 8576) || (s__state <= 8576 && 2 == blastFlag)) || ((!(s__hit == 0) && s__state <= 8672) && 3 == blastFlag)) || ((2 == blastFlag && !(s__hit == 0)) && s__state <= 8672)) || ((blastFlag == 0 && !(s__hit == 0)) && s__state <= 8672) - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: ((((blastFlag == 0 && s__state <= 8576) || (s__state <= 8576 && 2 == blastFlag)) || ((!(s__hit == 0) && s__state <= 8672) && 3 == blastFlag)) || ((2 == blastFlag && !(s__hit == 0)) && s__state <= 8672)) || ((blastFlag == 0 && !(s__hit == 0)) && s__state <= 8672) - InvariantResult [Line: 399]: Loop Invariant Derived loop invariant: ((((blastFlag == 0 && s__state <= 8576) || (s__state <= 8576 && 2 == blastFlag)) || ((!(s__hit == 0) && s__state <= 8672) && 3 == blastFlag)) || ((2 == blastFlag && !(s__hit == 0)) && s__state <= 8672)) || ((blastFlag == 0 && !(s__hit == 0)) && s__state <= 8672) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ((blastFlag == 0 && 8672 <= s__state) || ((2 == blastFlag && !(s__hit == 0)) && 8672 <= s__state)) || ((!(s__hit == 0) && 8672 <= s__state) && 3 == blastFlag) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: ((((s__state <= 8576 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) || blastFlag == 0) || (!(s__hit == 0) && 3 == blastFlag)) || (2 == blastFlag && !(s__hit == 0)) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: ((!(s__hit == 0) && s__state <= 8672) || (blastFlag == 0 && s__state <= 8672)) || ((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(s__hit == 0) && s__state <= 8672) && s__state == 8608) || ((s__state <= 8576 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576)) || ((!(s__hit == 0) && s__state == 8592) && s__state <= 8672)) || blastFlag == 0) || (2 == blastFlag && s__state == 8512)) || ((2 == blastFlag && s__state <= 8672) && 8560 == s__state)) || (((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && s__state == 8592) && s__state <= 8672)) || (blastFlag == 1 && 8496 == s__state)) || (2 == blastFlag && s__state == 8528)) || (!(s__hit == 0) && 3 == blastFlag)) || (((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8672) && 8672 <= s__state) && 3 == blastFlag)) || (((s__state == 8640 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672)) || ((s__state == 8544 && 2 == blastFlag) && s__state <= 8672)) || ((s__state == 8656 && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576)) || ((8448 == s__state && 3 == s__s3__tmp__next_state___0) && 3 == blastFlag)) || s__state == 3) || (2 == blastFlag && !(s__hit == 0))) || (((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672) && s__state == 8608)) || ((s__state == 8640 && !(s__hit == 0)) && s__state <= 8672) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((((blastFlag == 0 && s__state <= 8576) || (s__state <= 8576 && 2 == blastFlag)) || ((!(s__hit == 0) && s__state <= 8672) && 3 == blastFlag)) || ((2 == blastFlag && !(s__hit == 0)) && s__state <= 8672)) || ((blastFlag == 0 && !(s__hit == 0)) && s__state <= 8672) - ProcedureContractResult [Line: 622]: 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:11,243 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...