/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_11.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 08:14:00,436 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 08:14:00,437 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 08:14:00,463 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 08:14:00,472 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 08:14:00,473 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 08:14:00,473 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 08:14:00,475 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 08:14:00,476 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 08:14:00,476 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 08:14:00,477 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 08:14:00,477 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 08:14:00,478 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 08:14:00,478 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 08:14:00,479 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 08:14:00,480 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 08:14:00,480 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 08:14:00,481 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 08:14:00,482 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 08:14:00,483 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 08:14:00,484 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 08:14:00,485 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 08:14:00,485 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 08:14:00,486 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 08:14:00,487 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 08:14:00,488 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 08:14:00,489 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 08:14:00,489 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 08:14:00,489 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 08:14:00,490 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 08:14:00,490 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 08:14:00,491 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 08:14:00,491 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 08:14:00,492 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 08:14:00,492 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 08:14:00,493 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 08:14:00,493 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 08:14:00,493 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 08:14:00,494 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 08:14:00,494 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 08:14:00,494 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 08:14:00,495 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 08:14:00,495 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 08:14:00,501 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 08:14:00,502 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 08:14:00,502 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 08:14:00,502 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 08:14:00,503 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 08:14:00,503 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 08:14:00,503 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 08:14:00,503 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 08:14:00,503 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 08:14:00,503 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 08:14:00,503 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 08:14:00,503 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 08:14:00,504 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 08:14:00,504 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 08:14:00,504 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 08:14:00,504 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 08:14:00,504 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 08:14:00,504 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 08:14:00,504 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:14:00,504 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 08:14:00,504 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 08:14:00,505 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 08:14:00,505 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 08:14:00,505 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 08:14:00,505 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 08:14:00,505 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-28 08:14:00,648 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 08:14:00,673 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 08:14:00,675 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 08:14:00,676 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 08:14:00,678 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 08:14:00,679 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_11.cil.c [2022-04-28 08:14:00,745 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8797ad24f/285fd5bbee8c4c01b779f966c3a7dfd1/FLAGad8077a6d [2022-04-28 08:14:01,117 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 08:14:01,117 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_11.cil.c [2022-04-28 08:14:01,129 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8797ad24f/285fd5bbee8c4c01b779f966c3a7dfd1/FLAGad8077a6d [2022-04-28 08:14:01,138 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8797ad24f/285fd5bbee8c4c01b779f966c3a7dfd1 [2022-04-28 08:14:01,141 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 08:14:01,144 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 08:14:01,145 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 08:14:01,145 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 08:14:01,148 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 08:14:01,148 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:14:01" (1/1) ... [2022-04-28 08:14:01,150 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60f4b12c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:14:01, skipping insertion in model container [2022-04-28 08:14:01,150 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:14:01" (1/1) ... [2022-04-28 08:14:01,155 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 08:14:01,185 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 08:14:01,445 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_11.cil.c[43646,43659] [2022-04-28 08:14:01,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:14:01,461 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 08:14:01,527 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_11.cil.c[43646,43659] [2022-04-28 08:14:01,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:14:01,538 INFO L208 MainTranslator]: Completed translation [2022-04-28 08:14:01,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:14:01 WrapperNode [2022-04-28 08:14:01,539 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 08:14:01,539 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 08:14:01,539 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 08:14:01,539 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 08:14:01,547 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:14:01" (1/1) ... [2022-04-28 08:14:01,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:14:01" (1/1) ... [2022-04-28 08:14:01,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:14:01" (1/1) ... [2022-04-28 08:14:01,553 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:14:01" (1/1) ... [2022-04-28 08:14:01,579 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:14:01" (1/1) ... [2022-04-28 08:14:01,600 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:14:01" (1/1) ... [2022-04-28 08:14:01,602 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:14:01" (1/1) ... [2022-04-28 08:14:01,604 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 08:14:01,605 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 08:14:01,605 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 08:14:01,605 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 08:14:01,611 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:14:01" (1/1) ... [2022-04-28 08:14:01,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:14:01,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:14:01,646 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-28 08:14:01,648 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-28 08:14:01,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 08:14:01,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 08:14:01,678 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 08:14:01,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-28 08:14:01,678 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 08:14:01,678 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 08:14:01,679 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 08:14:01,679 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 08:14:01,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 08:14:01,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-28 08:14:01,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 08:14:01,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-28 08:14:01,682 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-28 08:14:01,682 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-28 08:14:01,682 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 08:14:01,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 08:14:01,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 08:14:01,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 08:14:01,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 08:14:01,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 08:14:01,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 08:14:01,769 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 08:14:01,770 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 08:14:01,841 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:14:02,234 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-04-28 08:14:02,234 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-04-28 08:14:02,242 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 08:14:02,248 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 08:14:02,248 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 08:14:02,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:14:02 BoogieIcfgContainer [2022-04-28 08:14:02,254 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 08:14:02,256 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 08:14:02,256 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 08:14:02,258 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 08:14:02,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 08:14:01" (1/3) ... [2022-04-28 08:14:02,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@175b7f86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:14:02, skipping insertion in model container [2022-04-28 08:14:02,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:14:01" (2/3) ... [2022-04-28 08:14:02,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@175b7f86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:14:02, skipping insertion in model container [2022-04-28 08:14:02,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:14:02" (3/3) ... [2022-04-28 08:14:02,260 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_11.cil.c [2022-04-28 08:14:02,270 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 08:14:02,270 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 08:14:02,306 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 08:14:02,310 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@35325722, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1390114f [2022-04-28 08:14:02,310 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 08:14:02,316 INFO L276 IsEmpty]: Start isEmpty. Operand has 158 states, 150 states have (on average 1.7266666666666666) internal successors, (259), 151 states have internal predecessors, (259), 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-28 08:14:02,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 08:14:02,323 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:14:02,323 INFO L195 NwaCegarLoop]: 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] [2022-04-28 08:14:02,323 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:14:02,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:14:02,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1730008188, now seen corresponding path program 1 times [2022-04-28 08:14:02,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:02,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [810176561] [2022-04-28 08:14:02,338 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:14:02,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1730008188, now seen corresponding path program 2 times [2022-04-28 08:14:02,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:14:02,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965786769] [2022-04-28 08:14:02,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:14:02,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:14:02,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:02,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:14:02,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:02,537 INFO L290 TraceCheckUtils]: 0: Hoare triple {167#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {161#true} is VALID [2022-04-28 08:14:02,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-28 08:14:02,537 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {161#true} {161#true} #657#return; {161#true} is VALID [2022-04-28 08:14:02,539 INFO L272 TraceCheckUtils]: 0: Hoare triple {161#true} call ULTIMATE.init(); {167#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:14:02,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {167#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {161#true} is VALID [2022-04-28 08:14:02,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-28 08:14:02,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161#true} {161#true} #657#return; {161#true} is VALID [2022-04-28 08:14:02,540 INFO L272 TraceCheckUtils]: 4: Hoare triple {161#true} call #t~ret60 := main(); {161#true} is VALID [2022-04-28 08:14:02,540 INFO L290 TraceCheckUtils]: 5: Hoare triple {161#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {161#true} is VALID [2022-04-28 08:14:02,540 INFO L272 TraceCheckUtils]: 6: Hoare triple {161#true} call #t~ret59 := ssl3_accept(~s~0); {161#true} is VALID [2022-04-28 08:14:02,546 INFO L290 TraceCheckUtils]: 7: Hoare triple {161#true} ~initial_state := #in~initial_state;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__info_callback~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__in_handshake~0 := #t~nondet5;havoc #t~nondet5;havoc ~s__state~0;havoc ~s__new_session~0;havoc ~s__server~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__version~0 := #t~nondet6;havoc #t~nondet6;havoc ~s__type~0;havoc ~s__init_num~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__hit~0 := #t~nondet7;havoc #t~nondet7;havoc ~s__rwstate~0;~s__init_buf___0~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~s__debug~0 := #t~nondet8;havoc #t~nondet8;havoc ~s__shutdown~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~s__cert~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~s__options~0 := #t~nondet10;havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~s__verify_mode~0 := #t~nondet11;havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~s__session__peer~0 := #t~nondet12;havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~s__cert__pkeys__AT0__privatekey~0 := #t~nondet13;havoc #t~nondet13;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~s__ctx__info_callback~0 := #t~nondet14;havoc #t~nondet14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~s__ctx__stats__sess_accept_renegotiate~0 := #t~nondet15;havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~s__ctx__stats__sess_accept~0 := #t~nondet16;havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~s__ctx__stats__sess_accept_good~0 := #t~nondet17;havoc #t~nondet17;havoc ~s__s3__tmp__cert_request~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet19;havoc #t~nondet19;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~num1~0 := #t~nondet20;havoc #t~nondet20;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___1~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___2~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___3~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___4~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___5~0 := #t~nondet25;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___6~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___7~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___8~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___9~0 := #t~nondet29;havoc #t~nondet29;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___10~0 := #t~nondet30;havoc #t~nondet30;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;~__cil_tmp58~0 := #t~nondet31;havoc #t~nondet31;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;havoc ~__cil_tmp61~0;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~0 := #t~nondet32;havoc #t~nondet32;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {161#true} is VALID [2022-04-28 08:14:02,546 INFO L290 TraceCheckUtils]: 8: Hoare triple {161#true} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {161#true} is VALID [2022-04-28 08:14:02,546 INFO L290 TraceCheckUtils]: 9: Hoare triple {161#true} #t~post33 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post33;havoc #t~post33; {161#true} is VALID [2022-04-28 08:14:02,547 INFO L290 TraceCheckUtils]: 10: Hoare triple {161#true} assume !(0 != 12288 + ~tmp___1~0); {161#true} is VALID [2022-04-28 08:14:02,547 INFO L290 TraceCheckUtils]: 11: Hoare triple {161#true} assume !(0 == ~s__cert~0); {161#true} is VALID [2022-04-28 08:14:02,547 INFO L290 TraceCheckUtils]: 12: Hoare triple {161#true} assume !false; {161#true} is VALID [2022-04-28 08:14:02,547 INFO L290 TraceCheckUtils]: 13: Hoare triple {161#true} ~state~0 := ~s__state~0; {161#true} is VALID [2022-04-28 08:14:02,547 INFO L290 TraceCheckUtils]: 14: Hoare triple {161#true} assume !(12292 == ~s__state~0); {161#true} is VALID [2022-04-28 08:14:02,547 INFO L290 TraceCheckUtils]: 15: Hoare triple {161#true} assume !(16384 == ~s__state~0); {161#true} is VALID [2022-04-28 08:14:02,548 INFO L290 TraceCheckUtils]: 16: Hoare triple {161#true} assume !(8192 == ~s__state~0); {161#true} is VALID [2022-04-28 08:14:02,548 INFO L290 TraceCheckUtils]: 17: Hoare triple {161#true} assume !(24576 == ~s__state~0); {161#true} is VALID [2022-04-28 08:14:02,548 INFO L290 TraceCheckUtils]: 18: Hoare triple {161#true} assume !(8195 == ~s__state~0); {161#true} is VALID [2022-04-28 08:14:02,548 INFO L290 TraceCheckUtils]: 19: Hoare triple {161#true} assume 8480 == ~s__state~0; {161#true} is VALID [2022-04-28 08:14:02,548 INFO L290 TraceCheckUtils]: 20: Hoare triple {161#true} ~s__shutdown~0 := 0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~ret~0 := #t~nondet37;havoc #t~nondet37; {161#true} is VALID [2022-04-28 08:14:02,549 INFO L290 TraceCheckUtils]: 21: Hoare triple {161#true} assume !(~ret~0 <= 0);~s__s3__tmp__next_state___0~0 := 8482;~s__state~0 := 8448;~s__init_num~0 := 0; {166#(<= ssl3_accept_~s__state~0 8448)} is VALID [2022-04-28 08:14:02,549 INFO L290 TraceCheckUtils]: 22: Hoare triple {166#(<= ssl3_accept_~s__state~0 8448)} assume !(0 == ~s__s3__tmp__reuse_message~0); {166#(<= ssl3_accept_~s__state~0 8448)} is VALID [2022-04-28 08:14:02,550 INFO L290 TraceCheckUtils]: 23: Hoare triple {166#(<= ssl3_accept_~s__state~0 8448)} assume 8576 == ~state~0; {166#(<= ssl3_accept_~s__state~0 8448)} is VALID [2022-04-28 08:14:02,550 INFO L290 TraceCheckUtils]: 24: Hoare triple {166#(<= ssl3_accept_~s__state~0 8448)} assume 8592 == ~s__state~0; {162#false} is VALID [2022-04-28 08:14:02,550 INFO L290 TraceCheckUtils]: 25: Hoare triple {162#false} assume -12288 != ~tmp___1~0; {162#false} is VALID [2022-04-28 08:14:02,550 INFO L290 TraceCheckUtils]: 26: Hoare triple {162#false} assume -16384 != ~tmp___2~0; {162#false} is VALID [2022-04-28 08:14:02,551 INFO L290 TraceCheckUtils]: 27: Hoare triple {162#false} assume 4294967040 != ~__cil_tmp56~0 % 4294967296; {162#false} is VALID [2022-04-28 08:14:02,551 INFO L290 TraceCheckUtils]: 28: Hoare triple {162#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {162#false} is VALID [2022-04-28 08:14:02,551 INFO L290 TraceCheckUtils]: 29: Hoare triple {162#false} assume 1024 != ~tmp___7~0; {162#false} is VALID [2022-04-28 08:14:02,551 INFO L290 TraceCheckUtils]: 30: Hoare triple {162#false} assume 512 != ~tmp___7~0; {162#false} is VALID [2022-04-28 08:14:02,551 INFO L290 TraceCheckUtils]: 31: Hoare triple {162#false} assume !false; {162#false} is VALID [2022-04-28 08:14:02,551 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-28 08:14:02,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:14:02,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965786769] [2022-04-28 08:14:02,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965786769] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:02,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:02,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:14:02,554 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:14:02,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [810176561] [2022-04-28 08:14:02,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [810176561] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:02,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:02,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:14:02,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606291101] [2022-04-28 08:14:02,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:14:02,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 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 32 [2022-04-28 08:14:02,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:14:02,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 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-28 08:14:02,588 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:02,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:14:02,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:02,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:14:02,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:14:02,608 INFO L87 Difference]: Start difference. First operand has 158 states, 150 states have (on average 1.7266666666666666) internal successors, (259), 151 states have internal predecessors, (259), 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 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 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-28 08:14:03,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:03,401 INFO L93 Difference]: Finished difference Result 365 states and 628 transitions. [2022-04-28 08:14:03,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:14:03,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 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 32 [2022-04-28 08:14:03,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:14:03,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 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-28 08:14:03,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 628 transitions. [2022-04-28 08:14:03,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 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-28 08:14:03,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 628 transitions. [2022-04-28 08:14:03,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 628 transitions. [2022-04-28 08:14:03,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 628 edges. 628 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:03,851 INFO L225 Difference]: With dead ends: 365 [2022-04-28 08:14:03,851 INFO L226 Difference]: Without dead ends: 186 [2022-04-28 08:14:03,853 INFO L412 NwaCegarLoop]: 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-28 08:14:03,856 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 355 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 08:14:03,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 290 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 08:14:03,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-04-28 08:14:03,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2022-04-28 08:14:03,906 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:14:03,907 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand has 185 states, 180 states have (on average 1.4833333333333334) internal successors, (267), 180 states have internal predecessors, (267), 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-28 08:14:03,908 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand has 185 states, 180 states have (on average 1.4833333333333334) internal successors, (267), 180 states have internal predecessors, (267), 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-28 08:14:03,909 INFO L87 Difference]: Start difference. First operand 186 states. Second operand has 185 states, 180 states have (on average 1.4833333333333334) internal successors, (267), 180 states have internal predecessors, (267), 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-28 08:14:03,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:03,916 INFO L93 Difference]: Finished difference Result 186 states and 272 transitions. [2022-04-28 08:14:03,916 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 272 transitions. [2022-04-28 08:14:03,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:03,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:03,917 INFO L74 IsIncluded]: Start isIncluded. First operand has 185 states, 180 states have (on average 1.4833333333333334) internal successors, (267), 180 states have internal predecessors, (267), 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) Second operand 186 states. [2022-04-28 08:14:03,918 INFO L87 Difference]: Start difference. First operand has 185 states, 180 states have (on average 1.4833333333333334) internal successors, (267), 180 states have internal predecessors, (267), 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) Second operand 186 states. [2022-04-28 08:14:03,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:03,923 INFO L93 Difference]: Finished difference Result 186 states and 272 transitions. [2022-04-28 08:14:03,923 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 272 transitions. [2022-04-28 08:14:03,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:03,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:03,924 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:14:03,924 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:14:03,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 180 states have (on average 1.4833333333333334) internal successors, (267), 180 states have internal predecessors, (267), 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-28 08:14:03,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 271 transitions. [2022-04-28 08:14:03,944 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 271 transitions. Word has length 32 [2022-04-28 08:14:03,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:14:03,944 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 271 transitions. [2022-04-28 08:14:03,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 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-28 08:14:03,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 185 states and 271 transitions. [2022-04-28 08:14:04,139 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 271 edges. 271 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:04,139 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 271 transitions. [2022-04-28 08:14:04,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 08:14:04,140 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:14:04,140 INFO L195 NwaCegarLoop]: 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] [2022-04-28 08:14:04,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 08:14:04,141 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:14:04,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:14:04,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1886345113, now seen corresponding path program 1 times [2022-04-28 08:14:04,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:04,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [13692846] [2022-04-28 08:14:04,142 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:14:04,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1886345113, now seen corresponding path program 2 times [2022-04-28 08:14:04,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:14:04,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067043371] [2022-04-28 08:14:04,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:14:04,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:14:04,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:04,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:14:04,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:04,208 INFO L290 TraceCheckUtils]: 0: Hoare triple {1652#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1645#true} is VALID [2022-04-28 08:14:04,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {1645#true} assume true; {1645#true} is VALID [2022-04-28 08:14:04,208 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1645#true} {1645#true} #657#return; {1645#true} is VALID [2022-04-28 08:14:04,209 INFO L272 TraceCheckUtils]: 0: Hoare triple {1645#true} call ULTIMATE.init(); {1652#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:14:04,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {1652#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1645#true} is VALID [2022-04-28 08:14:04,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {1645#true} assume true; {1645#true} is VALID [2022-04-28 08:14:04,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1645#true} {1645#true} #657#return; {1645#true} is VALID [2022-04-28 08:14:04,210 INFO L272 TraceCheckUtils]: 4: Hoare triple {1645#true} call #t~ret60 := main(); {1645#true} is VALID [2022-04-28 08:14:04,210 INFO L290 TraceCheckUtils]: 5: Hoare triple {1645#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {1645#true} is VALID [2022-04-28 08:14:04,210 INFO L272 TraceCheckUtils]: 6: Hoare triple {1645#true} call #t~ret59 := ssl3_accept(~s~0); {1645#true} is VALID [2022-04-28 08:14:04,210 INFO L290 TraceCheckUtils]: 7: Hoare triple {1645#true} ~initial_state := #in~initial_state;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__info_callback~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__in_handshake~0 := #t~nondet5;havoc #t~nondet5;havoc ~s__state~0;havoc ~s__new_session~0;havoc ~s__server~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__version~0 := #t~nondet6;havoc #t~nondet6;havoc ~s__type~0;havoc ~s__init_num~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__hit~0 := #t~nondet7;havoc #t~nondet7;havoc ~s__rwstate~0;~s__init_buf___0~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~s__debug~0 := #t~nondet8;havoc #t~nondet8;havoc ~s__shutdown~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~s__cert~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~s__options~0 := #t~nondet10;havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~s__verify_mode~0 := #t~nondet11;havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~s__session__peer~0 := #t~nondet12;havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~s__cert__pkeys__AT0__privatekey~0 := #t~nondet13;havoc #t~nondet13;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~s__ctx__info_callback~0 := #t~nondet14;havoc #t~nondet14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~s__ctx__stats__sess_accept_renegotiate~0 := #t~nondet15;havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~s__ctx__stats__sess_accept~0 := #t~nondet16;havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~s__ctx__stats__sess_accept_good~0 := #t~nondet17;havoc #t~nondet17;havoc ~s__s3__tmp__cert_request~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet19;havoc #t~nondet19;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~num1~0 := #t~nondet20;havoc #t~nondet20;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___1~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___2~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___3~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___4~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___5~0 := #t~nondet25;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___6~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___7~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___8~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___9~0 := #t~nondet29;havoc #t~nondet29;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___10~0 := #t~nondet30;havoc #t~nondet30;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;~__cil_tmp58~0 := #t~nondet31;havoc #t~nondet31;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;havoc ~__cil_tmp61~0;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~0 := #t~nondet32;havoc #t~nondet32;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {1645#true} is VALID [2022-04-28 08:14:04,210 INFO L290 TraceCheckUtils]: 8: Hoare triple {1645#true} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {1645#true} is VALID [2022-04-28 08:14:04,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {1645#true} #t~post33 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post33;havoc #t~post33; {1645#true} is VALID [2022-04-28 08:14:04,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {1645#true} assume !(0 != 12288 + ~tmp___1~0); {1645#true} is VALID [2022-04-28 08:14:04,211 INFO L290 TraceCheckUtils]: 11: Hoare triple {1645#true} assume !(0 == ~s__cert~0); {1645#true} is VALID [2022-04-28 08:14:04,211 INFO L290 TraceCheckUtils]: 12: Hoare triple {1645#true} assume !false; {1645#true} is VALID [2022-04-28 08:14:04,211 INFO L290 TraceCheckUtils]: 13: Hoare triple {1645#true} ~state~0 := ~s__state~0; {1650#(<= ssl3_accept_~s__state~0 ssl3_accept_~state~0)} is VALID [2022-04-28 08:14:04,211 INFO L290 TraceCheckUtils]: 14: Hoare triple {1650#(<= ssl3_accept_~s__state~0 ssl3_accept_~state~0)} assume 12292 == ~s__state~0; {1651#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-28 08:14:04,212 INFO L290 TraceCheckUtils]: 15: Hoare triple {1651#(<= 12292 ssl3_accept_~state~0)} ~s__new_session~0 := 1; {1651#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-28 08:14:04,212 INFO L290 TraceCheckUtils]: 16: Hoare triple {1651#(<= 12292 ssl3_accept_~state~0)} ~s__server~0 := 1; {1651#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-28 08:14:04,213 INFO L290 TraceCheckUtils]: 17: Hoare triple {1651#(<= 12292 ssl3_accept_~state~0)} assume 0 != ~cb~0; {1651#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-28 08:14:04,213 INFO L290 TraceCheckUtils]: 18: Hoare triple {1651#(<= 12292 ssl3_accept_~state~0)} ~__cil_tmp55~0 := 8 * ~s__version~0; {1651#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-28 08:14:04,213 INFO L290 TraceCheckUtils]: 19: Hoare triple {1651#(<= 12292 ssl3_accept_~state~0)} assume !(3 != ~__cil_tmp55~0);~s__type~0 := 8192; {1651#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-28 08:14:04,214 INFO L290 TraceCheckUtils]: 20: Hoare triple {1651#(<= 12292 ssl3_accept_~state~0)} assume !(0 == ~s__init_buf___0~0); {1651#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-28 08:14:04,214 INFO L290 TraceCheckUtils]: 21: Hoare triple {1651#(<= 12292 ssl3_accept_~state~0)} assume !(0 == ~tmp___4~0);~s__init_num~0 := 0; {1651#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-28 08:14:04,214 INFO L290 TraceCheckUtils]: 22: Hoare triple {1651#(<= 12292 ssl3_accept_~state~0)} assume !(12292 != ~s__state~0);#t~post36 := ~s__ctx__stats__sess_accept_renegotiate~0;~s__ctx__stats__sess_accept_renegotiate~0 := 1 + #t~post36;havoc #t~post36;~s__state~0 := 8480; {1651#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-28 08:14:04,215 INFO L290 TraceCheckUtils]: 23: Hoare triple {1651#(<= 12292 ssl3_accept_~state~0)} assume !(0 == ~s__s3__tmp__reuse_message~0); {1651#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-28 08:14:04,215 INFO L290 TraceCheckUtils]: 24: Hoare triple {1651#(<= 12292 ssl3_accept_~state~0)} assume 8576 == ~state~0; {1646#false} is VALID [2022-04-28 08:14:04,215 INFO L290 TraceCheckUtils]: 25: Hoare triple {1646#false} assume 8592 == ~s__state~0; {1646#false} is VALID [2022-04-28 08:14:04,215 INFO L290 TraceCheckUtils]: 26: Hoare triple {1646#false} assume -12288 != ~tmp___1~0; {1646#false} is VALID [2022-04-28 08:14:04,215 INFO L290 TraceCheckUtils]: 27: Hoare triple {1646#false} assume -16384 != ~tmp___2~0; {1646#false} is VALID [2022-04-28 08:14:04,215 INFO L290 TraceCheckUtils]: 28: Hoare triple {1646#false} assume 4294967040 != ~__cil_tmp56~0 % 4294967296; {1646#false} is VALID [2022-04-28 08:14:04,216 INFO L290 TraceCheckUtils]: 29: Hoare triple {1646#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {1646#false} is VALID [2022-04-28 08:14:04,216 INFO L290 TraceCheckUtils]: 30: Hoare triple {1646#false} assume 1024 != ~tmp___7~0; {1646#false} is VALID [2022-04-28 08:14:04,216 INFO L290 TraceCheckUtils]: 31: Hoare triple {1646#false} assume 512 != ~tmp___7~0; {1646#false} is VALID [2022-04-28 08:14:04,216 INFO L290 TraceCheckUtils]: 32: Hoare triple {1646#false} assume !false; {1646#false} is VALID [2022-04-28 08:14:04,216 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-28 08:14:04,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:14:04,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067043371] [2022-04-28 08:14:04,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067043371] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:04,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:04,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:14:04,217 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:14:04,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [13692846] [2022-04-28 08:14:04,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [13692846] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:04,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:04,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:14:04,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726401557] [2022-04-28 08:14:04,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:14:04,218 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 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 33 [2022-04-28 08:14:04,219 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:14:04,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 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-28 08:14:04,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:04,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:14:04,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:04,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:14:04,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:14:04,238 INFO L87 Difference]: Start difference. First operand 185 states and 271 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 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-28 08:14:04,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:04,987 INFO L93 Difference]: Finished difference Result 385 states and 567 transitions. [2022-04-28 08:14:04,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:14:04,987 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 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 33 [2022-04-28 08:14:04,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:14:04,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 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-28 08:14:04,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-28 08:14:04,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 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-28 08:14:04,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-28 08:14:04,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 466 transitions. [2022-04-28 08:14:05,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 466 edges. 466 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:05,324 INFO L225 Difference]: With dead ends: 385 [2022-04-28 08:14:05,324 INFO L226 Difference]: Without dead ends: 214 [2022-04-28 08:14:05,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-28 08:14:05,325 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 423 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 08:14:05,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 185 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 08:14:05,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-04-28 08:14:05,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 193. [2022-04-28 08:14:05,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:14:05,467 INFO L82 GeneralOperation]: Start isEquivalent. First operand 214 states. Second operand has 193 states, 188 states have (on average 1.4893617021276595) internal successors, (280), 188 states have internal predecessors, (280), 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-28 08:14:05,467 INFO L74 IsIncluded]: Start isIncluded. First operand 214 states. Second operand has 193 states, 188 states have (on average 1.4893617021276595) internal successors, (280), 188 states have internal predecessors, (280), 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-28 08:14:05,468 INFO L87 Difference]: Start difference. First operand 214 states. Second operand has 193 states, 188 states have (on average 1.4893617021276595) internal successors, (280), 188 states have internal predecessors, (280), 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-28 08:14:05,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:05,476 INFO L93 Difference]: Finished difference Result 214 states and 313 transitions. [2022-04-28 08:14:05,476 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 313 transitions. [2022-04-28 08:14:05,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:05,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:05,477 INFO L74 IsIncluded]: Start isIncluded. First operand has 193 states, 188 states have (on average 1.4893617021276595) internal successors, (280), 188 states have internal predecessors, (280), 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) Second operand 214 states. [2022-04-28 08:14:05,478 INFO L87 Difference]: Start difference. First operand has 193 states, 188 states have (on average 1.4893617021276595) internal successors, (280), 188 states have internal predecessors, (280), 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) Second operand 214 states. [2022-04-28 08:14:05,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:05,494 INFO L93 Difference]: Finished difference Result 214 states and 313 transitions. [2022-04-28 08:14:05,494 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 313 transitions. [2022-04-28 08:14:05,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:05,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:05,495 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:14:05,495 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:14:05,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 188 states have (on average 1.4893617021276595) internal successors, (280), 188 states have internal predecessors, (280), 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-28 08:14:05,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 284 transitions. [2022-04-28 08:14:05,503 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 284 transitions. Word has length 33 [2022-04-28 08:14:05,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:14:05,503 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 284 transitions. [2022-04-28 08:14:05,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 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-28 08:14:05,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 193 states and 284 transitions. [2022-04-28 08:14:05,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 284 edges. 284 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:05,712 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 284 transitions. [2022-04-28 08:14:05,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 08:14:05,713 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:14:05,713 INFO L195 NwaCegarLoop]: 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] [2022-04-28 08:14:05,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 08:14:05,713 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:14:05,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:14:05,714 INFO L85 PathProgramCache]: Analyzing trace with hash -818420097, now seen corresponding path program 1 times [2022-04-28 08:14:05,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:05,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [23150133] [2022-04-28 08:14:05,714 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:14:05,714 INFO L85 PathProgramCache]: Analyzing trace with hash -818420097, now seen corresponding path program 2 times [2022-04-28 08:14:05,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:14:05,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415545516] [2022-04-28 08:14:05,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:14:05,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:14:05,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:05,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:14:05,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:05,777 INFO L290 TraceCheckUtils]: 0: Hoare triple {3252#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {3245#true} is VALID [2022-04-28 08:14:05,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {3245#true} assume true; {3245#true} is VALID [2022-04-28 08:14:05,777 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3245#true} {3245#true} #657#return; {3245#true} is VALID [2022-04-28 08:14:05,778 INFO L272 TraceCheckUtils]: 0: Hoare triple {3245#true} call ULTIMATE.init(); {3252#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:14:05,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {3252#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {3245#true} is VALID [2022-04-28 08:14:05,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {3245#true} assume true; {3245#true} is VALID [2022-04-28 08:14:05,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3245#true} {3245#true} #657#return; {3245#true} is VALID [2022-04-28 08:14:05,778 INFO L272 TraceCheckUtils]: 4: Hoare triple {3245#true} call #t~ret60 := main(); {3245#true} is VALID [2022-04-28 08:14:05,778 INFO L290 TraceCheckUtils]: 5: Hoare triple {3245#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {3245#true} is VALID [2022-04-28 08:14:05,779 INFO L272 TraceCheckUtils]: 6: Hoare triple {3245#true} call #t~ret59 := ssl3_accept(~s~0); {3245#true} is VALID [2022-04-28 08:14:05,779 INFO L290 TraceCheckUtils]: 7: Hoare triple {3245#true} ~initial_state := #in~initial_state;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__info_callback~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__in_handshake~0 := #t~nondet5;havoc #t~nondet5;havoc ~s__state~0;havoc ~s__new_session~0;havoc ~s__server~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__version~0 := #t~nondet6;havoc #t~nondet6;havoc ~s__type~0;havoc ~s__init_num~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__hit~0 := #t~nondet7;havoc #t~nondet7;havoc ~s__rwstate~0;~s__init_buf___0~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~s__debug~0 := #t~nondet8;havoc #t~nondet8;havoc ~s__shutdown~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~s__cert~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~s__options~0 := #t~nondet10;havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~s__verify_mode~0 := #t~nondet11;havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~s__session__peer~0 := #t~nondet12;havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~s__cert__pkeys__AT0__privatekey~0 := #t~nondet13;havoc #t~nondet13;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~s__ctx__info_callback~0 := #t~nondet14;havoc #t~nondet14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~s__ctx__stats__sess_accept_renegotiate~0 := #t~nondet15;havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~s__ctx__stats__sess_accept~0 := #t~nondet16;havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~s__ctx__stats__sess_accept_good~0 := #t~nondet17;havoc #t~nondet17;havoc ~s__s3__tmp__cert_request~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet19;havoc #t~nondet19;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~num1~0 := #t~nondet20;havoc #t~nondet20;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___1~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___2~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___3~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___4~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___5~0 := #t~nondet25;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___6~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___7~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___8~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___9~0 := #t~nondet29;havoc #t~nondet29;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___10~0 := #t~nondet30;havoc #t~nondet30;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;~__cil_tmp58~0 := #t~nondet31;havoc #t~nondet31;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;havoc ~__cil_tmp61~0;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~0 := #t~nondet32;havoc #t~nondet32;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {3245#true} is VALID [2022-04-28 08:14:05,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {3245#true} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {3245#true} is VALID [2022-04-28 08:14:05,779 INFO L290 TraceCheckUtils]: 9: Hoare triple {3245#true} #t~post33 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post33;havoc #t~post33; {3245#true} is VALID [2022-04-28 08:14:05,779 INFO L290 TraceCheckUtils]: 10: Hoare triple {3245#true} assume !(0 != 12288 + ~tmp___1~0); {3245#true} is VALID [2022-04-28 08:14:05,779 INFO L290 TraceCheckUtils]: 11: Hoare triple {3245#true} assume !(0 == ~s__cert~0); {3245#true} is VALID [2022-04-28 08:14:05,779 INFO L290 TraceCheckUtils]: 12: Hoare triple {3245#true} assume !false; {3245#true} is VALID [2022-04-28 08:14:05,780 INFO L290 TraceCheckUtils]: 13: Hoare triple {3245#true} ~state~0 := ~s__state~0; {3250#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-28 08:14:05,780 INFO L290 TraceCheckUtils]: 14: Hoare triple {3250#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(12292 == ~s__state~0); {3250#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-28 08:14:05,781 INFO L290 TraceCheckUtils]: 15: Hoare triple {3250#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(16384 == ~s__state~0); {3250#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-28 08:14:05,781 INFO L290 TraceCheckUtils]: 16: Hoare triple {3250#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume 8192 == ~s__state~0; {3251#(<= ssl3_accept_~state~0 8192)} is VALID [2022-04-28 08:14:05,781 INFO L290 TraceCheckUtils]: 17: Hoare triple {3251#(<= ssl3_accept_~state~0 8192)} ~s__server~0 := 1; {3251#(<= ssl3_accept_~state~0 8192)} is VALID [2022-04-28 08:14:05,782 INFO L290 TraceCheckUtils]: 18: Hoare triple {3251#(<= ssl3_accept_~state~0 8192)} assume 0 != ~cb~0; {3251#(<= ssl3_accept_~state~0 8192)} is VALID [2022-04-28 08:14:05,782 INFO L290 TraceCheckUtils]: 19: Hoare triple {3251#(<= ssl3_accept_~state~0 8192)} ~__cil_tmp55~0 := 8 * ~s__version~0; {3251#(<= ssl3_accept_~state~0 8192)} is VALID [2022-04-28 08:14:05,782 INFO L290 TraceCheckUtils]: 20: Hoare triple {3251#(<= ssl3_accept_~state~0 8192)} assume !(3 != ~__cil_tmp55~0);~s__type~0 := 8192; {3251#(<= ssl3_accept_~state~0 8192)} is VALID [2022-04-28 08:14:05,783 INFO L290 TraceCheckUtils]: 21: Hoare triple {3251#(<= ssl3_accept_~state~0 8192)} assume !(0 == ~s__init_buf___0~0); {3251#(<= ssl3_accept_~state~0 8192)} is VALID [2022-04-28 08:14:05,783 INFO L290 TraceCheckUtils]: 22: Hoare triple {3251#(<= ssl3_accept_~state~0 8192)} assume !(0 == ~tmp___4~0);~s__init_num~0 := 0; {3251#(<= ssl3_accept_~state~0 8192)} is VALID [2022-04-28 08:14:05,783 INFO L290 TraceCheckUtils]: 23: Hoare triple {3251#(<= ssl3_accept_~state~0 8192)} assume 12292 != ~s__state~0; {3251#(<= ssl3_accept_~state~0 8192)} is VALID [2022-04-28 08:14:05,784 INFO L290 TraceCheckUtils]: 24: Hoare triple {3251#(<= ssl3_accept_~state~0 8192)} assume !(0 == ~tmp___5~0);~s__state~0 := 8464;#t~post35 := ~s__ctx__stats__sess_accept~0;~s__ctx__stats__sess_accept~0 := 1 + #t~post35;havoc #t~post35; {3251#(<= ssl3_accept_~state~0 8192)} is VALID [2022-04-28 08:14:05,784 INFO L290 TraceCheckUtils]: 25: Hoare triple {3251#(<= ssl3_accept_~state~0 8192)} assume !(0 == ~s__s3__tmp__reuse_message~0); {3251#(<= ssl3_accept_~state~0 8192)} is VALID [2022-04-28 08:14:05,784 INFO L290 TraceCheckUtils]: 26: Hoare triple {3251#(<= ssl3_accept_~state~0 8192)} assume 8576 == ~state~0; {3246#false} is VALID [2022-04-28 08:14:05,784 INFO L290 TraceCheckUtils]: 27: Hoare triple {3246#false} assume 8592 == ~s__state~0; {3246#false} is VALID [2022-04-28 08:14:05,784 INFO L290 TraceCheckUtils]: 28: Hoare triple {3246#false} assume -12288 != ~tmp___1~0; {3246#false} is VALID [2022-04-28 08:14:05,785 INFO L290 TraceCheckUtils]: 29: Hoare triple {3246#false} assume -16384 != ~tmp___2~0; {3246#false} is VALID [2022-04-28 08:14:05,785 INFO L290 TraceCheckUtils]: 30: Hoare triple {3246#false} assume 4294967040 != ~__cil_tmp56~0 % 4294967296; {3246#false} is VALID [2022-04-28 08:14:05,785 INFO L290 TraceCheckUtils]: 31: Hoare triple {3246#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {3246#false} is VALID [2022-04-28 08:14:05,785 INFO L290 TraceCheckUtils]: 32: Hoare triple {3246#false} assume 1024 != ~tmp___7~0; {3246#false} is VALID [2022-04-28 08:14:05,785 INFO L290 TraceCheckUtils]: 33: Hoare triple {3246#false} assume 512 != ~tmp___7~0; {3246#false} is VALID [2022-04-28 08:14:05,785 INFO L290 TraceCheckUtils]: 34: Hoare triple {3246#false} assume !false; {3246#false} is VALID [2022-04-28 08:14:05,785 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-28 08:14:05,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:14:05,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415545516] [2022-04-28 08:14:05,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415545516] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:05,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:05,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:14:05,786 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:14:05,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [23150133] [2022-04-28 08:14:05,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [23150133] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:05,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:05,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:14:05,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373671463] [2022-04-28 08:14:05,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:14:05,787 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (3), 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 35 [2022-04-28 08:14:05,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:14:05,788 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (3), 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-28 08:14:05,807 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:05,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:14:05,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:05,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:14:05,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:14:05,808 INFO L87 Difference]: Start difference. First operand 193 states and 284 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (3), 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-28 08:14:06,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:06,677 INFO L93 Difference]: Finished difference Result 411 states and 605 transitions. [2022-04-28 08:14:06,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:14:06,677 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (3), 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 35 [2022-04-28 08:14:06,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:14:06,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (3), 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-28 08:14:06,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-28 08:14:06,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (3), 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-28 08:14:06,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-28 08:14:06,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 466 transitions. [2022-04-28 08:14:07,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 466 edges. 466 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:07,015 INFO L225 Difference]: With dead ends: 411 [2022-04-28 08:14:07,015 INFO L226 Difference]: Without dead ends: 232 [2022-04-28 08:14:07,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-28 08:14:07,016 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 396 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 08:14:07,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 196 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 08:14:07,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-04-28 08:14:07,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 202. [2022-04-28 08:14:07,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:14:07,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 232 states. Second operand has 202 states, 197 states have (on average 1.4771573604060915) internal successors, (291), 197 states have internal predecessors, (291), 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-28 08:14:07,225 INFO L74 IsIncluded]: Start isIncluded. First operand 232 states. Second operand has 202 states, 197 states have (on average 1.4771573604060915) internal successors, (291), 197 states have internal predecessors, (291), 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-28 08:14:07,225 INFO L87 Difference]: Start difference. First operand 232 states. Second operand has 202 states, 197 states have (on average 1.4771573604060915) internal successors, (291), 197 states have internal predecessors, (291), 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-28 08:14:07,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:07,230 INFO L93 Difference]: Finished difference Result 232 states and 338 transitions. [2022-04-28 08:14:07,230 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 338 transitions. [2022-04-28 08:14:07,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:07,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:07,231 INFO L74 IsIncluded]: Start isIncluded. First operand has 202 states, 197 states have (on average 1.4771573604060915) internal successors, (291), 197 states have internal predecessors, (291), 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) Second operand 232 states. [2022-04-28 08:14:07,231 INFO L87 Difference]: Start difference. First operand has 202 states, 197 states have (on average 1.4771573604060915) internal successors, (291), 197 states have internal predecessors, (291), 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) Second operand 232 states. [2022-04-28 08:14:07,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:07,236 INFO L93 Difference]: Finished difference Result 232 states and 338 transitions. [2022-04-28 08:14:07,236 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 338 transitions. [2022-04-28 08:14:07,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:07,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:07,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:14:07,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:14:07,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 197 states have (on average 1.4771573604060915) internal successors, (291), 197 states have internal predecessors, (291), 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-28 08:14:07,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 295 transitions. [2022-04-28 08:14:07,241 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 295 transitions. Word has length 35 [2022-04-28 08:14:07,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:14:07,242 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 295 transitions. [2022-04-28 08:14:07,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (3), 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-28 08:14:07,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 202 states and 295 transitions. [2022-04-28 08:14:07,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 295 edges. 295 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:07,446 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 295 transitions. [2022-04-28 08:14:07,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 08:14:07,446 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:14:07,447 INFO L195 NwaCegarLoop]: 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] [2022-04-28 08:14:07,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 08:14:07,447 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:14:07,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:14:07,447 INFO L85 PathProgramCache]: Analyzing trace with hash -148338235, now seen corresponding path program 1 times [2022-04-28 08:14:07,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:07,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1112233716] [2022-04-28 08:14:07,448 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:14:07,448 INFO L85 PathProgramCache]: Analyzing trace with hash -148338235, now seen corresponding path program 2 times [2022-04-28 08:14:07,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:14:07,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112043603] [2022-04-28 08:14:07,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:14:07,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:14:07,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:07,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:14:07,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:07,544 INFO L290 TraceCheckUtils]: 0: Hoare triple {4957#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {4951#true} is VALID [2022-04-28 08:14:07,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {4951#true} assume true; {4951#true} is VALID [2022-04-28 08:14:07,545 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4951#true} {4951#true} #657#return; {4951#true} is VALID [2022-04-28 08:14:07,545 INFO L272 TraceCheckUtils]: 0: Hoare triple {4951#true} call ULTIMATE.init(); {4957#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:14:07,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {4957#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {4951#true} is VALID [2022-04-28 08:14:07,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {4951#true} assume true; {4951#true} is VALID [2022-04-28 08:14:07,546 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4951#true} {4951#true} #657#return; {4951#true} is VALID [2022-04-28 08:14:07,546 INFO L272 TraceCheckUtils]: 4: Hoare triple {4951#true} call #t~ret60 := main(); {4951#true} is VALID [2022-04-28 08:14:07,546 INFO L290 TraceCheckUtils]: 5: Hoare triple {4951#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {4951#true} is VALID [2022-04-28 08:14:07,546 INFO L272 TraceCheckUtils]: 6: Hoare triple {4951#true} call #t~ret59 := ssl3_accept(~s~0); {4951#true} is VALID [2022-04-28 08:14:07,546 INFO L290 TraceCheckUtils]: 7: Hoare triple {4951#true} ~initial_state := #in~initial_state;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__info_callback~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__in_handshake~0 := #t~nondet5;havoc #t~nondet5;havoc ~s__state~0;havoc ~s__new_session~0;havoc ~s__server~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__version~0 := #t~nondet6;havoc #t~nondet6;havoc ~s__type~0;havoc ~s__init_num~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__hit~0 := #t~nondet7;havoc #t~nondet7;havoc ~s__rwstate~0;~s__init_buf___0~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~s__debug~0 := #t~nondet8;havoc #t~nondet8;havoc ~s__shutdown~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~s__cert~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~s__options~0 := #t~nondet10;havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~s__verify_mode~0 := #t~nondet11;havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~s__session__peer~0 := #t~nondet12;havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~s__cert__pkeys__AT0__privatekey~0 := #t~nondet13;havoc #t~nondet13;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~s__ctx__info_callback~0 := #t~nondet14;havoc #t~nondet14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~s__ctx__stats__sess_accept_renegotiate~0 := #t~nondet15;havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~s__ctx__stats__sess_accept~0 := #t~nondet16;havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~s__ctx__stats__sess_accept_good~0 := #t~nondet17;havoc #t~nondet17;havoc ~s__s3__tmp__cert_request~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet19;havoc #t~nondet19;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~num1~0 := #t~nondet20;havoc #t~nondet20;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___1~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___2~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___3~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___4~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___5~0 := #t~nondet25;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___6~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___7~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___8~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___9~0 := #t~nondet29;havoc #t~nondet29;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___10~0 := #t~nondet30;havoc #t~nondet30;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;~__cil_tmp58~0 := #t~nondet31;havoc #t~nondet31;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;havoc ~__cil_tmp61~0;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~0 := #t~nondet32;havoc #t~nondet32;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {4951#true} is VALID [2022-04-28 08:14:07,546 INFO L290 TraceCheckUtils]: 8: Hoare triple {4951#true} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {4951#true} is VALID [2022-04-28 08:14:07,547 INFO L290 TraceCheckUtils]: 9: Hoare triple {4951#true} #t~post33 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post33;havoc #t~post33; {4951#true} is VALID [2022-04-28 08:14:07,547 INFO L290 TraceCheckUtils]: 10: Hoare triple {4951#true} assume !(0 != 12288 + ~tmp___1~0); {4951#true} is VALID [2022-04-28 08:14:07,547 INFO L290 TraceCheckUtils]: 11: Hoare triple {4951#true} assume !(0 == ~s__cert~0); {4951#true} is VALID [2022-04-28 08:14:07,547 INFO L290 TraceCheckUtils]: 12: Hoare triple {4951#true} assume !false; {4951#true} is VALID [2022-04-28 08:14:07,547 INFO L290 TraceCheckUtils]: 13: Hoare triple {4951#true} ~state~0 := ~s__state~0; {4951#true} is VALID [2022-04-28 08:14:07,547 INFO L290 TraceCheckUtils]: 14: Hoare triple {4951#true} assume !(12292 == ~s__state~0); {4951#true} is VALID [2022-04-28 08:14:07,547 INFO L290 TraceCheckUtils]: 15: Hoare triple {4951#true} assume !(16384 == ~s__state~0); {4951#true} is VALID [2022-04-28 08:14:07,547 INFO L290 TraceCheckUtils]: 16: Hoare triple {4951#true} assume !(8192 == ~s__state~0); {4951#true} is VALID [2022-04-28 08:14:07,548 INFO L290 TraceCheckUtils]: 17: Hoare triple {4951#true} assume !(24576 == ~s__state~0); {4951#true} is VALID [2022-04-28 08:14:07,548 INFO L290 TraceCheckUtils]: 18: Hoare triple {4951#true} assume !(8195 == ~s__state~0); {4951#true} is VALID [2022-04-28 08:14:07,548 INFO L290 TraceCheckUtils]: 19: Hoare triple {4951#true} assume !(8480 == ~s__state~0); {4951#true} is VALID [2022-04-28 08:14:07,548 INFO L290 TraceCheckUtils]: 20: Hoare triple {4951#true} assume !(8481 == ~s__state~0); {4951#true} is VALID [2022-04-28 08:14:07,548 INFO L290 TraceCheckUtils]: 21: Hoare triple {4951#true} assume !(8482 == ~s__state~0); {4951#true} is VALID [2022-04-28 08:14:07,548 INFO L290 TraceCheckUtils]: 22: Hoare triple {4951#true} assume 8464 == ~s__state~0; {4951#true} is VALID [2022-04-28 08:14:07,548 INFO L290 TraceCheckUtils]: 23: Hoare triple {4951#true} ~s__shutdown~0 := 0;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~ret~0 := #t~nondet38;havoc #t~nondet38; {4951#true} is VALID [2022-04-28 08:14:07,549 INFO L290 TraceCheckUtils]: 24: Hoare triple {4951#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {4951#true} is VALID [2022-04-28 08:14:07,550 INFO L290 TraceCheckUtils]: 25: Hoare triple {4951#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;~s__state~0 := 8496;~s__init_num~0 := 0; {4956#(<= ssl3_accept_~s__state~0 8496)} is VALID [2022-04-28 08:14:07,551 INFO L290 TraceCheckUtils]: 26: Hoare triple {4956#(<= ssl3_accept_~s__state~0 8496)} assume !(0 == ~s__s3__tmp__reuse_message~0); {4956#(<= ssl3_accept_~s__state~0 8496)} is VALID [2022-04-28 08:14:07,551 INFO L290 TraceCheckUtils]: 27: Hoare triple {4956#(<= ssl3_accept_~s__state~0 8496)} assume 8576 == ~state~0; {4956#(<= ssl3_accept_~s__state~0 8496)} is VALID [2022-04-28 08:14:07,551 INFO L290 TraceCheckUtils]: 28: Hoare triple {4956#(<= ssl3_accept_~s__state~0 8496)} assume 8592 == ~s__state~0; {4952#false} is VALID [2022-04-28 08:14:07,551 INFO L290 TraceCheckUtils]: 29: Hoare triple {4952#false} assume -12288 != ~tmp___1~0; {4952#false} is VALID [2022-04-28 08:14:07,552 INFO L290 TraceCheckUtils]: 30: Hoare triple {4952#false} assume -16384 != ~tmp___2~0; {4952#false} is VALID [2022-04-28 08:14:07,552 INFO L290 TraceCheckUtils]: 31: Hoare triple {4952#false} assume 4294967040 != ~__cil_tmp56~0 % 4294967296; {4952#false} is VALID [2022-04-28 08:14:07,552 INFO L290 TraceCheckUtils]: 32: Hoare triple {4952#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {4952#false} is VALID [2022-04-28 08:14:07,552 INFO L290 TraceCheckUtils]: 33: Hoare triple {4952#false} assume 1024 != ~tmp___7~0; {4952#false} is VALID [2022-04-28 08:14:07,552 INFO L290 TraceCheckUtils]: 34: Hoare triple {4952#false} assume 512 != ~tmp___7~0; {4952#false} is VALID [2022-04-28 08:14:07,552 INFO L290 TraceCheckUtils]: 35: Hoare triple {4952#false} assume !false; {4952#false} is VALID [2022-04-28 08:14:07,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:14:07,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:14:07,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112043603] [2022-04-28 08:14:07,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112043603] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:07,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:07,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:14:07,555 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:14:07,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1112233716] [2022-04-28 08:14:07,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1112233716] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:07,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:07,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:14:07,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131450714] [2022-04-28 08:14:07,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:14:07,555 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (3), 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 36 [2022-04-28 08:14:07,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:14:07,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (3), 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-28 08:14:07,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:07,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:14:07,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:07,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:14:07,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:14:07,575 INFO L87 Difference]: Start difference. First operand 202 states and 295 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (3), 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-28 08:14:08,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:08,264 INFO L93 Difference]: Finished difference Result 441 states and 666 transitions. [2022-04-28 08:14:08,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:14:08,264 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (3), 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 36 [2022-04-28 08:14:08,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:14:08,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (3), 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-28 08:14:08,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 524 transitions. [2022-04-28 08:14:08,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (3), 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-28 08:14:08,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 524 transitions. [2022-04-28 08:14:08,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 524 transitions. [2022-04-28 08:14:08,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 524 edges. 524 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:08,560 INFO L225 Difference]: With dead ends: 441 [2022-04-28 08:14:08,560 INFO L226 Difference]: Without dead ends: 241 [2022-04-28 08:14:08,561 INFO L412 NwaCegarLoop]: 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-28 08:14:08,565 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 310 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:14:08,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 234 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:14:08,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-04-28 08:14:08,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 225. [2022-04-28 08:14:08,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:14:08,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 241 states. Second operand has 225 states, 220 states have (on average 1.4954545454545454) internal successors, (329), 220 states have internal predecessors, (329), 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-28 08:14:08,828 INFO L74 IsIncluded]: Start isIncluded. First operand 241 states. Second operand has 225 states, 220 states have (on average 1.4954545454545454) internal successors, (329), 220 states have internal predecessors, (329), 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-28 08:14:08,828 INFO L87 Difference]: Start difference. First operand 241 states. Second operand has 225 states, 220 states have (on average 1.4954545454545454) internal successors, (329), 220 states have internal predecessors, (329), 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-28 08:14:08,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:08,832 INFO L93 Difference]: Finished difference Result 241 states and 352 transitions. [2022-04-28 08:14:08,832 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 352 transitions. [2022-04-28 08:14:08,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:08,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:08,833 INFO L74 IsIncluded]: Start isIncluded. First operand has 225 states, 220 states have (on average 1.4954545454545454) internal successors, (329), 220 states have internal predecessors, (329), 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) Second operand 241 states. [2022-04-28 08:14:08,833 INFO L87 Difference]: Start difference. First operand has 225 states, 220 states have (on average 1.4954545454545454) internal successors, (329), 220 states have internal predecessors, (329), 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) Second operand 241 states. [2022-04-28 08:14:08,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:08,837 INFO L93 Difference]: Finished difference Result 241 states and 352 transitions. [2022-04-28 08:14:08,837 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 352 transitions. [2022-04-28 08:14:08,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:08,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:08,838 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:14:08,839 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:14:08,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 220 states have (on average 1.4954545454545454) internal successors, (329), 220 states have internal predecessors, (329), 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-28 08:14:08,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 333 transitions. [2022-04-28 08:14:08,849 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 333 transitions. Word has length 36 [2022-04-28 08:14:08,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:14:08,849 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 333 transitions. [2022-04-28 08:14:08,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (3), 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-28 08:14:08,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 225 states and 333 transitions. [2022-04-28 08:14:09,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 333 edges. 333 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:09,062 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 333 transitions. [2022-04-28 08:14:09,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 08:14:09,062 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:14:09,062 INFO L195 NwaCegarLoop]: 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] [2022-04-28 08:14:09,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 08:14:09,063 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:14:09,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:14:09,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1107449201, now seen corresponding path program 1 times [2022-04-28 08:14:09,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:09,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1598421682] [2022-04-28 08:14:09,063 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:14:09,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1107449201, now seen corresponding path program 2 times [2022-04-28 08:14:09,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:14:09,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116253584] [2022-04-28 08:14:09,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:14:09,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:14:09,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:09,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:14:09,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:09,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {6783#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {6777#true} is VALID [2022-04-28 08:14:09,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {6777#true} assume true; {6777#true} is VALID [2022-04-28 08:14:09,136 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6777#true} {6777#true} #657#return; {6777#true} is VALID [2022-04-28 08:14:09,136 INFO L272 TraceCheckUtils]: 0: Hoare triple {6777#true} call ULTIMATE.init(); {6783#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:14:09,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {6783#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {6777#true} is VALID [2022-04-28 08:14:09,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {6777#true} assume true; {6777#true} is VALID [2022-04-28 08:14:09,137 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6777#true} {6777#true} #657#return; {6777#true} is VALID [2022-04-28 08:14:09,137 INFO L272 TraceCheckUtils]: 4: Hoare triple {6777#true} call #t~ret60 := main(); {6777#true} is VALID [2022-04-28 08:14:09,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {6777#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {6777#true} is VALID [2022-04-28 08:14:09,137 INFO L272 TraceCheckUtils]: 6: Hoare triple {6777#true} call #t~ret59 := ssl3_accept(~s~0); {6777#true} is VALID [2022-04-28 08:14:09,137 INFO L290 TraceCheckUtils]: 7: Hoare triple {6777#true} ~initial_state := #in~initial_state;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__info_callback~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__in_handshake~0 := #t~nondet5;havoc #t~nondet5;havoc ~s__state~0;havoc ~s__new_session~0;havoc ~s__server~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__version~0 := #t~nondet6;havoc #t~nondet6;havoc ~s__type~0;havoc ~s__init_num~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__hit~0 := #t~nondet7;havoc #t~nondet7;havoc ~s__rwstate~0;~s__init_buf___0~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~s__debug~0 := #t~nondet8;havoc #t~nondet8;havoc ~s__shutdown~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~s__cert~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~s__options~0 := #t~nondet10;havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~s__verify_mode~0 := #t~nondet11;havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~s__session__peer~0 := #t~nondet12;havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~s__cert__pkeys__AT0__privatekey~0 := #t~nondet13;havoc #t~nondet13;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~s__ctx__info_callback~0 := #t~nondet14;havoc #t~nondet14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~s__ctx__stats__sess_accept_renegotiate~0 := #t~nondet15;havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~s__ctx__stats__sess_accept~0 := #t~nondet16;havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~s__ctx__stats__sess_accept_good~0 := #t~nondet17;havoc #t~nondet17;havoc ~s__s3__tmp__cert_request~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet19;havoc #t~nondet19;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~num1~0 := #t~nondet20;havoc #t~nondet20;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___1~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___2~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___3~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___4~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___5~0 := #t~nondet25;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___6~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___7~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___8~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___9~0 := #t~nondet29;havoc #t~nondet29;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___10~0 := #t~nondet30;havoc #t~nondet30;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;~__cil_tmp58~0 := #t~nondet31;havoc #t~nondet31;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;havoc ~__cil_tmp61~0;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~0 := #t~nondet32;havoc #t~nondet32;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {6782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:14:09,138 INFO L290 TraceCheckUtils]: 8: Hoare triple {6782#(= ssl3_accept_~blastFlag~0 0)} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {6782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:14:09,138 INFO L290 TraceCheckUtils]: 9: Hoare triple {6782#(= ssl3_accept_~blastFlag~0 0)} #t~post33 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post33;havoc #t~post33; {6782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:14:09,138 INFO L290 TraceCheckUtils]: 10: Hoare triple {6782#(= ssl3_accept_~blastFlag~0 0)} assume !(0 != 12288 + ~tmp___1~0); {6782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:14:09,138 INFO L290 TraceCheckUtils]: 11: Hoare triple {6782#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == ~s__cert~0); {6782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:14:09,139 INFO L290 TraceCheckUtils]: 12: Hoare triple {6782#(= ssl3_accept_~blastFlag~0 0)} assume !false; {6782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:14:09,139 INFO L290 TraceCheckUtils]: 13: Hoare triple {6782#(= ssl3_accept_~blastFlag~0 0)} ~state~0 := ~s__state~0; {6782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:14:09,139 INFO L290 TraceCheckUtils]: 14: Hoare triple {6782#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == ~s__state~0); {6782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:14:09,140 INFO L290 TraceCheckUtils]: 15: Hoare triple {6782#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == ~s__state~0); {6782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:14:09,140 INFO L290 TraceCheckUtils]: 16: Hoare triple {6782#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == ~s__state~0); {6782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:14:09,140 INFO L290 TraceCheckUtils]: 17: Hoare triple {6782#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == ~s__state~0); {6782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:14:09,140 INFO L290 TraceCheckUtils]: 18: Hoare triple {6782#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == ~s__state~0); {6782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:14:09,141 INFO L290 TraceCheckUtils]: 19: Hoare triple {6782#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == ~s__state~0); {6782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:14:09,141 INFO L290 TraceCheckUtils]: 20: Hoare triple {6782#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == ~s__state~0); {6782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:14:09,141 INFO L290 TraceCheckUtils]: 21: Hoare triple {6782#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == ~s__state~0); {6782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:14:09,142 INFO L290 TraceCheckUtils]: 22: Hoare triple {6782#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == ~s__state~0); {6782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:14:09,142 INFO L290 TraceCheckUtils]: 23: Hoare triple {6782#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == ~s__state~0); {6782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:14:09,142 INFO L290 TraceCheckUtils]: 24: Hoare triple {6782#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == ~s__state~0); {6782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:14:09,143 INFO L290 TraceCheckUtils]: 25: Hoare triple {6782#(= ssl3_accept_~blastFlag~0 0)} assume 8496 == ~s__state~0; {6782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:14:09,143 INFO L290 TraceCheckUtils]: 26: Hoare triple {6782#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~ret~0 := #t~nondet39;havoc #t~nondet39; {6782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:14:09,143 INFO L290 TraceCheckUtils]: 27: Hoare triple {6782#(= ssl3_accept_~blastFlag~0 0)} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {6778#false} is VALID [2022-04-28 08:14:09,143 INFO L290 TraceCheckUtils]: 28: Hoare triple {6778#false} assume !(~ret~0 <= 0); {6778#false} is VALID [2022-04-28 08:14:09,143 INFO L290 TraceCheckUtils]: 29: Hoare triple {6778#false} assume 0 != ~s__hit~0;~s__state~0 := 8656; {6778#false} is VALID [2022-04-28 08:14:09,144 INFO L290 TraceCheckUtils]: 30: Hoare triple {6778#false} ~s__init_num~0 := 0; {6778#false} is VALID [2022-04-28 08:14:09,144 INFO L290 TraceCheckUtils]: 31: Hoare triple {6778#false} assume !(0 == ~s__s3__tmp__reuse_message~0); {6778#false} is VALID [2022-04-28 08:14:09,144 INFO L290 TraceCheckUtils]: 32: Hoare triple {6778#false} assume 8576 == ~state~0; {6778#false} is VALID [2022-04-28 08:14:09,144 INFO L290 TraceCheckUtils]: 33: Hoare triple {6778#false} assume 8592 == ~s__state~0; {6778#false} is VALID [2022-04-28 08:14:09,144 INFO L290 TraceCheckUtils]: 34: Hoare triple {6778#false} assume -12288 != ~tmp___1~0; {6778#false} is VALID [2022-04-28 08:14:09,144 INFO L290 TraceCheckUtils]: 35: Hoare triple {6778#false} assume -16384 != ~tmp___2~0; {6778#false} is VALID [2022-04-28 08:14:09,144 INFO L290 TraceCheckUtils]: 36: Hoare triple {6778#false} assume 4294967040 != ~__cil_tmp56~0 % 4294967296; {6778#false} is VALID [2022-04-28 08:14:09,144 INFO L290 TraceCheckUtils]: 37: Hoare triple {6778#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {6778#false} is VALID [2022-04-28 08:14:09,144 INFO L290 TraceCheckUtils]: 38: Hoare triple {6778#false} assume 1024 != ~tmp___7~0; {6778#false} is VALID [2022-04-28 08:14:09,144 INFO L290 TraceCheckUtils]: 39: Hoare triple {6778#false} assume 512 != ~tmp___7~0; {6778#false} is VALID [2022-04-28 08:14:09,145 INFO L290 TraceCheckUtils]: 40: Hoare triple {6778#false} assume !false; {6778#false} is VALID [2022-04-28 08:14:09,145 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-28 08:14:09,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:14:09,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116253584] [2022-04-28 08:14:09,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116253584] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:09,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:09,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:14:09,145 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:14:09,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1598421682] [2022-04-28 08:14:09,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1598421682] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:09,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:09,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:14:09,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545933610] [2022-04-28 08:14:09,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:14:09,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (3), 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 41 [2022-04-28 08:14:09,146 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:14:09,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (3), 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-28 08:14:09,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:09,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:14:09,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:09,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:14:09,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:14:09,167 INFO L87 Difference]: Start difference. First operand 225 states and 333 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (3), 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-28 08:14:10,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:10,066 INFO L93 Difference]: Finished difference Result 646 states and 962 transitions. [2022-04-28 08:14:10,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:14:10,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (3), 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 41 [2022-04-28 08:14:10,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:14:10,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (3), 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-28 08:14:10,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 617 transitions. [2022-04-28 08:14:10,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (3), 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-28 08:14:10,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 617 transitions. [2022-04-28 08:14:10,074 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 617 transitions. [2022-04-28 08:14:10,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 617 edges. 617 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:10,470 INFO L225 Difference]: With dead ends: 646 [2022-04-28 08:14:10,470 INFO L226 Difference]: Without dead ends: 435 [2022-04-28 08:14:10,470 INFO L412 NwaCegarLoop]: 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-28 08:14:10,471 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 589 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:14:10,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 220 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:14:10,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2022-04-28 08:14:10,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 433. [2022-04-28 08:14:10,959 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:14:10,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 435 states. Second operand has 433 states, 428 states have (on average 1.4883177570093458) internal successors, (637), 428 states have internal predecessors, (637), 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-28 08:14:10,961 INFO L74 IsIncluded]: Start isIncluded. First operand 435 states. Second operand has 433 states, 428 states have (on average 1.4883177570093458) internal successors, (637), 428 states have internal predecessors, (637), 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-28 08:14:10,962 INFO L87 Difference]: Start difference. First operand 435 states. Second operand has 433 states, 428 states have (on average 1.4883177570093458) internal successors, (637), 428 states have internal predecessors, (637), 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-28 08:14:10,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:10,970 INFO L93 Difference]: Finished difference Result 435 states and 642 transitions. [2022-04-28 08:14:10,970 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 642 transitions. [2022-04-28 08:14:10,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:10,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:10,989 INFO L74 IsIncluded]: Start isIncluded. First operand has 433 states, 428 states have (on average 1.4883177570093458) internal successors, (637), 428 states have internal predecessors, (637), 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) Second operand 435 states. [2022-04-28 08:14:10,989 INFO L87 Difference]: Start difference. First operand has 433 states, 428 states have (on average 1.4883177570093458) internal successors, (637), 428 states have internal predecessors, (637), 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) Second operand 435 states. [2022-04-28 08:14:10,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:10,997 INFO L93 Difference]: Finished difference Result 435 states and 642 transitions. [2022-04-28 08:14:10,997 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 642 transitions. [2022-04-28 08:14:10,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:10,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:10,998 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:14:10,998 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:14:10,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 428 states have (on average 1.4883177570093458) internal successors, (637), 428 states have internal predecessors, (637), 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-28 08:14:11,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 641 transitions. [2022-04-28 08:14:11,008 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 641 transitions. Word has length 41 [2022-04-28 08:14:11,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:14:11,008 INFO L495 AbstractCegarLoop]: Abstraction has 433 states and 641 transitions. [2022-04-28 08:14:11,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (3), 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-28 08:14:11,008 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 433 states and 641 transitions. [2022-04-28 08:14:11,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 641 edges. 641 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:11,428 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 641 transitions. [2022-04-28 08:14:11,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 08:14:11,429 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:14:11,429 INFO L195 NwaCegarLoop]: 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] [2022-04-28 08:14:11,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 08:14:11,429 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:14:11,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:14:11,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1540817245, now seen corresponding path program 1 times [2022-04-28 08:14:11,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:11,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1032266519] [2022-04-28 08:14:11,430 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:14:11,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1540817245, now seen corresponding path program 2 times [2022-04-28 08:14:11,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:14:11,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792063815] [2022-04-28 08:14:11,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:14:11,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:14:11,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:11,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:14:11,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:11,522 INFO L290 TraceCheckUtils]: 0: Hoare triple {9822#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {9816#true} is VALID [2022-04-28 08:14:11,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {9816#true} assume true; {9816#true} is VALID [2022-04-28 08:14:11,522 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9816#true} {9816#true} #657#return; {9816#true} is VALID [2022-04-28 08:14:11,523 INFO L272 TraceCheckUtils]: 0: Hoare triple {9816#true} call ULTIMATE.init(); {9822#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:14:11,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {9822#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {9816#true} is VALID [2022-04-28 08:14:11,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {9816#true} assume true; {9816#true} is VALID [2022-04-28 08:14:11,523 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9816#true} {9816#true} #657#return; {9816#true} is VALID [2022-04-28 08:14:11,523 INFO L272 TraceCheckUtils]: 4: Hoare triple {9816#true} call #t~ret60 := main(); {9816#true} is VALID [2022-04-28 08:14:11,523 INFO L290 TraceCheckUtils]: 5: Hoare triple {9816#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {9816#true} is VALID [2022-04-28 08:14:11,526 INFO L272 TraceCheckUtils]: 6: Hoare triple {9816#true} call #t~ret59 := ssl3_accept(~s~0); {9816#true} is VALID [2022-04-28 08:14:11,526 INFO L290 TraceCheckUtils]: 7: Hoare triple {9816#true} ~initial_state := #in~initial_state;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__info_callback~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__in_handshake~0 := #t~nondet5;havoc #t~nondet5;havoc ~s__state~0;havoc ~s__new_session~0;havoc ~s__server~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__version~0 := #t~nondet6;havoc #t~nondet6;havoc ~s__type~0;havoc ~s__init_num~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__hit~0 := #t~nondet7;havoc #t~nondet7;havoc ~s__rwstate~0;~s__init_buf___0~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~s__debug~0 := #t~nondet8;havoc #t~nondet8;havoc ~s__shutdown~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~s__cert~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~s__options~0 := #t~nondet10;havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~s__verify_mode~0 := #t~nondet11;havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~s__session__peer~0 := #t~nondet12;havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~s__cert__pkeys__AT0__privatekey~0 := #t~nondet13;havoc #t~nondet13;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~s__ctx__info_callback~0 := #t~nondet14;havoc #t~nondet14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~s__ctx__stats__sess_accept_renegotiate~0 := #t~nondet15;havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~s__ctx__stats__sess_accept~0 := #t~nondet16;havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~s__ctx__stats__sess_accept_good~0 := #t~nondet17;havoc #t~nondet17;havoc ~s__s3__tmp__cert_request~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet19;havoc #t~nondet19;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~num1~0 := #t~nondet20;havoc #t~nondet20;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___1~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___2~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___3~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___4~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___5~0 := #t~nondet25;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___6~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___7~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___8~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___9~0 := #t~nondet29;havoc #t~nondet29;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___10~0 := #t~nondet30;havoc #t~nondet30;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;~__cil_tmp58~0 := #t~nondet31;havoc #t~nondet31;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;havoc ~__cil_tmp61~0;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~0 := #t~nondet32;havoc #t~nondet32;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {9816#true} is VALID [2022-04-28 08:14:11,526 INFO L290 TraceCheckUtils]: 8: Hoare triple {9816#true} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {9816#true} is VALID [2022-04-28 08:14:11,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {9816#true} #t~post33 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post33;havoc #t~post33; {9816#true} is VALID [2022-04-28 08:14:11,526 INFO L290 TraceCheckUtils]: 10: Hoare triple {9816#true} assume !(0 != 12288 + ~tmp___1~0); {9816#true} is VALID [2022-04-28 08:14:11,527 INFO L290 TraceCheckUtils]: 11: Hoare triple {9816#true} assume !(0 == ~s__cert~0); {9816#true} is VALID [2022-04-28 08:14:11,527 INFO L290 TraceCheckUtils]: 12: Hoare triple {9816#true} assume !false; {9816#true} is VALID [2022-04-28 08:14:11,527 INFO L290 TraceCheckUtils]: 13: Hoare triple {9816#true} ~state~0 := ~s__state~0; {9816#true} is VALID [2022-04-28 08:14:11,527 INFO L290 TraceCheckUtils]: 14: Hoare triple {9816#true} assume !(12292 == ~s__state~0); {9816#true} is VALID [2022-04-28 08:14:11,527 INFO L290 TraceCheckUtils]: 15: Hoare triple {9816#true} assume !(16384 == ~s__state~0); {9816#true} is VALID [2022-04-28 08:14:11,527 INFO L290 TraceCheckUtils]: 16: Hoare triple {9816#true} assume !(8192 == ~s__state~0); {9816#true} is VALID [2022-04-28 08:14:11,527 INFO L290 TraceCheckUtils]: 17: Hoare triple {9816#true} assume !(24576 == ~s__state~0); {9816#true} is VALID [2022-04-28 08:14:11,527 INFO L290 TraceCheckUtils]: 18: Hoare triple {9816#true} assume !(8195 == ~s__state~0); {9816#true} is VALID [2022-04-28 08:14:11,527 INFO L290 TraceCheckUtils]: 19: Hoare triple {9816#true} assume !(8480 == ~s__state~0); {9816#true} is VALID [2022-04-28 08:14:11,528 INFO L290 TraceCheckUtils]: 20: Hoare triple {9816#true} assume !(8481 == ~s__state~0); {9816#true} is VALID [2022-04-28 08:14:11,528 INFO L290 TraceCheckUtils]: 21: Hoare triple {9816#true} assume !(8482 == ~s__state~0); {9816#true} is VALID [2022-04-28 08:14:11,528 INFO L290 TraceCheckUtils]: 22: Hoare triple {9816#true} assume !(8464 == ~s__state~0); {9816#true} is VALID [2022-04-28 08:14:11,528 INFO L290 TraceCheckUtils]: 23: Hoare triple {9816#true} assume !(8465 == ~s__state~0); {9816#true} is VALID [2022-04-28 08:14:11,528 INFO L290 TraceCheckUtils]: 24: Hoare triple {9816#true} assume !(8466 == ~s__state~0); {9816#true} is VALID [2022-04-28 08:14:11,528 INFO L290 TraceCheckUtils]: 25: Hoare triple {9816#true} assume !(8496 == ~s__state~0); {9816#true} is VALID [2022-04-28 08:14:11,528 INFO L290 TraceCheckUtils]: 26: Hoare triple {9816#true} assume !(8497 == ~s__state~0); {9816#true} is VALID [2022-04-28 08:14:11,528 INFO L290 TraceCheckUtils]: 27: Hoare triple {9816#true} assume 8512 == ~s__state~0; {9816#true} is VALID [2022-04-28 08:14:11,528 INFO L290 TraceCheckUtils]: 28: Hoare triple {9816#true} assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet40;havoc #t~nondet40;~__cil_tmp56~0 := ~s__s3__tmp__new_cipher__algorithms~0; {9816#true} is VALID [2022-04-28 08:14:11,528 INFO L290 TraceCheckUtils]: 29: Hoare triple {9816#true} assume 0 != (256 + ~__cil_tmp56~0) % 4294967296;~skip~0 := 1; {9816#true} is VALID [2022-04-28 08:14:11,529 INFO L290 TraceCheckUtils]: 30: Hoare triple {9816#true} ~s__state~0 := 8528;~s__init_num~0 := 0; {9821#(<= ssl3_accept_~s__state~0 8528)} is VALID [2022-04-28 08:14:11,529 INFO L290 TraceCheckUtils]: 31: Hoare triple {9821#(<= ssl3_accept_~s__state~0 8528)} assume !(0 == ~s__s3__tmp__reuse_message~0); {9821#(<= ssl3_accept_~s__state~0 8528)} is VALID [2022-04-28 08:14:11,529 INFO L290 TraceCheckUtils]: 32: Hoare triple {9821#(<= ssl3_accept_~s__state~0 8528)} assume 8576 == ~state~0; {9821#(<= ssl3_accept_~s__state~0 8528)} is VALID [2022-04-28 08:14:11,530 INFO L290 TraceCheckUtils]: 33: Hoare triple {9821#(<= ssl3_accept_~s__state~0 8528)} assume 8592 == ~s__state~0; {9817#false} is VALID [2022-04-28 08:14:11,530 INFO L290 TraceCheckUtils]: 34: Hoare triple {9817#false} assume -12288 != ~tmp___1~0; {9817#false} is VALID [2022-04-28 08:14:11,530 INFO L290 TraceCheckUtils]: 35: Hoare triple {9817#false} assume -16384 != ~tmp___2~0; {9817#false} is VALID [2022-04-28 08:14:11,530 INFO L290 TraceCheckUtils]: 36: Hoare triple {9817#false} assume 4294967040 != ~__cil_tmp56~0 % 4294967296; {9817#false} is VALID [2022-04-28 08:14:11,530 INFO L290 TraceCheckUtils]: 37: Hoare triple {9817#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {9817#false} is VALID [2022-04-28 08:14:11,530 INFO L290 TraceCheckUtils]: 38: Hoare triple {9817#false} assume 1024 != ~tmp___7~0; {9817#false} is VALID [2022-04-28 08:14:11,530 INFO L290 TraceCheckUtils]: 39: Hoare triple {9817#false} assume 512 != ~tmp___7~0; {9817#false} is VALID [2022-04-28 08:14:11,530 INFO L290 TraceCheckUtils]: 40: Hoare triple {9817#false} assume !false; {9817#false} is VALID [2022-04-28 08:14:11,531 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-28 08:14:11,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:14:11,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792063815] [2022-04-28 08:14:11,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792063815] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:11,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:11,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:14:11,531 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:14:11,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1032266519] [2022-04-28 08:14:11,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1032266519] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:11,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:11,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:14:11,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639655031] [2022-04-28 08:14:11,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:14:11,532 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (3), 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 41 [2022-04-28 08:14:11,532 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:14:11,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (3), 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-28 08:14:11,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:11,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:14:11,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:11,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:14:11,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:14:11,555 INFO L87 Difference]: Start difference. First operand 433 states and 641 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (3), 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-28 08:14:12,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:12,937 INFO L93 Difference]: Finished difference Result 972 states and 1480 transitions. [2022-04-28 08:14:12,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:14:12,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (3), 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 41 [2022-04-28 08:14:12,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:14:12,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (3), 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-28 08:14:12,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 538 transitions. [2022-04-28 08:14:12,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (3), 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-28 08:14:12,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 538 transitions. [2022-04-28 08:14:12,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 538 transitions. [2022-04-28 08:14:13,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 538 edges. 538 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:13,290 INFO L225 Difference]: With dead ends: 972 [2022-04-28 08:14:13,291 INFO L226 Difference]: Without dead ends: 529 [2022-04-28 08:14:13,292 INFO L412 NwaCegarLoop]: 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-28 08:14:13,292 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 348 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 08:14:13,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 235 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 08:14:13,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2022-04-28 08:14:13,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 489. [2022-04-28 08:14:13,992 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:14:13,993 INFO L82 GeneralOperation]: Start isEquivalent. First operand 529 states. Second operand has 489 states, 484 states have (on average 1.5103305785123966) internal successors, (731), 484 states have internal predecessors, (731), 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-28 08:14:13,994 INFO L74 IsIncluded]: Start isIncluded. First operand 529 states. Second operand has 489 states, 484 states have (on average 1.5103305785123966) internal successors, (731), 484 states have internal predecessors, (731), 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-28 08:14:13,994 INFO L87 Difference]: Start difference. First operand 529 states. Second operand has 489 states, 484 states have (on average 1.5103305785123966) internal successors, (731), 484 states have internal predecessors, (731), 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-28 08:14:14,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:14,005 INFO L93 Difference]: Finished difference Result 529 states and 791 transitions. [2022-04-28 08:14:14,006 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 791 transitions. [2022-04-28 08:14:14,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:14,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:14,007 INFO L74 IsIncluded]: Start isIncluded. First operand has 489 states, 484 states have (on average 1.5103305785123966) internal successors, (731), 484 states have internal predecessors, (731), 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) Second operand 529 states. [2022-04-28 08:14:14,008 INFO L87 Difference]: Start difference. First operand has 489 states, 484 states have (on average 1.5103305785123966) internal successors, (731), 484 states have internal predecessors, (731), 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) Second operand 529 states. [2022-04-28 08:14:14,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:14,018 INFO L93 Difference]: Finished difference Result 529 states and 791 transitions. [2022-04-28 08:14:14,018 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 791 transitions. [2022-04-28 08:14:14,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:14,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:14,019 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:14:14,019 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:14:14,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 484 states have (on average 1.5103305785123966) internal successors, (731), 484 states have internal predecessors, (731), 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-28 08:14:14,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 735 transitions. [2022-04-28 08:14:14,031 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 735 transitions. Word has length 41 [2022-04-28 08:14:14,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:14:14,031 INFO L495 AbstractCegarLoop]: Abstraction has 489 states and 735 transitions. [2022-04-28 08:14:14,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (3), 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-28 08:14:14,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 489 states and 735 transitions. [2022-04-28 08:14:14,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 735 edges. 735 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:14,461 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 735 transitions. [2022-04-28 08:14:14,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 08:14:14,462 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:14:14,462 INFO L195 NwaCegarLoop]: 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] [2022-04-28 08:14:14,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 08:14:14,462 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:14:14,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:14:14,463 INFO L85 PathProgramCache]: Analyzing trace with hash 162840181, now seen corresponding path program 1 times [2022-04-28 08:14:14,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:14,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [635869446] [2022-04-28 08:14:14,463 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:14:14,463 INFO L85 PathProgramCache]: Analyzing trace with hash 162840181, now seen corresponding path program 2 times [2022-04-28 08:14:14,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:14:14,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828974214] [2022-04-28 08:14:14,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:14:14,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:14:14,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:14,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:14:14,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:14,517 INFO L290 TraceCheckUtils]: 0: Hoare triple {13814#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {13808#true} is VALID [2022-04-28 08:14:14,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {13808#true} assume true; {13808#true} is VALID [2022-04-28 08:14:14,517 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13808#true} {13808#true} #657#return; {13808#true} is VALID [2022-04-28 08:14:14,517 INFO L272 TraceCheckUtils]: 0: Hoare triple {13808#true} call ULTIMATE.init(); {13814#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:14:14,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {13814#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {13808#true} is VALID [2022-04-28 08:14:14,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {13808#true} assume true; {13808#true} is VALID [2022-04-28 08:14:14,521 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13808#true} {13808#true} #657#return; {13808#true} is VALID [2022-04-28 08:14:14,521 INFO L272 TraceCheckUtils]: 4: Hoare triple {13808#true} call #t~ret60 := main(); {13808#true} is VALID [2022-04-28 08:14:14,521 INFO L290 TraceCheckUtils]: 5: Hoare triple {13808#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {13808#true} is VALID [2022-04-28 08:14:14,522 INFO L272 TraceCheckUtils]: 6: Hoare triple {13808#true} call #t~ret59 := ssl3_accept(~s~0); {13808#true} is VALID [2022-04-28 08:14:14,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {13808#true} ~initial_state := #in~initial_state;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__info_callback~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__in_handshake~0 := #t~nondet5;havoc #t~nondet5;havoc ~s__state~0;havoc ~s__new_session~0;havoc ~s__server~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__version~0 := #t~nondet6;havoc #t~nondet6;havoc ~s__type~0;havoc ~s__init_num~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__hit~0 := #t~nondet7;havoc #t~nondet7;havoc ~s__rwstate~0;~s__init_buf___0~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~s__debug~0 := #t~nondet8;havoc #t~nondet8;havoc ~s__shutdown~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~s__cert~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~s__options~0 := #t~nondet10;havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~s__verify_mode~0 := #t~nondet11;havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~s__session__peer~0 := #t~nondet12;havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~s__cert__pkeys__AT0__privatekey~0 := #t~nondet13;havoc #t~nondet13;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~s__ctx__info_callback~0 := #t~nondet14;havoc #t~nondet14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~s__ctx__stats__sess_accept_renegotiate~0 := #t~nondet15;havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~s__ctx__stats__sess_accept~0 := #t~nondet16;havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~s__ctx__stats__sess_accept_good~0 := #t~nondet17;havoc #t~nondet17;havoc ~s__s3__tmp__cert_request~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet19;havoc #t~nondet19;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~num1~0 := #t~nondet20;havoc #t~nondet20;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___1~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___2~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___3~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___4~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___5~0 := #t~nondet25;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___6~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___7~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___8~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___9~0 := #t~nondet29;havoc #t~nondet29;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___10~0 := #t~nondet30;havoc #t~nondet30;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;~__cil_tmp58~0 := #t~nondet31;havoc #t~nondet31;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;havoc ~__cil_tmp61~0;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~0 := #t~nondet32;havoc #t~nondet32;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {13808#true} is VALID [2022-04-28 08:14:14,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {13808#true} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {13808#true} is VALID [2022-04-28 08:14:14,522 INFO L290 TraceCheckUtils]: 9: Hoare triple {13808#true} #t~post33 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post33;havoc #t~post33; {13808#true} is VALID [2022-04-28 08:14:14,522 INFO L290 TraceCheckUtils]: 10: Hoare triple {13808#true} assume !(0 != 12288 + ~tmp___1~0); {13808#true} is VALID [2022-04-28 08:14:14,522 INFO L290 TraceCheckUtils]: 11: Hoare triple {13808#true} assume !(0 == ~s__cert~0); {13808#true} is VALID [2022-04-28 08:14:14,522 INFO L290 TraceCheckUtils]: 12: Hoare triple {13808#true} assume !false; {13808#true} is VALID [2022-04-28 08:14:14,522 INFO L290 TraceCheckUtils]: 13: Hoare triple {13808#true} ~state~0 := ~s__state~0; {13808#true} is VALID [2022-04-28 08:14:14,522 INFO L290 TraceCheckUtils]: 14: Hoare triple {13808#true} assume !(12292 == ~s__state~0); {13808#true} is VALID [2022-04-28 08:14:14,522 INFO L290 TraceCheckUtils]: 15: Hoare triple {13808#true} assume !(16384 == ~s__state~0); {13808#true} is VALID [2022-04-28 08:14:14,523 INFO L290 TraceCheckUtils]: 16: Hoare triple {13808#true} assume !(8192 == ~s__state~0); {13808#true} is VALID [2022-04-28 08:14:14,523 INFO L290 TraceCheckUtils]: 17: Hoare triple {13808#true} assume !(24576 == ~s__state~0); {13808#true} is VALID [2022-04-28 08:14:14,523 INFO L290 TraceCheckUtils]: 18: Hoare triple {13808#true} assume !(8195 == ~s__state~0); {13808#true} is VALID [2022-04-28 08:14:14,523 INFO L290 TraceCheckUtils]: 19: Hoare triple {13808#true} assume !(8480 == ~s__state~0); {13808#true} is VALID [2022-04-28 08:14:14,523 INFO L290 TraceCheckUtils]: 20: Hoare triple {13808#true} assume !(8481 == ~s__state~0); {13808#true} is VALID [2022-04-28 08:14:14,523 INFO L290 TraceCheckUtils]: 21: Hoare triple {13808#true} assume !(8482 == ~s__state~0); {13808#true} is VALID [2022-04-28 08:14:14,523 INFO L290 TraceCheckUtils]: 22: Hoare triple {13808#true} assume !(8464 == ~s__state~0); {13808#true} is VALID [2022-04-28 08:14:14,523 INFO L290 TraceCheckUtils]: 23: Hoare triple {13808#true} assume !(8465 == ~s__state~0); {13808#true} is VALID [2022-04-28 08:14:14,523 INFO L290 TraceCheckUtils]: 24: Hoare triple {13808#true} assume !(8466 == ~s__state~0); {13808#true} is VALID [2022-04-28 08:14:14,523 INFO L290 TraceCheckUtils]: 25: Hoare triple {13808#true} assume 8496 == ~s__state~0; {13808#true} is VALID [2022-04-28 08:14:14,523 INFO L290 TraceCheckUtils]: 26: Hoare triple {13808#true} assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~ret~0 := #t~nondet39;havoc #t~nondet39; {13808#true} is VALID [2022-04-28 08:14:14,524 INFO L290 TraceCheckUtils]: 27: Hoare triple {13808#true} assume !(1 == ~blastFlag~0); {13808#true} is VALID [2022-04-28 08:14:14,524 INFO L290 TraceCheckUtils]: 28: Hoare triple {13808#true} assume !(3 == ~blastFlag~0); {13808#true} is VALID [2022-04-28 08:14:14,524 INFO L290 TraceCheckUtils]: 29: Hoare triple {13808#true} assume !(~ret~0 <= 0); {13808#true} is VALID [2022-04-28 08:14:14,525 INFO L290 TraceCheckUtils]: 30: Hoare triple {13808#true} assume 0 != ~s__hit~0;~s__state~0 := 8656; {13813#(<= 8656 ssl3_accept_~s__state~0)} is VALID [2022-04-28 08:14:14,525 INFO L290 TraceCheckUtils]: 31: Hoare triple {13813#(<= 8656 ssl3_accept_~s__state~0)} ~s__init_num~0 := 0; {13813#(<= 8656 ssl3_accept_~s__state~0)} is VALID [2022-04-28 08:14:14,526 INFO L290 TraceCheckUtils]: 32: Hoare triple {13813#(<= 8656 ssl3_accept_~s__state~0)} assume !(0 == ~s__s3__tmp__reuse_message~0); {13813#(<= 8656 ssl3_accept_~s__state~0)} is VALID [2022-04-28 08:14:14,526 INFO L290 TraceCheckUtils]: 33: Hoare triple {13813#(<= 8656 ssl3_accept_~s__state~0)} assume 8576 == ~state~0; {13813#(<= 8656 ssl3_accept_~s__state~0)} is VALID [2022-04-28 08:14:14,526 INFO L290 TraceCheckUtils]: 34: Hoare triple {13813#(<= 8656 ssl3_accept_~s__state~0)} assume 8592 == ~s__state~0; {13809#false} is VALID [2022-04-28 08:14:14,526 INFO L290 TraceCheckUtils]: 35: Hoare triple {13809#false} assume -12288 != ~tmp___1~0; {13809#false} is VALID [2022-04-28 08:14:14,526 INFO L290 TraceCheckUtils]: 36: Hoare triple {13809#false} assume -16384 != ~tmp___2~0; {13809#false} is VALID [2022-04-28 08:14:14,526 INFO L290 TraceCheckUtils]: 37: Hoare triple {13809#false} assume 4294967040 != ~__cil_tmp56~0 % 4294967296; {13809#false} is VALID [2022-04-28 08:14:14,526 INFO L290 TraceCheckUtils]: 38: Hoare triple {13809#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {13809#false} is VALID [2022-04-28 08:14:14,527 INFO L290 TraceCheckUtils]: 39: Hoare triple {13809#false} assume 1024 != ~tmp___7~0; {13809#false} is VALID [2022-04-28 08:14:14,527 INFO L290 TraceCheckUtils]: 40: Hoare triple {13809#false} assume 512 != ~tmp___7~0; {13809#false} is VALID [2022-04-28 08:14:14,527 INFO L290 TraceCheckUtils]: 41: Hoare triple {13809#false} assume !false; {13809#false} is VALID [2022-04-28 08:14:14,528 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-28 08:14:14,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:14:14,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828974214] [2022-04-28 08:14:14,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828974214] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:14,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:14,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:14:14,529 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:14:14,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [635869446] [2022-04-28 08:14:14,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [635869446] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:14,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:14,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:14:14,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927395695] [2022-04-28 08:14:14,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:14:14,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 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 42 [2022-04-28 08:14:14,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:14:14,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 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-28 08:14:14,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:14,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:14:14,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:14,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:14:14,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:14:14,550 INFO L87 Difference]: Start difference. First operand 489 states and 735 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 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-28 08:14:15,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:15,623 INFO L93 Difference]: Finished difference Result 1058 states and 1625 transitions. [2022-04-28 08:14:15,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:14:15,623 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 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 42 [2022-04-28 08:14:15,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:14:15,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 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-28 08:14:15,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 518 transitions. [2022-04-28 08:14:15,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 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-28 08:14:15,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 518 transitions. [2022-04-28 08:14:15,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 518 transitions. [2022-04-28 08:14:15,959 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 518 edges. 518 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:15,974 INFO L225 Difference]: With dead ends: 1058 [2022-04-28 08:14:15,975 INFO L226 Difference]: Without dead ends: 583 [2022-04-28 08:14:15,975 INFO L412 NwaCegarLoop]: 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-28 08:14:15,976 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 293 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:14:15,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 238 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:14:15,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2022-04-28 08:14:16,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 571. [2022-04-28 08:14:16,737 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:14:16,738 INFO L82 GeneralOperation]: Start isEquivalent. First operand 583 states. Second operand has 571 states, 566 states have (on average 1.4681978798586572) internal successors, (831), 566 states have internal predecessors, (831), 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-28 08:14:16,739 INFO L74 IsIncluded]: Start isIncluded. First operand 583 states. Second operand has 571 states, 566 states have (on average 1.4681978798586572) internal successors, (831), 566 states have internal predecessors, (831), 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-28 08:14:16,740 INFO L87 Difference]: Start difference. First operand 583 states. Second operand has 571 states, 566 states have (on average 1.4681978798586572) internal successors, (831), 566 states have internal predecessors, (831), 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-28 08:14:16,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:16,754 INFO L93 Difference]: Finished difference Result 583 states and 852 transitions. [2022-04-28 08:14:16,754 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 852 transitions. [2022-04-28 08:14:16,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:16,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:16,756 INFO L74 IsIncluded]: Start isIncluded. First operand has 571 states, 566 states have (on average 1.4681978798586572) internal successors, (831), 566 states have internal predecessors, (831), 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) Second operand 583 states. [2022-04-28 08:14:16,756 INFO L87 Difference]: Start difference. First operand has 571 states, 566 states have (on average 1.4681978798586572) internal successors, (831), 566 states have internal predecessors, (831), 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) Second operand 583 states. [2022-04-28 08:14:16,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:16,769 INFO L93 Difference]: Finished difference Result 583 states and 852 transitions. [2022-04-28 08:14:16,769 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 852 transitions. [2022-04-28 08:14:16,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:16,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:16,770 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:14:16,770 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:14:16,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 566 states have (on average 1.4681978798586572) internal successors, (831), 566 states have internal predecessors, (831), 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-28 08:14:16,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 835 transitions. [2022-04-28 08:14:16,787 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 835 transitions. Word has length 42 [2022-04-28 08:14:16,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:14:16,787 INFO L495 AbstractCegarLoop]: Abstraction has 571 states and 835 transitions. [2022-04-28 08:14:16,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 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-28 08:14:16,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 571 states and 835 transitions. [2022-04-28 08:14:17,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 835 edges. 835 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:17,428 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 835 transitions. [2022-04-28 08:14:17,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 08:14:17,430 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:14:17,430 INFO L195 NwaCegarLoop]: 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] [2022-04-28 08:14:17,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 08:14:17,430 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:14:17,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:14:17,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1441142835, now seen corresponding path program 1 times [2022-04-28 08:14:17,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:17,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [138352856] [2022-04-28 08:14:17,431 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:14:17,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1441142835, now seen corresponding path program 2 times [2022-04-28 08:14:17,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:14:17,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273462762] [2022-04-28 08:14:17,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:14:17,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:14:17,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:17,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:14:17,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:17,507 INFO L290 TraceCheckUtils]: 0: Hoare triple {18250#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {18244#true} is VALID [2022-04-28 08:14:17,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {18244#true} assume true; {18244#true} is VALID [2022-04-28 08:14:17,507 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18244#true} {18244#true} #657#return; {18244#true} is VALID [2022-04-28 08:14:17,508 INFO L272 TraceCheckUtils]: 0: Hoare triple {18244#true} call ULTIMATE.init(); {18250#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:14:17,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {18250#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {18244#true} is VALID [2022-04-28 08:14:17,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {18244#true} assume true; {18244#true} is VALID [2022-04-28 08:14:17,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18244#true} {18244#true} #657#return; {18244#true} is VALID [2022-04-28 08:14:17,508 INFO L272 TraceCheckUtils]: 4: Hoare triple {18244#true} call #t~ret60 := main(); {18244#true} is VALID [2022-04-28 08:14:17,508 INFO L290 TraceCheckUtils]: 5: Hoare triple {18244#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {18244#true} is VALID [2022-04-28 08:14:17,508 INFO L272 TraceCheckUtils]: 6: Hoare triple {18244#true} call #t~ret59 := ssl3_accept(~s~0); {18244#true} is VALID [2022-04-28 08:14:17,508 INFO L290 TraceCheckUtils]: 7: Hoare triple {18244#true} ~initial_state := #in~initial_state;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__info_callback~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__in_handshake~0 := #t~nondet5;havoc #t~nondet5;havoc ~s__state~0;havoc ~s__new_session~0;havoc ~s__server~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__version~0 := #t~nondet6;havoc #t~nondet6;havoc ~s__type~0;havoc ~s__init_num~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__hit~0 := #t~nondet7;havoc #t~nondet7;havoc ~s__rwstate~0;~s__init_buf___0~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~s__debug~0 := #t~nondet8;havoc #t~nondet8;havoc ~s__shutdown~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~s__cert~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~s__options~0 := #t~nondet10;havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~s__verify_mode~0 := #t~nondet11;havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~s__session__peer~0 := #t~nondet12;havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~s__cert__pkeys__AT0__privatekey~0 := #t~nondet13;havoc #t~nondet13;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~s__ctx__info_callback~0 := #t~nondet14;havoc #t~nondet14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~s__ctx__stats__sess_accept_renegotiate~0 := #t~nondet15;havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~s__ctx__stats__sess_accept~0 := #t~nondet16;havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~s__ctx__stats__sess_accept_good~0 := #t~nondet17;havoc #t~nondet17;havoc ~s__s3__tmp__cert_request~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet19;havoc #t~nondet19;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~num1~0 := #t~nondet20;havoc #t~nondet20;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___1~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___2~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___3~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___4~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___5~0 := #t~nondet25;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___6~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___7~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___8~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___9~0 := #t~nondet29;havoc #t~nondet29;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___10~0 := #t~nondet30;havoc #t~nondet30;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;~__cil_tmp58~0 := #t~nondet31;havoc #t~nondet31;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;havoc ~__cil_tmp61~0;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~0 := #t~nondet32;havoc #t~nondet32;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {18244#true} is VALID [2022-04-28 08:14:17,508 INFO L290 TraceCheckUtils]: 8: Hoare triple {18244#true} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {18244#true} is VALID [2022-04-28 08:14:17,509 INFO L290 TraceCheckUtils]: 9: Hoare triple {18244#true} #t~post33 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post33;havoc #t~post33; {18244#true} is VALID [2022-04-28 08:14:17,509 INFO L290 TraceCheckUtils]: 10: Hoare triple {18244#true} assume !(0 != 12288 + ~tmp___1~0); {18244#true} is VALID [2022-04-28 08:14:17,509 INFO L290 TraceCheckUtils]: 11: Hoare triple {18244#true} assume !(0 == ~s__cert~0); {18244#true} is VALID [2022-04-28 08:14:17,509 INFO L290 TraceCheckUtils]: 12: Hoare triple {18244#true} assume !false; {18244#true} is VALID [2022-04-28 08:14:17,509 INFO L290 TraceCheckUtils]: 13: Hoare triple {18244#true} ~state~0 := ~s__state~0; {18244#true} is VALID [2022-04-28 08:14:17,509 INFO L290 TraceCheckUtils]: 14: Hoare triple {18244#true} assume !(12292 == ~s__state~0); {18244#true} is VALID [2022-04-28 08:14:17,509 INFO L290 TraceCheckUtils]: 15: Hoare triple {18244#true} assume !(16384 == ~s__state~0); {18244#true} is VALID [2022-04-28 08:14:17,509 INFO L290 TraceCheckUtils]: 16: Hoare triple {18244#true} assume !(8192 == ~s__state~0); {18244#true} is VALID [2022-04-28 08:14:17,510 INFO L290 TraceCheckUtils]: 17: Hoare triple {18244#true} assume !(24576 == ~s__state~0); {18244#true} is VALID [2022-04-28 08:14:17,510 INFO L290 TraceCheckUtils]: 18: Hoare triple {18244#true} assume !(8195 == ~s__state~0); {18244#true} is VALID [2022-04-28 08:14:17,510 INFO L290 TraceCheckUtils]: 19: Hoare triple {18244#true} assume !(8480 == ~s__state~0); {18244#true} is VALID [2022-04-28 08:14:17,510 INFO L290 TraceCheckUtils]: 20: Hoare triple {18244#true} assume !(8481 == ~s__state~0); {18244#true} is VALID [2022-04-28 08:14:17,510 INFO L290 TraceCheckUtils]: 21: Hoare triple {18244#true} assume !(8482 == ~s__state~0); {18244#true} is VALID [2022-04-28 08:14:17,511 INFO L290 TraceCheckUtils]: 22: Hoare triple {18244#true} assume !(8464 == ~s__state~0); {18244#true} is VALID [2022-04-28 08:14:17,511 INFO L290 TraceCheckUtils]: 23: Hoare triple {18244#true} assume !(8465 == ~s__state~0); {18244#true} is VALID [2022-04-28 08:14:17,511 INFO L290 TraceCheckUtils]: 24: Hoare triple {18244#true} assume !(8466 == ~s__state~0); {18244#true} is VALID [2022-04-28 08:14:17,511 INFO L290 TraceCheckUtils]: 25: Hoare triple {18244#true} assume !(8496 == ~s__state~0); {18244#true} is VALID [2022-04-28 08:14:17,512 INFO L290 TraceCheckUtils]: 26: Hoare triple {18244#true} assume !(8497 == ~s__state~0); {18244#true} is VALID [2022-04-28 08:14:17,512 INFO L290 TraceCheckUtils]: 27: Hoare triple {18244#true} assume !(8512 == ~s__state~0); {18244#true} is VALID [2022-04-28 08:14:17,512 INFO L290 TraceCheckUtils]: 28: Hoare triple {18244#true} assume !(8513 == ~s__state~0); {18244#true} is VALID [2022-04-28 08:14:17,512 INFO L290 TraceCheckUtils]: 29: Hoare triple {18244#true} assume !(8528 == ~s__state~0); {18244#true} is VALID [2022-04-28 08:14:17,512 INFO L290 TraceCheckUtils]: 30: Hoare triple {18244#true} assume !(8529 == ~s__state~0); {18244#true} is VALID [2022-04-28 08:14:17,512 INFO L290 TraceCheckUtils]: 31: Hoare triple {18244#true} assume 8544 == ~s__state~0; {18244#true} is VALID [2022-04-28 08:14:17,512 INFO L290 TraceCheckUtils]: 32: Hoare triple {18244#true} assume !(0 != 1 + ~s__verify_mode~0);~skip~0 := 1;~s__s3__tmp__cert_request~0 := 0;~s__state~0 := 8560; {18249#(<= ssl3_accept_~s__state~0 8560)} is VALID [2022-04-28 08:14:17,513 INFO L290 TraceCheckUtils]: 33: Hoare triple {18249#(<= ssl3_accept_~s__state~0 8560)} assume !(0 == ~s__s3__tmp__reuse_message~0); {18249#(<= ssl3_accept_~s__state~0 8560)} is VALID [2022-04-28 08:14:17,513 INFO L290 TraceCheckUtils]: 34: Hoare triple {18249#(<= ssl3_accept_~s__state~0 8560)} assume 8576 == ~state~0; {18249#(<= ssl3_accept_~s__state~0 8560)} is VALID [2022-04-28 08:14:17,513 INFO L290 TraceCheckUtils]: 35: Hoare triple {18249#(<= ssl3_accept_~s__state~0 8560)} assume 8592 == ~s__state~0; {18245#false} is VALID [2022-04-28 08:14:17,513 INFO L290 TraceCheckUtils]: 36: Hoare triple {18245#false} assume -12288 != ~tmp___1~0; {18245#false} is VALID [2022-04-28 08:14:17,513 INFO L290 TraceCheckUtils]: 37: Hoare triple {18245#false} assume -16384 != ~tmp___2~0; {18245#false} is VALID [2022-04-28 08:14:17,514 INFO L290 TraceCheckUtils]: 38: Hoare triple {18245#false} assume 4294967040 != ~__cil_tmp56~0 % 4294967296; {18245#false} is VALID [2022-04-28 08:14:17,514 INFO L290 TraceCheckUtils]: 39: Hoare triple {18245#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {18245#false} is VALID [2022-04-28 08:14:17,514 INFO L290 TraceCheckUtils]: 40: Hoare triple {18245#false} assume 1024 != ~tmp___7~0; {18245#false} is VALID [2022-04-28 08:14:17,514 INFO L290 TraceCheckUtils]: 41: Hoare triple {18245#false} assume 512 != ~tmp___7~0; {18245#false} is VALID [2022-04-28 08:14:17,514 INFO L290 TraceCheckUtils]: 42: Hoare triple {18245#false} assume !false; {18245#false} is VALID [2022-04-28 08:14:17,514 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-28 08:14:17,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:14:17,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273462762] [2022-04-28 08:14:17,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273462762] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:17,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:17,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:14:17,515 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:14:17,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [138352856] [2022-04-28 08:14:17,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [138352856] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:17,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:17,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:14:17,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137431575] [2022-04-28 08:14:17,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:14:17,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 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 43 [2022-04-28 08:14:17,515 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:14:17,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 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-28 08:14:17,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:17,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:14:17,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:17,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:14:17,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:14:17,539 INFO L87 Difference]: Start difference. First operand 571 states and 835 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 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-28 08:14:19,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:19,022 INFO L93 Difference]: Finished difference Result 1224 states and 1828 transitions. [2022-04-28 08:14:19,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:14:19,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 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 43 [2022-04-28 08:14:19,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:14:19,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 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-28 08:14:19,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 519 transitions. [2022-04-28 08:14:19,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 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-28 08:14:19,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 519 transitions. [2022-04-28 08:14:19,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 519 transitions. [2022-04-28 08:14:19,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 519 edges. 519 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:19,388 INFO L225 Difference]: With dead ends: 1224 [2022-04-28 08:14:19,388 INFO L226 Difference]: Without dead ends: 643 [2022-04-28 08:14:19,389 INFO L412 NwaCegarLoop]: 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-28 08:14:19,390 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 339 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:14:19,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 235 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:14:19,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2022-04-28 08:14:20,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 633. [2022-04-28 08:14:20,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:14:20,126 INFO L82 GeneralOperation]: Start isEquivalent. First operand 643 states. Second operand has 633 states, 628 states have (on average 1.4952229299363058) internal successors, (939), 628 states have internal predecessors, (939), 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-28 08:14:20,127 INFO L74 IsIncluded]: Start isIncluded. First operand 643 states. Second operand has 633 states, 628 states have (on average 1.4952229299363058) internal successors, (939), 628 states have internal predecessors, (939), 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-28 08:14:20,147 INFO L87 Difference]: Start difference. First operand 643 states. Second operand has 633 states, 628 states have (on average 1.4952229299363058) internal successors, (939), 628 states have internal predecessors, (939), 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-28 08:14:20,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:20,161 INFO L93 Difference]: Finished difference Result 643 states and 953 transitions. [2022-04-28 08:14:20,161 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 953 transitions. [2022-04-28 08:14:20,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:20,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:20,162 INFO L74 IsIncluded]: Start isIncluded. First operand has 633 states, 628 states have (on average 1.4952229299363058) internal successors, (939), 628 states have internal predecessors, (939), 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) Second operand 643 states. [2022-04-28 08:14:20,163 INFO L87 Difference]: Start difference. First operand has 633 states, 628 states have (on average 1.4952229299363058) internal successors, (939), 628 states have internal predecessors, (939), 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) Second operand 643 states. [2022-04-28 08:14:20,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:20,193 INFO L93 Difference]: Finished difference Result 643 states and 953 transitions. [2022-04-28 08:14:20,193 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 953 transitions. [2022-04-28 08:14:20,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:20,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:20,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:14:20,194 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:14:20,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 628 states have (on average 1.4952229299363058) internal successors, (939), 628 states have internal predecessors, (939), 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-28 08:14:20,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 943 transitions. [2022-04-28 08:14:20,216 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 943 transitions. Word has length 43 [2022-04-28 08:14:20,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:14:20,216 INFO L495 AbstractCegarLoop]: Abstraction has 633 states and 943 transitions. [2022-04-28 08:14:20,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 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-28 08:14:20,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 633 states and 943 transitions. [2022-04-28 08:14:20,879 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 943 edges. 943 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:20,879 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 943 transitions. [2022-04-28 08:14:20,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-28 08:14:20,881 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:14:20,882 INFO L195 NwaCegarLoop]: 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] [2022-04-28 08:14:20,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 08:14:20,882 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:14:20,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:14:20,882 INFO L85 PathProgramCache]: Analyzing trace with hash -111424063, now seen corresponding path program 1 times [2022-04-28 08:14:20,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:20,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [732332264] [2022-04-28 08:14:20,882 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:14:20,883 INFO L85 PathProgramCache]: Analyzing trace with hash -111424063, now seen corresponding path program 2 times [2022-04-28 08:14:20,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:14:20,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559298108] [2022-04-28 08:14:20,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:14:20,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:14:20,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:20,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:14:20,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:20,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {23263#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {23256#true} is VALID [2022-04-28 08:14:20,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {23256#true} assume true; {23256#true} is VALID [2022-04-28 08:14:20,966 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23256#true} {23256#true} #657#return; {23256#true} is VALID [2022-04-28 08:14:20,966 INFO L272 TraceCheckUtils]: 0: Hoare triple {23256#true} call ULTIMATE.init(); {23263#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:14:20,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {23263#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {23256#true} is VALID [2022-04-28 08:14:20,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {23256#true} assume true; {23256#true} is VALID [2022-04-28 08:14:20,966 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23256#true} {23256#true} #657#return; {23256#true} is VALID [2022-04-28 08:14:20,966 INFO L272 TraceCheckUtils]: 4: Hoare triple {23256#true} call #t~ret60 := main(); {23256#true} is VALID [2022-04-28 08:14:20,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {23256#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {23256#true} is VALID [2022-04-28 08:14:20,967 INFO L272 TraceCheckUtils]: 6: Hoare triple {23256#true} call #t~ret59 := ssl3_accept(~s~0); {23256#true} is VALID [2022-04-28 08:14:20,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {23256#true} ~initial_state := #in~initial_state;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__info_callback~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__in_handshake~0 := #t~nondet5;havoc #t~nondet5;havoc ~s__state~0;havoc ~s__new_session~0;havoc ~s__server~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__version~0 := #t~nondet6;havoc #t~nondet6;havoc ~s__type~0;havoc ~s__init_num~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__hit~0 := #t~nondet7;havoc #t~nondet7;havoc ~s__rwstate~0;~s__init_buf___0~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~s__debug~0 := #t~nondet8;havoc #t~nondet8;havoc ~s__shutdown~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~s__cert~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~s__options~0 := #t~nondet10;havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~s__verify_mode~0 := #t~nondet11;havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~s__session__peer~0 := #t~nondet12;havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~s__cert__pkeys__AT0__privatekey~0 := #t~nondet13;havoc #t~nondet13;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~s__ctx__info_callback~0 := #t~nondet14;havoc #t~nondet14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~s__ctx__stats__sess_accept_renegotiate~0 := #t~nondet15;havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~s__ctx__stats__sess_accept~0 := #t~nondet16;havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~s__ctx__stats__sess_accept_good~0 := #t~nondet17;havoc #t~nondet17;havoc ~s__s3__tmp__cert_request~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet19;havoc #t~nondet19;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~num1~0 := #t~nondet20;havoc #t~nondet20;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___1~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___2~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___3~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___4~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___5~0 := #t~nondet25;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___6~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___7~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___8~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___9~0 := #t~nondet29;havoc #t~nondet29;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___10~0 := #t~nondet30;havoc #t~nondet30;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;~__cil_tmp58~0 := #t~nondet31;havoc #t~nondet31;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;havoc ~__cil_tmp61~0;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~0 := #t~nondet32;havoc #t~nondet32;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {23256#true} is VALID [2022-04-28 08:14:20,967 INFO L290 TraceCheckUtils]: 8: Hoare triple {23256#true} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {23256#true} is VALID [2022-04-28 08:14:20,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {23256#true} #t~post33 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post33;havoc #t~post33; {23256#true} is VALID [2022-04-28 08:14:20,967 INFO L290 TraceCheckUtils]: 10: Hoare triple {23256#true} assume !(0 != 12288 + ~tmp___1~0); {23256#true} is VALID [2022-04-28 08:14:20,967 INFO L290 TraceCheckUtils]: 11: Hoare triple {23256#true} assume !(0 == ~s__cert~0); {23256#true} is VALID [2022-04-28 08:14:20,967 INFO L290 TraceCheckUtils]: 12: Hoare triple {23256#true} assume !false; {23256#true} is VALID [2022-04-28 08:14:20,967 INFO L290 TraceCheckUtils]: 13: Hoare triple {23256#true} ~state~0 := ~s__state~0; {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-28 08:14:20,968 INFO L290 TraceCheckUtils]: 14: Hoare triple {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(12292 == ~s__state~0); {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-28 08:14:20,968 INFO L290 TraceCheckUtils]: 15: Hoare triple {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(16384 == ~s__state~0); {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-28 08:14:20,968 INFO L290 TraceCheckUtils]: 16: Hoare triple {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8192 == ~s__state~0); {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-28 08:14:20,968 INFO L290 TraceCheckUtils]: 17: Hoare triple {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(24576 == ~s__state~0); {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-28 08:14:20,969 INFO L290 TraceCheckUtils]: 18: Hoare triple {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8195 == ~s__state~0); {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-28 08:14:20,969 INFO L290 TraceCheckUtils]: 19: Hoare triple {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8480 == ~s__state~0); {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-28 08:14:20,969 INFO L290 TraceCheckUtils]: 20: Hoare triple {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8481 == ~s__state~0); {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-28 08:14:20,969 INFO L290 TraceCheckUtils]: 21: Hoare triple {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8482 == ~s__state~0); {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-28 08:14:20,969 INFO L290 TraceCheckUtils]: 22: Hoare triple {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8464 == ~s__state~0); {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-28 08:14:20,970 INFO L290 TraceCheckUtils]: 23: Hoare triple {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8465 == ~s__state~0); {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-28 08:14:20,970 INFO L290 TraceCheckUtils]: 24: Hoare triple {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8466 == ~s__state~0); {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-28 08:14:20,970 INFO L290 TraceCheckUtils]: 25: Hoare triple {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8496 == ~s__state~0); {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-28 08:14:20,970 INFO L290 TraceCheckUtils]: 26: Hoare triple {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8497 == ~s__state~0); {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-28 08:14:20,971 INFO L290 TraceCheckUtils]: 27: Hoare triple {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8512 == ~s__state~0); {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-28 08:14:20,971 INFO L290 TraceCheckUtils]: 28: Hoare triple {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8513 == ~s__state~0); {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-28 08:14:20,971 INFO L290 TraceCheckUtils]: 29: Hoare triple {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8528 == ~s__state~0); {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-28 08:14:20,971 INFO L290 TraceCheckUtils]: 30: Hoare triple {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8529 == ~s__state~0); {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-28 08:14:20,972 INFO L290 TraceCheckUtils]: 31: Hoare triple {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8544 == ~s__state~0); {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-28 08:14:20,972 INFO L290 TraceCheckUtils]: 32: Hoare triple {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8545 == ~s__state~0); {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-28 08:14:20,972 INFO L290 TraceCheckUtils]: 33: Hoare triple {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8560 == ~s__state~0); {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-28 08:14:20,972 INFO L290 TraceCheckUtils]: 34: Hoare triple {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8561 == ~s__state~0); {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-28 08:14:20,973 INFO L290 TraceCheckUtils]: 35: Hoare triple {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume 8448 == ~s__state~0; {23262#(<= ssl3_accept_~state~0 8448)} is VALID [2022-04-28 08:14:20,973 INFO L290 TraceCheckUtils]: 36: Hoare triple {23262#(<= ssl3_accept_~state~0 8448)} assume !(~num1~0 > 0); {23262#(<= ssl3_accept_~state~0 8448)} is VALID [2022-04-28 08:14:20,973 INFO L290 TraceCheckUtils]: 37: Hoare triple {23262#(<= ssl3_accept_~state~0 8448)} ~s__state~0 := ~s__s3__tmp__next_state___0~0; {23262#(<= ssl3_accept_~state~0 8448)} is VALID [2022-04-28 08:14:20,973 INFO L290 TraceCheckUtils]: 38: Hoare triple {23262#(<= ssl3_accept_~state~0 8448)} assume !(0 == ~s__s3__tmp__reuse_message~0); {23262#(<= ssl3_accept_~state~0 8448)} is VALID [2022-04-28 08:14:20,974 INFO L290 TraceCheckUtils]: 39: Hoare triple {23262#(<= ssl3_accept_~state~0 8448)} assume 8576 == ~state~0; {23257#false} is VALID [2022-04-28 08:14:20,974 INFO L290 TraceCheckUtils]: 40: Hoare triple {23257#false} assume 8592 == ~s__state~0; {23257#false} is VALID [2022-04-28 08:14:20,974 INFO L290 TraceCheckUtils]: 41: Hoare triple {23257#false} assume -12288 != ~tmp___1~0; {23257#false} is VALID [2022-04-28 08:14:20,974 INFO L290 TraceCheckUtils]: 42: Hoare triple {23257#false} assume -16384 != ~tmp___2~0; {23257#false} is VALID [2022-04-28 08:14:20,974 INFO L290 TraceCheckUtils]: 43: Hoare triple {23257#false} assume 4294967040 != ~__cil_tmp56~0 % 4294967296; {23257#false} is VALID [2022-04-28 08:14:20,974 INFO L290 TraceCheckUtils]: 44: Hoare triple {23257#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {23257#false} is VALID [2022-04-28 08:14:20,974 INFO L290 TraceCheckUtils]: 45: Hoare triple {23257#false} assume 1024 != ~tmp___7~0; {23257#false} is VALID [2022-04-28 08:14:20,974 INFO L290 TraceCheckUtils]: 46: Hoare triple {23257#false} assume 512 != ~tmp___7~0; {23257#false} is VALID [2022-04-28 08:14:20,974 INFO L290 TraceCheckUtils]: 47: Hoare triple {23257#false} assume !false; {23257#false} is VALID [2022-04-28 08:14:20,975 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-28 08:14:20,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:14:20,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559298108] [2022-04-28 08:14:20,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559298108] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:20,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:20,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:14:20,975 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:14:20,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [732332264] [2022-04-28 08:14:20,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [732332264] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:20,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:20,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:14:20,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933827981] [2022-04-28 08:14:20,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:14:20,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 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 48 [2022-04-28 08:14:20,976 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:14:20,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 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-28 08:14:20,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:20,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:14:20,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:20,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:14:20,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:14:20,999 INFO L87 Difference]: Start difference. First operand 633 states and 943 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 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-28 08:14:22,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:22,397 INFO L93 Difference]: Finished difference Result 1392 states and 2069 transitions. [2022-04-28 08:14:22,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 08:14:22,398 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 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 48 [2022-04-28 08:14:22,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:14:22,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 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-28 08:14:22,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 482 transitions. [2022-04-28 08:14:22,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 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-28 08:14:22,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 482 transitions. [2022-04-28 08:14:22,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 482 transitions. [2022-04-28 08:14:22,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 482 edges. 482 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:22,615 INFO L225 Difference]: With dead ends: 1392 [2022-04-28 08:14:22,615 INFO L226 Difference]: Without dead ends: 773 [2022-04-28 08:14:22,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-28 08:14:22,616 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 400 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 08:14:22,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 196 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 08:14:22,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2022-04-28 08:14:23,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 627. [2022-04-28 08:14:23,387 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:14:23,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 773 states. Second operand has 627 states, 622 states have (on average 1.5096463022508038) internal successors, (939), 622 states have internal predecessors, (939), 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-28 08:14:23,389 INFO L74 IsIncluded]: Start isIncluded. First operand 773 states. Second operand has 627 states, 622 states have (on average 1.5096463022508038) internal successors, (939), 622 states have internal predecessors, (939), 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-28 08:14:23,389 INFO L87 Difference]: Start difference. First operand 773 states. Second operand has 627 states, 622 states have (on average 1.5096463022508038) internal successors, (939), 622 states have internal predecessors, (939), 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-28 08:14:23,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:23,407 INFO L93 Difference]: Finished difference Result 773 states and 1138 transitions. [2022-04-28 08:14:23,407 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1138 transitions. [2022-04-28 08:14:23,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:23,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:23,408 INFO L74 IsIncluded]: Start isIncluded. First operand has 627 states, 622 states have (on average 1.5096463022508038) internal successors, (939), 622 states have internal predecessors, (939), 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) Second operand 773 states. [2022-04-28 08:14:23,409 INFO L87 Difference]: Start difference. First operand has 627 states, 622 states have (on average 1.5096463022508038) internal successors, (939), 622 states have internal predecessors, (939), 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) Second operand 773 states. [2022-04-28 08:14:23,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:23,428 INFO L93 Difference]: Finished difference Result 773 states and 1138 transitions. [2022-04-28 08:14:23,428 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1138 transitions. [2022-04-28 08:14:23,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:23,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:23,429 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:14:23,429 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:14:23,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 622 states have (on average 1.5096463022508038) internal successors, (939), 622 states have internal predecessors, (939), 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-28 08:14:23,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 943 transitions. [2022-04-28 08:14:23,445 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 943 transitions. Word has length 48 [2022-04-28 08:14:23,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:14:23,446 INFO L495 AbstractCegarLoop]: Abstraction has 627 states and 943 transitions. [2022-04-28 08:14:23,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 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-28 08:14:23,446 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 627 states and 943 transitions. [2022-04-28 08:14:23,959 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 943 edges. 943 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:23,959 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 943 transitions. [2022-04-28 08:14:23,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 08:14:23,960 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:14:23,961 INFO L195 NwaCegarLoop]: 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, 1] [2022-04-28 08:14:23,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 08:14:23,961 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:14:23,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:14:23,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1022300905, now seen corresponding path program 1 times [2022-04-28 08:14:23,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:23,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [529192586] [2022-04-28 08:14:23,962 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:14:23,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1022300905, now seen corresponding path program 2 times [2022-04-28 08:14:23,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:14:23,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462632976] [2022-04-28 08:14:23,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:14:23,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:14:24,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:24,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:14:24,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:24,043 INFO L290 TraceCheckUtils]: 0: Hoare triple {28865#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {28859#true} is VALID [2022-04-28 08:14:24,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {28859#true} assume true; {28859#true} is VALID [2022-04-28 08:14:24,044 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28859#true} {28859#true} #657#return; {28859#true} is VALID [2022-04-28 08:14:24,045 INFO L272 TraceCheckUtils]: 0: Hoare triple {28859#true} call ULTIMATE.init(); {28865#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:14:24,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {28865#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {28859#true} is VALID [2022-04-28 08:14:24,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {28859#true} assume true; {28859#true} is VALID [2022-04-28 08:14:24,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28859#true} {28859#true} #657#return; {28859#true} is VALID [2022-04-28 08:14:24,048 INFO L272 TraceCheckUtils]: 4: Hoare triple {28859#true} call #t~ret60 := main(); {28859#true} is VALID [2022-04-28 08:14:24,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {28859#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {28859#true} is VALID [2022-04-28 08:14:24,048 INFO L272 TraceCheckUtils]: 6: Hoare triple {28859#true} call #t~ret59 := ssl3_accept(~s~0); {28859#true} is VALID [2022-04-28 08:14:24,048 INFO L290 TraceCheckUtils]: 7: Hoare triple {28859#true} ~initial_state := #in~initial_state;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__info_callback~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__in_handshake~0 := #t~nondet5;havoc #t~nondet5;havoc ~s__state~0;havoc ~s__new_session~0;havoc ~s__server~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__version~0 := #t~nondet6;havoc #t~nondet6;havoc ~s__type~0;havoc ~s__init_num~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__hit~0 := #t~nondet7;havoc #t~nondet7;havoc ~s__rwstate~0;~s__init_buf___0~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~s__debug~0 := #t~nondet8;havoc #t~nondet8;havoc ~s__shutdown~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~s__cert~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~s__options~0 := #t~nondet10;havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~s__verify_mode~0 := #t~nondet11;havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~s__session__peer~0 := #t~nondet12;havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~s__cert__pkeys__AT0__privatekey~0 := #t~nondet13;havoc #t~nondet13;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~s__ctx__info_callback~0 := #t~nondet14;havoc #t~nondet14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~s__ctx__stats__sess_accept_renegotiate~0 := #t~nondet15;havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~s__ctx__stats__sess_accept~0 := #t~nondet16;havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~s__ctx__stats__sess_accept_good~0 := #t~nondet17;havoc #t~nondet17;havoc ~s__s3__tmp__cert_request~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet19;havoc #t~nondet19;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~num1~0 := #t~nondet20;havoc #t~nondet20;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___1~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___2~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___3~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___4~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___5~0 := #t~nondet25;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___6~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___7~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___8~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___9~0 := #t~nondet29;havoc #t~nondet29;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___10~0 := #t~nondet30;havoc #t~nondet30;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;~__cil_tmp58~0 := #t~nondet31;havoc #t~nondet31;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;havoc ~__cil_tmp61~0;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~0 := #t~nondet32;havoc #t~nondet32;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {28859#true} is VALID [2022-04-28 08:14:24,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {28859#true} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {28859#true} is VALID [2022-04-28 08:14:24,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {28859#true} #t~post33 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post33;havoc #t~post33; {28859#true} is VALID [2022-04-28 08:14:24,049 INFO L290 TraceCheckUtils]: 10: Hoare triple {28859#true} assume !(0 != 12288 + ~tmp___1~0); {28859#true} is VALID [2022-04-28 08:14:24,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {28859#true} assume !(0 == ~s__cert~0); {28859#true} is VALID [2022-04-28 08:14:24,050 INFO L290 TraceCheckUtils]: 12: Hoare triple {28859#true} assume !false; {28859#true} is VALID [2022-04-28 08:14:24,050 INFO L290 TraceCheckUtils]: 13: Hoare triple {28859#true} ~state~0 := ~s__state~0; {28859#true} is VALID [2022-04-28 08:14:24,050 INFO L290 TraceCheckUtils]: 14: Hoare triple {28859#true} assume !(12292 == ~s__state~0); {28859#true} is VALID [2022-04-28 08:14:24,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {28859#true} assume !(16384 == ~s__state~0); {28859#true} is VALID [2022-04-28 08:14:24,051 INFO L290 TraceCheckUtils]: 16: Hoare triple {28859#true} assume !(8192 == ~s__state~0); {28859#true} is VALID [2022-04-28 08:14:24,051 INFO L290 TraceCheckUtils]: 17: Hoare triple {28859#true} assume !(24576 == ~s__state~0); {28859#true} is VALID [2022-04-28 08:14:24,051 INFO L290 TraceCheckUtils]: 18: Hoare triple {28859#true} assume !(8195 == ~s__state~0); {28859#true} is VALID [2022-04-28 08:14:24,051 INFO L290 TraceCheckUtils]: 19: Hoare triple {28859#true} assume !(8480 == ~s__state~0); {28859#true} is VALID [2022-04-28 08:14:24,051 INFO L290 TraceCheckUtils]: 20: Hoare triple {28859#true} assume !(8481 == ~s__state~0); {28859#true} is VALID [2022-04-28 08:14:24,051 INFO L290 TraceCheckUtils]: 21: Hoare triple {28859#true} assume !(8482 == ~s__state~0); {28859#true} is VALID [2022-04-28 08:14:24,051 INFO L290 TraceCheckUtils]: 22: Hoare triple {28859#true} assume !(8464 == ~s__state~0); {28859#true} is VALID [2022-04-28 08:14:24,051 INFO L290 TraceCheckUtils]: 23: Hoare triple {28859#true} assume !(8465 == ~s__state~0); {28859#true} is VALID [2022-04-28 08:14:24,051 INFO L290 TraceCheckUtils]: 24: Hoare triple {28859#true} assume !(8466 == ~s__state~0); {28859#true} is VALID [2022-04-28 08:14:24,052 INFO L290 TraceCheckUtils]: 25: Hoare triple {28859#true} assume !(8496 == ~s__state~0); {28859#true} is VALID [2022-04-28 08:14:24,052 INFO L290 TraceCheckUtils]: 26: Hoare triple {28859#true} assume !(8497 == ~s__state~0); {28859#true} is VALID [2022-04-28 08:14:24,052 INFO L290 TraceCheckUtils]: 27: Hoare triple {28859#true} assume !(8512 == ~s__state~0); {28859#true} is VALID [2022-04-28 08:14:24,052 INFO L290 TraceCheckUtils]: 28: Hoare triple {28859#true} assume !(8513 == ~s__state~0); {28859#true} is VALID [2022-04-28 08:14:24,052 INFO L290 TraceCheckUtils]: 29: Hoare triple {28859#true} assume !(8528 == ~s__state~0); {28859#true} is VALID [2022-04-28 08:14:24,052 INFO L290 TraceCheckUtils]: 30: Hoare triple {28859#true} assume !(8529 == ~s__state~0); {28859#true} is VALID [2022-04-28 08:14:24,052 INFO L290 TraceCheckUtils]: 31: Hoare triple {28859#true} assume !(8544 == ~s__state~0); {28859#true} is VALID [2022-04-28 08:14:24,052 INFO L290 TraceCheckUtils]: 32: Hoare triple {28859#true} assume !(8545 == ~s__state~0); {28859#true} is VALID [2022-04-28 08:14:24,052 INFO L290 TraceCheckUtils]: 33: Hoare triple {28859#true} assume !(8560 == ~s__state~0); {28859#true} is VALID [2022-04-28 08:14:24,052 INFO L290 TraceCheckUtils]: 34: Hoare triple {28859#true} assume !(8561 == ~s__state~0); {28859#true} is VALID [2022-04-28 08:14:24,052 INFO L290 TraceCheckUtils]: 35: Hoare triple {28859#true} assume !(8448 == ~s__state~0); {28859#true} is VALID [2022-04-28 08:14:24,053 INFO L290 TraceCheckUtils]: 36: Hoare triple {28859#true} assume !(8576 == ~s__state~0); {28859#true} is VALID [2022-04-28 08:14:24,053 INFO L290 TraceCheckUtils]: 37: Hoare triple {28859#true} assume !(8577 == ~s__state~0); {28859#true} is VALID [2022-04-28 08:14:24,053 INFO L290 TraceCheckUtils]: 38: Hoare triple {28859#true} assume 8592 == ~s__state~0; {28859#true} is VALID [2022-04-28 08:14:24,053 INFO L290 TraceCheckUtils]: 39: Hoare triple {28859#true} assume -2147483648 <= #t~nondet51 && #t~nondet51 <= 2147483647;~ret~0 := #t~nondet51;havoc #t~nondet51; {28859#true} is VALID [2022-04-28 08:14:24,054 INFO L290 TraceCheckUtils]: 40: Hoare triple {28859#true} assume !(~ret~0 <= 0);~s__state~0 := 8608;~s__init_num~0 := 0; {28864#(<= 8608 ssl3_accept_~s__state~0)} is VALID [2022-04-28 08:14:24,054 INFO L290 TraceCheckUtils]: 41: Hoare triple {28864#(<= 8608 ssl3_accept_~s__state~0)} assume !(0 == ~s__s3__tmp__reuse_message~0); {28864#(<= 8608 ssl3_accept_~s__state~0)} is VALID [2022-04-28 08:14:24,054 INFO L290 TraceCheckUtils]: 42: Hoare triple {28864#(<= 8608 ssl3_accept_~s__state~0)} assume 8576 == ~state~0; {28864#(<= 8608 ssl3_accept_~s__state~0)} is VALID [2022-04-28 08:14:24,055 INFO L290 TraceCheckUtils]: 43: Hoare triple {28864#(<= 8608 ssl3_accept_~s__state~0)} assume 8592 == ~s__state~0; {28860#false} is VALID [2022-04-28 08:14:24,055 INFO L290 TraceCheckUtils]: 44: Hoare triple {28860#false} assume -12288 != ~tmp___1~0; {28860#false} is VALID [2022-04-28 08:14:24,055 INFO L290 TraceCheckUtils]: 45: Hoare triple {28860#false} assume -16384 != ~tmp___2~0; {28860#false} is VALID [2022-04-28 08:14:24,055 INFO L290 TraceCheckUtils]: 46: Hoare triple {28860#false} assume 4294967040 != ~__cil_tmp56~0 % 4294967296; {28860#false} is VALID [2022-04-28 08:14:24,055 INFO L290 TraceCheckUtils]: 47: Hoare triple {28860#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {28860#false} is VALID [2022-04-28 08:14:24,055 INFO L290 TraceCheckUtils]: 48: Hoare triple {28860#false} assume 1024 != ~tmp___7~0; {28860#false} is VALID [2022-04-28 08:14:24,056 INFO L290 TraceCheckUtils]: 49: Hoare triple {28860#false} assume 512 != ~tmp___7~0; {28860#false} is VALID [2022-04-28 08:14:24,056 INFO L290 TraceCheckUtils]: 50: Hoare triple {28860#false} assume !false; {28860#false} is VALID [2022-04-28 08:14:24,057 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-28 08:14:24,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:14:24,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462632976] [2022-04-28 08:14:24,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462632976] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:24,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:24,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:14:24,058 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:14:24,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [529192586] [2022-04-28 08:14:24,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [529192586] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:24,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:24,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:14:24,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563033963] [2022-04-28 08:14:24,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:14:24,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (3), 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 51 [2022-04-28 08:14:24,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:14:24,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (3), 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-28 08:14:24,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:24,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:14:24,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:24,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:14:24,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:14:24,085 INFO L87 Difference]: Start difference. First operand 627 states and 943 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (3), 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-28 08:14:25,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:25,152 INFO L93 Difference]: Finished difference Result 1334 states and 2041 transitions. [2022-04-28 08:14:25,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:14:25,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (3), 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 51 [2022-04-28 08:14:25,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:14:25,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (3), 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-28 08:14:25,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 518 transitions. [2022-04-28 08:14:25,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (3), 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-28 08:14:25,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 518 transitions. [2022-04-28 08:14:25,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 518 transitions. [2022-04-28 08:14:25,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 518 edges. 518 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:25,380 INFO L225 Difference]: With dead ends: 1334 [2022-04-28 08:14:25,380 INFO L226 Difference]: Without dead ends: 721 [2022-04-28 08:14:25,381 INFO L412 NwaCegarLoop]: 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-28 08:14:25,382 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 297 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:14:25,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 238 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:14:25,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2022-04-28 08:14:26,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 701. [2022-04-28 08:14:26,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:14:26,135 INFO L82 GeneralOperation]: Start isEquivalent. First operand 721 states. Second operand has 701 states, 696 states have (on average 1.4813218390804597) internal successors, (1031), 696 states have internal predecessors, (1031), 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-28 08:14:26,135 INFO L74 IsIncluded]: Start isIncluded. First operand 721 states. Second operand has 701 states, 696 states have (on average 1.4813218390804597) internal successors, (1031), 696 states have internal predecessors, (1031), 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-28 08:14:26,136 INFO L87 Difference]: Start difference. First operand 721 states. Second operand has 701 states, 696 states have (on average 1.4813218390804597) internal successors, (1031), 696 states have internal predecessors, (1031), 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-28 08:14:26,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:26,150 INFO L93 Difference]: Finished difference Result 721 states and 1068 transitions. [2022-04-28 08:14:26,150 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1068 transitions. [2022-04-28 08:14:26,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:26,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:26,152 INFO L74 IsIncluded]: Start isIncluded. First operand has 701 states, 696 states have (on average 1.4813218390804597) internal successors, (1031), 696 states have internal predecessors, (1031), 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) Second operand 721 states. [2022-04-28 08:14:26,152 INFO L87 Difference]: Start difference. First operand has 701 states, 696 states have (on average 1.4813218390804597) internal successors, (1031), 696 states have internal predecessors, (1031), 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) Second operand 721 states. [2022-04-28 08:14:26,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:26,167 INFO L93 Difference]: Finished difference Result 721 states and 1068 transitions. [2022-04-28 08:14:26,167 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1068 transitions. [2022-04-28 08:14:26,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:26,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:26,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:14:26,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:14:26,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 696 states have (on average 1.4813218390804597) internal successors, (1031), 696 states have internal predecessors, (1031), 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-28 08:14:26,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 1035 transitions. [2022-04-28 08:14:26,187 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 1035 transitions. Word has length 51 [2022-04-28 08:14:26,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:14:26,187 INFO L495 AbstractCegarLoop]: Abstraction has 701 states and 1035 transitions. [2022-04-28 08:14:26,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (3), 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-28 08:14:26,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 701 states and 1035 transitions. [2022-04-28 08:14:26,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1035 edges. 1035 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:26,757 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 1035 transitions. [2022-04-28 08:14:26,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 08:14:26,758 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:14:26,758 INFO L195 NwaCegarLoop]: 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, 1] [2022-04-28 08:14:26,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 08:14:26,758 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:14:26,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:14:26,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1802448233, now seen corresponding path program 1 times [2022-04-28 08:14:26,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:26,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1063952642] [2022-04-28 08:14:26,759 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:14:26,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1802448233, now seen corresponding path program 2 times [2022-04-28 08:14:26,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:14:26,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808012364] [2022-04-28 08:14:26,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:14:26,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:14:26,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:26,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:14:26,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:26,801 INFO L290 TraceCheckUtils]: 0: Hoare triple {34389#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {34383#true} is VALID [2022-04-28 08:14:26,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {34383#true} assume true; {34383#true} is VALID [2022-04-28 08:14:26,802 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34383#true} {34383#true} #657#return; {34383#true} is VALID [2022-04-28 08:14:26,802 INFO L272 TraceCheckUtils]: 0: Hoare triple {34383#true} call ULTIMATE.init(); {34389#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:14:26,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {34389#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {34383#true} is VALID [2022-04-28 08:14:26,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {34383#true} assume true; {34383#true} is VALID [2022-04-28 08:14:26,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34383#true} {34383#true} #657#return; {34383#true} is VALID [2022-04-28 08:14:26,803 INFO L272 TraceCheckUtils]: 4: Hoare triple {34383#true} call #t~ret60 := main(); {34383#true} is VALID [2022-04-28 08:14:26,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {34383#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {34383#true} is VALID [2022-04-28 08:14:26,803 INFO L272 TraceCheckUtils]: 6: Hoare triple {34383#true} call #t~ret59 := ssl3_accept(~s~0); {34383#true} is VALID [2022-04-28 08:14:26,803 INFO L290 TraceCheckUtils]: 7: Hoare triple {34383#true} ~initial_state := #in~initial_state;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__info_callback~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__in_handshake~0 := #t~nondet5;havoc #t~nondet5;havoc ~s__state~0;havoc ~s__new_session~0;havoc ~s__server~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__version~0 := #t~nondet6;havoc #t~nondet6;havoc ~s__type~0;havoc ~s__init_num~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__hit~0 := #t~nondet7;havoc #t~nondet7;havoc ~s__rwstate~0;~s__init_buf___0~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~s__debug~0 := #t~nondet8;havoc #t~nondet8;havoc ~s__shutdown~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~s__cert~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~s__options~0 := #t~nondet10;havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~s__verify_mode~0 := #t~nondet11;havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~s__session__peer~0 := #t~nondet12;havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~s__cert__pkeys__AT0__privatekey~0 := #t~nondet13;havoc #t~nondet13;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~s__ctx__info_callback~0 := #t~nondet14;havoc #t~nondet14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~s__ctx__stats__sess_accept_renegotiate~0 := #t~nondet15;havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~s__ctx__stats__sess_accept~0 := #t~nondet16;havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~s__ctx__stats__sess_accept_good~0 := #t~nondet17;havoc #t~nondet17;havoc ~s__s3__tmp__cert_request~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet19;havoc #t~nondet19;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~num1~0 := #t~nondet20;havoc #t~nondet20;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___1~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___2~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___3~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___4~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___5~0 := #t~nondet25;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___6~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___7~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___8~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___9~0 := #t~nondet29;havoc #t~nondet29;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___10~0 := #t~nondet30;havoc #t~nondet30;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;~__cil_tmp58~0 := #t~nondet31;havoc #t~nondet31;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;havoc ~__cil_tmp61~0;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~0 := #t~nondet32;havoc #t~nondet32;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {34383#true} is VALID [2022-04-28 08:14:26,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {34383#true} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {34383#true} is VALID [2022-04-28 08:14:26,803 INFO L290 TraceCheckUtils]: 9: Hoare triple {34383#true} #t~post33 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post33;havoc #t~post33; {34383#true} is VALID [2022-04-28 08:14:26,803 INFO L290 TraceCheckUtils]: 10: Hoare triple {34383#true} assume !(0 != 12288 + ~tmp___1~0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-28 08:14:26,803 INFO L290 TraceCheckUtils]: 11: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(0 == ~s__cert~0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-28 08:14:26,804 INFO L290 TraceCheckUtils]: 12: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !false; {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-28 08:14:26,804 INFO L290 TraceCheckUtils]: 13: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} ~state~0 := ~s__state~0; {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-28 08:14:26,804 INFO L290 TraceCheckUtils]: 14: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(12292 == ~s__state~0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-28 08:14:26,804 INFO L290 TraceCheckUtils]: 15: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(16384 == ~s__state~0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-28 08:14:26,805 INFO L290 TraceCheckUtils]: 16: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(8192 == ~s__state~0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-28 08:14:26,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(24576 == ~s__state~0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-28 08:14:26,805 INFO L290 TraceCheckUtils]: 18: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(8195 == ~s__state~0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-28 08:14:26,805 INFO L290 TraceCheckUtils]: 19: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(8480 == ~s__state~0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-28 08:14:26,805 INFO L290 TraceCheckUtils]: 20: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(8481 == ~s__state~0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-28 08:14:26,806 INFO L290 TraceCheckUtils]: 21: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(8482 == ~s__state~0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-28 08:14:26,806 INFO L290 TraceCheckUtils]: 22: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(8464 == ~s__state~0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-28 08:14:26,806 INFO L290 TraceCheckUtils]: 23: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(8465 == ~s__state~0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-28 08:14:26,806 INFO L290 TraceCheckUtils]: 24: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(8466 == ~s__state~0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-28 08:14:26,807 INFO L290 TraceCheckUtils]: 25: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(8496 == ~s__state~0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-28 08:14:26,807 INFO L290 TraceCheckUtils]: 26: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(8497 == ~s__state~0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-28 08:14:26,807 INFO L290 TraceCheckUtils]: 27: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(8512 == ~s__state~0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-28 08:14:26,807 INFO L290 TraceCheckUtils]: 28: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(8513 == ~s__state~0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-28 08:14:26,807 INFO L290 TraceCheckUtils]: 29: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(8528 == ~s__state~0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-28 08:14:26,808 INFO L290 TraceCheckUtils]: 30: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(8529 == ~s__state~0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-28 08:14:26,808 INFO L290 TraceCheckUtils]: 31: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(8544 == ~s__state~0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-28 08:14:26,808 INFO L290 TraceCheckUtils]: 32: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(8545 == ~s__state~0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-28 08:14:26,808 INFO L290 TraceCheckUtils]: 33: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(8560 == ~s__state~0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-28 08:14:26,809 INFO L290 TraceCheckUtils]: 34: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(8561 == ~s__state~0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-28 08:14:26,809 INFO L290 TraceCheckUtils]: 35: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(8448 == ~s__state~0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-28 08:14:26,809 INFO L290 TraceCheckUtils]: 36: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume 8576 == ~s__state~0; {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-28 08:14:26,809 INFO L290 TraceCheckUtils]: 37: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume -2147483648 <= #t~nondet49 && #t~nondet49 <= 2147483647;~ret~0 := #t~nondet49;havoc #t~nondet49; {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-28 08:14:26,810 INFO L290 TraceCheckUtils]: 38: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(~ret~0 <= 0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-28 08:14:26,810 INFO L290 TraceCheckUtils]: 39: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(2 == ~ret~0);assume -2147483648 <= #t~nondet50 && #t~nondet50 <= 2147483647;~ret~0 := #t~nondet50;havoc #t~nondet50; {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-28 08:14:26,810 INFO L290 TraceCheckUtils]: 40: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(~ret~0 <= 0);~s__init_num~0 := 0;~s__state~0 := 8592; {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-28 08:14:26,810 INFO L290 TraceCheckUtils]: 41: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(0 == ~s__s3__tmp__reuse_message~0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-28 08:14:26,811 INFO L290 TraceCheckUtils]: 42: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume 8576 == ~state~0; {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-28 08:14:26,811 INFO L290 TraceCheckUtils]: 43: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume 8592 == ~s__state~0; {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-28 08:14:26,811 INFO L290 TraceCheckUtils]: 44: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume -12288 != ~tmp___1~0; {34384#false} is VALID [2022-04-28 08:14:26,811 INFO L290 TraceCheckUtils]: 45: Hoare triple {34384#false} assume -16384 != ~tmp___2~0; {34384#false} is VALID [2022-04-28 08:14:26,811 INFO L290 TraceCheckUtils]: 46: Hoare triple {34384#false} assume 4294967040 != ~__cil_tmp56~0 % 4294967296; {34384#false} is VALID [2022-04-28 08:14:26,811 INFO L290 TraceCheckUtils]: 47: Hoare triple {34384#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {34384#false} is VALID [2022-04-28 08:14:26,811 INFO L290 TraceCheckUtils]: 48: Hoare triple {34384#false} assume 1024 != ~tmp___7~0; {34384#false} is VALID [2022-04-28 08:14:26,811 INFO L290 TraceCheckUtils]: 49: Hoare triple {34384#false} assume 512 != ~tmp___7~0; {34384#false} is VALID [2022-04-28 08:14:26,811 INFO L290 TraceCheckUtils]: 50: Hoare triple {34384#false} assume !false; {34384#false} is VALID [2022-04-28 08:14:26,812 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-28 08:14:26,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:14:26,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808012364] [2022-04-28 08:14:26,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808012364] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:26,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:26,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:14:26,812 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:14:26,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1063952642] [2022-04-28 08:14:26,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1063952642] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:26,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:26,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:14:26,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521736410] [2022-04-28 08:14:26,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:14:26,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (3), 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 51 [2022-04-28 08:14:26,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:14:26,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (3), 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-28 08:14:26,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:26,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:14:26,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:26,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:14:26,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:14:26,837 INFO L87 Difference]: Start difference. First operand 701 states and 1035 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (3), 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-28 08:14:28,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:28,925 INFO L93 Difference]: Finished difference Result 2066 states and 3050 transitions. [2022-04-28 08:14:28,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:14:28,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (3), 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 51 [2022-04-28 08:14:28,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:14:28,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (3), 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-28 08:14:28,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 609 transitions. [2022-04-28 08:14:28,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (3), 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-28 08:14:28,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 609 transitions. [2022-04-28 08:14:28,941 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 609 transitions. [2022-04-28 08:14:29,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 609 edges. 609 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:29,392 INFO L225 Difference]: With dead ends: 2066 [2022-04-28 08:14:29,392 INFO L226 Difference]: Without dead ends: 1379 [2022-04-28 08:14:29,393 INFO L412 NwaCegarLoop]: 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-28 08:14:29,394 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 558 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:14:29,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 225 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:14:29,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2022-04-28 08:14:30,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1377. [2022-04-28 08:14:30,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:14:30,942 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1379 states. Second operand has 1377 states, 1372 states have (on average 1.4766763848396502) internal successors, (2026), 1372 states have internal predecessors, (2026), 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-28 08:14:30,943 INFO L74 IsIncluded]: Start isIncluded. First operand 1379 states. Second operand has 1377 states, 1372 states have (on average 1.4766763848396502) internal successors, (2026), 1372 states have internal predecessors, (2026), 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-28 08:14:30,944 INFO L87 Difference]: Start difference. First operand 1379 states. Second operand has 1377 states, 1372 states have (on average 1.4766763848396502) internal successors, (2026), 1372 states have internal predecessors, (2026), 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-28 08:14:30,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:30,991 INFO L93 Difference]: Finished difference Result 1379 states and 2031 transitions. [2022-04-28 08:14:30,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1379 states and 2031 transitions. [2022-04-28 08:14:30,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:30,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:30,995 INFO L74 IsIncluded]: Start isIncluded. First operand has 1377 states, 1372 states have (on average 1.4766763848396502) internal successors, (2026), 1372 states have internal predecessors, (2026), 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) Second operand 1379 states. [2022-04-28 08:14:30,996 INFO L87 Difference]: Start difference. First operand has 1377 states, 1372 states have (on average 1.4766763848396502) internal successors, (2026), 1372 states have internal predecessors, (2026), 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) Second operand 1379 states. [2022-04-28 08:14:31,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:31,045 INFO L93 Difference]: Finished difference Result 1379 states and 2031 transitions. [2022-04-28 08:14:31,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1379 states and 2031 transitions. [2022-04-28 08:14:31,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:31,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:31,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:14:31,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:14:31,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1377 states, 1372 states have (on average 1.4766763848396502) internal successors, (2026), 1372 states have internal predecessors, (2026), 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-28 08:14:31,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 2030 transitions. [2022-04-28 08:14:31,132 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 2030 transitions. Word has length 51 [2022-04-28 08:14:31,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:14:31,132 INFO L495 AbstractCegarLoop]: Abstraction has 1377 states and 2030 transitions. [2022-04-28 08:14:31,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (3), 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-28 08:14:31,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1377 states and 2030 transitions. [2022-04-28 08:14:32,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2030 edges. 2030 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:32,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 2030 transitions. [2022-04-28 08:14:32,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-28 08:14:32,742 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:14:32,742 INFO L195 NwaCegarLoop]: 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, 1, 1] [2022-04-28 08:14:32,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 08:14:32,743 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:14:32,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:14:32,743 INFO L85 PathProgramCache]: Analyzing trace with hash 821412563, now seen corresponding path program 1 times [2022-04-28 08:14:32,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:32,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1469313764] [2022-04-28 08:14:32,743 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:14:32,743 INFO L85 PathProgramCache]: Analyzing trace with hash 821412563, now seen corresponding path program 2 times [2022-04-28 08:14:32,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:14:32,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71739563] [2022-04-28 08:14:32,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:14:32,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:14:32,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:32,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:14:32,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:32,803 INFO L290 TraceCheckUtils]: 0: Hoare triple {44046#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {44038#true} is VALID [2022-04-28 08:14:32,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {44038#true} assume true; {44038#true} is VALID [2022-04-28 08:14:32,803 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44038#true} {44038#true} #657#return; {44038#true} is VALID [2022-04-28 08:14:32,803 INFO L272 TraceCheckUtils]: 0: Hoare triple {44038#true} call ULTIMATE.init(); {44046#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:14:32,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {44046#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {44038#true} is VALID [2022-04-28 08:14:32,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {44038#true} assume true; {44038#true} is VALID [2022-04-28 08:14:32,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44038#true} {44038#true} #657#return; {44038#true} is VALID [2022-04-28 08:14:32,804 INFO L272 TraceCheckUtils]: 4: Hoare triple {44038#true} call #t~ret60 := main(); {44038#true} is VALID [2022-04-28 08:14:32,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {44038#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {44043#(<= main_~s~0 8464)} is VALID [2022-04-28 08:14:32,804 INFO L272 TraceCheckUtils]: 6: Hoare triple {44043#(<= main_~s~0 8464)} call #t~ret59 := ssl3_accept(~s~0); {44044#(<= |ssl3_accept_#in~initial_state| 8464)} is VALID [2022-04-28 08:14:32,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {44044#(<= |ssl3_accept_#in~initial_state| 8464)} ~initial_state := #in~initial_state;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__info_callback~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__in_handshake~0 := #t~nondet5;havoc #t~nondet5;havoc ~s__state~0;havoc ~s__new_session~0;havoc ~s__server~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__version~0 := #t~nondet6;havoc #t~nondet6;havoc ~s__type~0;havoc ~s__init_num~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__hit~0 := #t~nondet7;havoc #t~nondet7;havoc ~s__rwstate~0;~s__init_buf___0~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~s__debug~0 := #t~nondet8;havoc #t~nondet8;havoc ~s__shutdown~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~s__cert~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~s__options~0 := #t~nondet10;havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~s__verify_mode~0 := #t~nondet11;havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~s__session__peer~0 := #t~nondet12;havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~s__cert__pkeys__AT0__privatekey~0 := #t~nondet13;havoc #t~nondet13;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~s__ctx__info_callback~0 := #t~nondet14;havoc #t~nondet14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~s__ctx__stats__sess_accept_renegotiate~0 := #t~nondet15;havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~s__ctx__stats__sess_accept~0 := #t~nondet16;havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~s__ctx__stats__sess_accept_good~0 := #t~nondet17;havoc #t~nondet17;havoc ~s__s3__tmp__cert_request~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet19;havoc #t~nondet19;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~num1~0 := #t~nondet20;havoc #t~nondet20;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___1~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___2~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___3~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___4~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___5~0 := #t~nondet25;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___6~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___7~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___8~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___9~0 := #t~nondet29;havoc #t~nondet29;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___10~0 := #t~nondet30;havoc #t~nondet30;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;~__cil_tmp58~0 := #t~nondet31;havoc #t~nondet31;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;havoc ~__cil_tmp61~0;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~0 := #t~nondet32;havoc #t~nondet32;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-28 08:14:32,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-28 08:14:32,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} #t~post33 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post33;havoc #t~post33; {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-28 08:14:32,807 INFO L290 TraceCheckUtils]: 10: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume 0 != 12288 + ~tmp___1~0; {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-28 08:14:32,807 INFO L290 TraceCheckUtils]: 11: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume 0 != 16384 + ~tmp___2~0; {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-28 08:14:32,807 INFO L290 TraceCheckUtils]: 12: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume !(0 == ~s__cert~0); {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-28 08:14:32,808 INFO L290 TraceCheckUtils]: 13: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume !false; {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-28 08:14:32,808 INFO L290 TraceCheckUtils]: 14: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} ~state~0 := ~s__state~0; {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-28 08:14:32,808 INFO L290 TraceCheckUtils]: 15: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume !(12292 == ~s__state~0); {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-28 08:14:32,808 INFO L290 TraceCheckUtils]: 16: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume !(16384 == ~s__state~0); {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-28 08:14:32,809 INFO L290 TraceCheckUtils]: 17: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume !(8192 == ~s__state~0); {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-28 08:14:32,809 INFO L290 TraceCheckUtils]: 18: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume !(24576 == ~s__state~0); {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-28 08:14:32,809 INFO L290 TraceCheckUtils]: 19: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume !(8195 == ~s__state~0); {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-28 08:14:32,809 INFO L290 TraceCheckUtils]: 20: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume !(8480 == ~s__state~0); {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-28 08:14:32,810 INFO L290 TraceCheckUtils]: 21: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume !(8481 == ~s__state~0); {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-28 08:14:32,810 INFO L290 TraceCheckUtils]: 22: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume !(8482 == ~s__state~0); {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-28 08:14:32,810 INFO L290 TraceCheckUtils]: 23: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume !(8464 == ~s__state~0); {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-28 08:14:32,810 INFO L290 TraceCheckUtils]: 24: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume !(8465 == ~s__state~0); {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-28 08:14:32,811 INFO L290 TraceCheckUtils]: 25: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume !(8466 == ~s__state~0); {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-28 08:14:32,811 INFO L290 TraceCheckUtils]: 26: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume !(8496 == ~s__state~0); {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-28 08:14:32,811 INFO L290 TraceCheckUtils]: 27: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume !(8497 == ~s__state~0); {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-28 08:14:32,811 INFO L290 TraceCheckUtils]: 28: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume !(8512 == ~s__state~0); {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-28 08:14:32,812 INFO L290 TraceCheckUtils]: 29: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume !(8513 == ~s__state~0); {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-28 08:14:32,812 INFO L290 TraceCheckUtils]: 30: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume !(8528 == ~s__state~0); {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-28 08:14:32,812 INFO L290 TraceCheckUtils]: 31: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume !(8529 == ~s__state~0); {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-28 08:14:32,813 INFO L290 TraceCheckUtils]: 32: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume !(8544 == ~s__state~0); {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-28 08:14:32,813 INFO L290 TraceCheckUtils]: 33: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume !(8545 == ~s__state~0); {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-28 08:14:32,813 INFO L290 TraceCheckUtils]: 34: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume !(8560 == ~s__state~0); {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-28 08:14:32,813 INFO L290 TraceCheckUtils]: 35: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume !(8561 == ~s__state~0); {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-28 08:14:32,814 INFO L290 TraceCheckUtils]: 36: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume !(8448 == ~s__state~0); {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-28 08:14:32,814 INFO L290 TraceCheckUtils]: 37: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume 8576 == ~s__state~0; {44039#false} is VALID [2022-04-28 08:14:32,814 INFO L290 TraceCheckUtils]: 38: Hoare triple {44039#false} assume -2147483648 <= #t~nondet49 && #t~nondet49 <= 2147483647;~ret~0 := #t~nondet49;havoc #t~nondet49; {44039#false} is VALID [2022-04-28 08:14:32,814 INFO L290 TraceCheckUtils]: 39: Hoare triple {44039#false} assume !(~ret~0 <= 0); {44039#false} is VALID [2022-04-28 08:14:32,814 INFO L290 TraceCheckUtils]: 40: Hoare triple {44039#false} assume !(2 == ~ret~0);assume -2147483648 <= #t~nondet50 && #t~nondet50 <= 2147483647;~ret~0 := #t~nondet50;havoc #t~nondet50; {44039#false} is VALID [2022-04-28 08:14:32,814 INFO L290 TraceCheckUtils]: 41: Hoare triple {44039#false} assume !(~ret~0 <= 0);~s__init_num~0 := 0;~s__state~0 := 8592; {44039#false} is VALID [2022-04-28 08:14:32,814 INFO L290 TraceCheckUtils]: 42: Hoare triple {44039#false} assume !(0 == ~s__s3__tmp__reuse_message~0); {44039#false} is VALID [2022-04-28 08:14:32,814 INFO L290 TraceCheckUtils]: 43: Hoare triple {44039#false} assume 8576 == ~state~0; {44039#false} is VALID [2022-04-28 08:14:32,814 INFO L290 TraceCheckUtils]: 44: Hoare triple {44039#false} assume 8592 == ~s__state~0; {44039#false} is VALID [2022-04-28 08:14:32,814 INFO L290 TraceCheckUtils]: 45: Hoare triple {44039#false} assume -12288 != ~tmp___1~0; {44039#false} is VALID [2022-04-28 08:14:32,815 INFO L290 TraceCheckUtils]: 46: Hoare triple {44039#false} assume -16384 != ~tmp___2~0; {44039#false} is VALID [2022-04-28 08:14:32,815 INFO L290 TraceCheckUtils]: 47: Hoare triple {44039#false} assume 4294967040 != ~__cil_tmp56~0 % 4294967296; {44039#false} is VALID [2022-04-28 08:14:32,815 INFO L290 TraceCheckUtils]: 48: Hoare triple {44039#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {44039#false} is VALID [2022-04-28 08:14:32,815 INFO L290 TraceCheckUtils]: 49: Hoare triple {44039#false} assume 1024 != ~tmp___7~0; {44039#false} is VALID [2022-04-28 08:14:32,815 INFO L290 TraceCheckUtils]: 50: Hoare triple {44039#false} assume 512 != ~tmp___7~0; {44039#false} is VALID [2022-04-28 08:14:32,815 INFO L290 TraceCheckUtils]: 51: Hoare triple {44039#false} assume !false; {44039#false} is VALID [2022-04-28 08:14:32,815 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-28 08:14:32,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:14:32,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71739563] [2022-04-28 08:14:32,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71739563] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:32,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:32,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:14:32,816 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:14:32,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1469313764] [2022-04-28 08:14:32,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1469313764] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:32,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:32,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:14:32,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029936175] [2022-04-28 08:14:32,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:14:32,816 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 2 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) Word has length 52 [2022-04-28 08:14:32,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:14:32,817 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 2 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-28 08:14:32,846 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:32,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 08:14:32,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:32,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 08:14:32,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:14:32,847 INFO L87 Difference]: Start difference. First operand 1377 states and 2030 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 2 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-28 08:14:37,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:37,252 INFO L93 Difference]: Finished difference Result 2953 states and 4379 transitions. [2022-04-28 08:14:37,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 08:14:37,252 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 2 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) Word has length 52 [2022-04-28 08:14:37,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:14:37,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 2 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-28 08:14:37,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 519 transitions. [2022-04-28 08:14:37,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 2 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-28 08:14:37,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 519 transitions. [2022-04-28 08:14:37,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 519 transitions. [2022-04-28 08:14:37,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 519 edges. 519 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:37,633 INFO L225 Difference]: With dead ends: 2953 [2022-04-28 08:14:37,634 INFO L226 Difference]: Without dead ends: 1567 [2022-04-28 08:14:37,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-28 08:14:37,636 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 614 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:14:37,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [614 Valid, 194 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 08:14:37,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2022-04-28 08:14:39,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1453. [2022-04-28 08:14:39,906 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:14:39,908 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1567 states. Second operand has 1453 states, 1448 states have (on average 1.473756906077348) internal successors, (2134), 1448 states have internal predecessors, (2134), 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-28 08:14:39,909 INFO L74 IsIncluded]: Start isIncluded. First operand 1567 states. Second operand has 1453 states, 1448 states have (on average 1.473756906077348) internal successors, (2134), 1448 states have internal predecessors, (2134), 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-28 08:14:39,910 INFO L87 Difference]: Start difference. First operand 1567 states. Second operand has 1453 states, 1448 states have (on average 1.473756906077348) internal successors, (2134), 1448 states have internal predecessors, (2134), 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-28 08:14:39,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:39,977 INFO L93 Difference]: Finished difference Result 1567 states and 2260 transitions. [2022-04-28 08:14:39,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2260 transitions. [2022-04-28 08:14:39,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:39,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:39,981 INFO L74 IsIncluded]: Start isIncluded. First operand has 1453 states, 1448 states have (on average 1.473756906077348) internal successors, (2134), 1448 states have internal predecessors, (2134), 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) Second operand 1567 states. [2022-04-28 08:14:39,982 INFO L87 Difference]: Start difference. First operand has 1453 states, 1448 states have (on average 1.473756906077348) internal successors, (2134), 1448 states have internal predecessors, (2134), 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) Second operand 1567 states. [2022-04-28 08:14:40,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:40,049 INFO L93 Difference]: Finished difference Result 1567 states and 2260 transitions. [2022-04-28 08:14:40,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2260 transitions. [2022-04-28 08:14:40,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:40,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:40,051 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:14:40,051 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:14:40,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1453 states, 1448 states have (on average 1.473756906077348) internal successors, (2134), 1448 states have internal predecessors, (2134), 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-28 08:14:40,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 2138 transitions. [2022-04-28 08:14:40,154 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 2138 transitions. Word has length 52 [2022-04-28 08:14:40,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:14:40,154 INFO L495 AbstractCegarLoop]: Abstraction has 1453 states and 2138 transitions. [2022-04-28 08:14:40,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 2 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-28 08:14:40,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1453 states and 2138 transitions. [2022-04-28 08:14:41,958 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2138 edges. 2138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:41,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 2138 transitions. [2022-04-28 08:14:41,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-28 08:14:41,960 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:14:41,960 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-04-28 08:14:41,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 08:14:41,960 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:14:41,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:14:41,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1685857253, now seen corresponding path program 1 times [2022-04-28 08:14:41,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:41,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1428978446] [2022-04-28 08:14:42,147 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Computed reflexive-transitive closure does not contain relation itself.Something went wrong in computation of loop acceleration formula. at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.checkPropertiesOfLoopAccelerationFormula(JordanLoopAcceleration.java:1038) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.createLoopAccelerationTermSequential(JordanLoopAcceleration.java:693) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.createLoopAccelerationFormula(JordanLoopAcceleration.java:528) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.accelerateLoop(JordanLoopAcceleration.java:156) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.loopaccelerator.AcceleratorJordan.accelerateLoop(AcceleratorJordan.java:88) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:246) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:195) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-28 08:14:42,152 INFO L158 Benchmark]: Toolchain (without parser) took 41008.79ms. Allocated memory was 182.5MB in the beginning and 406.8MB in the end (delta: 224.4MB). Free memory was 134.1MB in the beginning and 313.8MB in the end (delta: -179.7MB). Peak memory consumption was 44.7MB. Max. memory is 8.0GB. [2022-04-28 08:14:42,153 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 182.5MB. Free memory was 151.0MB in the beginning and 150.9MB in the end (delta: 88.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 08:14:42,155 INFO L158 Benchmark]: CACSL2BoogieTranslator took 394.13ms. Allocated memory is still 182.5MB. Free memory was 134.0MB in the beginning and 156.4MB in the end (delta: -22.5MB). Peak memory consumption was 13.9MB. Max. memory is 8.0GB. [2022-04-28 08:14:42,156 INFO L158 Benchmark]: Boogie Preprocessor took 64.82ms. Allocated memory is still 182.5MB. Free memory was 156.4MB in the beginning and 153.5MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-04-28 08:14:42,156 INFO L158 Benchmark]: RCFGBuilder took 649.03ms. Allocated memory is still 182.5MB. Free memory was 153.5MB in the beginning and 116.6MB in the end (delta: 36.9MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2022-04-28 08:14:42,156 INFO L158 Benchmark]: TraceAbstraction took 39895.83ms. Allocated memory was 182.5MB in the beginning and 406.8MB in the end (delta: 224.4MB). Free memory was 115.7MB in the beginning and 313.8MB in the end (delta: -198.1MB). Peak memory consumption was 27.6MB. Max. memory is 8.0GB. [2022-04-28 08:14:42,157 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 182.5MB. Free memory was 151.0MB in the beginning and 150.9MB in the end (delta: 88.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 394.13ms. Allocated memory is still 182.5MB. Free memory was 134.0MB in the beginning and 156.4MB in the end (delta: -22.5MB). Peak memory consumption was 13.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 64.82ms. Allocated memory is still 182.5MB. Free memory was 156.4MB in the beginning and 153.5MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 649.03ms. Allocated memory is still 182.5MB. Free memory was 153.5MB in the beginning and 116.6MB in the end (delta: 36.9MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 39895.83ms. Allocated memory was 182.5MB in the beginning and 406.8MB in the end (delta: 224.4MB). Free memory was 115.7MB in the beginning and 313.8MB in the end (delta: -198.1MB). Peak memory consumption was 27.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Computed reflexive-transitive closure does not contain relation itself.Something went wrong in computation of loop acceleration formula. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Computed reflexive-transitive closure does not contain relation itself.Something went wrong in computation of loop acceleration formula.: de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.checkPropertiesOfLoopAccelerationFormula(JordanLoopAcceleration.java:1038) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-28 08:14:42,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...