/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_12.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 11:16:11,585 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 11:16:11,587 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 11:16:11,621 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 11:16:11,621 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 11:16:11,622 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 11:16:11,624 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 11:16:11,626 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 11:16:11,627 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 11:16:11,630 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 11:16:11,631 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 11:16:11,632 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 11:16:11,632 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 11:16:11,634 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 11:16:11,636 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 11:16:11,638 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 11:16:11,639 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 11:16:11,639 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 11:16:11,641 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 11:16:11,645 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 11:16:11,646 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 11:16:11,647 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 11:16:11,648 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 11:16:11,648 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 11:16:11,649 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 11:16:11,652 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 11:16:11,652 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 11:16:11,652 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 11:16:11,653 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 11:16:11,653 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 11:16:11,654 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 11:16:11,654 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 11:16:11,656 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 11:16:11,656 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 11:16:11,656 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 11:16:11,657 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 11:16:11,657 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 11:16:11,657 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 11:16:11,658 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 11:16:11,658 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 11:16:11,658 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 11:16:11,659 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 11:16:11,660 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 11:16:11,667 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 11:16:11,667 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 11:16:11,668 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 11:16:11,668 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 11:16:11,668 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 11:16:11,668 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 11:16:11,668 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 11:16:11,668 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 11:16:11,668 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 11:16:11,669 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 11:16:11,669 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 11:16:11,669 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 11:16:11,669 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 11:16:11,669 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 11:16:11,670 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 11:16:11,670 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 11:16:11,670 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 11:16:11,670 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 11:16:11,670 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:16:11,670 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 11:16:11,670 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 11:16:11,670 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 11:16:11,670 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 11:16:11,670 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 11:16:11,670 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 11:16:11,670 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-15 11:16:11,841 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 11:16:11,857 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 11:16:11,858 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 11:16:11,859 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 11:16:11,860 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 11:16:11,860 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_12.cil.c [2022-04-15 11:16:11,922 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e867ee4eb/15db6591c35e4bb2a9dee7d333aaa6bb/FLAG3302e4630 [2022-04-15 11:16:12,250 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 11:16:12,250 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_12.cil.c [2022-04-15 11:16:12,261 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e867ee4eb/15db6591c35e4bb2a9dee7d333aaa6bb/FLAG3302e4630 [2022-04-15 11:16:12,656 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e867ee4eb/15db6591c35e4bb2a9dee7d333aaa6bb [2022-04-15 11:16:12,658 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 11:16:12,659 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 11:16:12,660 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 11:16:12,660 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 11:16:12,672 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 11:16:12,673 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:16:12" (1/1) ... [2022-04-15 11:16:12,674 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16ccb9d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:16:12, skipping insertion in model container [2022-04-15 11:16:12,674 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:16:12" (1/1) ... [2022-04-15 11:16:12,679 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 11:16:12,717 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 11:16:12,929 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_12.cil.c[49672,49685] [2022-04-15 11:16:12,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:16:12,948 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 11:16:13,012 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_12.cil.c[49672,49685] [2022-04-15 11:16:13,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:16:13,030 INFO L208 MainTranslator]: Completed translation [2022-04-15 11:16:13,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:16:13 WrapperNode [2022-04-15 11:16:13,031 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 11:16:13,032 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 11:16:13,032 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 11:16:13,032 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 11:16:13,039 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:16:13" (1/1) ... [2022-04-15 11:16:13,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:16:13" (1/1) ... [2022-04-15 11:16:13,048 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:16:13" (1/1) ... [2022-04-15 11:16:13,049 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:16:13" (1/1) ... [2022-04-15 11:16:13,060 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:16:13" (1/1) ... [2022-04-15 11:16:13,070 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:16:13" (1/1) ... [2022-04-15 11:16:13,071 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:16:13" (1/1) ... [2022-04-15 11:16:13,073 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 11:16:13,074 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 11:16:13,074 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 11:16:13,074 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 11:16:13,081 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:16:13" (1/1) ... [2022-04-15 11:16:13,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:16:13,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:16:13,101 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-15 11:16:13,125 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-15 11:16:13,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 11:16:13,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 11:16:13,150 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 11:16:13,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-15 11:16:13,150 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 11:16:13,150 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 11:16:13,150 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 11:16:13,150 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 11:16:13,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 11:16:13,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-15 11:16:13,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 11:16:13,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-15 11:16:13,152 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-15 11:16:13,152 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-15 11:16:13,152 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 11:16:13,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 11:16:13,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 11:16:13,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 11:16:13,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 11:16:13,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 11:16:13,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 11:16:13,253 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 11:16:13,254 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 11:16:13,325 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:16:13,688 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-04-15 11:16:13,688 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-04-15 11:16:13,702 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 11:16:13,708 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 11:16:13,708 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 11:16:13,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:16:13 BoogieIcfgContainer [2022-04-15 11:16:13,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 11:16:13,711 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 11:16:13,711 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 11:16:13,716 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 11:16:13,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 11:16:12" (1/3) ... [2022-04-15 11:16:13,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b68b109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:16:13, skipping insertion in model container [2022-04-15 11:16:13,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:16:13" (2/3) ... [2022-04-15 11:16:13,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b68b109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:16:13, skipping insertion in model container [2022-04-15 11:16:13,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:16:13" (3/3) ... [2022-04-15 11:16:13,718 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_12.cil.c [2022-04-15 11:16:13,721 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 11:16:13,721 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 11:16:13,773 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 11:16:13,789 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 11:16:13,789 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 11:16:13,815 INFO L276 IsEmpty]: Start isEmpty. Operand has 176 states, 168 states have (on average 1.75) internal successors, (294), 169 states have internal predecessors, (294), 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-15 11:16:13,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 11:16:13,821 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:16:13,824 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:16:13,825 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:16:13,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:16:13,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1199187261, now seen corresponding path program 1 times [2022-04-15 11:16:13,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:13,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [270071923] [2022-04-15 11:16:13,865 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:16:13,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1199187261, now seen corresponding path program 2 times [2022-04-15 11:16:13,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:16:13,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986488507] [2022-04-15 11:16:13,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:16:13,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:16:13,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:14,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:16:14,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:14,120 INFO L290 TraceCheckUtils]: 0: Hoare triple {187#(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); {179#true} is VALID [2022-04-15 11:16:14,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {179#true} assume true; {179#true} is VALID [2022-04-15 11:16:14,121 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {179#true} {179#true} #752#return; {179#true} is VALID [2022-04-15 11:16:14,122 INFO L272 TraceCheckUtils]: 0: Hoare triple {179#true} call ULTIMATE.init(); {187#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:16:14,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {187#(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); {179#true} is VALID [2022-04-15 11:16:14,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {179#true} assume true; {179#true} is VALID [2022-04-15 11:16:14,123 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {179#true} {179#true} #752#return; {179#true} is VALID [2022-04-15 11:16:14,123 INFO L272 TraceCheckUtils]: 4: Hoare triple {179#true} call #t~ret59 := main(); {179#true} is VALID [2022-04-15 11:16:14,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {179#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {184#(<= main_~s~0 8464)} is VALID [2022-04-15 11:16:14,124 INFO L272 TraceCheckUtils]: 6: Hoare triple {184#(<= main_~s~0 8464)} call #t~ret58 := ssl3_accept(~s~0); {185#(not (= 8480 |ssl3_accept_#in~initial_state|))} is VALID [2022-04-15 11:16:14,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {185#(not (= 8480 |ssl3_accept_#in~initial_state|))} ~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;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;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~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {186#(not (= ssl3_accept_~s__state~0 8480))} is VALID [2022-04-15 11:16:14,127 INFO L290 TraceCheckUtils]: 8: Hoare triple {186#(not (= ssl3_accept_~s__state~0 8480))} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {186#(not (= ssl3_accept_~s__state~0 8480))} is VALID [2022-04-15 11:16:14,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {186#(not (= ssl3_accept_~s__state~0 8480))} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {186#(not (= ssl3_accept_~s__state~0 8480))} is VALID [2022-04-15 11:16:14,131 INFO L290 TraceCheckUtils]: 10: Hoare triple {186#(not (= ssl3_accept_~s__state~0 8480))} assume !(0 != 12288 + ~tmp___1~0); {186#(not (= ssl3_accept_~s__state~0 8480))} is VALID [2022-04-15 11:16:14,132 INFO L290 TraceCheckUtils]: 11: Hoare triple {186#(not (= ssl3_accept_~s__state~0 8480))} assume !(0 == ~s__cert~0); {186#(not (= ssl3_accept_~s__state~0 8480))} is VALID [2022-04-15 11:16:14,133 INFO L290 TraceCheckUtils]: 12: Hoare triple {186#(not (= ssl3_accept_~s__state~0 8480))} assume !false; {186#(not (= ssl3_accept_~s__state~0 8480))} is VALID [2022-04-15 11:16:14,133 INFO L290 TraceCheckUtils]: 13: Hoare triple {186#(not (= ssl3_accept_~s__state~0 8480))} ~state~0 := ~s__state~0; {186#(not (= ssl3_accept_~s__state~0 8480))} is VALID [2022-04-15 11:16:14,133 INFO L290 TraceCheckUtils]: 14: Hoare triple {186#(not (= ssl3_accept_~s__state~0 8480))} assume !(12292 == ~s__state~0); {186#(not (= ssl3_accept_~s__state~0 8480))} is VALID [2022-04-15 11:16:14,134 INFO L290 TraceCheckUtils]: 15: Hoare triple {186#(not (= ssl3_accept_~s__state~0 8480))} assume !(16384 == ~s__state~0); {186#(not (= ssl3_accept_~s__state~0 8480))} is VALID [2022-04-15 11:16:14,134 INFO L290 TraceCheckUtils]: 16: Hoare triple {186#(not (= ssl3_accept_~s__state~0 8480))} assume !(8192 == ~s__state~0); {186#(not (= ssl3_accept_~s__state~0 8480))} is VALID [2022-04-15 11:16:14,135 INFO L290 TraceCheckUtils]: 17: Hoare triple {186#(not (= ssl3_accept_~s__state~0 8480))} assume !(24576 == ~s__state~0); {186#(not (= ssl3_accept_~s__state~0 8480))} is VALID [2022-04-15 11:16:14,135 INFO L290 TraceCheckUtils]: 18: Hoare triple {186#(not (= ssl3_accept_~s__state~0 8480))} assume !(8195 == ~s__state~0); {186#(not (= ssl3_accept_~s__state~0 8480))} is VALID [2022-04-15 11:16:14,137 INFO L290 TraceCheckUtils]: 19: Hoare triple {186#(not (= ssl3_accept_~s__state~0 8480))} assume 8480 == ~s__state~0; {180#false} is VALID [2022-04-15 11:16:14,137 INFO L290 TraceCheckUtils]: 20: Hoare triple {180#false} ~s__shutdown~0 := 0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~ret~0 := #t~nondet35;havoc #t~nondet35; {180#false} is VALID [2022-04-15 11:16:14,137 INFO L290 TraceCheckUtils]: 21: Hoare triple {180#false} assume !(~ret~0 <= 0);~s__s3__tmp__next_state___0~0 := 8482;~s__state~0 := 8448;~s__init_num~0 := 0; {180#false} is VALID [2022-04-15 11:16:14,137 INFO L290 TraceCheckUtils]: 22: Hoare triple {180#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {180#false} is VALID [2022-04-15 11:16:14,137 INFO L290 TraceCheckUtils]: 23: Hoare triple {180#false} assume 0 == ~s__s3__tmp__reuse_message~0; {180#false} is VALID [2022-04-15 11:16:14,137 INFO L290 TraceCheckUtils]: 24: Hoare triple {180#false} assume 0 == ~skip~0; {180#false} is VALID [2022-04-15 11:16:14,137 INFO L290 TraceCheckUtils]: 25: Hoare triple {180#false} assume 8560 == ~state~0; {180#false} is VALID [2022-04-15 11:16:14,138 INFO L290 TraceCheckUtils]: 26: Hoare triple {180#false} assume 8448 == ~s__state~0; {180#false} is VALID [2022-04-15 11:16:14,138 INFO L290 TraceCheckUtils]: 27: Hoare triple {180#false} assume -1 != ~s__verify_mode~0; {180#false} is VALID [2022-04-15 11:16:14,138 INFO L290 TraceCheckUtils]: 28: Hoare triple {180#false} assume -2 != ~s__verify_mode~0; {180#false} is VALID [2022-04-15 11:16:14,138 INFO L290 TraceCheckUtils]: 29: Hoare triple {180#false} assume 9021 != ~__cil_tmp61~0 % 4294967296; {180#false} is VALID [2022-04-15 11:16:14,138 INFO L290 TraceCheckUtils]: 30: Hoare triple {180#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {180#false} is VALID [2022-04-15 11:16:14,138 INFO L290 TraceCheckUtils]: 31: Hoare triple {180#false} assume 4 != ~blastFlag~0; {180#false} is VALID [2022-04-15 11:16:14,139 INFO L290 TraceCheckUtils]: 32: Hoare triple {180#false} assume 1024 != ~tmp___7~0; {180#false} is VALID [2022-04-15 11:16:14,139 INFO L290 TraceCheckUtils]: 33: Hoare triple {180#false} assume !false; {180#false} is VALID [2022-04-15 11:16:14,139 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-15 11:16:14,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:16:14,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986488507] [2022-04-15 11:16:14,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986488507] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:14,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:14,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:14,144 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:16:14,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [270071923] [2022-04-15 11:16:14,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [270071923] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:14,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:14,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:14,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972239472] [2022-04-15 11:16:14,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:16:14,149 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 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 34 [2022-04-15 11:16:14,151 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:16:14,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 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-15 11:16:14,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:14,182 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 11:16:14,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:14,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 11:16:14,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:16:14,208 INFO L87 Difference]: Start difference. First operand has 176 states, 168 states have (on average 1.75) internal successors, (294), 169 states have internal predecessors, (294), 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 6 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 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-15 11:16:15,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:15,378 INFO L93 Difference]: Finished difference Result 363 states and 624 transitions. [2022-04-15 11:16:15,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 11:16:15,378 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 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 34 [2022-04-15 11:16:15,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:16:15,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 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-15 11:16:15,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 624 transitions. [2022-04-15 11:16:15,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 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-15 11:16:15,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 624 transitions. [2022-04-15 11:16:15,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 624 transitions. [2022-04-15 11:16:15,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 624 edges. 624 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:15,845 INFO L225 Difference]: With dead ends: 363 [2022-04-15 11:16:15,845 INFO L226 Difference]: Without dead ends: 180 [2022-04-15 11:16:15,847 INFO L912 BasicCegarLoop]: 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-15 11:16:15,849 INFO L913 BasicCegarLoop]: 237 mSDtfsCounter, 862 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:16:15,850 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [862 Valid, 258 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 11:16:15,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-04-15 11:16:15,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2022-04-15 11:16:15,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:16:15,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 180 states. Second operand has 178 states, 173 states have (on average 1.6127167630057804) internal successors, (279), 173 states have internal predecessors, (279), 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-15 11:16:15,889 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand has 178 states, 173 states have (on average 1.6127167630057804) internal successors, (279), 173 states have internal predecessors, (279), 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-15 11:16:15,889 INFO L87 Difference]: Start difference. First operand 180 states. Second operand has 178 states, 173 states have (on average 1.6127167630057804) internal successors, (279), 173 states have internal predecessors, (279), 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-15 11:16:15,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:15,901 INFO L93 Difference]: Finished difference Result 180 states and 285 transitions. [2022-04-15 11:16:15,901 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 285 transitions. [2022-04-15 11:16:15,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:15,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:15,908 INFO L74 IsIncluded]: Start isIncluded. First operand has 178 states, 173 states have (on average 1.6127167630057804) internal successors, (279), 173 states have internal predecessors, (279), 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 180 states. [2022-04-15 11:16:15,908 INFO L87 Difference]: Start difference. First operand has 178 states, 173 states have (on average 1.6127167630057804) internal successors, (279), 173 states have internal predecessors, (279), 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 180 states. [2022-04-15 11:16:15,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:15,915 INFO L93 Difference]: Finished difference Result 180 states and 285 transitions. [2022-04-15 11:16:15,915 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 285 transitions. [2022-04-15 11:16:15,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:15,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:15,916 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:16:15,916 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:16:15,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 173 states have (on average 1.6127167630057804) internal successors, (279), 173 states have internal predecessors, (279), 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-15 11:16:15,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 283 transitions. [2022-04-15 11:16:15,923 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 283 transitions. Word has length 34 [2022-04-15 11:16:15,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:16:15,923 INFO L478 AbstractCegarLoop]: Abstraction has 178 states and 283 transitions. [2022-04-15 11:16:15,924 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 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-15 11:16:15,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 178 states and 283 transitions. [2022-04-15 11:16:16,205 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 283 edges. 283 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:16,205 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 283 transitions. [2022-04-15 11:16:16,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 11:16:16,206 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:16:16,206 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:16:16,206 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 11:16:16,206 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:16:16,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:16:16,207 INFO L85 PathProgramCache]: Analyzing trace with hash -576860, now seen corresponding path program 1 times [2022-04-15 11:16:16,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:16,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [825141614] [2022-04-15 11:16:16,208 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:16:16,208 INFO L85 PathProgramCache]: Analyzing trace with hash -576860, now seen corresponding path program 2 times [2022-04-15 11:16:16,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:16:16,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263149271] [2022-04-15 11:16:16,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:16:16,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:16:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:16,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:16:16,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:16,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {1646#(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); {1638#true} is VALID [2022-04-15 11:16:16,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {1638#true} assume true; {1638#true} is VALID [2022-04-15 11:16:16,281 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1638#true} {1638#true} #752#return; {1638#true} is VALID [2022-04-15 11:16:16,281 INFO L272 TraceCheckUtils]: 0: Hoare triple {1638#true} call ULTIMATE.init(); {1646#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:16:16,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {1646#(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); {1638#true} is VALID [2022-04-15 11:16:16,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {1638#true} assume true; {1638#true} is VALID [2022-04-15 11:16:16,282 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1638#true} {1638#true} #752#return; {1638#true} is VALID [2022-04-15 11:16:16,282 INFO L272 TraceCheckUtils]: 4: Hoare triple {1638#true} call #t~ret59 := main(); {1638#true} is VALID [2022-04-15 11:16:16,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {1638#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {1643#(<= main_~s~0 8464)} is VALID [2022-04-15 11:16:16,283 INFO L272 TraceCheckUtils]: 6: Hoare triple {1643#(<= main_~s~0 8464)} call #t~ret58 := ssl3_accept(~s~0); {1644#(not (= 12292 |ssl3_accept_#in~initial_state|))} is VALID [2022-04-15 11:16:16,284 INFO L290 TraceCheckUtils]: 7: Hoare triple {1644#(not (= 12292 |ssl3_accept_#in~initial_state|))} ~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;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;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~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {1645#(not (= 12292 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:16,284 INFO L290 TraceCheckUtils]: 8: Hoare triple {1645#(not (= 12292 ssl3_accept_~s__state~0))} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {1645#(not (= 12292 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:16,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {1645#(not (= 12292 ssl3_accept_~s__state~0))} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {1645#(not (= 12292 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:16,285 INFO L290 TraceCheckUtils]: 10: Hoare triple {1645#(not (= 12292 ssl3_accept_~s__state~0))} assume !(0 != 12288 + ~tmp___1~0); {1645#(not (= 12292 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:16,285 INFO L290 TraceCheckUtils]: 11: Hoare triple {1645#(not (= 12292 ssl3_accept_~s__state~0))} assume !(0 == ~s__cert~0); {1645#(not (= 12292 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:16,286 INFO L290 TraceCheckUtils]: 12: Hoare triple {1645#(not (= 12292 ssl3_accept_~s__state~0))} assume !false; {1645#(not (= 12292 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:16,286 INFO L290 TraceCheckUtils]: 13: Hoare triple {1645#(not (= 12292 ssl3_accept_~s__state~0))} ~state~0 := ~s__state~0; {1645#(not (= 12292 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:16,286 INFO L290 TraceCheckUtils]: 14: Hoare triple {1645#(not (= 12292 ssl3_accept_~s__state~0))} assume 12292 == ~s__state~0; {1639#false} is VALID [2022-04-15 11:16:16,287 INFO L290 TraceCheckUtils]: 15: Hoare triple {1639#false} ~s__new_session~0 := 1; {1639#false} is VALID [2022-04-15 11:16:16,287 INFO L290 TraceCheckUtils]: 16: Hoare triple {1639#false} ~s__server~0 := 1; {1639#false} is VALID [2022-04-15 11:16:16,287 INFO L290 TraceCheckUtils]: 17: Hoare triple {1639#false} assume 0 != ~cb~0; {1639#false} is VALID [2022-04-15 11:16:16,287 INFO L290 TraceCheckUtils]: 18: Hoare triple {1639#false} ~__cil_tmp55~0 := 8 * ~s__version~0; {1639#false} is VALID [2022-04-15 11:16:16,287 INFO L290 TraceCheckUtils]: 19: Hoare triple {1639#false} assume !(3 != ~__cil_tmp55~0);~s__type~0 := 8192; {1639#false} is VALID [2022-04-15 11:16:16,287 INFO L290 TraceCheckUtils]: 20: Hoare triple {1639#false} assume !(0 == ~s__init_buf___0~0); {1639#false} is VALID [2022-04-15 11:16:16,288 INFO L290 TraceCheckUtils]: 21: Hoare triple {1639#false} assume !(0 == ~tmp___4~0);~s__init_num~0 := 0; {1639#false} is VALID [2022-04-15 11:16:16,288 INFO L290 TraceCheckUtils]: 22: Hoare triple {1639#false} assume !(12292 != ~s__state~0);#t~post34 := ~s__ctx__stats__sess_accept_renegotiate~0;~s__ctx__stats__sess_accept_renegotiate~0 := 1 + #t~post34;havoc #t~post34;~s__state~0 := 8480; {1639#false} is VALID [2022-04-15 11:16:16,288 INFO L290 TraceCheckUtils]: 23: Hoare triple {1639#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {1639#false} is VALID [2022-04-15 11:16:16,288 INFO L290 TraceCheckUtils]: 24: Hoare triple {1639#false} assume 0 == ~s__s3__tmp__reuse_message~0; {1639#false} is VALID [2022-04-15 11:16:16,288 INFO L290 TraceCheckUtils]: 25: Hoare triple {1639#false} assume 0 == ~skip~0; {1639#false} is VALID [2022-04-15 11:16:16,288 INFO L290 TraceCheckUtils]: 26: Hoare triple {1639#false} assume 8560 == ~state~0; {1639#false} is VALID [2022-04-15 11:16:16,288 INFO L290 TraceCheckUtils]: 27: Hoare triple {1639#false} assume 8448 == ~s__state~0; {1639#false} is VALID [2022-04-15 11:16:16,289 INFO L290 TraceCheckUtils]: 28: Hoare triple {1639#false} assume -1 != ~s__verify_mode~0; {1639#false} is VALID [2022-04-15 11:16:16,289 INFO L290 TraceCheckUtils]: 29: Hoare triple {1639#false} assume -2 != ~s__verify_mode~0; {1639#false} is VALID [2022-04-15 11:16:16,289 INFO L290 TraceCheckUtils]: 30: Hoare triple {1639#false} assume 9021 != ~__cil_tmp61~0 % 4294967296; {1639#false} is VALID [2022-04-15 11:16:16,289 INFO L290 TraceCheckUtils]: 31: Hoare triple {1639#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {1639#false} is VALID [2022-04-15 11:16:16,289 INFO L290 TraceCheckUtils]: 32: Hoare triple {1639#false} assume 4 != ~blastFlag~0; {1639#false} is VALID [2022-04-15 11:16:16,289 INFO L290 TraceCheckUtils]: 33: Hoare triple {1639#false} assume 1024 != ~tmp___7~0; {1639#false} is VALID [2022-04-15 11:16:16,289 INFO L290 TraceCheckUtils]: 34: Hoare triple {1639#false} assume !false; {1639#false} is VALID [2022-04-15 11:16:16,290 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-15 11:16:16,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:16:16,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263149271] [2022-04-15 11:16:16,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263149271] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:16,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:16,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:16,290 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:16:16,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [825141614] [2022-04-15 11:16:16,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [825141614] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:16,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:16,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:16,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034958904] [2022-04-15 11:16:16,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:16:16,292 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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 35 [2022-04-15 11:16:16,292 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:16:16,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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-15 11:16:16,311 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-15 11:16:16,311 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 11:16:16,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:16,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 11:16:16,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:16:16,312 INFO L87 Difference]: Start difference. First operand 178 states and 283 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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-15 11:16:17,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:17,065 INFO L93 Difference]: Finished difference Result 364 states and 581 transitions. [2022-04-15 11:16:17,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 11:16:17,066 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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 35 [2022-04-15 11:16:17,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:16:17,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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-15 11:16:17,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 521 transitions. [2022-04-15 11:16:17,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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-15 11:16:17,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 521 transitions. [2022-04-15 11:16:17,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 521 transitions. [2022-04-15 11:16:17,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 521 edges. 521 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:17,420 INFO L225 Difference]: With dead ends: 364 [2022-04-15 11:16:17,421 INFO L226 Difference]: Without dead ends: 200 [2022-04-15 11:16:17,423 INFO L912 BasicCegarLoop]: 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-15 11:16:17,425 INFO L913 BasicCegarLoop]: 180 mSDtfsCounter, 766 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:16:17,426 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [766 Valid, 197 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 11:16:17,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-04-15 11:16:17,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2022-04-15 11:16:17,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:16:17,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 200 states. Second operand has 200 states, 195 states have (on average 1.5846153846153845) internal successors, (309), 195 states have internal predecessors, (309), 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-15 11:16:17,452 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand has 200 states, 195 states have (on average 1.5846153846153845) internal successors, (309), 195 states have internal predecessors, (309), 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-15 11:16:17,453 INFO L87 Difference]: Start difference. First operand 200 states. Second operand has 200 states, 195 states have (on average 1.5846153846153845) internal successors, (309), 195 states have internal predecessors, (309), 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-15 11:16:17,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:17,463 INFO L93 Difference]: Finished difference Result 200 states and 313 transitions. [2022-04-15 11:16:17,463 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 313 transitions. [2022-04-15 11:16:17,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:17,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:17,464 INFO L74 IsIncluded]: Start isIncluded. First operand has 200 states, 195 states have (on average 1.5846153846153845) internal successors, (309), 195 states have internal predecessors, (309), 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 200 states. [2022-04-15 11:16:17,464 INFO L87 Difference]: Start difference. First operand has 200 states, 195 states have (on average 1.5846153846153845) internal successors, (309), 195 states have internal predecessors, (309), 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 200 states. [2022-04-15 11:16:17,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:17,469 INFO L93 Difference]: Finished difference Result 200 states and 313 transitions. [2022-04-15 11:16:17,469 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 313 transitions. [2022-04-15 11:16:17,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:17,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:17,470 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:16:17,470 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:16:17,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 195 states have (on average 1.5846153846153845) internal successors, (309), 195 states have internal predecessors, (309), 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-15 11:16:17,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 313 transitions. [2022-04-15 11:16:17,476 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 313 transitions. Word has length 35 [2022-04-15 11:16:17,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:16:17,476 INFO L478 AbstractCegarLoop]: Abstraction has 200 states and 313 transitions. [2022-04-15 11:16:17,476 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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-15 11:16:17,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 200 states and 313 transitions. [2022-04-15 11:16:17,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 313 edges. 313 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:17,730 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 313 transitions. [2022-04-15 11:16:17,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 11:16:17,731 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:16:17,731 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:16:17,731 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 11:16:17,732 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:16:17,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:16:17,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1037347800, now seen corresponding path program 1 times [2022-04-15 11:16:17,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:17,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1203308808] [2022-04-15 11:16:17,736 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:16:17,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1037347800, now seen corresponding path program 2 times [2022-04-15 11:16:17,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:16:17,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830084749] [2022-04-15 11:16:17,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:16:17,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:16:17,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:17,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:16:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:17,823 INFO L290 TraceCheckUtils]: 0: Hoare triple {3191#(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); {3183#true} is VALID [2022-04-15 11:16:17,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {3183#true} assume true; {3183#true} is VALID [2022-04-15 11:16:17,823 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3183#true} {3183#true} #752#return; {3183#true} is VALID [2022-04-15 11:16:17,824 INFO L272 TraceCheckUtils]: 0: Hoare triple {3183#true} call ULTIMATE.init(); {3191#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:16:17,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {3191#(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); {3183#true} is VALID [2022-04-15 11:16:17,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {3183#true} assume true; {3183#true} is VALID [2022-04-15 11:16:17,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3183#true} {3183#true} #752#return; {3183#true} is VALID [2022-04-15 11:16:17,824 INFO L272 TraceCheckUtils]: 4: Hoare triple {3183#true} call #t~ret59 := main(); {3183#true} is VALID [2022-04-15 11:16:17,824 INFO L290 TraceCheckUtils]: 5: Hoare triple {3183#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {3188#(<= main_~s~0 8464)} is VALID [2022-04-15 11:16:17,825 INFO L272 TraceCheckUtils]: 6: Hoare triple {3188#(<= main_~s~0 8464)} call #t~ret58 := ssl3_accept(~s~0); {3189#(not (= 8482 |ssl3_accept_#in~initial_state|))} is VALID [2022-04-15 11:16:17,826 INFO L290 TraceCheckUtils]: 7: Hoare triple {3189#(not (= 8482 |ssl3_accept_#in~initial_state|))} ~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;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;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~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {3190#(not (= ssl3_accept_~s__state~0 8482))} is VALID [2022-04-15 11:16:17,827 INFO L290 TraceCheckUtils]: 8: Hoare triple {3190#(not (= ssl3_accept_~s__state~0 8482))} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {3190#(not (= ssl3_accept_~s__state~0 8482))} is VALID [2022-04-15 11:16:17,827 INFO L290 TraceCheckUtils]: 9: Hoare triple {3190#(not (= ssl3_accept_~s__state~0 8482))} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {3190#(not (= ssl3_accept_~s__state~0 8482))} is VALID [2022-04-15 11:16:17,827 INFO L290 TraceCheckUtils]: 10: Hoare triple {3190#(not (= ssl3_accept_~s__state~0 8482))} assume !(0 != 12288 + ~tmp___1~0); {3190#(not (= ssl3_accept_~s__state~0 8482))} is VALID [2022-04-15 11:16:17,827 INFO L290 TraceCheckUtils]: 11: Hoare triple {3190#(not (= ssl3_accept_~s__state~0 8482))} assume !(0 == ~s__cert~0); {3190#(not (= ssl3_accept_~s__state~0 8482))} is VALID [2022-04-15 11:16:17,828 INFO L290 TraceCheckUtils]: 12: Hoare triple {3190#(not (= ssl3_accept_~s__state~0 8482))} assume !false; {3190#(not (= ssl3_accept_~s__state~0 8482))} is VALID [2022-04-15 11:16:17,828 INFO L290 TraceCheckUtils]: 13: Hoare triple {3190#(not (= ssl3_accept_~s__state~0 8482))} ~state~0 := ~s__state~0; {3190#(not (= ssl3_accept_~s__state~0 8482))} is VALID [2022-04-15 11:16:17,828 INFO L290 TraceCheckUtils]: 14: Hoare triple {3190#(not (= ssl3_accept_~s__state~0 8482))} assume !(12292 == ~s__state~0); {3190#(not (= ssl3_accept_~s__state~0 8482))} is VALID [2022-04-15 11:16:17,829 INFO L290 TraceCheckUtils]: 15: Hoare triple {3190#(not (= ssl3_accept_~s__state~0 8482))} assume !(16384 == ~s__state~0); {3190#(not (= ssl3_accept_~s__state~0 8482))} is VALID [2022-04-15 11:16:17,829 INFO L290 TraceCheckUtils]: 16: Hoare triple {3190#(not (= ssl3_accept_~s__state~0 8482))} assume !(8192 == ~s__state~0); {3190#(not (= ssl3_accept_~s__state~0 8482))} is VALID [2022-04-15 11:16:17,829 INFO L290 TraceCheckUtils]: 17: Hoare triple {3190#(not (= ssl3_accept_~s__state~0 8482))} assume !(24576 == ~s__state~0); {3190#(not (= ssl3_accept_~s__state~0 8482))} is VALID [2022-04-15 11:16:17,830 INFO L290 TraceCheckUtils]: 18: Hoare triple {3190#(not (= ssl3_accept_~s__state~0 8482))} assume !(8195 == ~s__state~0); {3190#(not (= ssl3_accept_~s__state~0 8482))} is VALID [2022-04-15 11:16:17,830 INFO L290 TraceCheckUtils]: 19: Hoare triple {3190#(not (= ssl3_accept_~s__state~0 8482))} assume !(8480 == ~s__state~0); {3190#(not (= ssl3_accept_~s__state~0 8482))} is VALID [2022-04-15 11:16:17,830 INFO L290 TraceCheckUtils]: 20: Hoare triple {3190#(not (= ssl3_accept_~s__state~0 8482))} assume !(8481 == ~s__state~0); {3190#(not (= ssl3_accept_~s__state~0 8482))} is VALID [2022-04-15 11:16:17,830 INFO L290 TraceCheckUtils]: 21: Hoare triple {3190#(not (= ssl3_accept_~s__state~0 8482))} assume 8482 == ~s__state~0; {3184#false} is VALID [2022-04-15 11:16:17,831 INFO L290 TraceCheckUtils]: 22: Hoare triple {3184#false} ~s__state~0 := 3; {3184#false} is VALID [2022-04-15 11:16:17,831 INFO L290 TraceCheckUtils]: 23: Hoare triple {3184#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {3184#false} is VALID [2022-04-15 11:16:17,831 INFO L290 TraceCheckUtils]: 24: Hoare triple {3184#false} assume 0 == ~s__s3__tmp__reuse_message~0; {3184#false} is VALID [2022-04-15 11:16:17,831 INFO L290 TraceCheckUtils]: 25: Hoare triple {3184#false} assume 0 == ~skip~0; {3184#false} is VALID [2022-04-15 11:16:17,831 INFO L290 TraceCheckUtils]: 26: Hoare triple {3184#false} assume 8560 == ~state~0; {3184#false} is VALID [2022-04-15 11:16:17,831 INFO L290 TraceCheckUtils]: 27: Hoare triple {3184#false} assume 8448 == ~s__state~0; {3184#false} is VALID [2022-04-15 11:16:17,831 INFO L290 TraceCheckUtils]: 28: Hoare triple {3184#false} assume -1 != ~s__verify_mode~0; {3184#false} is VALID [2022-04-15 11:16:17,832 INFO L290 TraceCheckUtils]: 29: Hoare triple {3184#false} assume -2 != ~s__verify_mode~0; {3184#false} is VALID [2022-04-15 11:16:17,832 INFO L290 TraceCheckUtils]: 30: Hoare triple {3184#false} assume 9021 != ~__cil_tmp61~0 % 4294967296; {3184#false} is VALID [2022-04-15 11:16:17,832 INFO L290 TraceCheckUtils]: 31: Hoare triple {3184#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {3184#false} is VALID [2022-04-15 11:16:17,832 INFO L290 TraceCheckUtils]: 32: Hoare triple {3184#false} assume 4 != ~blastFlag~0; {3184#false} is VALID [2022-04-15 11:16:17,832 INFO L290 TraceCheckUtils]: 33: Hoare triple {3184#false} assume 1024 != ~tmp___7~0; {3184#false} is VALID [2022-04-15 11:16:17,832 INFO L290 TraceCheckUtils]: 34: Hoare triple {3184#false} assume !false; {3184#false} is VALID [2022-04-15 11:16:17,832 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-15 11:16:17,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:16:17,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830084749] [2022-04-15 11:16:17,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830084749] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:17,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:17,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:17,833 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:16:17,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1203308808] [2022-04-15 11:16:17,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1203308808] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:17,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:17,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:17,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529467108] [2022-04-15 11:16:17,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:16:17,834 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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 35 [2022-04-15 11:16:17,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:16:17,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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-15 11:16:17,877 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-15 11:16:17,877 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 11:16:17,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:17,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 11:16:17,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:16:17,878 INFO L87 Difference]: Start difference. First operand 200 states and 313 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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-15 11:16:18,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:18,586 INFO L93 Difference]: Finished difference Result 393 states and 622 transitions. [2022-04-15 11:16:18,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 11:16:18,586 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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 35 [2022-04-15 11:16:18,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:16:18,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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-15 11:16:18,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 522 transitions. [2022-04-15 11:16:18,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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-15 11:16:18,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 522 transitions. [2022-04-15 11:16:18,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 522 transitions. [2022-04-15 11:16:18,919 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 522 edges. 522 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:18,922 INFO L225 Difference]: With dead ends: 393 [2022-04-15 11:16:18,922 INFO L226 Difference]: Without dead ends: 207 [2022-04-15 11:16:18,923 INFO L912 BasicCegarLoop]: 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-15 11:16:18,924 INFO L913 BasicCegarLoop]: 181 mSDtfsCounter, 758 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:16:18,924 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [758 Valid, 198 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 11:16:18,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-04-15 11:16:18,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2022-04-15 11:16:18,935 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:16:18,936 INFO L82 GeneralOperation]: Start isEquivalent. First operand 207 states. Second operand has 207 states, 202 states have (on average 1.5940594059405941) internal successors, (322), 202 states have internal predecessors, (322), 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-15 11:16:18,936 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand has 207 states, 202 states have (on average 1.5940594059405941) internal successors, (322), 202 states have internal predecessors, (322), 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-15 11:16:18,937 INFO L87 Difference]: Start difference. First operand 207 states. Second operand has 207 states, 202 states have (on average 1.5940594059405941) internal successors, (322), 202 states have internal predecessors, (322), 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-15 11:16:18,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:18,945 INFO L93 Difference]: Finished difference Result 207 states and 326 transitions. [2022-04-15 11:16:18,945 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 326 transitions. [2022-04-15 11:16:18,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:18,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:18,945 INFO L74 IsIncluded]: Start isIncluded. First operand has 207 states, 202 states have (on average 1.5940594059405941) internal successors, (322), 202 states have internal predecessors, (322), 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 207 states. [2022-04-15 11:16:18,946 INFO L87 Difference]: Start difference. First operand has 207 states, 202 states have (on average 1.5940594059405941) internal successors, (322), 202 states have internal predecessors, (322), 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 207 states. [2022-04-15 11:16:18,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:18,953 INFO L93 Difference]: Finished difference Result 207 states and 326 transitions. [2022-04-15 11:16:18,954 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 326 transitions. [2022-04-15 11:16:18,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:18,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:18,954 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:16:18,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:16:18,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 202 states have (on average 1.5940594059405941) internal successors, (322), 202 states have internal predecessors, (322), 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-15 11:16:18,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 326 transitions. [2022-04-15 11:16:18,963 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 326 transitions. Word has length 35 [2022-04-15 11:16:18,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:16:18,963 INFO L478 AbstractCegarLoop]: Abstraction has 207 states and 326 transitions. [2022-04-15 11:16:18,963 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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-15 11:16:18,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 207 states and 326 transitions. [2022-04-15 11:16:19,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 326 edges. 326 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:19,236 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 326 transitions. [2022-04-15 11:16:19,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 11:16:19,237 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:16:19,237 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:16:19,237 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 11:16:19,237 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:16:19,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:16:19,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1441132167, now seen corresponding path program 1 times [2022-04-15 11:16:19,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:19,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [506814815] [2022-04-15 11:16:19,240 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:16:19,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1441132167, now seen corresponding path program 2 times [2022-04-15 11:16:19,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:16:19,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883522939] [2022-04-15 11:16:19,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:16:19,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:16:19,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:19,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:16:19,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:19,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {4822#(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); {4814#true} is VALID [2022-04-15 11:16:19,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {4814#true} assume true; {4814#true} is VALID [2022-04-15 11:16:19,312 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4814#true} {4814#true} #752#return; {4814#true} is VALID [2022-04-15 11:16:19,313 INFO L272 TraceCheckUtils]: 0: Hoare triple {4814#true} call ULTIMATE.init(); {4822#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:16:19,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {4822#(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); {4814#true} is VALID [2022-04-15 11:16:19,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {4814#true} assume true; {4814#true} is VALID [2022-04-15 11:16:19,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4814#true} {4814#true} #752#return; {4814#true} is VALID [2022-04-15 11:16:19,313 INFO L272 TraceCheckUtils]: 4: Hoare triple {4814#true} call #t~ret59 := main(); {4814#true} is VALID [2022-04-15 11:16:19,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {4814#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {4819#(<= main_~s~0 8464)} is VALID [2022-04-15 11:16:19,314 INFO L272 TraceCheckUtils]: 6: Hoare triple {4819#(<= main_~s~0 8464)} call #t~ret58 := ssl3_accept(~s~0); {4820#(not (= |ssl3_accept_#in~initial_state| 8481))} is VALID [2022-04-15 11:16:19,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {4820#(not (= |ssl3_accept_#in~initial_state| 8481))} ~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;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;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~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {4821#(not (= ssl3_accept_~s__state~0 8481))} is VALID [2022-04-15 11:16:19,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {4821#(not (= ssl3_accept_~s__state~0 8481))} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {4821#(not (= ssl3_accept_~s__state~0 8481))} is VALID [2022-04-15 11:16:19,316 INFO L290 TraceCheckUtils]: 9: Hoare triple {4821#(not (= ssl3_accept_~s__state~0 8481))} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {4821#(not (= ssl3_accept_~s__state~0 8481))} is VALID [2022-04-15 11:16:19,316 INFO L290 TraceCheckUtils]: 10: Hoare triple {4821#(not (= ssl3_accept_~s__state~0 8481))} assume !(0 != 12288 + ~tmp___1~0); {4821#(not (= ssl3_accept_~s__state~0 8481))} is VALID [2022-04-15 11:16:19,316 INFO L290 TraceCheckUtils]: 11: Hoare triple {4821#(not (= ssl3_accept_~s__state~0 8481))} assume !(0 == ~s__cert~0); {4821#(not (= ssl3_accept_~s__state~0 8481))} is VALID [2022-04-15 11:16:19,317 INFO L290 TraceCheckUtils]: 12: Hoare triple {4821#(not (= ssl3_accept_~s__state~0 8481))} assume !false; {4821#(not (= ssl3_accept_~s__state~0 8481))} is VALID [2022-04-15 11:16:19,317 INFO L290 TraceCheckUtils]: 13: Hoare triple {4821#(not (= ssl3_accept_~s__state~0 8481))} ~state~0 := ~s__state~0; {4821#(not (= ssl3_accept_~s__state~0 8481))} is VALID [2022-04-15 11:16:19,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {4821#(not (= ssl3_accept_~s__state~0 8481))} assume !(12292 == ~s__state~0); {4821#(not (= ssl3_accept_~s__state~0 8481))} is VALID [2022-04-15 11:16:19,318 INFO L290 TraceCheckUtils]: 15: Hoare triple {4821#(not (= ssl3_accept_~s__state~0 8481))} assume !(16384 == ~s__state~0); {4821#(not (= ssl3_accept_~s__state~0 8481))} is VALID [2022-04-15 11:16:19,318 INFO L290 TraceCheckUtils]: 16: Hoare triple {4821#(not (= ssl3_accept_~s__state~0 8481))} assume !(8192 == ~s__state~0); {4821#(not (= ssl3_accept_~s__state~0 8481))} is VALID [2022-04-15 11:16:19,318 INFO L290 TraceCheckUtils]: 17: Hoare triple {4821#(not (= ssl3_accept_~s__state~0 8481))} assume !(24576 == ~s__state~0); {4821#(not (= ssl3_accept_~s__state~0 8481))} is VALID [2022-04-15 11:16:19,318 INFO L290 TraceCheckUtils]: 18: Hoare triple {4821#(not (= ssl3_accept_~s__state~0 8481))} assume !(8195 == ~s__state~0); {4821#(not (= ssl3_accept_~s__state~0 8481))} is VALID [2022-04-15 11:16:19,319 INFO L290 TraceCheckUtils]: 19: Hoare triple {4821#(not (= ssl3_accept_~s__state~0 8481))} assume !(8480 == ~s__state~0); {4821#(not (= ssl3_accept_~s__state~0 8481))} is VALID [2022-04-15 11:16:19,319 INFO L290 TraceCheckUtils]: 20: Hoare triple {4821#(not (= ssl3_accept_~s__state~0 8481))} assume 8481 == ~s__state~0; {4815#false} is VALID [2022-04-15 11:16:19,319 INFO L290 TraceCheckUtils]: 21: Hoare triple {4815#false} ~s__shutdown~0 := 0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~ret~0 := #t~nondet35;havoc #t~nondet35; {4815#false} is VALID [2022-04-15 11:16:19,319 INFO L290 TraceCheckUtils]: 22: Hoare triple {4815#false} assume !(~ret~0 <= 0);~s__s3__tmp__next_state___0~0 := 8482;~s__state~0 := 8448;~s__init_num~0 := 0; {4815#false} is VALID [2022-04-15 11:16:19,319 INFO L290 TraceCheckUtils]: 23: Hoare triple {4815#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {4815#false} is VALID [2022-04-15 11:16:19,320 INFO L290 TraceCheckUtils]: 24: Hoare triple {4815#false} assume 0 == ~s__s3__tmp__reuse_message~0; {4815#false} is VALID [2022-04-15 11:16:19,320 INFO L290 TraceCheckUtils]: 25: Hoare triple {4815#false} assume 0 == ~skip~0; {4815#false} is VALID [2022-04-15 11:16:19,320 INFO L290 TraceCheckUtils]: 26: Hoare triple {4815#false} assume 8560 == ~state~0; {4815#false} is VALID [2022-04-15 11:16:19,320 INFO L290 TraceCheckUtils]: 27: Hoare triple {4815#false} assume 8448 == ~s__state~0; {4815#false} is VALID [2022-04-15 11:16:19,320 INFO L290 TraceCheckUtils]: 28: Hoare triple {4815#false} assume -1 != ~s__verify_mode~0; {4815#false} is VALID [2022-04-15 11:16:19,320 INFO L290 TraceCheckUtils]: 29: Hoare triple {4815#false} assume -2 != ~s__verify_mode~0; {4815#false} is VALID [2022-04-15 11:16:19,320 INFO L290 TraceCheckUtils]: 30: Hoare triple {4815#false} assume 9021 != ~__cil_tmp61~0 % 4294967296; {4815#false} is VALID [2022-04-15 11:16:19,320 INFO L290 TraceCheckUtils]: 31: Hoare triple {4815#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {4815#false} is VALID [2022-04-15 11:16:19,321 INFO L290 TraceCheckUtils]: 32: Hoare triple {4815#false} assume 4 != ~blastFlag~0; {4815#false} is VALID [2022-04-15 11:16:19,321 INFO L290 TraceCheckUtils]: 33: Hoare triple {4815#false} assume 1024 != ~tmp___7~0; {4815#false} is VALID [2022-04-15 11:16:19,321 INFO L290 TraceCheckUtils]: 34: Hoare triple {4815#false} assume !false; {4815#false} is VALID [2022-04-15 11:16:19,321 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-15 11:16:19,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:16:19,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883522939] [2022-04-15 11:16:19,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883522939] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:19,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:19,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:19,322 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:16:19,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [506814815] [2022-04-15 11:16:19,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [506814815] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:19,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:19,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:19,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398435991] [2022-04-15 11:16:19,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:16:19,322 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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 35 [2022-04-15 11:16:19,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:16:19,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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-15 11:16:19,342 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-15 11:16:19,343 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 11:16:19,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:19,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 11:16:19,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:16:19,343 INFO L87 Difference]: Start difference. First operand 207 states and 326 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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-15 11:16:20,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:20,036 INFO L93 Difference]: Finished difference Result 402 states and 636 transitions. [2022-04-15 11:16:20,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 11:16:20,036 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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 35 [2022-04-15 11:16:20,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:16:20,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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-15 11:16:20,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 522 transitions. [2022-04-15 11:16:20,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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-15 11:16:20,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 522 transitions. [2022-04-15 11:16:20,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 522 transitions. [2022-04-15 11:16:20,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 522 edges. 522 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:20,384 INFO L225 Difference]: With dead ends: 402 [2022-04-15 11:16:20,384 INFO L226 Difference]: Without dead ends: 209 [2022-04-15 11:16:20,384 INFO L912 BasicCegarLoop]: 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-15 11:16:20,385 INFO L913 BasicCegarLoop]: 181 mSDtfsCounter, 759 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:16:20,385 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [759 Valid, 198 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 11:16:20,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-04-15 11:16:20,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2022-04-15 11:16:20,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:16:20,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 209 states. Second operand has 207 states, 202 states have (on average 1.5891089108910892) internal successors, (321), 202 states have internal predecessors, (321), 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-15 11:16:20,402 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand has 207 states, 202 states have (on average 1.5891089108910892) internal successors, (321), 202 states have internal predecessors, (321), 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-15 11:16:20,402 INFO L87 Difference]: Start difference. First operand 209 states. Second operand has 207 states, 202 states have (on average 1.5891089108910892) internal successors, (321), 202 states have internal predecessors, (321), 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-15 11:16:20,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:20,408 INFO L93 Difference]: Finished difference Result 209 states and 327 transitions. [2022-04-15 11:16:20,408 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 327 transitions. [2022-04-15 11:16:20,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:20,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:20,409 INFO L74 IsIncluded]: Start isIncluded. First operand has 207 states, 202 states have (on average 1.5891089108910892) internal successors, (321), 202 states have internal predecessors, (321), 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 209 states. [2022-04-15 11:16:20,409 INFO L87 Difference]: Start difference. First operand has 207 states, 202 states have (on average 1.5891089108910892) internal successors, (321), 202 states have internal predecessors, (321), 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 209 states. [2022-04-15 11:16:20,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:20,414 INFO L93 Difference]: Finished difference Result 209 states and 327 transitions. [2022-04-15 11:16:20,414 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 327 transitions. [2022-04-15 11:16:20,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:20,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:20,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:16:20,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:16:20,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 202 states have (on average 1.5891089108910892) internal successors, (321), 202 states have internal predecessors, (321), 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-15 11:16:20,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 325 transitions. [2022-04-15 11:16:20,419 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 325 transitions. Word has length 35 [2022-04-15 11:16:20,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:16:20,420 INFO L478 AbstractCegarLoop]: Abstraction has 207 states and 325 transitions. [2022-04-15 11:16:20,420 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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-15 11:16:20,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 207 states and 325 transitions. [2022-04-15 11:16:20,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 325 edges. 325 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:20,713 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 325 transitions. [2022-04-15 11:16:20,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 11:16:20,714 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:16:20,714 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:16:20,714 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 11:16:20,714 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:16:20,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:16:20,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1028210496, now seen corresponding path program 1 times [2022-04-15 11:16:20,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:20,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1243089765] [2022-04-15 11:16:20,715 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:16:20,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1028210496, now seen corresponding path program 2 times [2022-04-15 11:16:20,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:16:20,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923422391] [2022-04-15 11:16:20,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:16:20,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:16:20,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:20,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:16:20,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:20,791 INFO L290 TraceCheckUtils]: 0: Hoare triple {6475#(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); {6467#true} is VALID [2022-04-15 11:16:20,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {6467#true} assume true; {6467#true} is VALID [2022-04-15 11:16:20,791 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6467#true} {6467#true} #752#return; {6467#true} is VALID [2022-04-15 11:16:20,792 INFO L272 TraceCheckUtils]: 0: Hoare triple {6467#true} call ULTIMATE.init(); {6475#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:16:20,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {6475#(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); {6467#true} is VALID [2022-04-15 11:16:20,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {6467#true} assume true; {6467#true} is VALID [2022-04-15 11:16:20,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6467#true} {6467#true} #752#return; {6467#true} is VALID [2022-04-15 11:16:20,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {6467#true} call #t~ret59 := main(); {6467#true} is VALID [2022-04-15 11:16:20,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {6467#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {6472#(<= main_~s~0 8464)} is VALID [2022-04-15 11:16:20,793 INFO L272 TraceCheckUtils]: 6: Hoare triple {6472#(<= main_~s~0 8464)} call #t~ret58 := ssl3_accept(~s~0); {6473#(not (= 16384 |ssl3_accept_#in~initial_state|))} is VALID [2022-04-15 11:16:20,794 INFO L290 TraceCheckUtils]: 7: Hoare triple {6473#(not (= 16384 |ssl3_accept_#in~initial_state|))} ~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;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;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~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {6474#(not (= ssl3_accept_~s__state~0 16384))} is VALID [2022-04-15 11:16:20,795 INFO L290 TraceCheckUtils]: 8: Hoare triple {6474#(not (= ssl3_accept_~s__state~0 16384))} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {6474#(not (= ssl3_accept_~s__state~0 16384))} is VALID [2022-04-15 11:16:20,795 INFO L290 TraceCheckUtils]: 9: Hoare triple {6474#(not (= ssl3_accept_~s__state~0 16384))} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {6474#(not (= ssl3_accept_~s__state~0 16384))} is VALID [2022-04-15 11:16:20,795 INFO L290 TraceCheckUtils]: 10: Hoare triple {6474#(not (= ssl3_accept_~s__state~0 16384))} assume !(0 != 12288 + ~tmp___1~0); {6474#(not (= ssl3_accept_~s__state~0 16384))} is VALID [2022-04-15 11:16:20,795 INFO L290 TraceCheckUtils]: 11: Hoare triple {6474#(not (= ssl3_accept_~s__state~0 16384))} assume !(0 == ~s__cert~0); {6474#(not (= ssl3_accept_~s__state~0 16384))} is VALID [2022-04-15 11:16:20,796 INFO L290 TraceCheckUtils]: 12: Hoare triple {6474#(not (= ssl3_accept_~s__state~0 16384))} assume !false; {6474#(not (= ssl3_accept_~s__state~0 16384))} is VALID [2022-04-15 11:16:20,796 INFO L290 TraceCheckUtils]: 13: Hoare triple {6474#(not (= ssl3_accept_~s__state~0 16384))} ~state~0 := ~s__state~0; {6474#(not (= ssl3_accept_~s__state~0 16384))} is VALID [2022-04-15 11:16:20,796 INFO L290 TraceCheckUtils]: 14: Hoare triple {6474#(not (= ssl3_accept_~s__state~0 16384))} assume !(12292 == ~s__state~0); {6474#(not (= ssl3_accept_~s__state~0 16384))} is VALID [2022-04-15 11:16:20,797 INFO L290 TraceCheckUtils]: 15: Hoare triple {6474#(not (= ssl3_accept_~s__state~0 16384))} assume 16384 == ~s__state~0; {6468#false} is VALID [2022-04-15 11:16:20,797 INFO L290 TraceCheckUtils]: 16: Hoare triple {6468#false} ~s__server~0 := 1; {6468#false} is VALID [2022-04-15 11:16:20,797 INFO L290 TraceCheckUtils]: 17: Hoare triple {6468#false} assume 0 != ~cb~0; {6468#false} is VALID [2022-04-15 11:16:20,797 INFO L290 TraceCheckUtils]: 18: Hoare triple {6468#false} ~__cil_tmp55~0 := 8 * ~s__version~0; {6468#false} is VALID [2022-04-15 11:16:20,797 INFO L290 TraceCheckUtils]: 19: Hoare triple {6468#false} assume !(3 != ~__cil_tmp55~0);~s__type~0 := 8192; {6468#false} is VALID [2022-04-15 11:16:20,797 INFO L290 TraceCheckUtils]: 20: Hoare triple {6468#false} assume !(0 == ~s__init_buf___0~0); {6468#false} is VALID [2022-04-15 11:16:20,797 INFO L290 TraceCheckUtils]: 21: Hoare triple {6468#false} assume !(0 == ~tmp___4~0);~s__init_num~0 := 0; {6468#false} is VALID [2022-04-15 11:16:20,797 INFO L290 TraceCheckUtils]: 22: Hoare triple {6468#false} assume 12292 != ~s__state~0; {6468#false} is VALID [2022-04-15 11:16:20,798 INFO L290 TraceCheckUtils]: 23: Hoare triple {6468#false} assume !(0 == ~tmp___5~0);~s__state~0 := 8464;#t~post33 := ~s__ctx__stats__sess_accept~0;~s__ctx__stats__sess_accept~0 := 1 + #t~post33;havoc #t~post33; {6468#false} is VALID [2022-04-15 11:16:20,798 INFO L290 TraceCheckUtils]: 24: Hoare triple {6468#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {6468#false} is VALID [2022-04-15 11:16:20,798 INFO L290 TraceCheckUtils]: 25: Hoare triple {6468#false} assume 0 == ~s__s3__tmp__reuse_message~0; {6468#false} is VALID [2022-04-15 11:16:20,798 INFO L290 TraceCheckUtils]: 26: Hoare triple {6468#false} assume 0 == ~skip~0; {6468#false} is VALID [2022-04-15 11:16:20,798 INFO L290 TraceCheckUtils]: 27: Hoare triple {6468#false} assume 8560 == ~state~0; {6468#false} is VALID [2022-04-15 11:16:20,798 INFO L290 TraceCheckUtils]: 28: Hoare triple {6468#false} assume 8448 == ~s__state~0; {6468#false} is VALID [2022-04-15 11:16:20,798 INFO L290 TraceCheckUtils]: 29: Hoare triple {6468#false} assume -1 != ~s__verify_mode~0; {6468#false} is VALID [2022-04-15 11:16:20,798 INFO L290 TraceCheckUtils]: 30: Hoare triple {6468#false} assume -2 != ~s__verify_mode~0; {6468#false} is VALID [2022-04-15 11:16:20,798 INFO L290 TraceCheckUtils]: 31: Hoare triple {6468#false} assume 9021 != ~__cil_tmp61~0 % 4294967296; {6468#false} is VALID [2022-04-15 11:16:20,799 INFO L290 TraceCheckUtils]: 32: Hoare triple {6468#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {6468#false} is VALID [2022-04-15 11:16:20,799 INFO L290 TraceCheckUtils]: 33: Hoare triple {6468#false} assume 4 != ~blastFlag~0; {6468#false} is VALID [2022-04-15 11:16:20,799 INFO L290 TraceCheckUtils]: 34: Hoare triple {6468#false} assume 1024 != ~tmp___7~0; {6468#false} is VALID [2022-04-15 11:16:20,799 INFO L290 TraceCheckUtils]: 35: Hoare triple {6468#false} assume !false; {6468#false} is VALID [2022-04-15 11:16:20,799 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-15 11:16:20,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:16:20,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923422391] [2022-04-15 11:16:20,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923422391] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:20,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:20,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:20,800 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:16:20,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1243089765] [2022-04-15 11:16:20,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1243089765] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:20,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:20,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:20,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673171182] [2022-04-15 11:16:20,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:16:20,800 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 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 36 [2022-04-15 11:16:20,801 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:16:20,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 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-15 11:16:20,834 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-15 11:16:20,834 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 11:16:20,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:20,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 11:16:20,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:16:20,835 INFO L87 Difference]: Start difference. First operand 207 states and 325 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 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-15 11:16:21,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:21,591 INFO L93 Difference]: Finished difference Result 410 states and 644 transitions. [2022-04-15 11:16:21,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 11:16:21,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 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 36 [2022-04-15 11:16:21,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:16:21,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 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-15 11:16:21,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 522 transitions. [2022-04-15 11:16:21,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 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-15 11:16:21,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 522 transitions. [2022-04-15 11:16:21,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 522 transitions. [2022-04-15 11:16:21,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 522 edges. 522 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:21,933 INFO L225 Difference]: With dead ends: 410 [2022-04-15 11:16:21,933 INFO L226 Difference]: Without dead ends: 217 [2022-04-15 11:16:21,933 INFO L912 BasicCegarLoop]: 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-15 11:16:21,934 INFO L913 BasicCegarLoop]: 180 mSDtfsCounter, 767 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:16:21,937 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [767 Valid, 197 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 11:16:21,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-04-15 11:16:21,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 207. [2022-04-15 11:16:21,951 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:16:21,951 INFO L82 GeneralOperation]: Start isEquivalent. First operand 217 states. Second operand has 207 states, 202 states have (on average 1.5792079207920793) internal successors, (319), 202 states have internal predecessors, (319), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:21,952 INFO L74 IsIncluded]: Start isIncluded. First operand 217 states. Second operand has 207 states, 202 states have (on average 1.5792079207920793) internal successors, (319), 202 states have internal predecessors, (319), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:21,952 INFO L87 Difference]: Start difference. First operand 217 states. Second operand has 207 states, 202 states have (on average 1.5792079207920793) internal successors, (319), 202 states have internal predecessors, (319), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:21,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:21,955 INFO L93 Difference]: Finished difference Result 217 states and 335 transitions. [2022-04-15 11:16:21,955 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 335 transitions. [2022-04-15 11:16:21,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:21,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:21,956 INFO L74 IsIncluded]: Start isIncluded. First operand has 207 states, 202 states have (on average 1.5792079207920793) internal successors, (319), 202 states have internal predecessors, (319), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 217 states. [2022-04-15 11:16:21,956 INFO L87 Difference]: Start difference. First operand has 207 states, 202 states have (on average 1.5792079207920793) internal successors, (319), 202 states have internal predecessors, (319), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 217 states. [2022-04-15 11:16:21,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:21,959 INFO L93 Difference]: Finished difference Result 217 states and 335 transitions. [2022-04-15 11:16:21,960 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 335 transitions. [2022-04-15 11:16:21,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:21,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:21,960 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:16:21,960 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:16:21,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 202 states have (on average 1.5792079207920793) internal successors, (319), 202 states have internal predecessors, (319), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:21,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 323 transitions. [2022-04-15 11:16:21,963 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 323 transitions. Word has length 36 [2022-04-15 11:16:21,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:16:21,964 INFO L478 AbstractCegarLoop]: Abstraction has 207 states and 323 transitions. [2022-04-15 11:16:21,964 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 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-15 11:16:21,964 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 207 states and 323 transitions. [2022-04-15 11:16:22,203 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 323 edges. 323 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:22,203 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 323 transitions. [2022-04-15 11:16:22,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 11:16:22,203 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:16:22,203 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:16:22,204 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 11:16:22,204 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:16:22,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:16:22,204 INFO L85 PathProgramCache]: Analyzing trace with hash -2097728708, now seen corresponding path program 1 times [2022-04-15 11:16:22,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:22,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1103828700] [2022-04-15 11:16:22,205 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:16:22,205 INFO L85 PathProgramCache]: Analyzing trace with hash -2097728708, now seen corresponding path program 2 times [2022-04-15 11:16:22,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:16:22,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055617115] [2022-04-15 11:16:22,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:16:22,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:16:22,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:22,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:16:22,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:22,316 INFO L290 TraceCheckUtils]: 0: Hoare triple {8160#(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); {8152#true} is VALID [2022-04-15 11:16:22,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {8152#true} assume true; {8152#true} is VALID [2022-04-15 11:16:22,316 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8152#true} {8152#true} #752#return; {8152#true} is VALID [2022-04-15 11:16:22,317 INFO L272 TraceCheckUtils]: 0: Hoare triple {8152#true} call ULTIMATE.init(); {8160#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:16:22,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {8160#(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); {8152#true} is VALID [2022-04-15 11:16:22,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {8152#true} assume true; {8152#true} is VALID [2022-04-15 11:16:22,317 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8152#true} {8152#true} #752#return; {8152#true} is VALID [2022-04-15 11:16:22,317 INFO L272 TraceCheckUtils]: 4: Hoare triple {8152#true} call #t~ret59 := main(); {8152#true} is VALID [2022-04-15 11:16:22,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {8152#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {8157#(<= 8464 main_~s~0)} is VALID [2022-04-15 11:16:22,318 INFO L272 TraceCheckUtils]: 6: Hoare triple {8157#(<= 8464 main_~s~0)} call #t~ret58 := ssl3_accept(~s~0); {8158#(not (= 8192 |ssl3_accept_#in~initial_state|))} is VALID [2022-04-15 11:16:22,319 INFO L290 TraceCheckUtils]: 7: Hoare triple {8158#(not (= 8192 |ssl3_accept_#in~initial_state|))} ~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;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;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~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {8159#(not (= 8192 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:22,323 INFO L290 TraceCheckUtils]: 8: Hoare triple {8159#(not (= 8192 ssl3_accept_~s__state~0))} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {8159#(not (= 8192 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:22,323 INFO L290 TraceCheckUtils]: 9: Hoare triple {8159#(not (= 8192 ssl3_accept_~s__state~0))} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {8159#(not (= 8192 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:22,323 INFO L290 TraceCheckUtils]: 10: Hoare triple {8159#(not (= 8192 ssl3_accept_~s__state~0))} assume !(0 != 12288 + ~tmp___1~0); {8159#(not (= 8192 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:22,324 INFO L290 TraceCheckUtils]: 11: Hoare triple {8159#(not (= 8192 ssl3_accept_~s__state~0))} assume !(0 == ~s__cert~0); {8159#(not (= 8192 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:22,324 INFO L290 TraceCheckUtils]: 12: Hoare triple {8159#(not (= 8192 ssl3_accept_~s__state~0))} assume !false; {8159#(not (= 8192 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:22,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {8159#(not (= 8192 ssl3_accept_~s__state~0))} ~state~0 := ~s__state~0; {8159#(not (= 8192 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:22,324 INFO L290 TraceCheckUtils]: 14: Hoare triple {8159#(not (= 8192 ssl3_accept_~s__state~0))} assume !(12292 == ~s__state~0); {8159#(not (= 8192 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:22,325 INFO L290 TraceCheckUtils]: 15: Hoare triple {8159#(not (= 8192 ssl3_accept_~s__state~0))} assume !(16384 == ~s__state~0); {8159#(not (= 8192 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:22,325 INFO L290 TraceCheckUtils]: 16: Hoare triple {8159#(not (= 8192 ssl3_accept_~s__state~0))} assume 8192 == ~s__state~0; {8153#false} is VALID [2022-04-15 11:16:22,325 INFO L290 TraceCheckUtils]: 17: Hoare triple {8153#false} ~s__server~0 := 1; {8153#false} is VALID [2022-04-15 11:16:22,325 INFO L290 TraceCheckUtils]: 18: Hoare triple {8153#false} assume 0 != ~cb~0; {8153#false} is VALID [2022-04-15 11:16:22,325 INFO L290 TraceCheckUtils]: 19: Hoare triple {8153#false} ~__cil_tmp55~0 := 8 * ~s__version~0; {8153#false} is VALID [2022-04-15 11:16:22,325 INFO L290 TraceCheckUtils]: 20: Hoare triple {8153#false} assume !(3 != ~__cil_tmp55~0);~s__type~0 := 8192; {8153#false} is VALID [2022-04-15 11:16:22,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {8153#false} assume !(0 == ~s__init_buf___0~0); {8153#false} is VALID [2022-04-15 11:16:22,326 INFO L290 TraceCheckUtils]: 22: Hoare triple {8153#false} assume !(0 == ~tmp___4~0);~s__init_num~0 := 0; {8153#false} is VALID [2022-04-15 11:16:22,326 INFO L290 TraceCheckUtils]: 23: Hoare triple {8153#false} assume 12292 != ~s__state~0; {8153#false} is VALID [2022-04-15 11:16:22,326 INFO L290 TraceCheckUtils]: 24: Hoare triple {8153#false} assume !(0 == ~tmp___5~0);~s__state~0 := 8464;#t~post33 := ~s__ctx__stats__sess_accept~0;~s__ctx__stats__sess_accept~0 := 1 + #t~post33;havoc #t~post33; {8153#false} is VALID [2022-04-15 11:16:22,328 INFO L290 TraceCheckUtils]: 25: Hoare triple {8153#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {8153#false} is VALID [2022-04-15 11:16:22,328 INFO L290 TraceCheckUtils]: 26: Hoare triple {8153#false} assume 0 == ~s__s3__tmp__reuse_message~0; {8153#false} is VALID [2022-04-15 11:16:22,329 INFO L290 TraceCheckUtils]: 27: Hoare triple {8153#false} assume 0 == ~skip~0; {8153#false} is VALID [2022-04-15 11:16:22,329 INFO L290 TraceCheckUtils]: 28: Hoare triple {8153#false} assume 8560 == ~state~0; {8153#false} is VALID [2022-04-15 11:16:22,329 INFO L290 TraceCheckUtils]: 29: Hoare triple {8153#false} assume 8448 == ~s__state~0; {8153#false} is VALID [2022-04-15 11:16:22,329 INFO L290 TraceCheckUtils]: 30: Hoare triple {8153#false} assume -1 != ~s__verify_mode~0; {8153#false} is VALID [2022-04-15 11:16:22,329 INFO L290 TraceCheckUtils]: 31: Hoare triple {8153#false} assume -2 != ~s__verify_mode~0; {8153#false} is VALID [2022-04-15 11:16:22,329 INFO L290 TraceCheckUtils]: 32: Hoare triple {8153#false} assume 9021 != ~__cil_tmp61~0 % 4294967296; {8153#false} is VALID [2022-04-15 11:16:22,329 INFO L290 TraceCheckUtils]: 33: Hoare triple {8153#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {8153#false} is VALID [2022-04-15 11:16:22,330 INFO L290 TraceCheckUtils]: 34: Hoare triple {8153#false} assume 4 != ~blastFlag~0; {8153#false} is VALID [2022-04-15 11:16:22,330 INFO L290 TraceCheckUtils]: 35: Hoare triple {8153#false} assume 1024 != ~tmp___7~0; {8153#false} is VALID [2022-04-15 11:16:22,330 INFO L290 TraceCheckUtils]: 36: Hoare triple {8153#false} assume !false; {8153#false} is VALID [2022-04-15 11:16:22,331 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-15 11:16:22,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:16:22,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055617115] [2022-04-15 11:16:22,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055617115] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:22,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:22,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:22,332 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:16:22,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1103828700] [2022-04-15 11:16:22,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1103828700] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:22,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:22,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:22,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383256427] [2022-04-15 11:16:22,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:16:22,332 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 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 37 [2022-04-15 11:16:22,333 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:16:22,334 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 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-15 11:16:22,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:22,353 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 11:16:22,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:22,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 11:16:22,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:16:22,356 INFO L87 Difference]: Start difference. First operand 207 states and 323 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 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-15 11:16:22,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:22,980 INFO L93 Difference]: Finished difference Result 410 states and 640 transitions. [2022-04-15 11:16:22,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 11:16:22,981 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 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 37 [2022-04-15 11:16:22,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:16:22,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 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-15 11:16:22,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 523 transitions. [2022-04-15 11:16:22,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 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-15 11:16:22,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 523 transitions. [2022-04-15 11:16:22,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 523 transitions. [2022-04-15 11:16:23,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 523 edges. 523 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:23,340 INFO L225 Difference]: With dead ends: 410 [2022-04-15 11:16:23,340 INFO L226 Difference]: Without dead ends: 217 [2022-04-15 11:16:23,341 INFO L912 BasicCegarLoop]: 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-15 11:16:23,343 INFO L913 BasicCegarLoop]: 181 mSDtfsCounter, 767 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:16:23,343 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [767 Valid, 198 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 11:16:23,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-04-15 11:16:23,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 207. [2022-04-15 11:16:23,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:16:23,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 217 states. Second operand has 207 states, 202 states have (on average 1.5693069306930694) internal successors, (317), 202 states have internal predecessors, (317), 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-15 11:16:23,357 INFO L74 IsIncluded]: Start isIncluded. First operand 217 states. Second operand has 207 states, 202 states have (on average 1.5693069306930694) internal successors, (317), 202 states have internal predecessors, (317), 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-15 11:16:23,357 INFO L87 Difference]: Start difference. First operand 217 states. Second operand has 207 states, 202 states have (on average 1.5693069306930694) internal successors, (317), 202 states have internal predecessors, (317), 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-15 11:16:23,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:23,360 INFO L93 Difference]: Finished difference Result 217 states and 333 transitions. [2022-04-15 11:16:23,360 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 333 transitions. [2022-04-15 11:16:23,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:23,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:23,361 INFO L74 IsIncluded]: Start isIncluded. First operand has 207 states, 202 states have (on average 1.5693069306930694) internal successors, (317), 202 states have internal predecessors, (317), 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 217 states. [2022-04-15 11:16:23,362 INFO L87 Difference]: Start difference. First operand has 207 states, 202 states have (on average 1.5693069306930694) internal successors, (317), 202 states have internal predecessors, (317), 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 217 states. [2022-04-15 11:16:23,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:23,365 INFO L93 Difference]: Finished difference Result 217 states and 333 transitions. [2022-04-15 11:16:23,365 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 333 transitions. [2022-04-15 11:16:23,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:23,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:23,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:16:23,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:16:23,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 202 states have (on average 1.5693069306930694) internal successors, (317), 202 states have internal predecessors, (317), 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-15 11:16:23,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 321 transitions. [2022-04-15 11:16:23,368 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 321 transitions. Word has length 37 [2022-04-15 11:16:23,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:16:23,369 INFO L478 AbstractCegarLoop]: Abstraction has 207 states and 321 transitions. [2022-04-15 11:16:23,369 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 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-15 11:16:23,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 207 states and 321 transitions. [2022-04-15 11:16:23,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 321 edges. 321 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:23,687 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 321 transitions. [2022-04-15 11:16:23,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 11:16:23,688 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:16:23,688 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:16:23,688 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 11:16:23,688 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:16:23,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:16:23,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1553278138, now seen corresponding path program 1 times [2022-04-15 11:16:23,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:23,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [49056919] [2022-04-15 11:16:23,690 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:16:23,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1553278138, now seen corresponding path program 2 times [2022-04-15 11:16:23,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:16:23,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155148810] [2022-04-15 11:16:23,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:16:23,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:16:23,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:23,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:16:23,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:23,788 INFO L290 TraceCheckUtils]: 0: Hoare triple {9844#(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); {9837#true} is VALID [2022-04-15 11:16:23,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {9837#true} assume true; {9837#true} is VALID [2022-04-15 11:16:23,789 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9837#true} {9837#true} #752#return; {9837#true} is VALID [2022-04-15 11:16:23,789 INFO L272 TraceCheckUtils]: 0: Hoare triple {9837#true} call ULTIMATE.init(); {9844#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:16:23,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {9844#(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); {9837#true} is VALID [2022-04-15 11:16:23,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {9837#true} assume true; {9837#true} is VALID [2022-04-15 11:16:23,790 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9837#true} {9837#true} #752#return; {9837#true} is VALID [2022-04-15 11:16:23,790 INFO L272 TraceCheckUtils]: 4: Hoare triple {9837#true} call #t~ret59 := main(); {9837#true} is VALID [2022-04-15 11:16:23,790 INFO L290 TraceCheckUtils]: 5: Hoare triple {9837#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {9837#true} is VALID [2022-04-15 11:16:23,790 INFO L272 TraceCheckUtils]: 6: Hoare triple {9837#true} call #t~ret58 := ssl3_accept(~s~0); {9837#true} is VALID [2022-04-15 11:16:23,790 INFO L290 TraceCheckUtils]: 7: Hoare triple {9837#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;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;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~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {9837#true} is VALID [2022-04-15 11:16:23,790 INFO L290 TraceCheckUtils]: 8: Hoare triple {9837#true} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {9837#true} is VALID [2022-04-15 11:16:23,790 INFO L290 TraceCheckUtils]: 9: Hoare triple {9837#true} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {9837#true} is VALID [2022-04-15 11:16:23,790 INFO L290 TraceCheckUtils]: 10: Hoare triple {9837#true} assume !(0 != 12288 + ~tmp___1~0); {9837#true} is VALID [2022-04-15 11:16:23,791 INFO L290 TraceCheckUtils]: 11: Hoare triple {9837#true} assume !(0 == ~s__cert~0); {9837#true} is VALID [2022-04-15 11:16:23,791 INFO L290 TraceCheckUtils]: 12: Hoare triple {9837#true} assume !false; {9837#true} is VALID [2022-04-15 11:16:23,791 INFO L290 TraceCheckUtils]: 13: Hoare triple {9837#true} ~state~0 := ~s__state~0; {9842#(or (not (= 8464 ssl3_accept_~s__state~0)) (not (= 8560 ssl3_accept_~state~0)))} is VALID [2022-04-15 11:16:23,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {9842#(or (not (= 8464 ssl3_accept_~s__state~0)) (not (= 8560 ssl3_accept_~state~0)))} assume !(12292 == ~s__state~0); {9842#(or (not (= 8464 ssl3_accept_~s__state~0)) (not (= 8560 ssl3_accept_~state~0)))} is VALID [2022-04-15 11:16:23,792 INFO L290 TraceCheckUtils]: 15: Hoare triple {9842#(or (not (= 8464 ssl3_accept_~s__state~0)) (not (= 8560 ssl3_accept_~state~0)))} assume !(16384 == ~s__state~0); {9842#(or (not (= 8464 ssl3_accept_~s__state~0)) (not (= 8560 ssl3_accept_~state~0)))} is VALID [2022-04-15 11:16:23,792 INFO L290 TraceCheckUtils]: 16: Hoare triple {9842#(or (not (= 8464 ssl3_accept_~s__state~0)) (not (= 8560 ssl3_accept_~state~0)))} assume !(8192 == ~s__state~0); {9842#(or (not (= 8464 ssl3_accept_~s__state~0)) (not (= 8560 ssl3_accept_~state~0)))} is VALID [2022-04-15 11:16:23,793 INFO L290 TraceCheckUtils]: 17: Hoare triple {9842#(or (not (= 8464 ssl3_accept_~s__state~0)) (not (= 8560 ssl3_accept_~state~0)))} assume !(24576 == ~s__state~0); {9842#(or (not (= 8464 ssl3_accept_~s__state~0)) (not (= 8560 ssl3_accept_~state~0)))} is VALID [2022-04-15 11:16:23,794 INFO L290 TraceCheckUtils]: 18: Hoare triple {9842#(or (not (= 8464 ssl3_accept_~s__state~0)) (not (= 8560 ssl3_accept_~state~0)))} assume !(8195 == ~s__state~0); {9842#(or (not (= 8464 ssl3_accept_~s__state~0)) (not (= 8560 ssl3_accept_~state~0)))} is VALID [2022-04-15 11:16:23,795 INFO L290 TraceCheckUtils]: 19: Hoare triple {9842#(or (not (= 8464 ssl3_accept_~s__state~0)) (not (= 8560 ssl3_accept_~state~0)))} assume !(8480 == ~s__state~0); {9842#(or (not (= 8464 ssl3_accept_~s__state~0)) (not (= 8560 ssl3_accept_~state~0)))} is VALID [2022-04-15 11:16:23,796 INFO L290 TraceCheckUtils]: 20: Hoare triple {9842#(or (not (= 8464 ssl3_accept_~s__state~0)) (not (= 8560 ssl3_accept_~state~0)))} assume !(8481 == ~s__state~0); {9842#(or (not (= 8464 ssl3_accept_~s__state~0)) (not (= 8560 ssl3_accept_~state~0)))} is VALID [2022-04-15 11:16:23,796 INFO L290 TraceCheckUtils]: 21: Hoare triple {9842#(or (not (= 8464 ssl3_accept_~s__state~0)) (not (= 8560 ssl3_accept_~state~0)))} assume !(8482 == ~s__state~0); {9842#(or (not (= 8464 ssl3_accept_~s__state~0)) (not (= 8560 ssl3_accept_~state~0)))} is VALID [2022-04-15 11:16:23,798 INFO L290 TraceCheckUtils]: 22: Hoare triple {9842#(or (not (= 8464 ssl3_accept_~s__state~0)) (not (= 8560 ssl3_accept_~state~0)))} assume 8464 == ~s__state~0; {9843#(not (= 8560 ssl3_accept_~state~0))} is VALID [2022-04-15 11:16:23,799 INFO L290 TraceCheckUtils]: 23: Hoare triple {9843#(not (= 8560 ssl3_accept_~state~0))} ~s__shutdown~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~ret~0 := #t~nondet36;havoc #t~nondet36; {9843#(not (= 8560 ssl3_accept_~state~0))} is VALID [2022-04-15 11:16:23,800 INFO L290 TraceCheckUtils]: 24: Hoare triple {9843#(not (= 8560 ssl3_accept_~state~0))} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {9843#(not (= 8560 ssl3_accept_~state~0))} is VALID [2022-04-15 11:16:23,800 INFO L290 TraceCheckUtils]: 25: Hoare triple {9843#(not (= 8560 ssl3_accept_~state~0))} assume !(~ret~0 <= 0);~got_new_session~0 := 1;~s__state~0 := 8496;~s__init_num~0 := 0; {9843#(not (= 8560 ssl3_accept_~state~0))} is VALID [2022-04-15 11:16:23,800 INFO L290 TraceCheckUtils]: 26: Hoare triple {9843#(not (= 8560 ssl3_accept_~state~0))} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {9843#(not (= 8560 ssl3_accept_~state~0))} is VALID [2022-04-15 11:16:23,800 INFO L290 TraceCheckUtils]: 27: Hoare triple {9843#(not (= 8560 ssl3_accept_~state~0))} assume 0 == ~s__s3__tmp__reuse_message~0; {9843#(not (= 8560 ssl3_accept_~state~0))} is VALID [2022-04-15 11:16:23,801 INFO L290 TraceCheckUtils]: 28: Hoare triple {9843#(not (= 8560 ssl3_accept_~state~0))} assume 0 == ~skip~0; {9843#(not (= 8560 ssl3_accept_~state~0))} is VALID [2022-04-15 11:16:23,801 INFO L290 TraceCheckUtils]: 29: Hoare triple {9843#(not (= 8560 ssl3_accept_~state~0))} assume 8560 == ~state~0; {9838#false} is VALID [2022-04-15 11:16:23,801 INFO L290 TraceCheckUtils]: 30: Hoare triple {9838#false} assume 8448 == ~s__state~0; {9838#false} is VALID [2022-04-15 11:16:23,801 INFO L290 TraceCheckUtils]: 31: Hoare triple {9838#false} assume -1 != ~s__verify_mode~0; {9838#false} is VALID [2022-04-15 11:16:23,801 INFO L290 TraceCheckUtils]: 32: Hoare triple {9838#false} assume -2 != ~s__verify_mode~0; {9838#false} is VALID [2022-04-15 11:16:23,801 INFO L290 TraceCheckUtils]: 33: Hoare triple {9838#false} assume 9021 != ~__cil_tmp61~0 % 4294967296; {9838#false} is VALID [2022-04-15 11:16:23,801 INFO L290 TraceCheckUtils]: 34: Hoare triple {9838#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {9838#false} is VALID [2022-04-15 11:16:23,801 INFO L290 TraceCheckUtils]: 35: Hoare triple {9838#false} assume 4 != ~blastFlag~0; {9838#false} is VALID [2022-04-15 11:16:23,802 INFO L290 TraceCheckUtils]: 36: Hoare triple {9838#false} assume 1024 != ~tmp___7~0; {9838#false} is VALID [2022-04-15 11:16:23,802 INFO L290 TraceCheckUtils]: 37: Hoare triple {9838#false} assume !false; {9838#false} is VALID [2022-04-15 11:16:23,802 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-15 11:16:23,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:16:23,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155148810] [2022-04-15 11:16:23,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155148810] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:23,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:23,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:16:23,802 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:16:23,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [49056919] [2022-04-15 11:16:23,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [49056919] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:23,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:23,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:16:23,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515243217] [2022-04-15 11:16:23,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:16:23,803 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (3), 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 38 [2022-04-15 11:16:23,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:16:23,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (3), 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-15 11:16:23,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:23,824 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:16:23,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:23,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:16:23,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:16:23,825 INFO L87 Difference]: Start difference. First operand 207 states and 321 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (3), 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-15 11:16:24,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:24,486 INFO L93 Difference]: Finished difference Result 443 states and 687 transitions. [2022-04-15 11:16:24,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:16:24,486 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (3), 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 38 [2022-04-15 11:16:24,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:16:24,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (3), 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-15 11:16:24,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 528 transitions. [2022-04-15 11:16:24,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (3), 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-15 11:16:24,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 528 transitions. [2022-04-15 11:16:24,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 528 transitions. [2022-04-15 11:16:24,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 528 edges. 528 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:24,840 INFO L225 Difference]: With dead ends: 443 [2022-04-15 11:16:24,840 INFO L226 Difference]: Without dead ends: 250 [2022-04-15 11:16:24,840 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-15 11:16:24,841 INFO L913 BasicCegarLoop]: 183 mSDtfsCounter, 482 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:16:24,841 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [482 Valid, 195 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 11:16:24,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-04-15 11:16:24,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 214. [2022-04-15 11:16:24,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:16:24,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 250 states. Second operand has 214 states, 209 states have (on average 1.5645933014354068) internal successors, (327), 209 states have internal predecessors, (327), 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-15 11:16:24,857 INFO L74 IsIncluded]: Start isIncluded. First operand 250 states. Second operand has 214 states, 209 states have (on average 1.5645933014354068) internal successors, (327), 209 states have internal predecessors, (327), 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-15 11:16:24,857 INFO L87 Difference]: Start difference. First operand 250 states. Second operand has 214 states, 209 states have (on average 1.5645933014354068) internal successors, (327), 209 states have internal predecessors, (327), 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-15 11:16:24,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:24,861 INFO L93 Difference]: Finished difference Result 250 states and 383 transitions. [2022-04-15 11:16:24,861 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 383 transitions. [2022-04-15 11:16:24,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:24,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:24,862 INFO L74 IsIncluded]: Start isIncluded. First operand has 214 states, 209 states have (on average 1.5645933014354068) internal successors, (327), 209 states have internal predecessors, (327), 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 250 states. [2022-04-15 11:16:24,862 INFO L87 Difference]: Start difference. First operand has 214 states, 209 states have (on average 1.5645933014354068) internal successors, (327), 209 states have internal predecessors, (327), 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 250 states. [2022-04-15 11:16:24,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:24,865 INFO L93 Difference]: Finished difference Result 250 states and 383 transitions. [2022-04-15 11:16:24,865 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 383 transitions. [2022-04-15 11:16:24,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:24,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:24,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:16:24,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:16:24,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 209 states have (on average 1.5645933014354068) internal successors, (327), 209 states have internal predecessors, (327), 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-15 11:16:24,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 331 transitions. [2022-04-15 11:16:24,869 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 331 transitions. Word has length 38 [2022-04-15 11:16:24,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:16:24,869 INFO L478 AbstractCegarLoop]: Abstraction has 214 states and 331 transitions. [2022-04-15 11:16:24,870 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (3), 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-15 11:16:24,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 214 states and 331 transitions. [2022-04-15 11:16:25,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 331 edges. 331 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:25,204 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 331 transitions. [2022-04-15 11:16:25,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 11:16:25,205 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:16:25,205 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:16:25,205 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 11:16:25,205 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:16:25,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:16:25,205 INFO L85 PathProgramCache]: Analyzing trace with hash 839158341, now seen corresponding path program 1 times [2022-04-15 11:16:25,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:25,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [818299788] [2022-04-15 11:16:25,206 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:16:25,206 INFO L85 PathProgramCache]: Analyzing trace with hash 839158341, now seen corresponding path program 2 times [2022-04-15 11:16:25,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:16:25,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787405377] [2022-04-15 11:16:25,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:16:25,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:16:25,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:25,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:16:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:25,283 INFO L290 TraceCheckUtils]: 0: Hoare triple {11675#(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); {11667#true} is VALID [2022-04-15 11:16:25,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {11667#true} assume true; {11667#true} is VALID [2022-04-15 11:16:25,283 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11667#true} {11667#true} #752#return; {11667#true} is VALID [2022-04-15 11:16:25,283 INFO L272 TraceCheckUtils]: 0: Hoare triple {11667#true} call ULTIMATE.init(); {11675#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:16:25,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {11675#(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); {11667#true} is VALID [2022-04-15 11:16:25,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {11667#true} assume true; {11667#true} is VALID [2022-04-15 11:16:25,283 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11667#true} {11667#true} #752#return; {11667#true} is VALID [2022-04-15 11:16:25,284 INFO L272 TraceCheckUtils]: 4: Hoare triple {11667#true} call #t~ret59 := main(); {11667#true} is VALID [2022-04-15 11:16:25,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {11667#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {11672#(<= main_~s~0 8464)} is VALID [2022-04-15 11:16:25,284 INFO L272 TraceCheckUtils]: 6: Hoare triple {11672#(<= main_~s~0 8464)} call #t~ret58 := ssl3_accept(~s~0); {11673#(not (= 24576 |ssl3_accept_#in~initial_state|))} is VALID [2022-04-15 11:16:25,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {11673#(not (= 24576 |ssl3_accept_#in~initial_state|))} ~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;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;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~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {11674#(not (= 24576 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:25,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {11674#(not (= 24576 ssl3_accept_~s__state~0))} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {11674#(not (= 24576 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:25,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {11674#(not (= 24576 ssl3_accept_~s__state~0))} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {11674#(not (= 24576 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:25,286 INFO L290 TraceCheckUtils]: 10: Hoare triple {11674#(not (= 24576 ssl3_accept_~s__state~0))} assume !(0 != 12288 + ~tmp___1~0); {11674#(not (= 24576 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:25,286 INFO L290 TraceCheckUtils]: 11: Hoare triple {11674#(not (= 24576 ssl3_accept_~s__state~0))} assume !(0 == ~s__cert~0); {11674#(not (= 24576 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:25,287 INFO L290 TraceCheckUtils]: 12: Hoare triple {11674#(not (= 24576 ssl3_accept_~s__state~0))} assume !false; {11674#(not (= 24576 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:25,287 INFO L290 TraceCheckUtils]: 13: Hoare triple {11674#(not (= 24576 ssl3_accept_~s__state~0))} ~state~0 := ~s__state~0; {11674#(not (= 24576 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:25,287 INFO L290 TraceCheckUtils]: 14: Hoare triple {11674#(not (= 24576 ssl3_accept_~s__state~0))} assume !(12292 == ~s__state~0); {11674#(not (= 24576 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:25,287 INFO L290 TraceCheckUtils]: 15: Hoare triple {11674#(not (= 24576 ssl3_accept_~s__state~0))} assume !(16384 == ~s__state~0); {11674#(not (= 24576 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:25,288 INFO L290 TraceCheckUtils]: 16: Hoare triple {11674#(not (= 24576 ssl3_accept_~s__state~0))} assume !(8192 == ~s__state~0); {11674#(not (= 24576 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:25,288 INFO L290 TraceCheckUtils]: 17: Hoare triple {11674#(not (= 24576 ssl3_accept_~s__state~0))} assume 24576 == ~s__state~0; {11668#false} is VALID [2022-04-15 11:16:25,288 INFO L290 TraceCheckUtils]: 18: Hoare triple {11668#false} ~s__server~0 := 1; {11668#false} is VALID [2022-04-15 11:16:25,288 INFO L290 TraceCheckUtils]: 19: Hoare triple {11668#false} assume 0 != ~cb~0; {11668#false} is VALID [2022-04-15 11:16:25,288 INFO L290 TraceCheckUtils]: 20: Hoare triple {11668#false} ~__cil_tmp55~0 := 8 * ~s__version~0; {11668#false} is VALID [2022-04-15 11:16:25,288 INFO L290 TraceCheckUtils]: 21: Hoare triple {11668#false} assume !(3 != ~__cil_tmp55~0);~s__type~0 := 8192; {11668#false} is VALID [2022-04-15 11:16:25,288 INFO L290 TraceCheckUtils]: 22: Hoare triple {11668#false} assume !(0 == ~s__init_buf___0~0); {11668#false} is VALID [2022-04-15 11:16:25,288 INFO L290 TraceCheckUtils]: 23: Hoare triple {11668#false} assume !(0 == ~tmp___4~0);~s__init_num~0 := 0; {11668#false} is VALID [2022-04-15 11:16:25,288 INFO L290 TraceCheckUtils]: 24: Hoare triple {11668#false} assume 12292 != ~s__state~0; {11668#false} is VALID [2022-04-15 11:16:25,289 INFO L290 TraceCheckUtils]: 25: Hoare triple {11668#false} assume !(0 == ~tmp___5~0);~s__state~0 := 8464;#t~post33 := ~s__ctx__stats__sess_accept~0;~s__ctx__stats__sess_accept~0 := 1 + #t~post33;havoc #t~post33; {11668#false} is VALID [2022-04-15 11:16:25,289 INFO L290 TraceCheckUtils]: 26: Hoare triple {11668#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {11668#false} is VALID [2022-04-15 11:16:25,289 INFO L290 TraceCheckUtils]: 27: Hoare triple {11668#false} assume 0 == ~s__s3__tmp__reuse_message~0; {11668#false} is VALID [2022-04-15 11:16:25,289 INFO L290 TraceCheckUtils]: 28: Hoare triple {11668#false} assume 0 == ~skip~0; {11668#false} is VALID [2022-04-15 11:16:25,289 INFO L290 TraceCheckUtils]: 29: Hoare triple {11668#false} assume 8560 == ~state~0; {11668#false} is VALID [2022-04-15 11:16:25,289 INFO L290 TraceCheckUtils]: 30: Hoare triple {11668#false} assume 8448 == ~s__state~0; {11668#false} is VALID [2022-04-15 11:16:25,289 INFO L290 TraceCheckUtils]: 31: Hoare triple {11668#false} assume -1 != ~s__verify_mode~0; {11668#false} is VALID [2022-04-15 11:16:25,289 INFO L290 TraceCheckUtils]: 32: Hoare triple {11668#false} assume -2 != ~s__verify_mode~0; {11668#false} is VALID [2022-04-15 11:16:25,289 INFO L290 TraceCheckUtils]: 33: Hoare triple {11668#false} assume 9021 != ~__cil_tmp61~0 % 4294967296; {11668#false} is VALID [2022-04-15 11:16:25,289 INFO L290 TraceCheckUtils]: 34: Hoare triple {11668#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {11668#false} is VALID [2022-04-15 11:16:25,289 INFO L290 TraceCheckUtils]: 35: Hoare triple {11668#false} assume 4 != ~blastFlag~0; {11668#false} is VALID [2022-04-15 11:16:25,289 INFO L290 TraceCheckUtils]: 36: Hoare triple {11668#false} assume 1024 != ~tmp___7~0; {11668#false} is VALID [2022-04-15 11:16:25,290 INFO L290 TraceCheckUtils]: 37: Hoare triple {11668#false} assume !false; {11668#false} is VALID [2022-04-15 11:16:25,290 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-15 11:16:25,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:16:25,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787405377] [2022-04-15 11:16:25,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787405377] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:25,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:25,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:25,290 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:16:25,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [818299788] [2022-04-15 11:16:25,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [818299788] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:25,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:25,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:25,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709144341] [2022-04-15 11:16:25,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:16:25,291 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 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 38 [2022-04-15 11:16:25,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:16:25,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 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-15 11:16:25,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:25,315 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 11:16:25,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:25,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 11:16:25,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:16:25,316 INFO L87 Difference]: Start difference. First operand 214 states and 331 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 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-15 11:16:26,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:26,002 INFO L93 Difference]: Finished difference Result 424 states and 656 transitions. [2022-04-15 11:16:26,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 11:16:26,002 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 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 38 [2022-04-15 11:16:26,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:16:26,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 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-15 11:16:26,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 524 transitions. [2022-04-15 11:16:26,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 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-15 11:16:26,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 524 transitions. [2022-04-15 11:16:26,007 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 524 transitions. [2022-04-15 11:16:26,344 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-15 11:16:26,347 INFO L225 Difference]: With dead ends: 424 [2022-04-15 11:16:26,347 INFO L226 Difference]: Without dead ends: 224 [2022-04-15 11:16:26,348 INFO L912 BasicCegarLoop]: 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-15 11:16:26,348 INFO L913 BasicCegarLoop]: 182 mSDtfsCounter, 767 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:16:26,348 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [767 Valid, 199 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 11:16:26,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-04-15 11:16:26,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 214. [2022-04-15 11:16:26,365 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:16:26,365 INFO L82 GeneralOperation]: Start isEquivalent. First operand 224 states. Second operand has 214 states, 209 states have (on average 1.555023923444976) internal successors, (325), 209 states have internal predecessors, (325), 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-15 11:16:26,365 INFO L74 IsIncluded]: Start isIncluded. First operand 224 states. Second operand has 214 states, 209 states have (on average 1.555023923444976) internal successors, (325), 209 states have internal predecessors, (325), 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-15 11:16:26,366 INFO L87 Difference]: Start difference. First operand 224 states. Second operand has 214 states, 209 states have (on average 1.555023923444976) internal successors, (325), 209 states have internal predecessors, (325), 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-15 11:16:26,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:26,369 INFO L93 Difference]: Finished difference Result 224 states and 341 transitions. [2022-04-15 11:16:26,369 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 341 transitions. [2022-04-15 11:16:26,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:26,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:26,370 INFO L74 IsIncluded]: Start isIncluded. First operand has 214 states, 209 states have (on average 1.555023923444976) internal successors, (325), 209 states have internal predecessors, (325), 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 224 states. [2022-04-15 11:16:26,370 INFO L87 Difference]: Start difference. First operand has 214 states, 209 states have (on average 1.555023923444976) internal successors, (325), 209 states have internal predecessors, (325), 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 224 states. [2022-04-15 11:16:26,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:26,373 INFO L93 Difference]: Finished difference Result 224 states and 341 transitions. [2022-04-15 11:16:26,373 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 341 transitions. [2022-04-15 11:16:26,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:26,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:26,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:16:26,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:16:26,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 209 states have (on average 1.555023923444976) internal successors, (325), 209 states have internal predecessors, (325), 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-15 11:16:26,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 329 transitions. [2022-04-15 11:16:26,377 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 329 transitions. Word has length 38 [2022-04-15 11:16:26,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:16:26,377 INFO L478 AbstractCegarLoop]: Abstraction has 214 states and 329 transitions. [2022-04-15 11:16:26,377 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 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-15 11:16:26,378 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 214 states and 329 transitions. [2022-04-15 11:16:26,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 329 edges. 329 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:26,729 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 329 transitions. [2022-04-15 11:16:26,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 11:16:26,730 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:16:26,730 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:16:26,730 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 11:16:26,730 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:16:26,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:16:26,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1549869087, now seen corresponding path program 1 times [2022-04-15 11:16:26,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:26,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [41601193] [2022-04-15 11:16:26,731 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:16:26,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1549869087, now seen corresponding path program 2 times [2022-04-15 11:16:26,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:16:26,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871039463] [2022-04-15 11:16:26,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:16:26,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:16:26,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:26,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:16:26,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:26,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {13416#(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); {13408#true} is VALID [2022-04-15 11:16:26,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {13408#true} assume true; {13408#true} is VALID [2022-04-15 11:16:26,786 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13408#true} {13408#true} #752#return; {13408#true} is VALID [2022-04-15 11:16:26,786 INFO L272 TraceCheckUtils]: 0: Hoare triple {13408#true} call ULTIMATE.init(); {13416#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:16:26,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {13416#(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); {13408#true} is VALID [2022-04-15 11:16:26,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {13408#true} assume true; {13408#true} is VALID [2022-04-15 11:16:26,786 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13408#true} {13408#true} #752#return; {13408#true} is VALID [2022-04-15 11:16:26,786 INFO L272 TraceCheckUtils]: 4: Hoare triple {13408#true} call #t~ret59 := main(); {13408#true} is VALID [2022-04-15 11:16:26,787 INFO L290 TraceCheckUtils]: 5: Hoare triple {13408#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {13413#(<= 8464 main_~s~0)} is VALID [2022-04-15 11:16:26,787 INFO L272 TraceCheckUtils]: 6: Hoare triple {13413#(<= 8464 main_~s~0)} call #t~ret58 := ssl3_accept(~s~0); {13414#(not (= 8195 |ssl3_accept_#in~initial_state|))} is VALID [2022-04-15 11:16:26,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {13414#(not (= 8195 |ssl3_accept_#in~initial_state|))} ~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;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;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~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {13415#(not (= ssl3_accept_~s__state~0 8195))} is VALID [2022-04-15 11:16:26,789 INFO L290 TraceCheckUtils]: 8: Hoare triple {13415#(not (= ssl3_accept_~s__state~0 8195))} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {13415#(not (= ssl3_accept_~s__state~0 8195))} is VALID [2022-04-15 11:16:26,789 INFO L290 TraceCheckUtils]: 9: Hoare triple {13415#(not (= ssl3_accept_~s__state~0 8195))} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {13415#(not (= ssl3_accept_~s__state~0 8195))} is VALID [2022-04-15 11:16:26,789 INFO L290 TraceCheckUtils]: 10: Hoare triple {13415#(not (= ssl3_accept_~s__state~0 8195))} assume !(0 != 12288 + ~tmp___1~0); {13415#(not (= ssl3_accept_~s__state~0 8195))} is VALID [2022-04-15 11:16:26,790 INFO L290 TraceCheckUtils]: 11: Hoare triple {13415#(not (= ssl3_accept_~s__state~0 8195))} assume !(0 == ~s__cert~0); {13415#(not (= ssl3_accept_~s__state~0 8195))} is VALID [2022-04-15 11:16:26,790 INFO L290 TraceCheckUtils]: 12: Hoare triple {13415#(not (= ssl3_accept_~s__state~0 8195))} assume !false; {13415#(not (= ssl3_accept_~s__state~0 8195))} is VALID [2022-04-15 11:16:26,790 INFO L290 TraceCheckUtils]: 13: Hoare triple {13415#(not (= ssl3_accept_~s__state~0 8195))} ~state~0 := ~s__state~0; {13415#(not (= ssl3_accept_~s__state~0 8195))} is VALID [2022-04-15 11:16:26,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {13415#(not (= ssl3_accept_~s__state~0 8195))} assume !(12292 == ~s__state~0); {13415#(not (= ssl3_accept_~s__state~0 8195))} is VALID [2022-04-15 11:16:26,791 INFO L290 TraceCheckUtils]: 15: Hoare triple {13415#(not (= ssl3_accept_~s__state~0 8195))} assume !(16384 == ~s__state~0); {13415#(not (= ssl3_accept_~s__state~0 8195))} is VALID [2022-04-15 11:16:26,791 INFO L290 TraceCheckUtils]: 16: Hoare triple {13415#(not (= ssl3_accept_~s__state~0 8195))} assume !(8192 == ~s__state~0); {13415#(not (= ssl3_accept_~s__state~0 8195))} is VALID [2022-04-15 11:16:26,791 INFO L290 TraceCheckUtils]: 17: Hoare triple {13415#(not (= ssl3_accept_~s__state~0 8195))} assume !(24576 == ~s__state~0); {13415#(not (= ssl3_accept_~s__state~0 8195))} is VALID [2022-04-15 11:16:26,792 INFO L290 TraceCheckUtils]: 18: Hoare triple {13415#(not (= ssl3_accept_~s__state~0 8195))} assume 8195 == ~s__state~0; {13409#false} is VALID [2022-04-15 11:16:26,792 INFO L290 TraceCheckUtils]: 19: Hoare triple {13409#false} ~s__server~0 := 1; {13409#false} is VALID [2022-04-15 11:16:26,792 INFO L290 TraceCheckUtils]: 20: Hoare triple {13409#false} assume 0 != ~cb~0; {13409#false} is VALID [2022-04-15 11:16:26,792 INFO L290 TraceCheckUtils]: 21: Hoare triple {13409#false} ~__cil_tmp55~0 := 8 * ~s__version~0; {13409#false} is VALID [2022-04-15 11:16:26,792 INFO L290 TraceCheckUtils]: 22: Hoare triple {13409#false} assume !(3 != ~__cil_tmp55~0);~s__type~0 := 8192; {13409#false} is VALID [2022-04-15 11:16:26,792 INFO L290 TraceCheckUtils]: 23: Hoare triple {13409#false} assume !(0 == ~s__init_buf___0~0); {13409#false} is VALID [2022-04-15 11:16:26,792 INFO L290 TraceCheckUtils]: 24: Hoare triple {13409#false} assume !(0 == ~tmp___4~0);~s__init_num~0 := 0; {13409#false} is VALID [2022-04-15 11:16:26,792 INFO L290 TraceCheckUtils]: 25: Hoare triple {13409#false} assume 12292 != ~s__state~0; {13409#false} is VALID [2022-04-15 11:16:26,792 INFO L290 TraceCheckUtils]: 26: Hoare triple {13409#false} assume !(0 == ~tmp___5~0);~s__state~0 := 8464;#t~post33 := ~s__ctx__stats__sess_accept~0;~s__ctx__stats__sess_accept~0 := 1 + #t~post33;havoc #t~post33; {13409#false} is VALID [2022-04-15 11:16:26,793 INFO L290 TraceCheckUtils]: 27: Hoare triple {13409#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {13409#false} is VALID [2022-04-15 11:16:26,793 INFO L290 TraceCheckUtils]: 28: Hoare triple {13409#false} assume 0 == ~s__s3__tmp__reuse_message~0; {13409#false} is VALID [2022-04-15 11:16:26,793 INFO L290 TraceCheckUtils]: 29: Hoare triple {13409#false} assume 0 == ~skip~0; {13409#false} is VALID [2022-04-15 11:16:26,793 INFO L290 TraceCheckUtils]: 30: Hoare triple {13409#false} assume 8560 == ~state~0; {13409#false} is VALID [2022-04-15 11:16:26,793 INFO L290 TraceCheckUtils]: 31: Hoare triple {13409#false} assume 8448 == ~s__state~0; {13409#false} is VALID [2022-04-15 11:16:26,793 INFO L290 TraceCheckUtils]: 32: Hoare triple {13409#false} assume -1 != ~s__verify_mode~0; {13409#false} is VALID [2022-04-15 11:16:26,793 INFO L290 TraceCheckUtils]: 33: Hoare triple {13409#false} assume -2 != ~s__verify_mode~0; {13409#false} is VALID [2022-04-15 11:16:26,793 INFO L290 TraceCheckUtils]: 34: Hoare triple {13409#false} assume 9021 != ~__cil_tmp61~0 % 4294967296; {13409#false} is VALID [2022-04-15 11:16:26,793 INFO L290 TraceCheckUtils]: 35: Hoare triple {13409#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {13409#false} is VALID [2022-04-15 11:16:26,793 INFO L290 TraceCheckUtils]: 36: Hoare triple {13409#false} assume 4 != ~blastFlag~0; {13409#false} is VALID [2022-04-15 11:16:26,793 INFO L290 TraceCheckUtils]: 37: Hoare triple {13409#false} assume 1024 != ~tmp___7~0; {13409#false} is VALID [2022-04-15 11:16:26,793 INFO L290 TraceCheckUtils]: 38: Hoare triple {13409#false} assume !false; {13409#false} is VALID [2022-04-15 11:16:26,794 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-15 11:16:26,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:16:26,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871039463] [2022-04-15 11:16:26,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871039463] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:26,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:26,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:26,794 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:16:26,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [41601193] [2022-04-15 11:16:26,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [41601193] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:26,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:26,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:26,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359086565] [2022-04-15 11:16:26,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:16:26,809 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 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 39 [2022-04-15 11:16:26,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:16:26,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 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-15 11:16:26,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:26,831 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 11:16:26,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:26,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 11:16:26,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:16:26,831 INFO L87 Difference]: Start difference. First operand 214 states and 329 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 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-15 11:16:27,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:27,559 INFO L93 Difference]: Finished difference Result 424 states and 652 transitions. [2022-04-15 11:16:27,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 11:16:27,559 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 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 39 [2022-04-15 11:16:27,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:16:27,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 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-15 11:16:27,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 525 transitions. [2022-04-15 11:16:27,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 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-15 11:16:27,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 525 transitions. [2022-04-15 11:16:27,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 525 transitions. [2022-04-15 11:16:27,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 525 edges. 525 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:27,899 INFO L225 Difference]: With dead ends: 424 [2022-04-15 11:16:27,899 INFO L226 Difference]: Without dead ends: 224 [2022-04-15 11:16:27,899 INFO L912 BasicCegarLoop]: 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-15 11:16:27,900 INFO L913 BasicCegarLoop]: 183 mSDtfsCounter, 767 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:16:27,900 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [767 Valid, 200 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 11:16:27,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-04-15 11:16:27,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 214. [2022-04-15 11:16:27,917 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:16:27,918 INFO L82 GeneralOperation]: Start isEquivalent. First operand 224 states. Second operand has 214 states, 209 states have (on average 1.5454545454545454) internal successors, (323), 209 states have internal predecessors, (323), 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-15 11:16:27,918 INFO L74 IsIncluded]: Start isIncluded. First operand 224 states. Second operand has 214 states, 209 states have (on average 1.5454545454545454) internal successors, (323), 209 states have internal predecessors, (323), 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-15 11:16:27,918 INFO L87 Difference]: Start difference. First operand 224 states. Second operand has 214 states, 209 states have (on average 1.5454545454545454) internal successors, (323), 209 states have internal predecessors, (323), 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-15 11:16:27,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:27,921 INFO L93 Difference]: Finished difference Result 224 states and 339 transitions. [2022-04-15 11:16:27,921 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 339 transitions. [2022-04-15 11:16:27,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:27,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:27,922 INFO L74 IsIncluded]: Start isIncluded. First operand has 214 states, 209 states have (on average 1.5454545454545454) internal successors, (323), 209 states have internal predecessors, (323), 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 224 states. [2022-04-15 11:16:27,922 INFO L87 Difference]: Start difference. First operand has 214 states, 209 states have (on average 1.5454545454545454) internal successors, (323), 209 states have internal predecessors, (323), 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 224 states. [2022-04-15 11:16:27,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:27,925 INFO L93 Difference]: Finished difference Result 224 states and 339 transitions. [2022-04-15 11:16:27,925 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 339 transitions. [2022-04-15 11:16:27,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:27,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:27,925 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:16:27,925 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:16:27,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 209 states have (on average 1.5454545454545454) internal successors, (323), 209 states have internal predecessors, (323), 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-15 11:16:27,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 327 transitions. [2022-04-15 11:16:27,928 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 327 transitions. Word has length 39 [2022-04-15 11:16:27,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:16:27,929 INFO L478 AbstractCegarLoop]: Abstraction has 214 states and 327 transitions. [2022-04-15 11:16:27,929 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 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-15 11:16:27,929 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 214 states and 327 transitions. [2022-04-15 11:16:28,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 327 edges. 327 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:28,311 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 327 transitions. [2022-04-15 11:16:28,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 11:16:28,311 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:16:28,312 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:16:28,312 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 11:16:28,312 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:16:28,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:16:28,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1904631677, now seen corresponding path program 1 times [2022-04-15 11:16:28,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:28,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1073186088] [2022-04-15 11:16:28,313 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:16:28,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1904631677, now seen corresponding path program 2 times [2022-04-15 11:16:28,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:16:28,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595595992] [2022-04-15 11:16:28,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:16:28,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:16:28,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:28,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:16:28,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:28,398 INFO L290 TraceCheckUtils]: 0: Hoare triple {15157#(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); {15149#true} is VALID [2022-04-15 11:16:28,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {15149#true} assume true; {15149#true} is VALID [2022-04-15 11:16:28,398 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15149#true} {15149#true} #752#return; {15149#true} is VALID [2022-04-15 11:16:28,399 INFO L272 TraceCheckUtils]: 0: Hoare triple {15149#true} call ULTIMATE.init(); {15157#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:16:28,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {15157#(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); {15149#true} is VALID [2022-04-15 11:16:28,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {15149#true} assume true; {15149#true} is VALID [2022-04-15 11:16:28,399 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15149#true} {15149#true} #752#return; {15149#true} is VALID [2022-04-15 11:16:28,399 INFO L272 TraceCheckUtils]: 4: Hoare triple {15149#true} call #t~ret59 := main(); {15149#true} is VALID [2022-04-15 11:16:28,400 INFO L290 TraceCheckUtils]: 5: Hoare triple {15149#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {15154#(<= main_~s~0 8464)} is VALID [2022-04-15 11:16:28,400 INFO L272 TraceCheckUtils]: 6: Hoare triple {15154#(<= main_~s~0 8464)} call #t~ret58 := ssl3_accept(~s~0); {15155#(not (= 8465 |ssl3_accept_#in~initial_state|))} is VALID [2022-04-15 11:16:28,402 INFO L290 TraceCheckUtils]: 7: Hoare triple {15155#(not (= 8465 |ssl3_accept_#in~initial_state|))} ~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;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;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~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {15156#(not (= ssl3_accept_~s__state~0 8465))} is VALID [2022-04-15 11:16:28,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {15156#(not (= ssl3_accept_~s__state~0 8465))} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {15156#(not (= ssl3_accept_~s__state~0 8465))} is VALID [2022-04-15 11:16:28,402 INFO L290 TraceCheckUtils]: 9: Hoare triple {15156#(not (= ssl3_accept_~s__state~0 8465))} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {15156#(not (= ssl3_accept_~s__state~0 8465))} is VALID [2022-04-15 11:16:28,403 INFO L290 TraceCheckUtils]: 10: Hoare triple {15156#(not (= ssl3_accept_~s__state~0 8465))} assume !(0 != 12288 + ~tmp___1~0); {15156#(not (= ssl3_accept_~s__state~0 8465))} is VALID [2022-04-15 11:16:28,403 INFO L290 TraceCheckUtils]: 11: Hoare triple {15156#(not (= ssl3_accept_~s__state~0 8465))} assume !(0 == ~s__cert~0); {15156#(not (= ssl3_accept_~s__state~0 8465))} is VALID [2022-04-15 11:16:28,403 INFO L290 TraceCheckUtils]: 12: Hoare triple {15156#(not (= ssl3_accept_~s__state~0 8465))} assume !false; {15156#(not (= ssl3_accept_~s__state~0 8465))} is VALID [2022-04-15 11:16:28,404 INFO L290 TraceCheckUtils]: 13: Hoare triple {15156#(not (= ssl3_accept_~s__state~0 8465))} ~state~0 := ~s__state~0; {15156#(not (= ssl3_accept_~s__state~0 8465))} is VALID [2022-04-15 11:16:28,404 INFO L290 TraceCheckUtils]: 14: Hoare triple {15156#(not (= ssl3_accept_~s__state~0 8465))} assume !(12292 == ~s__state~0); {15156#(not (= ssl3_accept_~s__state~0 8465))} is VALID [2022-04-15 11:16:28,404 INFO L290 TraceCheckUtils]: 15: Hoare triple {15156#(not (= ssl3_accept_~s__state~0 8465))} assume !(16384 == ~s__state~0); {15156#(not (= ssl3_accept_~s__state~0 8465))} is VALID [2022-04-15 11:16:28,405 INFO L290 TraceCheckUtils]: 16: Hoare triple {15156#(not (= ssl3_accept_~s__state~0 8465))} assume !(8192 == ~s__state~0); {15156#(not (= ssl3_accept_~s__state~0 8465))} is VALID [2022-04-15 11:16:28,405 INFO L290 TraceCheckUtils]: 17: Hoare triple {15156#(not (= ssl3_accept_~s__state~0 8465))} assume !(24576 == ~s__state~0); {15156#(not (= ssl3_accept_~s__state~0 8465))} is VALID [2022-04-15 11:16:28,405 INFO L290 TraceCheckUtils]: 18: Hoare triple {15156#(not (= ssl3_accept_~s__state~0 8465))} assume !(8195 == ~s__state~0); {15156#(not (= ssl3_accept_~s__state~0 8465))} is VALID [2022-04-15 11:16:28,406 INFO L290 TraceCheckUtils]: 19: Hoare triple {15156#(not (= ssl3_accept_~s__state~0 8465))} assume !(8480 == ~s__state~0); {15156#(not (= ssl3_accept_~s__state~0 8465))} is VALID [2022-04-15 11:16:28,408 INFO L290 TraceCheckUtils]: 20: Hoare triple {15156#(not (= ssl3_accept_~s__state~0 8465))} assume !(8481 == ~s__state~0); {15156#(not (= ssl3_accept_~s__state~0 8465))} is VALID [2022-04-15 11:16:28,408 INFO L290 TraceCheckUtils]: 21: Hoare triple {15156#(not (= ssl3_accept_~s__state~0 8465))} assume !(8482 == ~s__state~0); {15156#(not (= ssl3_accept_~s__state~0 8465))} is VALID [2022-04-15 11:16:28,413 INFO L290 TraceCheckUtils]: 22: Hoare triple {15156#(not (= ssl3_accept_~s__state~0 8465))} assume !(8464 == ~s__state~0); {15156#(not (= ssl3_accept_~s__state~0 8465))} is VALID [2022-04-15 11:16:28,414 INFO L290 TraceCheckUtils]: 23: Hoare triple {15156#(not (= ssl3_accept_~s__state~0 8465))} assume 8465 == ~s__state~0; {15150#false} is VALID [2022-04-15 11:16:28,414 INFO L290 TraceCheckUtils]: 24: Hoare triple {15150#false} ~s__shutdown~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~ret~0 := #t~nondet36;havoc #t~nondet36; {15150#false} is VALID [2022-04-15 11:16:28,414 INFO L290 TraceCheckUtils]: 25: Hoare triple {15150#false} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {15150#false} is VALID [2022-04-15 11:16:28,414 INFO L290 TraceCheckUtils]: 26: Hoare triple {15150#false} assume !(~ret~0 <= 0);~got_new_session~0 := 1;~s__state~0 := 8496;~s__init_num~0 := 0; {15150#false} is VALID [2022-04-15 11:16:28,415 INFO L290 TraceCheckUtils]: 27: Hoare triple {15150#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {15150#false} is VALID [2022-04-15 11:16:28,415 INFO L290 TraceCheckUtils]: 28: Hoare triple {15150#false} assume 0 == ~s__s3__tmp__reuse_message~0; {15150#false} is VALID [2022-04-15 11:16:28,415 INFO L290 TraceCheckUtils]: 29: Hoare triple {15150#false} assume 0 == ~skip~0; {15150#false} is VALID [2022-04-15 11:16:28,415 INFO L290 TraceCheckUtils]: 30: Hoare triple {15150#false} assume 8560 == ~state~0; {15150#false} is VALID [2022-04-15 11:16:28,415 INFO L290 TraceCheckUtils]: 31: Hoare triple {15150#false} assume 8448 == ~s__state~0; {15150#false} is VALID [2022-04-15 11:16:28,416 INFO L290 TraceCheckUtils]: 32: Hoare triple {15150#false} assume -1 != ~s__verify_mode~0; {15150#false} is VALID [2022-04-15 11:16:28,416 INFO L290 TraceCheckUtils]: 33: Hoare triple {15150#false} assume -2 != ~s__verify_mode~0; {15150#false} is VALID [2022-04-15 11:16:28,416 INFO L290 TraceCheckUtils]: 34: Hoare triple {15150#false} assume 9021 != ~__cil_tmp61~0 % 4294967296; {15150#false} is VALID [2022-04-15 11:16:28,416 INFO L290 TraceCheckUtils]: 35: Hoare triple {15150#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {15150#false} is VALID [2022-04-15 11:16:28,416 INFO L290 TraceCheckUtils]: 36: Hoare triple {15150#false} assume 4 != ~blastFlag~0; {15150#false} is VALID [2022-04-15 11:16:28,416 INFO L290 TraceCheckUtils]: 37: Hoare triple {15150#false} assume 1024 != ~tmp___7~0; {15150#false} is VALID [2022-04-15 11:16:28,416 INFO L290 TraceCheckUtils]: 38: Hoare triple {15150#false} assume !false; {15150#false} is VALID [2022-04-15 11:16:28,416 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-15 11:16:28,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:16:28,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595595992] [2022-04-15 11:16:28,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595595992] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:28,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:28,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:28,417 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:16:28,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1073186088] [2022-04-15 11:16:28,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1073186088] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:28,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:28,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:28,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589391366] [2022-04-15 11:16:28,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:16:28,418 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 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 39 [2022-04-15 11:16:28,418 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:16:28,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 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-15 11:16:28,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:28,446 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 11:16:28,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:28,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 11:16:28,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:16:28,446 INFO L87 Difference]: Start difference. First operand 214 states and 327 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 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-15 11:16:29,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:29,167 INFO L93 Difference]: Finished difference Result 419 states and 644 transitions. [2022-04-15 11:16:29,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 11:16:29,167 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 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 39 [2022-04-15 11:16:29,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:16:29,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 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-15 11:16:29,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 524 transitions. [2022-04-15 11:16:29,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 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-15 11:16:29,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 524 transitions. [2022-04-15 11:16:29,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 524 transitions. [2022-04-15 11:16:29,520 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-15 11:16:29,523 INFO L225 Difference]: With dead ends: 419 [2022-04-15 11:16:29,523 INFO L226 Difference]: Without dead ends: 219 [2022-04-15 11:16:29,524 INFO L912 BasicCegarLoop]: 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-15 11:16:29,524 INFO L913 BasicCegarLoop]: 187 mSDtfsCounter, 754 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:16:29,524 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [754 Valid, 204 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 11:16:29,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-04-15 11:16:29,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 216. [2022-04-15 11:16:29,550 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:16:29,550 INFO L82 GeneralOperation]: Start isEquivalent. First operand 219 states. Second operand has 216 states, 211 states have (on average 1.5450236966824644) internal successors, (326), 211 states have internal predecessors, (326), 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-15 11:16:29,551 INFO L74 IsIncluded]: Start isIncluded. First operand 219 states. Second operand has 216 states, 211 states have (on average 1.5450236966824644) internal successors, (326), 211 states have internal predecessors, (326), 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-15 11:16:29,551 INFO L87 Difference]: Start difference. First operand 219 states. Second operand has 216 states, 211 states have (on average 1.5450236966824644) internal successors, (326), 211 states have internal predecessors, (326), 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-15 11:16:29,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:29,554 INFO L93 Difference]: Finished difference Result 219 states and 334 transitions. [2022-04-15 11:16:29,554 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 334 transitions. [2022-04-15 11:16:29,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:29,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:29,555 INFO L74 IsIncluded]: Start isIncluded. First operand has 216 states, 211 states have (on average 1.5450236966824644) internal successors, (326), 211 states have internal predecessors, (326), 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 219 states. [2022-04-15 11:16:29,555 INFO L87 Difference]: Start difference. First operand has 216 states, 211 states have (on average 1.5450236966824644) internal successors, (326), 211 states have internal predecessors, (326), 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 219 states. [2022-04-15 11:16:29,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:29,558 INFO L93 Difference]: Finished difference Result 219 states and 334 transitions. [2022-04-15 11:16:29,558 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 334 transitions. [2022-04-15 11:16:29,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:29,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:29,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:16:29,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:16:29,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 211 states have (on average 1.5450236966824644) internal successors, (326), 211 states have internal predecessors, (326), 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-15 11:16:29,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 330 transitions. [2022-04-15 11:16:29,562 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 330 transitions. Word has length 39 [2022-04-15 11:16:29,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:16:29,562 INFO L478 AbstractCegarLoop]: Abstraction has 216 states and 330 transitions. [2022-04-15 11:16:29,563 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 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-15 11:16:29,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 216 states and 330 transitions. [2022-04-15 11:16:29,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 330 edges. 330 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:29,955 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 330 transitions. [2022-04-15 11:16:29,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-15 11:16:29,955 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:16:29,955 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:16:29,956 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 11:16:29,956 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:16:29,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:16:29,956 INFO L85 PathProgramCache]: Analyzing trace with hash -827017343, now seen corresponding path program 1 times [2022-04-15 11:16:29,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:29,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [257370508] [2022-04-15 11:16:29,956 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:16:29,957 INFO L85 PathProgramCache]: Analyzing trace with hash -827017343, now seen corresponding path program 2 times [2022-04-15 11:16:29,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:16:29,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032719789] [2022-04-15 11:16:29,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:16:29,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:16:29,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:30,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:16:30,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:30,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {16882#(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); {16874#true} is VALID [2022-04-15 11:16:30,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {16874#true} assume true; {16874#true} is VALID [2022-04-15 11:16:30,026 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16874#true} {16874#true} #752#return; {16874#true} is VALID [2022-04-15 11:16:30,027 INFO L272 TraceCheckUtils]: 0: Hoare triple {16874#true} call ULTIMATE.init(); {16882#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:16:30,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {16882#(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); {16874#true} is VALID [2022-04-15 11:16:30,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {16874#true} assume true; {16874#true} is VALID [2022-04-15 11:16:30,027 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16874#true} {16874#true} #752#return; {16874#true} is VALID [2022-04-15 11:16:30,027 INFO L272 TraceCheckUtils]: 4: Hoare triple {16874#true} call #t~ret59 := main(); {16874#true} is VALID [2022-04-15 11:16:30,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {16874#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {16879#(<= main_~s~0 8464)} is VALID [2022-04-15 11:16:30,028 INFO L272 TraceCheckUtils]: 6: Hoare triple {16879#(<= main_~s~0 8464)} call #t~ret58 := ssl3_accept(~s~0); {16880#(not (= 8466 |ssl3_accept_#in~initial_state|))} is VALID [2022-04-15 11:16:30,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {16880#(not (= 8466 |ssl3_accept_#in~initial_state|))} ~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;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;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~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {16881#(not (= 8466 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:30,030 INFO L290 TraceCheckUtils]: 8: Hoare triple {16881#(not (= 8466 ssl3_accept_~s__state~0))} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {16881#(not (= 8466 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:30,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {16881#(not (= 8466 ssl3_accept_~s__state~0))} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {16881#(not (= 8466 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:30,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {16881#(not (= 8466 ssl3_accept_~s__state~0))} assume !(0 != 12288 + ~tmp___1~0); {16881#(not (= 8466 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:30,031 INFO L290 TraceCheckUtils]: 11: Hoare triple {16881#(not (= 8466 ssl3_accept_~s__state~0))} assume !(0 == ~s__cert~0); {16881#(not (= 8466 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:30,031 INFO L290 TraceCheckUtils]: 12: Hoare triple {16881#(not (= 8466 ssl3_accept_~s__state~0))} assume !false; {16881#(not (= 8466 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:30,031 INFO L290 TraceCheckUtils]: 13: Hoare triple {16881#(not (= 8466 ssl3_accept_~s__state~0))} ~state~0 := ~s__state~0; {16881#(not (= 8466 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:30,031 INFO L290 TraceCheckUtils]: 14: Hoare triple {16881#(not (= 8466 ssl3_accept_~s__state~0))} assume !(12292 == ~s__state~0); {16881#(not (= 8466 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:30,032 INFO L290 TraceCheckUtils]: 15: Hoare triple {16881#(not (= 8466 ssl3_accept_~s__state~0))} assume !(16384 == ~s__state~0); {16881#(not (= 8466 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:30,032 INFO L290 TraceCheckUtils]: 16: Hoare triple {16881#(not (= 8466 ssl3_accept_~s__state~0))} assume !(8192 == ~s__state~0); {16881#(not (= 8466 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:30,035 INFO L290 TraceCheckUtils]: 17: Hoare triple {16881#(not (= 8466 ssl3_accept_~s__state~0))} assume !(24576 == ~s__state~0); {16881#(not (= 8466 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:30,036 INFO L290 TraceCheckUtils]: 18: Hoare triple {16881#(not (= 8466 ssl3_accept_~s__state~0))} assume !(8195 == ~s__state~0); {16881#(not (= 8466 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:30,036 INFO L290 TraceCheckUtils]: 19: Hoare triple {16881#(not (= 8466 ssl3_accept_~s__state~0))} assume !(8480 == ~s__state~0); {16881#(not (= 8466 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:30,036 INFO L290 TraceCheckUtils]: 20: Hoare triple {16881#(not (= 8466 ssl3_accept_~s__state~0))} assume !(8481 == ~s__state~0); {16881#(not (= 8466 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:30,036 INFO L290 TraceCheckUtils]: 21: Hoare triple {16881#(not (= 8466 ssl3_accept_~s__state~0))} assume !(8482 == ~s__state~0); {16881#(not (= 8466 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:30,037 INFO L290 TraceCheckUtils]: 22: Hoare triple {16881#(not (= 8466 ssl3_accept_~s__state~0))} assume !(8464 == ~s__state~0); {16881#(not (= 8466 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:30,037 INFO L290 TraceCheckUtils]: 23: Hoare triple {16881#(not (= 8466 ssl3_accept_~s__state~0))} assume !(8465 == ~s__state~0); {16881#(not (= 8466 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:30,037 INFO L290 TraceCheckUtils]: 24: Hoare triple {16881#(not (= 8466 ssl3_accept_~s__state~0))} assume 8466 == ~s__state~0; {16875#false} is VALID [2022-04-15 11:16:30,037 INFO L290 TraceCheckUtils]: 25: Hoare triple {16875#false} ~s__shutdown~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~ret~0 := #t~nondet36;havoc #t~nondet36; {16875#false} is VALID [2022-04-15 11:16:30,037 INFO L290 TraceCheckUtils]: 26: Hoare triple {16875#false} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {16875#false} is VALID [2022-04-15 11:16:30,038 INFO L290 TraceCheckUtils]: 27: Hoare triple {16875#false} assume !(~ret~0 <= 0);~got_new_session~0 := 1;~s__state~0 := 8496;~s__init_num~0 := 0; {16875#false} is VALID [2022-04-15 11:16:30,038 INFO L290 TraceCheckUtils]: 28: Hoare triple {16875#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {16875#false} is VALID [2022-04-15 11:16:30,038 INFO L290 TraceCheckUtils]: 29: Hoare triple {16875#false} assume 0 == ~s__s3__tmp__reuse_message~0; {16875#false} is VALID [2022-04-15 11:16:30,038 INFO L290 TraceCheckUtils]: 30: Hoare triple {16875#false} assume 0 == ~skip~0; {16875#false} is VALID [2022-04-15 11:16:30,038 INFO L290 TraceCheckUtils]: 31: Hoare triple {16875#false} assume 8560 == ~state~0; {16875#false} is VALID [2022-04-15 11:16:30,038 INFO L290 TraceCheckUtils]: 32: Hoare triple {16875#false} assume 8448 == ~s__state~0; {16875#false} is VALID [2022-04-15 11:16:30,038 INFO L290 TraceCheckUtils]: 33: Hoare triple {16875#false} assume -1 != ~s__verify_mode~0; {16875#false} is VALID [2022-04-15 11:16:30,038 INFO L290 TraceCheckUtils]: 34: Hoare triple {16875#false} assume -2 != ~s__verify_mode~0; {16875#false} is VALID [2022-04-15 11:16:30,038 INFO L290 TraceCheckUtils]: 35: Hoare triple {16875#false} assume 9021 != ~__cil_tmp61~0 % 4294967296; {16875#false} is VALID [2022-04-15 11:16:30,038 INFO L290 TraceCheckUtils]: 36: Hoare triple {16875#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {16875#false} is VALID [2022-04-15 11:16:30,038 INFO L290 TraceCheckUtils]: 37: Hoare triple {16875#false} assume 4 != ~blastFlag~0; {16875#false} is VALID [2022-04-15 11:16:30,038 INFO L290 TraceCheckUtils]: 38: Hoare triple {16875#false} assume 1024 != ~tmp___7~0; {16875#false} is VALID [2022-04-15 11:16:30,038 INFO L290 TraceCheckUtils]: 39: Hoare triple {16875#false} assume !false; {16875#false} is VALID [2022-04-15 11:16:30,040 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-15 11:16:30,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:16:30,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032719789] [2022-04-15 11:16:30,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032719789] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:30,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:30,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:30,041 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:16:30,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [257370508] [2022-04-15 11:16:30,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [257370508] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:30,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:30,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:30,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681963301] [2022-04-15 11:16:30,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:16:30,041 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 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 40 [2022-04-15 11:16:30,042 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:16:30,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 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-15 11:16:30,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:30,064 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 11:16:30,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:30,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 11:16:30,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:16:30,066 INFO L87 Difference]: Start difference. First operand 216 states and 330 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 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-15 11:16:30,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:30,715 INFO L93 Difference]: Finished difference Result 444 states and 678 transitions. [2022-04-15 11:16:30,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 11:16:30,716 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 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 40 [2022-04-15 11:16:30,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:16:30,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 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-15 11:16:30,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 525 transitions. [2022-04-15 11:16:30,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 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-15 11:16:30,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 525 transitions. [2022-04-15 11:16:30,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 525 transitions. [2022-04-15 11:16:30,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 525 edges. 525 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:30,957 INFO L225 Difference]: With dead ends: 444 [2022-04-15 11:16:30,957 INFO L226 Difference]: Without dead ends: 242 [2022-04-15 11:16:30,958 INFO L912 BasicCegarLoop]: 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-15 11:16:30,958 INFO L913 BasicCegarLoop]: 188 mSDtfsCounter, 754 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:16:30,959 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [754 Valid, 205 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 11:16:30,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-04-15 11:16:30,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 239. [2022-04-15 11:16:30,994 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:16:30,994 INFO L82 GeneralOperation]: Start isEquivalent. First operand 242 states. Second operand has 239 states, 234 states have (on average 1.5256410256410255) internal successors, (357), 234 states have internal predecessors, (357), 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-15 11:16:30,995 INFO L74 IsIncluded]: Start isIncluded. First operand 242 states. Second operand has 239 states, 234 states have (on average 1.5256410256410255) internal successors, (357), 234 states have internal predecessors, (357), 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-15 11:16:30,995 INFO L87 Difference]: Start difference. First operand 242 states. Second operand has 239 states, 234 states have (on average 1.5256410256410255) internal successors, (357), 234 states have internal predecessors, (357), 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-15 11:16:30,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:30,998 INFO L93 Difference]: Finished difference Result 242 states and 365 transitions. [2022-04-15 11:16:30,998 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 365 transitions. [2022-04-15 11:16:30,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:30,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:30,998 INFO L74 IsIncluded]: Start isIncluded. First operand has 239 states, 234 states have (on average 1.5256410256410255) internal successors, (357), 234 states have internal predecessors, (357), 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 242 states. [2022-04-15 11:16:30,999 INFO L87 Difference]: Start difference. First operand has 239 states, 234 states have (on average 1.5256410256410255) internal successors, (357), 234 states have internal predecessors, (357), 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 242 states. [2022-04-15 11:16:31,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:31,001 INFO L93 Difference]: Finished difference Result 242 states and 365 transitions. [2022-04-15 11:16:31,001 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 365 transitions. [2022-04-15 11:16:31,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:31,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:31,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:16:31,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:16:31,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 234 states have (on average 1.5256410256410255) internal successors, (357), 234 states have internal predecessors, (357), 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-15 11:16:31,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 361 transitions. [2022-04-15 11:16:31,005 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 361 transitions. Word has length 40 [2022-04-15 11:16:31,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:16:31,006 INFO L478 AbstractCegarLoop]: Abstraction has 239 states and 361 transitions. [2022-04-15 11:16:31,006 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 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-15 11:16:31,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 239 states and 361 transitions. [2022-04-15 11:16:31,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 361 edges. 361 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:31,420 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 361 transitions. [2022-04-15 11:16:31,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 11:16:31,421 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:16:31,421 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:16:31,421 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 11:16:31,421 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:16:31,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:16:31,422 INFO L85 PathProgramCache]: Analyzing trace with hash 341017417, now seen corresponding path program 1 times [2022-04-15 11:16:31,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:31,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2074944605] [2022-04-15 11:16:31,422 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:16:31,422 INFO L85 PathProgramCache]: Analyzing trace with hash 341017417, now seen corresponding path program 2 times [2022-04-15 11:16:31,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:16:31,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667714880] [2022-04-15 11:16:31,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:16:31,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:16:31,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:31,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:16:31,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:31,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {18749#(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); {18741#true} is VALID [2022-04-15 11:16:31,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {18741#true} assume true; {18741#true} is VALID [2022-04-15 11:16:31,496 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18741#true} {18741#true} #752#return; {18741#true} is VALID [2022-04-15 11:16:31,496 INFO L272 TraceCheckUtils]: 0: Hoare triple {18741#true} call ULTIMATE.init(); {18749#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:16:31,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {18749#(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); {18741#true} is VALID [2022-04-15 11:16:31,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {18741#true} assume true; {18741#true} is VALID [2022-04-15 11:16:31,496 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18741#true} {18741#true} #752#return; {18741#true} is VALID [2022-04-15 11:16:31,496 INFO L272 TraceCheckUtils]: 4: Hoare triple {18741#true} call #t~ret59 := main(); {18741#true} is VALID [2022-04-15 11:16:31,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {18741#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {18746#(<= main_~s~0 8464)} is VALID [2022-04-15 11:16:31,497 INFO L272 TraceCheckUtils]: 6: Hoare triple {18746#(<= main_~s~0 8464)} call #t~ret58 := ssl3_accept(~s~0); {18747#(not (= 8496 |ssl3_accept_#in~initial_state|))} is VALID [2022-04-15 11:16:31,498 INFO L290 TraceCheckUtils]: 7: Hoare triple {18747#(not (= 8496 |ssl3_accept_#in~initial_state|))} ~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;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;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~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {18748#(not (= 8496 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:31,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {18748#(not (= 8496 ssl3_accept_~s__state~0))} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {18748#(not (= 8496 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:31,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {18748#(not (= 8496 ssl3_accept_~s__state~0))} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {18748#(not (= 8496 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:31,499 INFO L290 TraceCheckUtils]: 10: Hoare triple {18748#(not (= 8496 ssl3_accept_~s__state~0))} assume !(0 != 12288 + ~tmp___1~0); {18748#(not (= 8496 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:31,500 INFO L290 TraceCheckUtils]: 11: Hoare triple {18748#(not (= 8496 ssl3_accept_~s__state~0))} assume !(0 == ~s__cert~0); {18748#(not (= 8496 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:31,500 INFO L290 TraceCheckUtils]: 12: Hoare triple {18748#(not (= 8496 ssl3_accept_~s__state~0))} assume !false; {18748#(not (= 8496 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:31,500 INFO L290 TraceCheckUtils]: 13: Hoare triple {18748#(not (= 8496 ssl3_accept_~s__state~0))} ~state~0 := ~s__state~0; {18748#(not (= 8496 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:31,500 INFO L290 TraceCheckUtils]: 14: Hoare triple {18748#(not (= 8496 ssl3_accept_~s__state~0))} assume !(12292 == ~s__state~0); {18748#(not (= 8496 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:31,501 INFO L290 TraceCheckUtils]: 15: Hoare triple {18748#(not (= 8496 ssl3_accept_~s__state~0))} assume !(16384 == ~s__state~0); {18748#(not (= 8496 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:31,501 INFO L290 TraceCheckUtils]: 16: Hoare triple {18748#(not (= 8496 ssl3_accept_~s__state~0))} assume !(8192 == ~s__state~0); {18748#(not (= 8496 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:31,501 INFO L290 TraceCheckUtils]: 17: Hoare triple {18748#(not (= 8496 ssl3_accept_~s__state~0))} assume !(24576 == ~s__state~0); {18748#(not (= 8496 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:31,502 INFO L290 TraceCheckUtils]: 18: Hoare triple {18748#(not (= 8496 ssl3_accept_~s__state~0))} assume !(8195 == ~s__state~0); {18748#(not (= 8496 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:31,502 INFO L290 TraceCheckUtils]: 19: Hoare triple {18748#(not (= 8496 ssl3_accept_~s__state~0))} assume !(8480 == ~s__state~0); {18748#(not (= 8496 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:31,502 INFO L290 TraceCheckUtils]: 20: Hoare triple {18748#(not (= 8496 ssl3_accept_~s__state~0))} assume !(8481 == ~s__state~0); {18748#(not (= 8496 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:31,502 INFO L290 TraceCheckUtils]: 21: Hoare triple {18748#(not (= 8496 ssl3_accept_~s__state~0))} assume !(8482 == ~s__state~0); {18748#(not (= 8496 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:31,503 INFO L290 TraceCheckUtils]: 22: Hoare triple {18748#(not (= 8496 ssl3_accept_~s__state~0))} assume !(8464 == ~s__state~0); {18748#(not (= 8496 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:31,503 INFO L290 TraceCheckUtils]: 23: Hoare triple {18748#(not (= 8496 ssl3_accept_~s__state~0))} assume !(8465 == ~s__state~0); {18748#(not (= 8496 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:31,503 INFO L290 TraceCheckUtils]: 24: Hoare triple {18748#(not (= 8496 ssl3_accept_~s__state~0))} assume !(8466 == ~s__state~0); {18748#(not (= 8496 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:31,504 INFO L290 TraceCheckUtils]: 25: Hoare triple {18748#(not (= 8496 ssl3_accept_~s__state~0))} assume 8496 == ~s__state~0; {18742#false} is VALID [2022-04-15 11:16:31,504 INFO L290 TraceCheckUtils]: 26: Hoare triple {18742#false} assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~ret~0 := #t~nondet37;havoc #t~nondet37; {18742#false} is VALID [2022-04-15 11:16:31,504 INFO L290 TraceCheckUtils]: 27: Hoare triple {18742#false} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {18742#false} is VALID [2022-04-15 11:16:31,504 INFO L290 TraceCheckUtils]: 28: Hoare triple {18742#false} assume !(~ret~0 <= 0); {18742#false} is VALID [2022-04-15 11:16:31,504 INFO L290 TraceCheckUtils]: 29: Hoare triple {18742#false} assume 0 != ~s__hit~0;~s__state~0 := 8656; {18742#false} is VALID [2022-04-15 11:16:31,504 INFO L290 TraceCheckUtils]: 30: Hoare triple {18742#false} ~s__init_num~0 := 0; {18742#false} is VALID [2022-04-15 11:16:31,504 INFO L290 TraceCheckUtils]: 31: Hoare triple {18742#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {18742#false} is VALID [2022-04-15 11:16:31,504 INFO L290 TraceCheckUtils]: 32: Hoare triple {18742#false} assume 0 == ~s__s3__tmp__reuse_message~0; {18742#false} is VALID [2022-04-15 11:16:31,504 INFO L290 TraceCheckUtils]: 33: Hoare triple {18742#false} assume 0 == ~skip~0; {18742#false} is VALID [2022-04-15 11:16:31,504 INFO L290 TraceCheckUtils]: 34: Hoare triple {18742#false} assume 8560 == ~state~0; {18742#false} is VALID [2022-04-15 11:16:31,504 INFO L290 TraceCheckUtils]: 35: Hoare triple {18742#false} assume 8448 == ~s__state~0; {18742#false} is VALID [2022-04-15 11:16:31,505 INFO L290 TraceCheckUtils]: 36: Hoare triple {18742#false} assume -1 != ~s__verify_mode~0; {18742#false} is VALID [2022-04-15 11:16:31,505 INFO L290 TraceCheckUtils]: 37: Hoare triple {18742#false} assume -2 != ~s__verify_mode~0; {18742#false} is VALID [2022-04-15 11:16:31,505 INFO L290 TraceCheckUtils]: 38: Hoare triple {18742#false} assume 9021 != ~__cil_tmp61~0 % 4294967296; {18742#false} is VALID [2022-04-15 11:16:31,505 INFO L290 TraceCheckUtils]: 39: Hoare triple {18742#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {18742#false} is VALID [2022-04-15 11:16:31,505 INFO L290 TraceCheckUtils]: 40: Hoare triple {18742#false} assume 4 != ~blastFlag~0; {18742#false} is VALID [2022-04-15 11:16:31,505 INFO L290 TraceCheckUtils]: 41: Hoare triple {18742#false} assume 1024 != ~tmp___7~0; {18742#false} is VALID [2022-04-15 11:16:31,505 INFO L290 TraceCheckUtils]: 42: Hoare triple {18742#false} assume !false; {18742#false} is VALID [2022-04-15 11:16:31,505 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-15 11:16:31,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:16:31,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667714880] [2022-04-15 11:16:31,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667714880] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:31,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:31,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:31,506 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:16:31,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2074944605] [2022-04-15 11:16:31,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2074944605] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:31,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:31,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:31,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611732639] [2022-04-15 11:16:31,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:16:31,506 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 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 43 [2022-04-15 11:16:31,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:16:31,507 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 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-15 11:16:31,533 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-15 11:16:31,533 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 11:16:31,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:31,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 11:16:31,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:16:31,534 INFO L87 Difference]: Start difference. First operand 239 states and 361 transitions. Second operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 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-15 11:16:32,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:32,223 INFO L93 Difference]: Finished difference Result 493 states and 745 transitions. [2022-04-15 11:16:32,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 11:16:32,224 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 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 43 [2022-04-15 11:16:32,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:16:32,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 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-15 11:16:32,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 529 transitions. [2022-04-15 11:16:32,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 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-15 11:16:32,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 529 transitions. [2022-04-15 11:16:32,228 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 529 transitions. [2022-04-15 11:16:32,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 529 edges. 529 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:32,563 INFO L225 Difference]: With dead ends: 493 [2022-04-15 11:16:32,563 INFO L226 Difference]: Without dead ends: 268 [2022-04-15 11:16:32,564 INFO L912 BasicCegarLoop]: 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-15 11:16:32,564 INFO L913 BasicCegarLoop]: 203 mSDtfsCounter, 732 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:16:32,564 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [732 Valid, 220 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 11:16:32,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-04-15 11:16:32,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 264. [2022-04-15 11:16:32,599 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:16:32,599 INFO L82 GeneralOperation]: Start isEquivalent. First operand 268 states. Second operand has 264 states, 259 states have (on average 1.5096525096525097) internal successors, (391), 259 states have internal predecessors, (391), 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-15 11:16:32,600 INFO L74 IsIncluded]: Start isIncluded. First operand 268 states. Second operand has 264 states, 259 states have (on average 1.5096525096525097) internal successors, (391), 259 states have internal predecessors, (391), 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-15 11:16:32,600 INFO L87 Difference]: Start difference. First operand 268 states. Second operand has 264 states, 259 states have (on average 1.5096525096525097) internal successors, (391), 259 states have internal predecessors, (391), 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-15 11:16:32,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:32,603 INFO L93 Difference]: Finished difference Result 268 states and 401 transitions. [2022-04-15 11:16:32,603 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 401 transitions. [2022-04-15 11:16:32,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:32,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:32,604 INFO L74 IsIncluded]: Start isIncluded. First operand has 264 states, 259 states have (on average 1.5096525096525097) internal successors, (391), 259 states have internal predecessors, (391), 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 268 states. [2022-04-15 11:16:32,604 INFO L87 Difference]: Start difference. First operand has 264 states, 259 states have (on average 1.5096525096525097) internal successors, (391), 259 states have internal predecessors, (391), 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 268 states. [2022-04-15 11:16:32,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:32,614 INFO L93 Difference]: Finished difference Result 268 states and 401 transitions. [2022-04-15 11:16:32,614 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 401 transitions. [2022-04-15 11:16:32,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:32,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:32,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:16:32,615 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:16:32,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 259 states have (on average 1.5096525096525097) internal successors, (391), 259 states have internal predecessors, (391), 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-15 11:16:32,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 395 transitions. [2022-04-15 11:16:32,627 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 395 transitions. Word has length 43 [2022-04-15 11:16:32,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:16:32,627 INFO L478 AbstractCegarLoop]: Abstraction has 264 states and 395 transitions. [2022-04-15 11:16:32,627 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 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-15 11:16:32,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 264 states and 395 transitions. [2022-04-15 11:16:33,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 395 edges. 395 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:33,089 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 395 transitions. [2022-04-15 11:16:33,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 11:16:33,090 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:16:33,090 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:16:33,090 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 11:16:33,090 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:16:33,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:16:33,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1564538053, now seen corresponding path program 1 times [2022-04-15 11:16:33,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:33,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [228771542] [2022-04-15 11:16:33,091 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:16:33,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1564538053, now seen corresponding path program 2 times [2022-04-15 11:16:33,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:16:33,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436760600] [2022-04-15 11:16:33,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:16:33,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:16:33,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:33,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:16:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:33,144 INFO L290 TraceCheckUtils]: 0: Hoare triple {20816#(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); {20808#true} is VALID [2022-04-15 11:16:33,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {20808#true} assume true; {20808#true} is VALID [2022-04-15 11:16:33,144 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20808#true} {20808#true} #752#return; {20808#true} is VALID [2022-04-15 11:16:33,145 INFO L272 TraceCheckUtils]: 0: Hoare triple {20808#true} call ULTIMATE.init(); {20816#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:16:33,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {20816#(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); {20808#true} is VALID [2022-04-15 11:16:33,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {20808#true} assume true; {20808#true} is VALID [2022-04-15 11:16:33,145 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20808#true} {20808#true} #752#return; {20808#true} is VALID [2022-04-15 11:16:33,145 INFO L272 TraceCheckUtils]: 4: Hoare triple {20808#true} call #t~ret59 := main(); {20808#true} is VALID [2022-04-15 11:16:33,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {20808#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {20813#(<= main_~s~0 8464)} is VALID [2022-04-15 11:16:33,146 INFO L272 TraceCheckUtils]: 6: Hoare triple {20813#(<= main_~s~0 8464)} call #t~ret58 := ssl3_accept(~s~0); {20814#(not (= |ssl3_accept_#in~initial_state| 8512))} is VALID [2022-04-15 11:16:33,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {20814#(not (= |ssl3_accept_#in~initial_state| 8512))} ~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;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;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~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {20815#(not (= ssl3_accept_~s__state~0 8512))} is VALID [2022-04-15 11:16:33,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {20815#(not (= ssl3_accept_~s__state~0 8512))} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {20815#(not (= ssl3_accept_~s__state~0 8512))} is VALID [2022-04-15 11:16:33,148 INFO L290 TraceCheckUtils]: 9: Hoare triple {20815#(not (= ssl3_accept_~s__state~0 8512))} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {20815#(not (= ssl3_accept_~s__state~0 8512))} is VALID [2022-04-15 11:16:33,148 INFO L290 TraceCheckUtils]: 10: Hoare triple {20815#(not (= ssl3_accept_~s__state~0 8512))} assume !(0 != 12288 + ~tmp___1~0); {20815#(not (= ssl3_accept_~s__state~0 8512))} is VALID [2022-04-15 11:16:33,148 INFO L290 TraceCheckUtils]: 11: Hoare triple {20815#(not (= ssl3_accept_~s__state~0 8512))} assume !(0 == ~s__cert~0); {20815#(not (= ssl3_accept_~s__state~0 8512))} is VALID [2022-04-15 11:16:33,148 INFO L290 TraceCheckUtils]: 12: Hoare triple {20815#(not (= ssl3_accept_~s__state~0 8512))} assume !false; {20815#(not (= ssl3_accept_~s__state~0 8512))} is VALID [2022-04-15 11:16:33,149 INFO L290 TraceCheckUtils]: 13: Hoare triple {20815#(not (= ssl3_accept_~s__state~0 8512))} ~state~0 := ~s__state~0; {20815#(not (= ssl3_accept_~s__state~0 8512))} is VALID [2022-04-15 11:16:33,149 INFO L290 TraceCheckUtils]: 14: Hoare triple {20815#(not (= ssl3_accept_~s__state~0 8512))} assume !(12292 == ~s__state~0); {20815#(not (= ssl3_accept_~s__state~0 8512))} is VALID [2022-04-15 11:16:33,149 INFO L290 TraceCheckUtils]: 15: Hoare triple {20815#(not (= ssl3_accept_~s__state~0 8512))} assume !(16384 == ~s__state~0); {20815#(not (= ssl3_accept_~s__state~0 8512))} is VALID [2022-04-15 11:16:33,150 INFO L290 TraceCheckUtils]: 16: Hoare triple {20815#(not (= ssl3_accept_~s__state~0 8512))} assume !(8192 == ~s__state~0); {20815#(not (= ssl3_accept_~s__state~0 8512))} is VALID [2022-04-15 11:16:33,150 INFO L290 TraceCheckUtils]: 17: Hoare triple {20815#(not (= ssl3_accept_~s__state~0 8512))} assume !(24576 == ~s__state~0); {20815#(not (= ssl3_accept_~s__state~0 8512))} is VALID [2022-04-15 11:16:33,150 INFO L290 TraceCheckUtils]: 18: Hoare triple {20815#(not (= ssl3_accept_~s__state~0 8512))} assume !(8195 == ~s__state~0); {20815#(not (= ssl3_accept_~s__state~0 8512))} is VALID [2022-04-15 11:16:33,151 INFO L290 TraceCheckUtils]: 19: Hoare triple {20815#(not (= ssl3_accept_~s__state~0 8512))} assume !(8480 == ~s__state~0); {20815#(not (= ssl3_accept_~s__state~0 8512))} is VALID [2022-04-15 11:16:33,151 INFO L290 TraceCheckUtils]: 20: Hoare triple {20815#(not (= ssl3_accept_~s__state~0 8512))} assume !(8481 == ~s__state~0); {20815#(not (= ssl3_accept_~s__state~0 8512))} is VALID [2022-04-15 11:16:33,151 INFO L290 TraceCheckUtils]: 21: Hoare triple {20815#(not (= ssl3_accept_~s__state~0 8512))} assume !(8482 == ~s__state~0); {20815#(not (= ssl3_accept_~s__state~0 8512))} is VALID [2022-04-15 11:16:33,151 INFO L290 TraceCheckUtils]: 22: Hoare triple {20815#(not (= ssl3_accept_~s__state~0 8512))} assume !(8464 == ~s__state~0); {20815#(not (= ssl3_accept_~s__state~0 8512))} is VALID [2022-04-15 11:16:33,152 INFO L290 TraceCheckUtils]: 23: Hoare triple {20815#(not (= ssl3_accept_~s__state~0 8512))} assume !(8465 == ~s__state~0); {20815#(not (= ssl3_accept_~s__state~0 8512))} is VALID [2022-04-15 11:16:33,152 INFO L290 TraceCheckUtils]: 24: Hoare triple {20815#(not (= ssl3_accept_~s__state~0 8512))} assume !(8466 == ~s__state~0); {20815#(not (= ssl3_accept_~s__state~0 8512))} is VALID [2022-04-15 11:16:33,152 INFO L290 TraceCheckUtils]: 25: Hoare triple {20815#(not (= ssl3_accept_~s__state~0 8512))} assume !(8496 == ~s__state~0); {20815#(not (= ssl3_accept_~s__state~0 8512))} is VALID [2022-04-15 11:16:33,153 INFO L290 TraceCheckUtils]: 26: Hoare triple {20815#(not (= ssl3_accept_~s__state~0 8512))} assume !(8497 == ~s__state~0); {20815#(not (= ssl3_accept_~s__state~0 8512))} is VALID [2022-04-15 11:16:33,153 INFO L290 TraceCheckUtils]: 27: Hoare triple {20815#(not (= ssl3_accept_~s__state~0 8512))} assume 8512 == ~s__state~0; {20809#false} is VALID [2022-04-15 11:16:33,153 INFO L290 TraceCheckUtils]: 28: Hoare triple {20809#false} assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet38;havoc #t~nondet38;~__cil_tmp56~0 := ~s__s3__tmp__new_cipher__algorithms~0; {20809#false} is VALID [2022-04-15 11:16:33,153 INFO L290 TraceCheckUtils]: 29: Hoare triple {20809#false} assume 0 != (256 + ~__cil_tmp56~0) % 4294967296;~__cil_tmp56~0 := 256345;~skip~0 := 1; {20809#false} is VALID [2022-04-15 11:16:33,153 INFO L290 TraceCheckUtils]: 30: Hoare triple {20809#false} ~s__state~0 := 8528;~s__init_num~0 := 0; {20809#false} is VALID [2022-04-15 11:16:33,153 INFO L290 TraceCheckUtils]: 31: Hoare triple {20809#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {20809#false} is VALID [2022-04-15 11:16:33,153 INFO L290 TraceCheckUtils]: 32: Hoare triple {20809#false} assume 0 == ~s__s3__tmp__reuse_message~0; {20809#false} is VALID [2022-04-15 11:16:33,153 INFO L290 TraceCheckUtils]: 33: Hoare triple {20809#false} assume 0 == ~skip~0; {20809#false} is VALID [2022-04-15 11:16:33,154 INFO L290 TraceCheckUtils]: 34: Hoare triple {20809#false} assume 8560 == ~state~0; {20809#false} is VALID [2022-04-15 11:16:33,154 INFO L290 TraceCheckUtils]: 35: Hoare triple {20809#false} assume 8448 == ~s__state~0; {20809#false} is VALID [2022-04-15 11:16:33,154 INFO L290 TraceCheckUtils]: 36: Hoare triple {20809#false} assume -1 != ~s__verify_mode~0; {20809#false} is VALID [2022-04-15 11:16:33,154 INFO L290 TraceCheckUtils]: 37: Hoare triple {20809#false} assume -2 != ~s__verify_mode~0; {20809#false} is VALID [2022-04-15 11:16:33,154 INFO L290 TraceCheckUtils]: 38: Hoare triple {20809#false} assume 9021 != ~__cil_tmp61~0 % 4294967296; {20809#false} is VALID [2022-04-15 11:16:33,154 INFO L290 TraceCheckUtils]: 39: Hoare triple {20809#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {20809#false} is VALID [2022-04-15 11:16:33,154 INFO L290 TraceCheckUtils]: 40: Hoare triple {20809#false} assume 4 != ~blastFlag~0; {20809#false} is VALID [2022-04-15 11:16:33,154 INFO L290 TraceCheckUtils]: 41: Hoare triple {20809#false} assume 1024 != ~tmp___7~0; {20809#false} is VALID [2022-04-15 11:16:33,154 INFO L290 TraceCheckUtils]: 42: Hoare triple {20809#false} assume !false; {20809#false} is VALID [2022-04-15 11:16:33,154 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-15 11:16:33,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:16:33,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436760600] [2022-04-15 11:16:33,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436760600] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:33,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:33,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:33,155 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:16:33,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [228771542] [2022-04-15 11:16:33,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [228771542] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:33,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:33,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:33,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895739866] [2022-04-15 11:16:33,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:16:33,156 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 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 43 [2022-04-15 11:16:33,156 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:16:33,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 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-15 11:16:33,181 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-15 11:16:33,181 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 11:16:33,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:33,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 11:16:33,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:16:33,181 INFO L87 Difference]: Start difference. First operand 264 states and 395 transitions. Second operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 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-15 11:16:33,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:33,911 INFO L93 Difference]: Finished difference Result 547 states and 818 transitions. [2022-04-15 11:16:33,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 11:16:33,911 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 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 43 [2022-04-15 11:16:33,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:16:33,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 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-15 11:16:33,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 535 transitions. [2022-04-15 11:16:33,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 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-15 11:16:33,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 535 transitions. [2022-04-15 11:16:33,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 535 transitions. [2022-04-15 11:16:34,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 535 edges. 535 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:34,146 INFO L225 Difference]: With dead ends: 547 [2022-04-15 11:16:34,146 INFO L226 Difference]: Without dead ends: 297 [2022-04-15 11:16:34,146 INFO L912 BasicCegarLoop]: 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-15 11:16:34,147 INFO L913 BasicCegarLoop]: 189 mSDtfsCounter, 768 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:16:34,147 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [768 Valid, 206 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 11:16:34,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-04-15 11:16:34,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 292. [2022-04-15 11:16:34,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:16:34,197 INFO L82 GeneralOperation]: Start isEquivalent. First operand 297 states. Second operand has 292 states, 287 states have (on average 1.494773519163763) internal successors, (429), 287 states have internal predecessors, (429), 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-15 11:16:34,197 INFO L74 IsIncluded]: Start isIncluded. First operand 297 states. Second operand has 292 states, 287 states have (on average 1.494773519163763) internal successors, (429), 287 states have internal predecessors, (429), 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-15 11:16:34,198 INFO L87 Difference]: Start difference. First operand 297 states. Second operand has 292 states, 287 states have (on average 1.494773519163763) internal successors, (429), 287 states have internal predecessors, (429), 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-15 11:16:34,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:34,201 INFO L93 Difference]: Finished difference Result 297 states and 440 transitions. [2022-04-15 11:16:34,201 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 440 transitions. [2022-04-15 11:16:34,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:34,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:34,202 INFO L74 IsIncluded]: Start isIncluded. First operand has 292 states, 287 states have (on average 1.494773519163763) internal successors, (429), 287 states have internal predecessors, (429), 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 297 states. [2022-04-15 11:16:34,202 INFO L87 Difference]: Start difference. First operand has 292 states, 287 states have (on average 1.494773519163763) internal successors, (429), 287 states have internal predecessors, (429), 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 297 states. [2022-04-15 11:16:34,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:34,207 INFO L93 Difference]: Finished difference Result 297 states and 440 transitions. [2022-04-15 11:16:34,207 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 440 transitions. [2022-04-15 11:16:34,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:34,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:34,207 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:16:34,207 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:16:34,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 287 states have (on average 1.494773519163763) internal successors, (429), 287 states have internal predecessors, (429), 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-15 11:16:34,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 433 transitions. [2022-04-15 11:16:34,212 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 433 transitions. Word has length 43 [2022-04-15 11:16:34,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:16:34,212 INFO L478 AbstractCegarLoop]: Abstraction has 292 states and 433 transitions. [2022-04-15 11:16:34,212 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 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-15 11:16:34,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 292 states and 433 transitions. [2022-04-15 11:16:34,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 433 edges. 433 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:34,653 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 433 transitions. [2022-04-15 11:16:34,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 11:16:34,653 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:16:34,653 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:16:34,654 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 11:16:34,654 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:16:34,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:16:34,654 INFO L85 PathProgramCache]: Analyzing trace with hash -570717011, now seen corresponding path program 1 times [2022-04-15 11:16:34,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:34,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1136257045] [2022-04-15 11:16:34,654 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:16:34,654 INFO L85 PathProgramCache]: Analyzing trace with hash -570717011, now seen corresponding path program 2 times [2022-04-15 11:16:34,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:16:34,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679633832] [2022-04-15 11:16:34,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:16:34,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:16:34,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:34,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:16:34,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:34,710 INFO L290 TraceCheckUtils]: 0: Hoare triple {23105#(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); {23097#true} is VALID [2022-04-15 11:16:34,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {23097#true} assume true; {23097#true} is VALID [2022-04-15 11:16:34,710 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23097#true} {23097#true} #752#return; {23097#true} is VALID [2022-04-15 11:16:34,710 INFO L272 TraceCheckUtils]: 0: Hoare triple {23097#true} call ULTIMATE.init(); {23105#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:16:34,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {23105#(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); {23097#true} is VALID [2022-04-15 11:16:34,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {23097#true} assume true; {23097#true} is VALID [2022-04-15 11:16:34,710 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23097#true} {23097#true} #752#return; {23097#true} is VALID [2022-04-15 11:16:34,711 INFO L272 TraceCheckUtils]: 4: Hoare triple {23097#true} call #t~ret59 := main(); {23097#true} is VALID [2022-04-15 11:16:34,711 INFO L290 TraceCheckUtils]: 5: Hoare triple {23097#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {23102#(<= main_~s~0 8464)} is VALID [2022-04-15 11:16:34,711 INFO L272 TraceCheckUtils]: 6: Hoare triple {23102#(<= main_~s~0 8464)} call #t~ret58 := ssl3_accept(~s~0); {23103#(not (= 8497 |ssl3_accept_#in~initial_state|))} is VALID [2022-04-15 11:16:34,712 INFO L290 TraceCheckUtils]: 7: Hoare triple {23103#(not (= 8497 |ssl3_accept_#in~initial_state|))} ~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;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;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~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {23104#(not (= 8497 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:34,713 INFO L290 TraceCheckUtils]: 8: Hoare triple {23104#(not (= 8497 ssl3_accept_~s__state~0))} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {23104#(not (= 8497 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:34,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {23104#(not (= 8497 ssl3_accept_~s__state~0))} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {23104#(not (= 8497 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:34,713 INFO L290 TraceCheckUtils]: 10: Hoare triple {23104#(not (= 8497 ssl3_accept_~s__state~0))} assume !(0 != 12288 + ~tmp___1~0); {23104#(not (= 8497 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:34,713 INFO L290 TraceCheckUtils]: 11: Hoare triple {23104#(not (= 8497 ssl3_accept_~s__state~0))} assume !(0 == ~s__cert~0); {23104#(not (= 8497 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:34,713 INFO L290 TraceCheckUtils]: 12: Hoare triple {23104#(not (= 8497 ssl3_accept_~s__state~0))} assume !false; {23104#(not (= 8497 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:34,714 INFO L290 TraceCheckUtils]: 13: Hoare triple {23104#(not (= 8497 ssl3_accept_~s__state~0))} ~state~0 := ~s__state~0; {23104#(not (= 8497 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:34,714 INFO L290 TraceCheckUtils]: 14: Hoare triple {23104#(not (= 8497 ssl3_accept_~s__state~0))} assume !(12292 == ~s__state~0); {23104#(not (= 8497 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:34,714 INFO L290 TraceCheckUtils]: 15: Hoare triple {23104#(not (= 8497 ssl3_accept_~s__state~0))} assume !(16384 == ~s__state~0); {23104#(not (= 8497 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:34,714 INFO L290 TraceCheckUtils]: 16: Hoare triple {23104#(not (= 8497 ssl3_accept_~s__state~0))} assume !(8192 == ~s__state~0); {23104#(not (= 8497 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:34,715 INFO L290 TraceCheckUtils]: 17: Hoare triple {23104#(not (= 8497 ssl3_accept_~s__state~0))} assume !(24576 == ~s__state~0); {23104#(not (= 8497 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:34,715 INFO L290 TraceCheckUtils]: 18: Hoare triple {23104#(not (= 8497 ssl3_accept_~s__state~0))} assume !(8195 == ~s__state~0); {23104#(not (= 8497 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:34,715 INFO L290 TraceCheckUtils]: 19: Hoare triple {23104#(not (= 8497 ssl3_accept_~s__state~0))} assume !(8480 == ~s__state~0); {23104#(not (= 8497 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:34,715 INFO L290 TraceCheckUtils]: 20: Hoare triple {23104#(not (= 8497 ssl3_accept_~s__state~0))} assume !(8481 == ~s__state~0); {23104#(not (= 8497 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:34,715 INFO L290 TraceCheckUtils]: 21: Hoare triple {23104#(not (= 8497 ssl3_accept_~s__state~0))} assume !(8482 == ~s__state~0); {23104#(not (= 8497 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:34,716 INFO L290 TraceCheckUtils]: 22: Hoare triple {23104#(not (= 8497 ssl3_accept_~s__state~0))} assume !(8464 == ~s__state~0); {23104#(not (= 8497 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:34,716 INFO L290 TraceCheckUtils]: 23: Hoare triple {23104#(not (= 8497 ssl3_accept_~s__state~0))} assume !(8465 == ~s__state~0); {23104#(not (= 8497 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:34,716 INFO L290 TraceCheckUtils]: 24: Hoare triple {23104#(not (= 8497 ssl3_accept_~s__state~0))} assume !(8466 == ~s__state~0); {23104#(not (= 8497 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:34,716 INFO L290 TraceCheckUtils]: 25: Hoare triple {23104#(not (= 8497 ssl3_accept_~s__state~0))} assume !(8496 == ~s__state~0); {23104#(not (= 8497 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:34,717 INFO L290 TraceCheckUtils]: 26: Hoare triple {23104#(not (= 8497 ssl3_accept_~s__state~0))} assume 8497 == ~s__state~0; {23098#false} is VALID [2022-04-15 11:16:34,717 INFO L290 TraceCheckUtils]: 27: Hoare triple {23098#false} assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~ret~0 := #t~nondet37;havoc #t~nondet37; {23098#false} is VALID [2022-04-15 11:16:34,717 INFO L290 TraceCheckUtils]: 28: Hoare triple {23098#false} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {23098#false} is VALID [2022-04-15 11:16:34,717 INFO L290 TraceCheckUtils]: 29: Hoare triple {23098#false} assume !(~ret~0 <= 0); {23098#false} is VALID [2022-04-15 11:16:34,717 INFO L290 TraceCheckUtils]: 30: Hoare triple {23098#false} assume 0 != ~s__hit~0;~s__state~0 := 8656; {23098#false} is VALID [2022-04-15 11:16:34,717 INFO L290 TraceCheckUtils]: 31: Hoare triple {23098#false} ~s__init_num~0 := 0; {23098#false} is VALID [2022-04-15 11:16:34,717 INFO L290 TraceCheckUtils]: 32: Hoare triple {23098#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {23098#false} is VALID [2022-04-15 11:16:34,717 INFO L290 TraceCheckUtils]: 33: Hoare triple {23098#false} assume 0 == ~s__s3__tmp__reuse_message~0; {23098#false} is VALID [2022-04-15 11:16:34,717 INFO L290 TraceCheckUtils]: 34: Hoare triple {23098#false} assume 0 == ~skip~0; {23098#false} is VALID [2022-04-15 11:16:34,717 INFO L290 TraceCheckUtils]: 35: Hoare triple {23098#false} assume 8560 == ~state~0; {23098#false} is VALID [2022-04-15 11:16:34,717 INFO L290 TraceCheckUtils]: 36: Hoare triple {23098#false} assume 8448 == ~s__state~0; {23098#false} is VALID [2022-04-15 11:16:34,717 INFO L290 TraceCheckUtils]: 37: Hoare triple {23098#false} assume -1 != ~s__verify_mode~0; {23098#false} is VALID [2022-04-15 11:16:34,717 INFO L290 TraceCheckUtils]: 38: Hoare triple {23098#false} assume -2 != ~s__verify_mode~0; {23098#false} is VALID [2022-04-15 11:16:34,717 INFO L290 TraceCheckUtils]: 39: Hoare triple {23098#false} assume 9021 != ~__cil_tmp61~0 % 4294967296; {23098#false} is VALID [2022-04-15 11:16:34,718 INFO L290 TraceCheckUtils]: 40: Hoare triple {23098#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {23098#false} is VALID [2022-04-15 11:16:34,718 INFO L290 TraceCheckUtils]: 41: Hoare triple {23098#false} assume 4 != ~blastFlag~0; {23098#false} is VALID [2022-04-15 11:16:34,718 INFO L290 TraceCheckUtils]: 42: Hoare triple {23098#false} assume 1024 != ~tmp___7~0; {23098#false} is VALID [2022-04-15 11:16:34,718 INFO L290 TraceCheckUtils]: 43: Hoare triple {23098#false} assume !false; {23098#false} is VALID [2022-04-15 11:16:34,718 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-15 11:16:34,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:16:34,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679633832] [2022-04-15 11:16:34,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679633832] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:34,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:34,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:34,719 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:16:34,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1136257045] [2022-04-15 11:16:34,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1136257045] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:34,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:34,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:34,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955794970] [2022-04-15 11:16:34,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:16:34,722 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 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 44 [2022-04-15 11:16:34,723 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:16:34,723 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 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-15 11:16:34,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:34,743 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 11:16:34,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:34,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 11:16:34,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:16:34,744 INFO L87 Difference]: Start difference. First operand 292 states and 433 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 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-15 11:16:35,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:35,417 INFO L93 Difference]: Finished difference Result 575 states and 856 transitions. [2022-04-15 11:16:35,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 11:16:35,417 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 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 44 [2022-04-15 11:16:35,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:16:35,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 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-15 11:16:35,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 531 transitions. [2022-04-15 11:16:35,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 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-15 11:16:35,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 531 transitions. [2022-04-15 11:16:35,421 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 531 transitions. [2022-04-15 11:16:35,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 531 edges. 531 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:35,700 INFO L225 Difference]: With dead ends: 575 [2022-04-15 11:16:35,700 INFO L226 Difference]: Without dead ends: 297 [2022-04-15 11:16:35,703 INFO L912 BasicCegarLoop]: 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-15 11:16:35,704 INFO L913 BasicCegarLoop]: 189 mSDtfsCounter, 761 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:16:35,705 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [761 Valid, 206 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 11:16:35,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-04-15 11:16:35,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 293. [2022-04-15 11:16:35,763 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:16:35,764 INFO L82 GeneralOperation]: Start isEquivalent. First operand 297 states. Second operand has 293 states, 288 states have (on average 1.4895833333333333) internal successors, (429), 288 states have internal predecessors, (429), 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-15 11:16:35,764 INFO L74 IsIncluded]: Start isIncluded. First operand 297 states. Second operand has 293 states, 288 states have (on average 1.4895833333333333) internal successors, (429), 288 states have internal predecessors, (429), 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-15 11:16:35,764 INFO L87 Difference]: Start difference. First operand 297 states. Second operand has 293 states, 288 states have (on average 1.4895833333333333) internal successors, (429), 288 states have internal predecessors, (429), 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-15 11:16:35,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:35,768 INFO L93 Difference]: Finished difference Result 297 states and 439 transitions. [2022-04-15 11:16:35,768 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 439 transitions. [2022-04-15 11:16:35,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:35,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:35,769 INFO L74 IsIncluded]: Start isIncluded. First operand has 293 states, 288 states have (on average 1.4895833333333333) internal successors, (429), 288 states have internal predecessors, (429), 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 297 states. [2022-04-15 11:16:35,769 INFO L87 Difference]: Start difference. First operand has 293 states, 288 states have (on average 1.4895833333333333) internal successors, (429), 288 states have internal predecessors, (429), 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 297 states. [2022-04-15 11:16:35,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:35,772 INFO L93 Difference]: Finished difference Result 297 states and 439 transitions. [2022-04-15 11:16:35,772 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 439 transitions. [2022-04-15 11:16:35,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:35,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:35,773 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:16:35,773 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:16:35,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 288 states have (on average 1.4895833333333333) internal successors, (429), 288 states have internal predecessors, (429), 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-15 11:16:35,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 433 transitions. [2022-04-15 11:16:35,777 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 433 transitions. Word has length 44 [2022-04-15 11:16:35,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:16:35,778 INFO L478 AbstractCegarLoop]: Abstraction has 293 states and 433 transitions. [2022-04-15 11:16:35,778 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 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-15 11:16:35,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 293 states and 433 transitions. [2022-04-15 11:16:36,426 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 433 edges. 433 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:36,426 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 433 transitions. [2022-04-15 11:16:36,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 11:16:36,427 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:16:36,427 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:16:36,427 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 11:16:36,427 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:16:36,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:16:36,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1737605119, now seen corresponding path program 1 times [2022-04-15 11:16:36,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:36,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [814050137] [2022-04-15 11:16:36,428 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:16:36,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1737605119, now seen corresponding path program 2 times [2022-04-15 11:16:36,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:16:36,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695454805] [2022-04-15 11:16:36,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:16:36,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:16:36,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:36,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:16:36,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:36,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {25452#(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); {25444#true} is VALID [2022-04-15 11:16:36,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {25444#true} assume true; {25444#true} is VALID [2022-04-15 11:16:36,481 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25444#true} {25444#true} #752#return; {25444#true} is VALID [2022-04-15 11:16:36,481 INFO L272 TraceCheckUtils]: 0: Hoare triple {25444#true} call ULTIMATE.init(); {25452#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:16:36,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {25452#(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); {25444#true} is VALID [2022-04-15 11:16:36,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {25444#true} assume true; {25444#true} is VALID [2022-04-15 11:16:36,482 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25444#true} {25444#true} #752#return; {25444#true} is VALID [2022-04-15 11:16:36,482 INFO L272 TraceCheckUtils]: 4: Hoare triple {25444#true} call #t~ret59 := main(); {25444#true} is VALID [2022-04-15 11:16:36,482 INFO L290 TraceCheckUtils]: 5: Hoare triple {25444#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {25449#(<= main_~s~0 8464)} is VALID [2022-04-15 11:16:36,482 INFO L272 TraceCheckUtils]: 6: Hoare triple {25449#(<= main_~s~0 8464)} call #t~ret58 := ssl3_accept(~s~0); {25450#(not (= 8513 |ssl3_accept_#in~initial_state|))} is VALID [2022-04-15 11:16:36,483 INFO L290 TraceCheckUtils]: 7: Hoare triple {25450#(not (= 8513 |ssl3_accept_#in~initial_state|))} ~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;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;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~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {25451#(not (= 8513 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:36,484 INFO L290 TraceCheckUtils]: 8: Hoare triple {25451#(not (= 8513 ssl3_accept_~s__state~0))} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {25451#(not (= 8513 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:36,484 INFO L290 TraceCheckUtils]: 9: Hoare triple {25451#(not (= 8513 ssl3_accept_~s__state~0))} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {25451#(not (= 8513 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:36,484 INFO L290 TraceCheckUtils]: 10: Hoare triple {25451#(not (= 8513 ssl3_accept_~s__state~0))} assume !(0 != 12288 + ~tmp___1~0); {25451#(not (= 8513 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:36,484 INFO L290 TraceCheckUtils]: 11: Hoare triple {25451#(not (= 8513 ssl3_accept_~s__state~0))} assume !(0 == ~s__cert~0); {25451#(not (= 8513 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:36,485 INFO L290 TraceCheckUtils]: 12: Hoare triple {25451#(not (= 8513 ssl3_accept_~s__state~0))} assume !false; {25451#(not (= 8513 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:36,485 INFO L290 TraceCheckUtils]: 13: Hoare triple {25451#(not (= 8513 ssl3_accept_~s__state~0))} ~state~0 := ~s__state~0; {25451#(not (= 8513 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:36,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {25451#(not (= 8513 ssl3_accept_~s__state~0))} assume !(12292 == ~s__state~0); {25451#(not (= 8513 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:36,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {25451#(not (= 8513 ssl3_accept_~s__state~0))} assume !(16384 == ~s__state~0); {25451#(not (= 8513 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:36,486 INFO L290 TraceCheckUtils]: 16: Hoare triple {25451#(not (= 8513 ssl3_accept_~s__state~0))} assume !(8192 == ~s__state~0); {25451#(not (= 8513 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:36,486 INFO L290 TraceCheckUtils]: 17: Hoare triple {25451#(not (= 8513 ssl3_accept_~s__state~0))} assume !(24576 == ~s__state~0); {25451#(not (= 8513 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:36,486 INFO L290 TraceCheckUtils]: 18: Hoare triple {25451#(not (= 8513 ssl3_accept_~s__state~0))} assume !(8195 == ~s__state~0); {25451#(not (= 8513 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:36,486 INFO L290 TraceCheckUtils]: 19: Hoare triple {25451#(not (= 8513 ssl3_accept_~s__state~0))} assume !(8480 == ~s__state~0); {25451#(not (= 8513 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:36,486 INFO L290 TraceCheckUtils]: 20: Hoare triple {25451#(not (= 8513 ssl3_accept_~s__state~0))} assume !(8481 == ~s__state~0); {25451#(not (= 8513 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:36,487 INFO L290 TraceCheckUtils]: 21: Hoare triple {25451#(not (= 8513 ssl3_accept_~s__state~0))} assume !(8482 == ~s__state~0); {25451#(not (= 8513 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:36,487 INFO L290 TraceCheckUtils]: 22: Hoare triple {25451#(not (= 8513 ssl3_accept_~s__state~0))} assume !(8464 == ~s__state~0); {25451#(not (= 8513 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:36,487 INFO L290 TraceCheckUtils]: 23: Hoare triple {25451#(not (= 8513 ssl3_accept_~s__state~0))} assume !(8465 == ~s__state~0); {25451#(not (= 8513 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:36,487 INFO L290 TraceCheckUtils]: 24: Hoare triple {25451#(not (= 8513 ssl3_accept_~s__state~0))} assume !(8466 == ~s__state~0); {25451#(not (= 8513 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:36,488 INFO L290 TraceCheckUtils]: 25: Hoare triple {25451#(not (= 8513 ssl3_accept_~s__state~0))} assume !(8496 == ~s__state~0); {25451#(not (= 8513 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:36,488 INFO L290 TraceCheckUtils]: 26: Hoare triple {25451#(not (= 8513 ssl3_accept_~s__state~0))} assume !(8497 == ~s__state~0); {25451#(not (= 8513 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:36,488 INFO L290 TraceCheckUtils]: 27: Hoare triple {25451#(not (= 8513 ssl3_accept_~s__state~0))} assume !(8512 == ~s__state~0); {25451#(not (= 8513 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:36,488 INFO L290 TraceCheckUtils]: 28: Hoare triple {25451#(not (= 8513 ssl3_accept_~s__state~0))} assume 8513 == ~s__state~0; {25445#false} is VALID [2022-04-15 11:16:36,488 INFO L290 TraceCheckUtils]: 29: Hoare triple {25445#false} assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet38;havoc #t~nondet38;~__cil_tmp56~0 := ~s__s3__tmp__new_cipher__algorithms~0; {25445#false} is VALID [2022-04-15 11:16:36,488 INFO L290 TraceCheckUtils]: 30: Hoare triple {25445#false} assume 0 != (256 + ~__cil_tmp56~0) % 4294967296;~__cil_tmp56~0 := 256345;~skip~0 := 1; {25445#false} is VALID [2022-04-15 11:16:36,489 INFO L290 TraceCheckUtils]: 31: Hoare triple {25445#false} ~s__state~0 := 8528;~s__init_num~0 := 0; {25445#false} is VALID [2022-04-15 11:16:36,492 INFO L290 TraceCheckUtils]: 32: Hoare triple {25445#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {25445#false} is VALID [2022-04-15 11:16:36,493 INFO L290 TraceCheckUtils]: 33: Hoare triple {25445#false} assume 0 == ~s__s3__tmp__reuse_message~0; {25445#false} is VALID [2022-04-15 11:16:36,493 INFO L290 TraceCheckUtils]: 34: Hoare triple {25445#false} assume 0 == ~skip~0; {25445#false} is VALID [2022-04-15 11:16:36,493 INFO L290 TraceCheckUtils]: 35: Hoare triple {25445#false} assume 8560 == ~state~0; {25445#false} is VALID [2022-04-15 11:16:36,493 INFO L290 TraceCheckUtils]: 36: Hoare triple {25445#false} assume 8448 == ~s__state~0; {25445#false} is VALID [2022-04-15 11:16:36,493 INFO L290 TraceCheckUtils]: 37: Hoare triple {25445#false} assume -1 != ~s__verify_mode~0; {25445#false} is VALID [2022-04-15 11:16:36,493 INFO L290 TraceCheckUtils]: 38: Hoare triple {25445#false} assume -2 != ~s__verify_mode~0; {25445#false} is VALID [2022-04-15 11:16:36,493 INFO L290 TraceCheckUtils]: 39: Hoare triple {25445#false} assume 9021 != ~__cil_tmp61~0 % 4294967296; {25445#false} is VALID [2022-04-15 11:16:36,493 INFO L290 TraceCheckUtils]: 40: Hoare triple {25445#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {25445#false} is VALID [2022-04-15 11:16:36,493 INFO L290 TraceCheckUtils]: 41: Hoare triple {25445#false} assume 4 != ~blastFlag~0; {25445#false} is VALID [2022-04-15 11:16:36,493 INFO L290 TraceCheckUtils]: 42: Hoare triple {25445#false} assume 1024 != ~tmp___7~0; {25445#false} is VALID [2022-04-15 11:16:36,493 INFO L290 TraceCheckUtils]: 43: Hoare triple {25445#false} assume !false; {25445#false} is VALID [2022-04-15 11:16:36,493 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-15 11:16:36,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:16:36,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695454805] [2022-04-15 11:16:36,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695454805] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:36,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:36,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:36,494 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:16:36,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [814050137] [2022-04-15 11:16:36,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [814050137] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:36,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:36,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:36,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377359765] [2022-04-15 11:16:36,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:16:36,495 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 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 44 [2022-04-15 11:16:36,495 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:16:36,495 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 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-15 11:16:36,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:36,518 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 11:16:36,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:36,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 11:16:36,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:16:36,519 INFO L87 Difference]: Start difference. First operand 293 states and 433 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 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-15 11:16:37,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:37,168 INFO L93 Difference]: Finished difference Result 579 states and 859 transitions. [2022-04-15 11:16:37,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 11:16:37,168 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 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 44 [2022-04-15 11:16:37,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:16:37,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 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-15 11:16:37,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 535 transitions. [2022-04-15 11:16:37,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 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-15 11:16:37,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 535 transitions. [2022-04-15 11:16:37,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 535 transitions. [2022-04-15 11:16:37,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 535 edges. 535 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:37,522 INFO L225 Difference]: With dead ends: 579 [2022-04-15 11:16:37,522 INFO L226 Difference]: Without dead ends: 300 [2022-04-15 11:16:37,523 INFO L912 BasicCegarLoop]: 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-15 11:16:37,523 INFO L913 BasicCegarLoop]: 191 mSDtfsCounter, 763 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:16:37,523 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [763 Valid, 208 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 11:16:37,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-04-15 11:16:37,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 295. [2022-04-15 11:16:37,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:16:37,556 INFO L82 GeneralOperation]: Start isEquivalent. First operand 300 states. Second operand has 295 states, 290 states have (on average 1.4896551724137932) internal successors, (432), 290 states have internal predecessors, (432), 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-15 11:16:37,556 INFO L74 IsIncluded]: Start isIncluded. First operand 300 states. Second operand has 295 states, 290 states have (on average 1.4896551724137932) internal successors, (432), 290 states have internal predecessors, (432), 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-15 11:16:37,556 INFO L87 Difference]: Start difference. First operand 300 states. Second operand has 295 states, 290 states have (on average 1.4896551724137932) internal successors, (432), 290 states have internal predecessors, (432), 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-15 11:16:37,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:37,560 INFO L93 Difference]: Finished difference Result 300 states and 443 transitions. [2022-04-15 11:16:37,560 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 443 transitions. [2022-04-15 11:16:37,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:37,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:37,560 INFO L74 IsIncluded]: Start isIncluded. First operand has 295 states, 290 states have (on average 1.4896551724137932) internal successors, (432), 290 states have internal predecessors, (432), 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 300 states. [2022-04-15 11:16:37,561 INFO L87 Difference]: Start difference. First operand has 295 states, 290 states have (on average 1.4896551724137932) internal successors, (432), 290 states have internal predecessors, (432), 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 300 states. [2022-04-15 11:16:37,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:37,564 INFO L93 Difference]: Finished difference Result 300 states and 443 transitions. [2022-04-15 11:16:37,564 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 443 transitions. [2022-04-15 11:16:37,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:37,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:37,565 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:16:37,565 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:16:37,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 290 states have (on average 1.4896551724137932) internal successors, (432), 290 states have internal predecessors, (432), 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-15 11:16:37,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 436 transitions. [2022-04-15 11:16:37,569 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 436 transitions. Word has length 44 [2022-04-15 11:16:37,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:16:37,569 INFO L478 AbstractCegarLoop]: Abstraction has 295 states and 436 transitions. [2022-04-15 11:16:37,569 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 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-15 11:16:37,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 295 states and 436 transitions. [2022-04-15 11:16:38,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 436 edges. 436 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:38,164 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 436 transitions. [2022-04-15 11:16:38,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-15 11:16:38,165 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:16:38,165 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:16:38,165 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 11:16:38,165 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:16:38,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:16:38,165 INFO L85 PathProgramCache]: Analyzing trace with hash -970621315, now seen corresponding path program 1 times [2022-04-15 11:16:38,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:38,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [56182913] [2022-04-15 11:16:38,166 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:16:38,166 INFO L85 PathProgramCache]: Analyzing trace with hash -970621315, now seen corresponding path program 2 times [2022-04-15 11:16:38,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:16:38,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180966816] [2022-04-15 11:16:38,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:16:38,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:16:38,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:38,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:16:38,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:38,217 INFO L290 TraceCheckUtils]: 0: Hoare triple {27817#(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); {27809#true} is VALID [2022-04-15 11:16:38,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {27809#true} assume true; {27809#true} is VALID [2022-04-15 11:16:38,217 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27809#true} {27809#true} #752#return; {27809#true} is VALID [2022-04-15 11:16:38,218 INFO L272 TraceCheckUtils]: 0: Hoare triple {27809#true} call ULTIMATE.init(); {27817#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:16:38,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {27817#(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); {27809#true} is VALID [2022-04-15 11:16:38,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {27809#true} assume true; {27809#true} is VALID [2022-04-15 11:16:38,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27809#true} {27809#true} #752#return; {27809#true} is VALID [2022-04-15 11:16:38,218 INFO L272 TraceCheckUtils]: 4: Hoare triple {27809#true} call #t~ret59 := main(); {27809#true} is VALID [2022-04-15 11:16:38,218 INFO L290 TraceCheckUtils]: 5: Hoare triple {27809#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {27814#(<= main_~s~0 8464)} is VALID [2022-04-15 11:16:38,219 INFO L272 TraceCheckUtils]: 6: Hoare triple {27814#(<= main_~s~0 8464)} call #t~ret58 := ssl3_accept(~s~0); {27815#(not (= 8544 |ssl3_accept_#in~initial_state|))} is VALID [2022-04-15 11:16:38,220 INFO L290 TraceCheckUtils]: 7: Hoare triple {27815#(not (= 8544 |ssl3_accept_#in~initial_state|))} ~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;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;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~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {27816#(not (= ssl3_accept_~s__state~0 8544))} is VALID [2022-04-15 11:16:38,220 INFO L290 TraceCheckUtils]: 8: Hoare triple {27816#(not (= ssl3_accept_~s__state~0 8544))} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {27816#(not (= ssl3_accept_~s__state~0 8544))} is VALID [2022-04-15 11:16:38,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {27816#(not (= ssl3_accept_~s__state~0 8544))} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {27816#(not (= ssl3_accept_~s__state~0 8544))} is VALID [2022-04-15 11:16:38,221 INFO L290 TraceCheckUtils]: 10: Hoare triple {27816#(not (= ssl3_accept_~s__state~0 8544))} assume !(0 != 12288 + ~tmp___1~0); {27816#(not (= ssl3_accept_~s__state~0 8544))} is VALID [2022-04-15 11:16:38,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {27816#(not (= ssl3_accept_~s__state~0 8544))} assume !(0 == ~s__cert~0); {27816#(not (= ssl3_accept_~s__state~0 8544))} is VALID [2022-04-15 11:16:38,222 INFO L290 TraceCheckUtils]: 12: Hoare triple {27816#(not (= ssl3_accept_~s__state~0 8544))} assume !false; {27816#(not (= ssl3_accept_~s__state~0 8544))} is VALID [2022-04-15 11:16:38,222 INFO L290 TraceCheckUtils]: 13: Hoare triple {27816#(not (= ssl3_accept_~s__state~0 8544))} ~state~0 := ~s__state~0; {27816#(not (= ssl3_accept_~s__state~0 8544))} is VALID [2022-04-15 11:16:38,222 INFO L290 TraceCheckUtils]: 14: Hoare triple {27816#(not (= ssl3_accept_~s__state~0 8544))} assume !(12292 == ~s__state~0); {27816#(not (= ssl3_accept_~s__state~0 8544))} is VALID [2022-04-15 11:16:38,223 INFO L290 TraceCheckUtils]: 15: Hoare triple {27816#(not (= ssl3_accept_~s__state~0 8544))} assume !(16384 == ~s__state~0); {27816#(not (= ssl3_accept_~s__state~0 8544))} is VALID [2022-04-15 11:16:38,223 INFO L290 TraceCheckUtils]: 16: Hoare triple {27816#(not (= ssl3_accept_~s__state~0 8544))} assume !(8192 == ~s__state~0); {27816#(not (= ssl3_accept_~s__state~0 8544))} is VALID [2022-04-15 11:16:38,223 INFO L290 TraceCheckUtils]: 17: Hoare triple {27816#(not (= ssl3_accept_~s__state~0 8544))} assume !(24576 == ~s__state~0); {27816#(not (= ssl3_accept_~s__state~0 8544))} is VALID [2022-04-15 11:16:38,224 INFO L290 TraceCheckUtils]: 18: Hoare triple {27816#(not (= ssl3_accept_~s__state~0 8544))} assume !(8195 == ~s__state~0); {27816#(not (= ssl3_accept_~s__state~0 8544))} is VALID [2022-04-15 11:16:38,224 INFO L290 TraceCheckUtils]: 19: Hoare triple {27816#(not (= ssl3_accept_~s__state~0 8544))} assume !(8480 == ~s__state~0); {27816#(not (= ssl3_accept_~s__state~0 8544))} is VALID [2022-04-15 11:16:38,224 INFO L290 TraceCheckUtils]: 20: Hoare triple {27816#(not (= ssl3_accept_~s__state~0 8544))} assume !(8481 == ~s__state~0); {27816#(not (= ssl3_accept_~s__state~0 8544))} is VALID [2022-04-15 11:16:38,225 INFO L290 TraceCheckUtils]: 21: Hoare triple {27816#(not (= ssl3_accept_~s__state~0 8544))} assume !(8482 == ~s__state~0); {27816#(not (= ssl3_accept_~s__state~0 8544))} is VALID [2022-04-15 11:16:38,225 INFO L290 TraceCheckUtils]: 22: Hoare triple {27816#(not (= ssl3_accept_~s__state~0 8544))} assume !(8464 == ~s__state~0); {27816#(not (= ssl3_accept_~s__state~0 8544))} is VALID [2022-04-15 11:16:38,225 INFO L290 TraceCheckUtils]: 23: Hoare triple {27816#(not (= ssl3_accept_~s__state~0 8544))} assume !(8465 == ~s__state~0); {27816#(not (= ssl3_accept_~s__state~0 8544))} is VALID [2022-04-15 11:16:38,226 INFO L290 TraceCheckUtils]: 24: Hoare triple {27816#(not (= ssl3_accept_~s__state~0 8544))} assume !(8466 == ~s__state~0); {27816#(not (= ssl3_accept_~s__state~0 8544))} is VALID [2022-04-15 11:16:38,226 INFO L290 TraceCheckUtils]: 25: Hoare triple {27816#(not (= ssl3_accept_~s__state~0 8544))} assume !(8496 == ~s__state~0); {27816#(not (= ssl3_accept_~s__state~0 8544))} is VALID [2022-04-15 11:16:38,226 INFO L290 TraceCheckUtils]: 26: Hoare triple {27816#(not (= ssl3_accept_~s__state~0 8544))} assume !(8497 == ~s__state~0); {27816#(not (= ssl3_accept_~s__state~0 8544))} is VALID [2022-04-15 11:16:38,227 INFO L290 TraceCheckUtils]: 27: Hoare triple {27816#(not (= ssl3_accept_~s__state~0 8544))} assume !(8512 == ~s__state~0); {27816#(not (= ssl3_accept_~s__state~0 8544))} is VALID [2022-04-15 11:16:38,227 INFO L290 TraceCheckUtils]: 28: Hoare triple {27816#(not (= ssl3_accept_~s__state~0 8544))} assume !(8513 == ~s__state~0); {27816#(not (= ssl3_accept_~s__state~0 8544))} is VALID [2022-04-15 11:16:38,227 INFO L290 TraceCheckUtils]: 29: Hoare triple {27816#(not (= ssl3_accept_~s__state~0 8544))} assume !(8528 == ~s__state~0); {27816#(not (= ssl3_accept_~s__state~0 8544))} is VALID [2022-04-15 11:16:38,228 INFO L290 TraceCheckUtils]: 30: Hoare triple {27816#(not (= ssl3_accept_~s__state~0 8544))} assume !(8529 == ~s__state~0); {27816#(not (= ssl3_accept_~s__state~0 8544))} is VALID [2022-04-15 11:16:38,228 INFO L290 TraceCheckUtils]: 31: Hoare triple {27816#(not (= ssl3_accept_~s__state~0 8544))} assume 8544 == ~s__state~0; {27810#false} is VALID [2022-04-15 11:16:38,228 INFO L290 TraceCheckUtils]: 32: Hoare triple {27810#false} assume !(0 != 1 + ~s__verify_mode~0);~skip~0 := 1;~s__s3__tmp__cert_request~0 := 0;~s__state~0 := 8560; {27810#false} is VALID [2022-04-15 11:16:38,228 INFO L290 TraceCheckUtils]: 33: Hoare triple {27810#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {27810#false} is VALID [2022-04-15 11:16:38,228 INFO L290 TraceCheckUtils]: 34: Hoare triple {27810#false} assume 0 == ~s__s3__tmp__reuse_message~0; {27810#false} is VALID [2022-04-15 11:16:38,228 INFO L290 TraceCheckUtils]: 35: Hoare triple {27810#false} assume 0 == ~skip~0; {27810#false} is VALID [2022-04-15 11:16:38,228 INFO L290 TraceCheckUtils]: 36: Hoare triple {27810#false} assume 8560 == ~state~0; {27810#false} is VALID [2022-04-15 11:16:38,228 INFO L290 TraceCheckUtils]: 37: Hoare triple {27810#false} assume 8448 == ~s__state~0; {27810#false} is VALID [2022-04-15 11:16:38,228 INFO L290 TraceCheckUtils]: 38: Hoare triple {27810#false} assume -1 != ~s__verify_mode~0; {27810#false} is VALID [2022-04-15 11:16:38,228 INFO L290 TraceCheckUtils]: 39: Hoare triple {27810#false} assume -2 != ~s__verify_mode~0; {27810#false} is VALID [2022-04-15 11:16:38,229 INFO L290 TraceCheckUtils]: 40: Hoare triple {27810#false} assume 9021 != ~__cil_tmp61~0 % 4294967296; {27810#false} is VALID [2022-04-15 11:16:38,229 INFO L290 TraceCheckUtils]: 41: Hoare triple {27810#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {27810#false} is VALID [2022-04-15 11:16:38,229 INFO L290 TraceCheckUtils]: 42: Hoare triple {27810#false} assume 4 != ~blastFlag~0; {27810#false} is VALID [2022-04-15 11:16:38,229 INFO L290 TraceCheckUtils]: 43: Hoare triple {27810#false} assume 1024 != ~tmp___7~0; {27810#false} is VALID [2022-04-15 11:16:38,229 INFO L290 TraceCheckUtils]: 44: Hoare triple {27810#false} assume !false; {27810#false} is VALID [2022-04-15 11:16:38,229 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-15 11:16:38,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:16:38,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180966816] [2022-04-15 11:16:38,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180966816] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:38,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:38,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:38,230 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:16:38,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [56182913] [2022-04-15 11:16:38,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [56182913] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:38,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:38,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:38,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746947111] [2022-04-15 11:16:38,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:16:38,230 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 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 45 [2022-04-15 11:16:38,230 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:16:38,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 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-15 11:16:38,259 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:38,259 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 11:16:38,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:38,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 11:16:38,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:16:38,260 INFO L87 Difference]: Start difference. First operand 295 states and 436 transitions. Second operand has 6 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 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-15 11:16:39,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:39,079 INFO L93 Difference]: Finished difference Result 615 states and 910 transitions. [2022-04-15 11:16:39,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 11:16:39,081 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 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 45 [2022-04-15 11:16:39,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:16:39,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 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-15 11:16:39,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 548 transitions. [2022-04-15 11:16:39,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 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-15 11:16:39,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 548 transitions. [2022-04-15 11:16:39,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 548 transitions. [2022-04-15 11:16:39,338 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 548 edges. 548 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:39,343 INFO L225 Difference]: With dead ends: 615 [2022-04-15 11:16:39,343 INFO L226 Difference]: Without dead ends: 334 [2022-04-15 11:16:39,344 INFO L912 BasicCegarLoop]: 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-15 11:16:39,344 INFO L913 BasicCegarLoop]: 192 mSDtfsCounter, 785 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:16:39,344 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [785 Valid, 209 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 11:16:39,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2022-04-15 11:16:39,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 325. [2022-04-15 11:16:39,416 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:16:39,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 334 states. Second operand has 325 states, 320 states have (on average 1.475) internal successors, (472), 320 states have internal predecessors, (472), 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-15 11:16:39,416 INFO L74 IsIncluded]: Start isIncluded. First operand 334 states. Second operand has 325 states, 320 states have (on average 1.475) internal successors, (472), 320 states have internal predecessors, (472), 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-15 11:16:39,417 INFO L87 Difference]: Start difference. First operand 334 states. Second operand has 325 states, 320 states have (on average 1.475) internal successors, (472), 320 states have internal predecessors, (472), 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-15 11:16:39,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:39,421 INFO L93 Difference]: Finished difference Result 334 states and 491 transitions. [2022-04-15 11:16:39,421 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 491 transitions. [2022-04-15 11:16:39,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:39,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:39,422 INFO L74 IsIncluded]: Start isIncluded. First operand has 325 states, 320 states have (on average 1.475) internal successors, (472), 320 states have internal predecessors, (472), 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 334 states. [2022-04-15 11:16:39,423 INFO L87 Difference]: Start difference. First operand has 325 states, 320 states have (on average 1.475) internal successors, (472), 320 states have internal predecessors, (472), 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 334 states. [2022-04-15 11:16:39,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:39,427 INFO L93 Difference]: Finished difference Result 334 states and 491 transitions. [2022-04-15 11:16:39,427 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 491 transitions. [2022-04-15 11:16:39,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:39,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:39,427 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:16:39,427 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:16:39,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 320 states have (on average 1.475) internal successors, (472), 320 states have internal predecessors, (472), 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-15 11:16:39,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 476 transitions. [2022-04-15 11:16:39,432 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 476 transitions. Word has length 45 [2022-04-15 11:16:39,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:16:39,432 INFO L478 AbstractCegarLoop]: Abstraction has 325 states and 476 transitions. [2022-04-15 11:16:39,433 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 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-15 11:16:39,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 325 states and 476 transitions. [2022-04-15 11:16:40,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 476 edges. 476 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:40,101 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 476 transitions. [2022-04-15 11:16:40,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-15 11:16:40,102 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:16:40,102 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:16:40,102 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 11:16:40,102 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:16:40,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:16:40,102 INFO L85 PathProgramCache]: Analyzing trace with hash -957955839, now seen corresponding path program 1 times [2022-04-15 11:16:40,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:40,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [137447316] [2022-04-15 11:16:40,103 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:16:40,103 INFO L85 PathProgramCache]: Analyzing trace with hash -957955839, now seen corresponding path program 2 times [2022-04-15 11:16:40,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:16:40,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492451048] [2022-04-15 11:16:40,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:16:40,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:16:40,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:40,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:16:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:40,154 INFO L290 TraceCheckUtils]: 0: Hoare triple {30382#(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); {30374#true} is VALID [2022-04-15 11:16:40,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {30374#true} assume true; {30374#true} is VALID [2022-04-15 11:16:40,154 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30374#true} {30374#true} #752#return; {30374#true} is VALID [2022-04-15 11:16:40,155 INFO L272 TraceCheckUtils]: 0: Hoare triple {30374#true} call ULTIMATE.init(); {30382#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:16:40,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {30382#(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); {30374#true} is VALID [2022-04-15 11:16:40,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {30374#true} assume true; {30374#true} is VALID [2022-04-15 11:16:40,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30374#true} {30374#true} #752#return; {30374#true} is VALID [2022-04-15 11:16:40,155 INFO L272 TraceCheckUtils]: 4: Hoare triple {30374#true} call #t~ret59 := main(); {30374#true} is VALID [2022-04-15 11:16:40,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {30374#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {30379#(<= main_~s~0 8464)} is VALID [2022-04-15 11:16:40,156 INFO L272 TraceCheckUtils]: 6: Hoare triple {30379#(<= main_~s~0 8464)} call #t~ret58 := ssl3_accept(~s~0); {30380#(not (= 8545 |ssl3_accept_#in~initial_state|))} is VALID [2022-04-15 11:16:40,157 INFO L290 TraceCheckUtils]: 7: Hoare triple {30380#(not (= 8545 |ssl3_accept_#in~initial_state|))} ~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;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;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~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {30381#(not (= ssl3_accept_~s__state~0 8545))} is VALID [2022-04-15 11:16:40,158 INFO L290 TraceCheckUtils]: 8: Hoare triple {30381#(not (= ssl3_accept_~s__state~0 8545))} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {30381#(not (= ssl3_accept_~s__state~0 8545))} is VALID [2022-04-15 11:16:40,158 INFO L290 TraceCheckUtils]: 9: Hoare triple {30381#(not (= ssl3_accept_~s__state~0 8545))} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {30381#(not (= ssl3_accept_~s__state~0 8545))} is VALID [2022-04-15 11:16:40,158 INFO L290 TraceCheckUtils]: 10: Hoare triple {30381#(not (= ssl3_accept_~s__state~0 8545))} assume !(0 != 12288 + ~tmp___1~0); {30381#(not (= ssl3_accept_~s__state~0 8545))} is VALID [2022-04-15 11:16:40,159 INFO L290 TraceCheckUtils]: 11: Hoare triple {30381#(not (= ssl3_accept_~s__state~0 8545))} assume !(0 == ~s__cert~0); {30381#(not (= ssl3_accept_~s__state~0 8545))} is VALID [2022-04-15 11:16:40,159 INFO L290 TraceCheckUtils]: 12: Hoare triple {30381#(not (= ssl3_accept_~s__state~0 8545))} assume !false; {30381#(not (= ssl3_accept_~s__state~0 8545))} is VALID [2022-04-15 11:16:40,159 INFO L290 TraceCheckUtils]: 13: Hoare triple {30381#(not (= ssl3_accept_~s__state~0 8545))} ~state~0 := ~s__state~0; {30381#(not (= ssl3_accept_~s__state~0 8545))} is VALID [2022-04-15 11:16:40,159 INFO L290 TraceCheckUtils]: 14: Hoare triple {30381#(not (= ssl3_accept_~s__state~0 8545))} assume !(12292 == ~s__state~0); {30381#(not (= ssl3_accept_~s__state~0 8545))} is VALID [2022-04-15 11:16:40,160 INFO L290 TraceCheckUtils]: 15: Hoare triple {30381#(not (= ssl3_accept_~s__state~0 8545))} assume !(16384 == ~s__state~0); {30381#(not (= ssl3_accept_~s__state~0 8545))} is VALID [2022-04-15 11:16:40,160 INFO L290 TraceCheckUtils]: 16: Hoare triple {30381#(not (= ssl3_accept_~s__state~0 8545))} assume !(8192 == ~s__state~0); {30381#(not (= ssl3_accept_~s__state~0 8545))} is VALID [2022-04-15 11:16:40,160 INFO L290 TraceCheckUtils]: 17: Hoare triple {30381#(not (= ssl3_accept_~s__state~0 8545))} assume !(24576 == ~s__state~0); {30381#(not (= ssl3_accept_~s__state~0 8545))} is VALID [2022-04-15 11:16:40,161 INFO L290 TraceCheckUtils]: 18: Hoare triple {30381#(not (= ssl3_accept_~s__state~0 8545))} assume !(8195 == ~s__state~0); {30381#(not (= ssl3_accept_~s__state~0 8545))} is VALID [2022-04-15 11:16:40,161 INFO L290 TraceCheckUtils]: 19: Hoare triple {30381#(not (= ssl3_accept_~s__state~0 8545))} assume !(8480 == ~s__state~0); {30381#(not (= ssl3_accept_~s__state~0 8545))} is VALID [2022-04-15 11:16:40,161 INFO L290 TraceCheckUtils]: 20: Hoare triple {30381#(not (= ssl3_accept_~s__state~0 8545))} assume !(8481 == ~s__state~0); {30381#(not (= ssl3_accept_~s__state~0 8545))} is VALID [2022-04-15 11:16:40,162 INFO L290 TraceCheckUtils]: 21: Hoare triple {30381#(not (= ssl3_accept_~s__state~0 8545))} assume !(8482 == ~s__state~0); {30381#(not (= ssl3_accept_~s__state~0 8545))} is VALID [2022-04-15 11:16:40,162 INFO L290 TraceCheckUtils]: 22: Hoare triple {30381#(not (= ssl3_accept_~s__state~0 8545))} assume !(8464 == ~s__state~0); {30381#(not (= ssl3_accept_~s__state~0 8545))} is VALID [2022-04-15 11:16:40,162 INFO L290 TraceCheckUtils]: 23: Hoare triple {30381#(not (= ssl3_accept_~s__state~0 8545))} assume !(8465 == ~s__state~0); {30381#(not (= ssl3_accept_~s__state~0 8545))} is VALID [2022-04-15 11:16:40,162 INFO L290 TraceCheckUtils]: 24: Hoare triple {30381#(not (= ssl3_accept_~s__state~0 8545))} assume !(8466 == ~s__state~0); {30381#(not (= ssl3_accept_~s__state~0 8545))} is VALID [2022-04-15 11:16:40,163 INFO L290 TraceCheckUtils]: 25: Hoare triple {30381#(not (= ssl3_accept_~s__state~0 8545))} assume !(8496 == ~s__state~0); {30381#(not (= ssl3_accept_~s__state~0 8545))} is VALID [2022-04-15 11:16:40,163 INFO L290 TraceCheckUtils]: 26: Hoare triple {30381#(not (= ssl3_accept_~s__state~0 8545))} assume !(8497 == ~s__state~0); {30381#(not (= ssl3_accept_~s__state~0 8545))} is VALID [2022-04-15 11:16:40,163 INFO L290 TraceCheckUtils]: 27: Hoare triple {30381#(not (= ssl3_accept_~s__state~0 8545))} assume !(8512 == ~s__state~0); {30381#(not (= ssl3_accept_~s__state~0 8545))} is VALID [2022-04-15 11:16:40,164 INFO L290 TraceCheckUtils]: 28: Hoare triple {30381#(not (= ssl3_accept_~s__state~0 8545))} assume !(8513 == ~s__state~0); {30381#(not (= ssl3_accept_~s__state~0 8545))} is VALID [2022-04-15 11:16:40,164 INFO L290 TraceCheckUtils]: 29: Hoare triple {30381#(not (= ssl3_accept_~s__state~0 8545))} assume !(8528 == ~s__state~0); {30381#(not (= ssl3_accept_~s__state~0 8545))} is VALID [2022-04-15 11:16:40,164 INFO L290 TraceCheckUtils]: 30: Hoare triple {30381#(not (= ssl3_accept_~s__state~0 8545))} assume !(8529 == ~s__state~0); {30381#(not (= ssl3_accept_~s__state~0 8545))} is VALID [2022-04-15 11:16:40,165 INFO L290 TraceCheckUtils]: 31: Hoare triple {30381#(not (= ssl3_accept_~s__state~0 8545))} assume !(8544 == ~s__state~0); {30381#(not (= ssl3_accept_~s__state~0 8545))} is VALID [2022-04-15 11:16:40,165 INFO L290 TraceCheckUtils]: 32: Hoare triple {30381#(not (= ssl3_accept_~s__state~0 8545))} assume 8545 == ~s__state~0; {30375#false} is VALID [2022-04-15 11:16:40,165 INFO L290 TraceCheckUtils]: 33: Hoare triple {30375#false} assume !(0 != 1 + ~s__verify_mode~0);~skip~0 := 1;~s__s3__tmp__cert_request~0 := 0;~s__state~0 := 8560; {30375#false} is VALID [2022-04-15 11:16:40,165 INFO L290 TraceCheckUtils]: 34: Hoare triple {30375#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {30375#false} is VALID [2022-04-15 11:16:40,165 INFO L290 TraceCheckUtils]: 35: Hoare triple {30375#false} assume 0 == ~s__s3__tmp__reuse_message~0; {30375#false} is VALID [2022-04-15 11:16:40,165 INFO L290 TraceCheckUtils]: 36: Hoare triple {30375#false} assume 0 == ~skip~0; {30375#false} is VALID [2022-04-15 11:16:40,165 INFO L290 TraceCheckUtils]: 37: Hoare triple {30375#false} assume 8560 == ~state~0; {30375#false} is VALID [2022-04-15 11:16:40,165 INFO L290 TraceCheckUtils]: 38: Hoare triple {30375#false} assume 8448 == ~s__state~0; {30375#false} is VALID [2022-04-15 11:16:40,165 INFO L290 TraceCheckUtils]: 39: Hoare triple {30375#false} assume -1 != ~s__verify_mode~0; {30375#false} is VALID [2022-04-15 11:16:40,165 INFO L290 TraceCheckUtils]: 40: Hoare triple {30375#false} assume -2 != ~s__verify_mode~0; {30375#false} is VALID [2022-04-15 11:16:40,165 INFO L290 TraceCheckUtils]: 41: Hoare triple {30375#false} assume 9021 != ~__cil_tmp61~0 % 4294967296; {30375#false} is VALID [2022-04-15 11:16:40,166 INFO L290 TraceCheckUtils]: 42: Hoare triple {30375#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {30375#false} is VALID [2022-04-15 11:16:40,166 INFO L290 TraceCheckUtils]: 43: Hoare triple {30375#false} assume 4 != ~blastFlag~0; {30375#false} is VALID [2022-04-15 11:16:40,166 INFO L290 TraceCheckUtils]: 44: Hoare triple {30375#false} assume 1024 != ~tmp___7~0; {30375#false} is VALID [2022-04-15 11:16:40,166 INFO L290 TraceCheckUtils]: 45: Hoare triple {30375#false} assume !false; {30375#false} is VALID [2022-04-15 11:16:40,166 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-15 11:16:40,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:16:40,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492451048] [2022-04-15 11:16:40,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492451048] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:40,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:40,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:40,167 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:16:40,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [137447316] [2022-04-15 11:16:40,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [137447316] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:40,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:40,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:40,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694740402] [2022-04-15 11:16:40,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:16:40,167 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 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 46 [2022-04-15 11:16:40,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:16:40,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 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-15 11:16:40,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:40,218 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 11:16:40,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:40,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 11:16:40,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:16:40,219 INFO L87 Difference]: Start difference. First operand 325 states and 476 transitions. Second operand has 6 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 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-15 11:16:41,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:41,113 INFO L93 Difference]: Finished difference Result 649 states and 957 transitions. [2022-04-15 11:16:41,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 11:16:41,113 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 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 46 [2022-04-15 11:16:41,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:16:41,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 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-15 11:16:41,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 550 transitions. [2022-04-15 11:16:41,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 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-15 11:16:41,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 550 transitions. [2022-04-15 11:16:41,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 550 transitions. [2022-04-15 11:16:41,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 550 edges. 550 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:41,484 INFO L225 Difference]: With dead ends: 649 [2022-04-15 11:16:41,484 INFO L226 Difference]: Without dead ends: 338 [2022-04-15 11:16:41,485 INFO L912 BasicCegarLoop]: 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-15 11:16:41,485 INFO L913 BasicCegarLoop]: 192 mSDtfsCounter, 788 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:16:41,485 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [788 Valid, 209 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 11:16:41,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-04-15 11:16:41,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 329. [2022-04-15 11:16:41,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:16:41,526 INFO L82 GeneralOperation]: Start isEquivalent. First operand 338 states. Second operand has 329 states, 324 states have (on average 1.478395061728395) internal successors, (479), 324 states have internal predecessors, (479), 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-15 11:16:41,527 INFO L74 IsIncluded]: Start isIncluded. First operand 338 states. Second operand has 329 states, 324 states have (on average 1.478395061728395) internal successors, (479), 324 states have internal predecessors, (479), 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-15 11:16:41,527 INFO L87 Difference]: Start difference. First operand 338 states. Second operand has 329 states, 324 states have (on average 1.478395061728395) internal successors, (479), 324 states have internal predecessors, (479), 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-15 11:16:41,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:41,531 INFO L93 Difference]: Finished difference Result 338 states and 498 transitions. [2022-04-15 11:16:41,531 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 498 transitions. [2022-04-15 11:16:41,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:41,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:41,532 INFO L74 IsIncluded]: Start isIncluded. First operand has 329 states, 324 states have (on average 1.478395061728395) internal successors, (479), 324 states have internal predecessors, (479), 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 338 states. [2022-04-15 11:16:41,532 INFO L87 Difference]: Start difference. First operand has 329 states, 324 states have (on average 1.478395061728395) internal successors, (479), 324 states have internal predecessors, (479), 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 338 states. [2022-04-15 11:16:41,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:41,537 INFO L93 Difference]: Finished difference Result 338 states and 498 transitions. [2022-04-15 11:16:41,537 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 498 transitions. [2022-04-15 11:16:41,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:41,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:41,537 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:16:41,537 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:16:41,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 324 states have (on average 1.478395061728395) internal successors, (479), 324 states have internal predecessors, (479), 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-15 11:16:41,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 483 transitions. [2022-04-15 11:16:41,542 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 483 transitions. Word has length 46 [2022-04-15 11:16:41,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:16:41,542 INFO L478 AbstractCegarLoop]: Abstraction has 329 states and 483 transitions. [2022-04-15 11:16:41,542 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 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-15 11:16:41,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 329 states and 483 transitions. [2022-04-15 11:16:42,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 483 edges. 483 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:42,254 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 483 transitions. [2022-04-15 11:16:42,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-15 11:16:42,255 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:16:42,255 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:16:42,255 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-15 11:16:42,255 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:16:42,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:16:42,255 INFO L85 PathProgramCache]: Analyzing trace with hash 14351293, now seen corresponding path program 1 times [2022-04-15 11:16:42,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:42,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [368271292] [2022-04-15 11:16:42,256 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:16:42,256 INFO L85 PathProgramCache]: Analyzing trace with hash 14351293, now seen corresponding path program 2 times [2022-04-15 11:16:42,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:16:42,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355005578] [2022-04-15 11:16:42,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:16:42,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:16:42,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:42,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:16:42,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:42,308 INFO L290 TraceCheckUtils]: 0: Hoare triple {33031#(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); {33023#true} is VALID [2022-04-15 11:16:42,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {33023#true} assume true; {33023#true} is VALID [2022-04-15 11:16:42,309 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33023#true} {33023#true} #752#return; {33023#true} is VALID [2022-04-15 11:16:42,309 INFO L272 TraceCheckUtils]: 0: Hoare triple {33023#true} call ULTIMATE.init(); {33031#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:16:42,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {33031#(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); {33023#true} is VALID [2022-04-15 11:16:42,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {33023#true} assume true; {33023#true} is VALID [2022-04-15 11:16:42,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33023#true} {33023#true} #752#return; {33023#true} is VALID [2022-04-15 11:16:42,309 INFO L272 TraceCheckUtils]: 4: Hoare triple {33023#true} call #t~ret59 := main(); {33023#true} is VALID [2022-04-15 11:16:42,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {33023#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {33028#(<= main_~s~0 8464)} is VALID [2022-04-15 11:16:42,310 INFO L272 TraceCheckUtils]: 6: Hoare triple {33028#(<= main_~s~0 8464)} call #t~ret58 := ssl3_accept(~s~0); {33029#(not (= 8528 |ssl3_accept_#in~initial_state|))} is VALID [2022-04-15 11:16:42,312 INFO L290 TraceCheckUtils]: 7: Hoare triple {33029#(not (= 8528 |ssl3_accept_#in~initial_state|))} ~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;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;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~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {33030#(not (= ssl3_accept_~s__state~0 8528))} is VALID [2022-04-15 11:16:42,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {33030#(not (= ssl3_accept_~s__state~0 8528))} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {33030#(not (= ssl3_accept_~s__state~0 8528))} is VALID [2022-04-15 11:16:42,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {33030#(not (= ssl3_accept_~s__state~0 8528))} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {33030#(not (= ssl3_accept_~s__state~0 8528))} is VALID [2022-04-15 11:16:42,312 INFO L290 TraceCheckUtils]: 10: Hoare triple {33030#(not (= ssl3_accept_~s__state~0 8528))} assume !(0 != 12288 + ~tmp___1~0); {33030#(not (= ssl3_accept_~s__state~0 8528))} is VALID [2022-04-15 11:16:42,313 INFO L290 TraceCheckUtils]: 11: Hoare triple {33030#(not (= ssl3_accept_~s__state~0 8528))} assume !(0 == ~s__cert~0); {33030#(not (= ssl3_accept_~s__state~0 8528))} is VALID [2022-04-15 11:16:42,313 INFO L290 TraceCheckUtils]: 12: Hoare triple {33030#(not (= ssl3_accept_~s__state~0 8528))} assume !false; {33030#(not (= ssl3_accept_~s__state~0 8528))} is VALID [2022-04-15 11:16:42,313 INFO L290 TraceCheckUtils]: 13: Hoare triple {33030#(not (= ssl3_accept_~s__state~0 8528))} ~state~0 := ~s__state~0; {33030#(not (= ssl3_accept_~s__state~0 8528))} is VALID [2022-04-15 11:16:42,314 INFO L290 TraceCheckUtils]: 14: Hoare triple {33030#(not (= ssl3_accept_~s__state~0 8528))} assume !(12292 == ~s__state~0); {33030#(not (= ssl3_accept_~s__state~0 8528))} is VALID [2022-04-15 11:16:42,314 INFO L290 TraceCheckUtils]: 15: Hoare triple {33030#(not (= ssl3_accept_~s__state~0 8528))} assume !(16384 == ~s__state~0); {33030#(not (= ssl3_accept_~s__state~0 8528))} is VALID [2022-04-15 11:16:42,314 INFO L290 TraceCheckUtils]: 16: Hoare triple {33030#(not (= ssl3_accept_~s__state~0 8528))} assume !(8192 == ~s__state~0); {33030#(not (= ssl3_accept_~s__state~0 8528))} is VALID [2022-04-15 11:16:42,315 INFO L290 TraceCheckUtils]: 17: Hoare triple {33030#(not (= ssl3_accept_~s__state~0 8528))} assume !(24576 == ~s__state~0); {33030#(not (= ssl3_accept_~s__state~0 8528))} is VALID [2022-04-15 11:16:42,315 INFO L290 TraceCheckUtils]: 18: Hoare triple {33030#(not (= ssl3_accept_~s__state~0 8528))} assume !(8195 == ~s__state~0); {33030#(not (= ssl3_accept_~s__state~0 8528))} is VALID [2022-04-15 11:16:42,315 INFO L290 TraceCheckUtils]: 19: Hoare triple {33030#(not (= ssl3_accept_~s__state~0 8528))} assume !(8480 == ~s__state~0); {33030#(not (= ssl3_accept_~s__state~0 8528))} is VALID [2022-04-15 11:16:42,315 INFO L290 TraceCheckUtils]: 20: Hoare triple {33030#(not (= ssl3_accept_~s__state~0 8528))} assume !(8481 == ~s__state~0); {33030#(not (= ssl3_accept_~s__state~0 8528))} is VALID [2022-04-15 11:16:42,316 INFO L290 TraceCheckUtils]: 21: Hoare triple {33030#(not (= ssl3_accept_~s__state~0 8528))} assume !(8482 == ~s__state~0); {33030#(not (= ssl3_accept_~s__state~0 8528))} is VALID [2022-04-15 11:16:42,316 INFO L290 TraceCheckUtils]: 22: Hoare triple {33030#(not (= ssl3_accept_~s__state~0 8528))} assume !(8464 == ~s__state~0); {33030#(not (= ssl3_accept_~s__state~0 8528))} is VALID [2022-04-15 11:16:42,316 INFO L290 TraceCheckUtils]: 23: Hoare triple {33030#(not (= ssl3_accept_~s__state~0 8528))} assume !(8465 == ~s__state~0); {33030#(not (= ssl3_accept_~s__state~0 8528))} is VALID [2022-04-15 11:16:42,317 INFO L290 TraceCheckUtils]: 24: Hoare triple {33030#(not (= ssl3_accept_~s__state~0 8528))} assume !(8466 == ~s__state~0); {33030#(not (= ssl3_accept_~s__state~0 8528))} is VALID [2022-04-15 11:16:42,317 INFO L290 TraceCheckUtils]: 25: Hoare triple {33030#(not (= ssl3_accept_~s__state~0 8528))} assume !(8496 == ~s__state~0); {33030#(not (= ssl3_accept_~s__state~0 8528))} is VALID [2022-04-15 11:16:42,317 INFO L290 TraceCheckUtils]: 26: Hoare triple {33030#(not (= ssl3_accept_~s__state~0 8528))} assume !(8497 == ~s__state~0); {33030#(not (= ssl3_accept_~s__state~0 8528))} is VALID [2022-04-15 11:16:42,318 INFO L290 TraceCheckUtils]: 27: Hoare triple {33030#(not (= ssl3_accept_~s__state~0 8528))} assume !(8512 == ~s__state~0); {33030#(not (= ssl3_accept_~s__state~0 8528))} is VALID [2022-04-15 11:16:42,318 INFO L290 TraceCheckUtils]: 28: Hoare triple {33030#(not (= ssl3_accept_~s__state~0 8528))} assume !(8513 == ~s__state~0); {33030#(not (= ssl3_accept_~s__state~0 8528))} is VALID [2022-04-15 11:16:42,318 INFO L290 TraceCheckUtils]: 29: Hoare triple {33030#(not (= ssl3_accept_~s__state~0 8528))} assume 8528 == ~s__state~0; {33024#false} is VALID [2022-04-15 11:16:42,318 INFO L290 TraceCheckUtils]: 30: Hoare triple {33024#false} assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet40;havoc #t~nondet40;~l~0 := ~s__s3__tmp__new_cipher__algorithms~0;~__cil_tmp57~0 := ~s__options~0; {33024#false} is VALID [2022-04-15 11:16:42,318 INFO L290 TraceCheckUtils]: 31: Hoare triple {33024#false} assume !(0 != (2097152 + ~__cil_tmp57~0) % 4294967296);~s__s3__tmp__use_rsa_tmp~0 := 0; {33024#false} is VALID [2022-04-15 11:16:42,318 INFO L290 TraceCheckUtils]: 32: Hoare triple {33024#false} assume !(0 != ~s__s3__tmp__use_rsa_tmp~0); {33024#false} is VALID [2022-04-15 11:16:42,319 INFO L290 TraceCheckUtils]: 33: Hoare triple {33024#false} assume !(0 != (30 + ~l~0) % 4294967296); {33024#false} is VALID [2022-04-15 11:16:42,319 INFO L290 TraceCheckUtils]: 34: Hoare triple {33024#false} assume !(0 != (1 + ~l~0) % 4294967296);~skip~0 := 1; {33024#false} is VALID [2022-04-15 11:16:42,319 INFO L290 TraceCheckUtils]: 35: Hoare triple {33024#false} ~s__state~0 := 8544;~s__init_num~0 := 0; {33024#false} is VALID [2022-04-15 11:16:42,319 INFO L290 TraceCheckUtils]: 36: Hoare triple {33024#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {33024#false} is VALID [2022-04-15 11:16:42,319 INFO L290 TraceCheckUtils]: 37: Hoare triple {33024#false} assume 0 == ~s__s3__tmp__reuse_message~0; {33024#false} is VALID [2022-04-15 11:16:42,319 INFO L290 TraceCheckUtils]: 38: Hoare triple {33024#false} assume 0 == ~skip~0; {33024#false} is VALID [2022-04-15 11:16:42,319 INFO L290 TraceCheckUtils]: 39: Hoare triple {33024#false} assume 8560 == ~state~0; {33024#false} is VALID [2022-04-15 11:16:42,319 INFO L290 TraceCheckUtils]: 40: Hoare triple {33024#false} assume 8448 == ~s__state~0; {33024#false} is VALID [2022-04-15 11:16:42,319 INFO L290 TraceCheckUtils]: 41: Hoare triple {33024#false} assume -1 != ~s__verify_mode~0; {33024#false} is VALID [2022-04-15 11:16:42,319 INFO L290 TraceCheckUtils]: 42: Hoare triple {33024#false} assume -2 != ~s__verify_mode~0; {33024#false} is VALID [2022-04-15 11:16:42,319 INFO L290 TraceCheckUtils]: 43: Hoare triple {33024#false} assume 9021 != ~__cil_tmp61~0 % 4294967296; {33024#false} is VALID [2022-04-15 11:16:42,319 INFO L290 TraceCheckUtils]: 44: Hoare triple {33024#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {33024#false} is VALID [2022-04-15 11:16:42,319 INFO L290 TraceCheckUtils]: 45: Hoare triple {33024#false} assume 4 != ~blastFlag~0; {33024#false} is VALID [2022-04-15 11:16:42,320 INFO L290 TraceCheckUtils]: 46: Hoare triple {33024#false} assume 1024 != ~tmp___7~0; {33024#false} is VALID [2022-04-15 11:16:42,320 INFO L290 TraceCheckUtils]: 47: Hoare triple {33024#false} assume !false; {33024#false} is VALID [2022-04-15 11:16:42,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:16:42,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:16:42,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355005578] [2022-04-15 11:16:42,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355005578] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:42,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:42,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:42,320 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:16:42,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [368271292] [2022-04-15 11:16:42,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [368271292] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:42,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:42,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:42,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947260945] [2022-04-15 11:16:42,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:16:42,321 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 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 48 [2022-04-15 11:16:42,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:16:42,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 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-15 11:16:42,352 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-15 11:16:42,352 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 11:16:42,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:42,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 11:16:42,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:16:42,352 INFO L87 Difference]: Start difference. First operand 329 states and 483 transitions. Second operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 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-15 11:16:43,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:43,152 INFO L93 Difference]: Finished difference Result 686 states and 1008 transitions. [2022-04-15 11:16:43,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 11:16:43,153 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 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 48 [2022-04-15 11:16:43,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:16:43,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 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-15 11:16:43,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 552 transitions. [2022-04-15 11:16:43,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 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-15 11:16:43,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 552 transitions. [2022-04-15 11:16:43,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 552 transitions. [2022-04-15 11:16:43,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 552 edges. 552 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:43,466 INFO L225 Difference]: With dead ends: 686 [2022-04-15 11:16:43,467 INFO L226 Difference]: Without dead ends: 371 [2022-04-15 11:16:43,467 INFO L912 BasicCegarLoop]: 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-15 11:16:43,467 INFO L913 BasicCegarLoop]: 192 mSDtfsCounter, 795 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:16:43,468 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [795 Valid, 209 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 11:16:43,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2022-04-15 11:16:43,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 357. [2022-04-15 11:16:43,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:16:43,531 INFO L82 GeneralOperation]: Start isEquivalent. First operand 371 states. Second operand has 357 states, 352 states have (on average 1.4602272727272727) internal successors, (514), 352 states have internal predecessors, (514), 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-15 11:16:43,531 INFO L74 IsIncluded]: Start isIncluded. First operand 371 states. Second operand has 357 states, 352 states have (on average 1.4602272727272727) internal successors, (514), 352 states have internal predecessors, (514), 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-15 11:16:43,531 INFO L87 Difference]: Start difference. First operand 371 states. Second operand has 357 states, 352 states have (on average 1.4602272727272727) internal successors, (514), 352 states have internal predecessors, (514), 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-15 11:16:43,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:43,536 INFO L93 Difference]: Finished difference Result 371 states and 541 transitions. [2022-04-15 11:16:43,536 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 541 transitions. [2022-04-15 11:16:43,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:43,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:43,537 INFO L74 IsIncluded]: Start isIncluded. First operand has 357 states, 352 states have (on average 1.4602272727272727) internal successors, (514), 352 states have internal predecessors, (514), 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 371 states. [2022-04-15 11:16:43,537 INFO L87 Difference]: Start difference. First operand has 357 states, 352 states have (on average 1.4602272727272727) internal successors, (514), 352 states have internal predecessors, (514), 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 371 states. [2022-04-15 11:16:43,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:43,542 INFO L93 Difference]: Finished difference Result 371 states and 541 transitions. [2022-04-15 11:16:43,542 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 541 transitions. [2022-04-15 11:16:43,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:43,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:43,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:16:43,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:16:43,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 352 states have (on average 1.4602272727272727) internal successors, (514), 352 states have internal predecessors, (514), 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-15 11:16:43,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 518 transitions. [2022-04-15 11:16:43,548 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 518 transitions. Word has length 48 [2022-04-15 11:16:43,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:16:43,548 INFO L478 AbstractCegarLoop]: Abstraction has 357 states and 518 transitions. [2022-04-15 11:16:43,548 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 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-15 11:16:43,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 357 states and 518 transitions. [2022-04-15 11:16:44,324 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-15 11:16:44,324 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 518 transitions. [2022-04-15 11:16:44,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-15 11:16:44,324 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:16:44,325 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:16:44,325 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-15 11:16:44,325 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:16:44,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:16:44,325 INFO L85 PathProgramCache]: Analyzing trace with hash -447006304, now seen corresponding path program 1 times [2022-04-15 11:16:44,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:44,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1840814824] [2022-04-15 11:16:44,325 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:16:44,325 INFO L85 PathProgramCache]: Analyzing trace with hash -447006304, now seen corresponding path program 2 times [2022-04-15 11:16:44,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:16:44,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258992613] [2022-04-15 11:16:44,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:16:44,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:16:44,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:44,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:16:44,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:44,401 INFO L290 TraceCheckUtils]: 0: Hoare triple {35876#(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); {35868#true} is VALID [2022-04-15 11:16:44,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {35868#true} assume true; {35868#true} is VALID [2022-04-15 11:16:44,401 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35868#true} {35868#true} #752#return; {35868#true} is VALID [2022-04-15 11:16:44,401 INFO L272 TraceCheckUtils]: 0: Hoare triple {35868#true} call ULTIMATE.init(); {35876#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:16:44,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {35876#(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); {35868#true} is VALID [2022-04-15 11:16:44,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {35868#true} assume true; {35868#true} is VALID [2022-04-15 11:16:44,402 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35868#true} {35868#true} #752#return; {35868#true} is VALID [2022-04-15 11:16:44,402 INFO L272 TraceCheckUtils]: 4: Hoare triple {35868#true} call #t~ret59 := main(); {35868#true} is VALID [2022-04-15 11:16:44,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {35868#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {35873#(<= main_~s~0 8464)} is VALID [2022-04-15 11:16:44,402 INFO L272 TraceCheckUtils]: 6: Hoare triple {35873#(<= main_~s~0 8464)} call #t~ret58 := ssl3_accept(~s~0); {35874#(not (= 8560 |ssl3_accept_#in~initial_state|))} is VALID [2022-04-15 11:16:44,404 INFO L290 TraceCheckUtils]: 7: Hoare triple {35874#(not (= 8560 |ssl3_accept_#in~initial_state|))} ~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;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;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~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:44,404 INFO L290 TraceCheckUtils]: 8: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:44,404 INFO L290 TraceCheckUtils]: 9: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:44,404 INFO L290 TraceCheckUtils]: 10: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} assume !(0 != 12288 + ~tmp___1~0); {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:44,405 INFO L290 TraceCheckUtils]: 11: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} assume !(0 == ~s__cert~0); {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:44,405 INFO L290 TraceCheckUtils]: 12: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} assume !false; {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:44,407 INFO L290 TraceCheckUtils]: 13: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} ~state~0 := ~s__state~0; {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:44,407 INFO L290 TraceCheckUtils]: 14: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} assume !(12292 == ~s__state~0); {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:44,408 INFO L290 TraceCheckUtils]: 15: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} assume !(16384 == ~s__state~0); {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:44,408 INFO L290 TraceCheckUtils]: 16: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} assume !(8192 == ~s__state~0); {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:44,408 INFO L290 TraceCheckUtils]: 17: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} assume !(24576 == ~s__state~0); {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:44,408 INFO L290 TraceCheckUtils]: 18: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} assume !(8195 == ~s__state~0); {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:44,409 INFO L290 TraceCheckUtils]: 19: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} assume !(8480 == ~s__state~0); {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:44,409 INFO L290 TraceCheckUtils]: 20: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} assume !(8481 == ~s__state~0); {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:44,409 INFO L290 TraceCheckUtils]: 21: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} assume !(8482 == ~s__state~0); {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:44,409 INFO L290 TraceCheckUtils]: 22: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} assume !(8464 == ~s__state~0); {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:44,410 INFO L290 TraceCheckUtils]: 23: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} assume !(8465 == ~s__state~0); {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:44,410 INFO L290 TraceCheckUtils]: 24: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} assume !(8466 == ~s__state~0); {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:44,410 INFO L290 TraceCheckUtils]: 25: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} assume !(8496 == ~s__state~0); {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:44,410 INFO L290 TraceCheckUtils]: 26: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} assume !(8497 == ~s__state~0); {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:44,411 INFO L290 TraceCheckUtils]: 27: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} assume !(8512 == ~s__state~0); {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:44,411 INFO L290 TraceCheckUtils]: 28: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} assume !(8513 == ~s__state~0); {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:44,411 INFO L290 TraceCheckUtils]: 29: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} assume !(8528 == ~s__state~0); {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:44,411 INFO L290 TraceCheckUtils]: 30: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} assume !(8529 == ~s__state~0); {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:44,412 INFO L290 TraceCheckUtils]: 31: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} assume !(8544 == ~s__state~0); {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:44,416 INFO L290 TraceCheckUtils]: 32: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} assume !(8545 == ~s__state~0); {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:44,416 INFO L290 TraceCheckUtils]: 33: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} assume 8560 == ~s__state~0; {35869#false} is VALID [2022-04-15 11:16:44,416 INFO L290 TraceCheckUtils]: 34: Hoare triple {35869#false} assume -2147483648 <= #t~nondet46 && #t~nondet46 <= 2147483647;~ret~0 := #t~nondet46;havoc #t~nondet46; {35869#false} is VALID [2022-04-15 11:16:44,416 INFO L290 TraceCheckUtils]: 35: Hoare triple {35869#false} assume !(~ret~0 <= 0);~s__s3__tmp__next_state___0~0 := 8576;~s__state~0 := 8448;~s__init_num~0 := 0; {35869#false} is VALID [2022-04-15 11:16:44,416 INFO L290 TraceCheckUtils]: 36: Hoare triple {35869#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {35869#false} is VALID [2022-04-15 11:16:44,416 INFO L290 TraceCheckUtils]: 37: Hoare triple {35869#false} assume 0 == ~s__s3__tmp__reuse_message~0; {35869#false} is VALID [2022-04-15 11:16:44,416 INFO L290 TraceCheckUtils]: 38: Hoare triple {35869#false} assume 0 == ~skip~0; {35869#false} is VALID [2022-04-15 11:16:44,416 INFO L290 TraceCheckUtils]: 39: Hoare triple {35869#false} assume 8560 == ~state~0; {35869#false} is VALID [2022-04-15 11:16:44,417 INFO L290 TraceCheckUtils]: 40: Hoare triple {35869#false} assume 8448 == ~s__state~0; {35869#false} is VALID [2022-04-15 11:16:44,417 INFO L290 TraceCheckUtils]: 41: Hoare triple {35869#false} assume -1 != ~s__verify_mode~0; {35869#false} is VALID [2022-04-15 11:16:44,417 INFO L290 TraceCheckUtils]: 42: Hoare triple {35869#false} assume -2 != ~s__verify_mode~0; {35869#false} is VALID [2022-04-15 11:16:44,417 INFO L290 TraceCheckUtils]: 43: Hoare triple {35869#false} assume 9021 != ~__cil_tmp61~0 % 4294967296; {35869#false} is VALID [2022-04-15 11:16:44,417 INFO L290 TraceCheckUtils]: 44: Hoare triple {35869#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {35869#false} is VALID [2022-04-15 11:16:44,417 INFO L290 TraceCheckUtils]: 45: Hoare triple {35869#false} assume 4 != ~blastFlag~0; {35869#false} is VALID [2022-04-15 11:16:44,417 INFO L290 TraceCheckUtils]: 46: Hoare triple {35869#false} assume 1024 != ~tmp___7~0; {35869#false} is VALID [2022-04-15 11:16:44,417 INFO L290 TraceCheckUtils]: 47: Hoare triple {35869#false} assume !false; {35869#false} is VALID [2022-04-15 11:16:44,417 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-15 11:16:44,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:16:44,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258992613] [2022-04-15 11:16:44,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258992613] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:44,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:44,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:44,419 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:16:44,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1840814824] [2022-04-15 11:16:44,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1840814824] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:44,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:44,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:44,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080953311] [2022-04-15 11:16:44,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:16:44,420 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 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 48 [2022-04-15 11:16:44,420 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:16:44,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 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-15 11:16:44,448 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-15 11:16:44,448 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 11:16:44,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:44,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 11:16:44,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:16:44,449 INFO L87 Difference]: Start difference. First operand 357 states and 518 transitions. Second operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 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-15 11:16:45,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:45,156 INFO L93 Difference]: Finished difference Result 734 states and 1062 transitions. [2022-04-15 11:16:45,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 11:16:45,156 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 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 48 [2022-04-15 11:16:45,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:16:45,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 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-15 11:16:45,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 538 transitions. [2022-04-15 11:16:45,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 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-15 11:16:45,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 538 transitions. [2022-04-15 11:16:45,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 538 transitions. [2022-04-15 11:16:45,395 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-15 11:16:45,401 INFO L225 Difference]: With dead ends: 734 [2022-04-15 11:16:45,402 INFO L226 Difference]: Without dead ends: 391 [2022-04-15 11:16:45,402 INFO L912 BasicCegarLoop]: 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-15 11:16:45,403 INFO L913 BasicCegarLoop]: 194 mSDtfsCounter, 759 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:16:45,403 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [759 Valid, 211 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 11:16:45,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2022-04-15 11:16:45,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 389. [2022-04-15 11:16:45,463 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:16:45,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 391 states. Second operand has 389 states, 384 states have (on average 1.4453125) internal successors, (555), 384 states have internal predecessors, (555), 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-15 11:16:45,464 INFO L74 IsIncluded]: Start isIncluded. First operand 391 states. Second operand has 389 states, 384 states have (on average 1.4453125) internal successors, (555), 384 states have internal predecessors, (555), 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-15 11:16:45,465 INFO L87 Difference]: Start difference. First operand 391 states. Second operand has 389 states, 384 states have (on average 1.4453125) internal successors, (555), 384 states have internal predecessors, (555), 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-15 11:16:45,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:45,470 INFO L93 Difference]: Finished difference Result 391 states and 561 transitions. [2022-04-15 11:16:45,470 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 561 transitions. [2022-04-15 11:16:45,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:45,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:45,471 INFO L74 IsIncluded]: Start isIncluded. First operand has 389 states, 384 states have (on average 1.4453125) internal successors, (555), 384 states have internal predecessors, (555), 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 391 states. [2022-04-15 11:16:45,471 INFO L87 Difference]: Start difference. First operand has 389 states, 384 states have (on average 1.4453125) internal successors, (555), 384 states have internal predecessors, (555), 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 391 states. [2022-04-15 11:16:45,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:45,478 INFO L93 Difference]: Finished difference Result 391 states and 561 transitions. [2022-04-15 11:16:45,479 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 561 transitions. [2022-04-15 11:16:45,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:45,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:45,479 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:16:45,479 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:16:45,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 384 states have (on average 1.4453125) internal successors, (555), 384 states have internal predecessors, (555), 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-15 11:16:45,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 559 transitions. [2022-04-15 11:16:45,486 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 559 transitions. Word has length 48 [2022-04-15 11:16:45,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:16:45,486 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 559 transitions. [2022-04-15 11:16:45,486 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 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-15 11:16:45,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 389 states and 559 transitions. [2022-04-15 11:16:46,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 559 edges. 559 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:46,349 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 559 transitions. [2022-04-15 11:16:46,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 11:16:46,349 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:16:46,350 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:16:46,350 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-15 11:16:46,350 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:16:46,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:16:46,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1888205337, now seen corresponding path program 1 times [2022-04-15 11:16:46,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:46,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [748116034] [2022-04-15 11:16:46,351 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:16:46,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1888205337, now seen corresponding path program 2 times [2022-04-15 11:16:46,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:16:46,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356113287] [2022-04-15 11:16:46,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:16:46,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:16:46,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:46,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:16:46,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:46,401 INFO L290 TraceCheckUtils]: 0: Hoare triple {38921#(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); {38913#true} is VALID [2022-04-15 11:16:46,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {38913#true} assume true; {38913#true} is VALID [2022-04-15 11:16:46,401 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38913#true} {38913#true} #752#return; {38913#true} is VALID [2022-04-15 11:16:46,402 INFO L272 TraceCheckUtils]: 0: Hoare triple {38913#true} call ULTIMATE.init(); {38921#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:16:46,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {38921#(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); {38913#true} is VALID [2022-04-15 11:16:46,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {38913#true} assume true; {38913#true} is VALID [2022-04-15 11:16:46,402 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38913#true} {38913#true} #752#return; {38913#true} is VALID [2022-04-15 11:16:46,402 INFO L272 TraceCheckUtils]: 4: Hoare triple {38913#true} call #t~ret59 := main(); {38913#true} is VALID [2022-04-15 11:16:46,403 INFO L290 TraceCheckUtils]: 5: Hoare triple {38913#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {38918#(<= main_~s~0 8464)} is VALID [2022-04-15 11:16:46,403 INFO L272 TraceCheckUtils]: 6: Hoare triple {38918#(<= main_~s~0 8464)} call #t~ret58 := ssl3_accept(~s~0); {38919#(not (= 8529 |ssl3_accept_#in~initial_state|))} is VALID [2022-04-15 11:16:46,404 INFO L290 TraceCheckUtils]: 7: Hoare triple {38919#(not (= 8529 |ssl3_accept_#in~initial_state|))} ~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;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;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~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {38920#(not (= ssl3_accept_~s__state~0 8529))} is VALID [2022-04-15 11:16:46,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {38920#(not (= ssl3_accept_~s__state~0 8529))} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {38920#(not (= ssl3_accept_~s__state~0 8529))} is VALID [2022-04-15 11:16:46,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {38920#(not (= ssl3_accept_~s__state~0 8529))} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {38920#(not (= ssl3_accept_~s__state~0 8529))} is VALID [2022-04-15 11:16:46,405 INFO L290 TraceCheckUtils]: 10: Hoare triple {38920#(not (= ssl3_accept_~s__state~0 8529))} assume !(0 != 12288 + ~tmp___1~0); {38920#(not (= ssl3_accept_~s__state~0 8529))} is VALID [2022-04-15 11:16:46,406 INFO L290 TraceCheckUtils]: 11: Hoare triple {38920#(not (= ssl3_accept_~s__state~0 8529))} assume !(0 == ~s__cert~0); {38920#(not (= ssl3_accept_~s__state~0 8529))} is VALID [2022-04-15 11:16:46,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {38920#(not (= ssl3_accept_~s__state~0 8529))} assume !false; {38920#(not (= ssl3_accept_~s__state~0 8529))} is VALID [2022-04-15 11:16:46,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {38920#(not (= ssl3_accept_~s__state~0 8529))} ~state~0 := ~s__state~0; {38920#(not (= ssl3_accept_~s__state~0 8529))} is VALID [2022-04-15 11:16:46,407 INFO L290 TraceCheckUtils]: 14: Hoare triple {38920#(not (= ssl3_accept_~s__state~0 8529))} assume !(12292 == ~s__state~0); {38920#(not (= ssl3_accept_~s__state~0 8529))} is VALID [2022-04-15 11:16:46,407 INFO L290 TraceCheckUtils]: 15: Hoare triple {38920#(not (= ssl3_accept_~s__state~0 8529))} assume !(16384 == ~s__state~0); {38920#(not (= ssl3_accept_~s__state~0 8529))} is VALID [2022-04-15 11:16:46,407 INFO L290 TraceCheckUtils]: 16: Hoare triple {38920#(not (= ssl3_accept_~s__state~0 8529))} assume !(8192 == ~s__state~0); {38920#(not (= ssl3_accept_~s__state~0 8529))} is VALID [2022-04-15 11:16:46,408 INFO L290 TraceCheckUtils]: 17: Hoare triple {38920#(not (= ssl3_accept_~s__state~0 8529))} assume !(24576 == ~s__state~0); {38920#(not (= ssl3_accept_~s__state~0 8529))} is VALID [2022-04-15 11:16:46,408 INFO L290 TraceCheckUtils]: 18: Hoare triple {38920#(not (= ssl3_accept_~s__state~0 8529))} assume !(8195 == ~s__state~0); {38920#(not (= ssl3_accept_~s__state~0 8529))} is VALID [2022-04-15 11:16:46,408 INFO L290 TraceCheckUtils]: 19: Hoare triple {38920#(not (= ssl3_accept_~s__state~0 8529))} assume !(8480 == ~s__state~0); {38920#(not (= ssl3_accept_~s__state~0 8529))} is VALID [2022-04-15 11:16:46,409 INFO L290 TraceCheckUtils]: 20: Hoare triple {38920#(not (= ssl3_accept_~s__state~0 8529))} assume !(8481 == ~s__state~0); {38920#(not (= ssl3_accept_~s__state~0 8529))} is VALID [2022-04-15 11:16:46,409 INFO L290 TraceCheckUtils]: 21: Hoare triple {38920#(not (= ssl3_accept_~s__state~0 8529))} assume !(8482 == ~s__state~0); {38920#(not (= ssl3_accept_~s__state~0 8529))} is VALID [2022-04-15 11:16:46,409 INFO L290 TraceCheckUtils]: 22: Hoare triple {38920#(not (= ssl3_accept_~s__state~0 8529))} assume !(8464 == ~s__state~0); {38920#(not (= ssl3_accept_~s__state~0 8529))} is VALID [2022-04-15 11:16:46,409 INFO L290 TraceCheckUtils]: 23: Hoare triple {38920#(not (= ssl3_accept_~s__state~0 8529))} assume !(8465 == ~s__state~0); {38920#(not (= ssl3_accept_~s__state~0 8529))} is VALID [2022-04-15 11:16:46,410 INFO L290 TraceCheckUtils]: 24: Hoare triple {38920#(not (= ssl3_accept_~s__state~0 8529))} assume !(8466 == ~s__state~0); {38920#(not (= ssl3_accept_~s__state~0 8529))} is VALID [2022-04-15 11:16:46,410 INFO L290 TraceCheckUtils]: 25: Hoare triple {38920#(not (= ssl3_accept_~s__state~0 8529))} assume !(8496 == ~s__state~0); {38920#(not (= ssl3_accept_~s__state~0 8529))} is VALID [2022-04-15 11:16:46,410 INFO L290 TraceCheckUtils]: 26: Hoare triple {38920#(not (= ssl3_accept_~s__state~0 8529))} assume !(8497 == ~s__state~0); {38920#(not (= ssl3_accept_~s__state~0 8529))} is VALID [2022-04-15 11:16:46,411 INFO L290 TraceCheckUtils]: 27: Hoare triple {38920#(not (= ssl3_accept_~s__state~0 8529))} assume !(8512 == ~s__state~0); {38920#(not (= ssl3_accept_~s__state~0 8529))} is VALID [2022-04-15 11:16:46,411 INFO L290 TraceCheckUtils]: 28: Hoare triple {38920#(not (= ssl3_accept_~s__state~0 8529))} assume !(8513 == ~s__state~0); {38920#(not (= ssl3_accept_~s__state~0 8529))} is VALID [2022-04-15 11:16:46,411 INFO L290 TraceCheckUtils]: 29: Hoare triple {38920#(not (= ssl3_accept_~s__state~0 8529))} assume !(8528 == ~s__state~0); {38920#(not (= ssl3_accept_~s__state~0 8529))} is VALID [2022-04-15 11:16:46,411 INFO L290 TraceCheckUtils]: 30: Hoare triple {38920#(not (= ssl3_accept_~s__state~0 8529))} assume 8529 == ~s__state~0; {38914#false} is VALID [2022-04-15 11:16:46,412 INFO L290 TraceCheckUtils]: 31: Hoare triple {38914#false} assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet40;havoc #t~nondet40;~l~0 := ~s__s3__tmp__new_cipher__algorithms~0;~__cil_tmp57~0 := ~s__options~0; {38914#false} is VALID [2022-04-15 11:16:46,412 INFO L290 TraceCheckUtils]: 32: Hoare triple {38914#false} assume !(0 != (2097152 + ~__cil_tmp57~0) % 4294967296);~s__s3__tmp__use_rsa_tmp~0 := 0; {38914#false} is VALID [2022-04-15 11:16:46,412 INFO L290 TraceCheckUtils]: 33: Hoare triple {38914#false} assume !(0 != ~s__s3__tmp__use_rsa_tmp~0); {38914#false} is VALID [2022-04-15 11:16:46,412 INFO L290 TraceCheckUtils]: 34: Hoare triple {38914#false} assume !(0 != (30 + ~l~0) % 4294967296); {38914#false} is VALID [2022-04-15 11:16:46,412 INFO L290 TraceCheckUtils]: 35: Hoare triple {38914#false} assume !(0 != (1 + ~l~0) % 4294967296);~skip~0 := 1; {38914#false} is VALID [2022-04-15 11:16:46,412 INFO L290 TraceCheckUtils]: 36: Hoare triple {38914#false} ~s__state~0 := 8544;~s__init_num~0 := 0; {38914#false} is VALID [2022-04-15 11:16:46,412 INFO L290 TraceCheckUtils]: 37: Hoare triple {38914#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {38914#false} is VALID [2022-04-15 11:16:46,412 INFO L290 TraceCheckUtils]: 38: Hoare triple {38914#false} assume 0 == ~s__s3__tmp__reuse_message~0; {38914#false} is VALID [2022-04-15 11:16:46,412 INFO L290 TraceCheckUtils]: 39: Hoare triple {38914#false} assume 0 == ~skip~0; {38914#false} is VALID [2022-04-15 11:16:46,412 INFO L290 TraceCheckUtils]: 40: Hoare triple {38914#false} assume 8560 == ~state~0; {38914#false} is VALID [2022-04-15 11:16:46,412 INFO L290 TraceCheckUtils]: 41: Hoare triple {38914#false} assume 8448 == ~s__state~0; {38914#false} is VALID [2022-04-15 11:16:46,412 INFO L290 TraceCheckUtils]: 42: Hoare triple {38914#false} assume -1 != ~s__verify_mode~0; {38914#false} is VALID [2022-04-15 11:16:46,412 INFO L290 TraceCheckUtils]: 43: Hoare triple {38914#false} assume -2 != ~s__verify_mode~0; {38914#false} is VALID [2022-04-15 11:16:46,413 INFO L290 TraceCheckUtils]: 44: Hoare triple {38914#false} assume 9021 != ~__cil_tmp61~0 % 4294967296; {38914#false} is VALID [2022-04-15 11:16:46,413 INFO L290 TraceCheckUtils]: 45: Hoare triple {38914#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {38914#false} is VALID [2022-04-15 11:16:46,413 INFO L290 TraceCheckUtils]: 46: Hoare triple {38914#false} assume 4 != ~blastFlag~0; {38914#false} is VALID [2022-04-15 11:16:46,413 INFO L290 TraceCheckUtils]: 47: Hoare triple {38914#false} assume 1024 != ~tmp___7~0; {38914#false} is VALID [2022-04-15 11:16:46,413 INFO L290 TraceCheckUtils]: 48: Hoare triple {38914#false} assume !false; {38914#false} is VALID [2022-04-15 11:16:46,413 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-15 11:16:46,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:16:46,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356113287] [2022-04-15 11:16:46,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356113287] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:46,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:46,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:46,414 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:16:46,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [748116034] [2022-04-15 11:16:46,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [748116034] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:46,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:46,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:46,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274938258] [2022-04-15 11:16:46,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:16:46,414 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 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 49 [2022-04-15 11:16:46,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:16:46,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 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-15 11:16:46,446 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:46,446 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 11:16:46,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:46,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 11:16:46,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:16:46,447 INFO L87 Difference]: Start difference. First operand 389 states and 559 transitions. Second operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 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-15 11:16:47,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:47,280 INFO L93 Difference]: Finished difference Result 778 states and 1123 transitions. [2022-04-15 11:16:47,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 11:16:47,281 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 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 49 [2022-04-15 11:16:47,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:16:47,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 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-15 11:16:47,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 554 transitions. [2022-04-15 11:16:47,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 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-15 11:16:47,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 554 transitions. [2022-04-15 11:16:47,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 554 transitions. [2022-04-15 11:16:47,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 554 edges. 554 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:47,612 INFO L225 Difference]: With dead ends: 778 [2022-04-15 11:16:47,612 INFO L226 Difference]: Without dead ends: 403 [2022-04-15 11:16:47,613 INFO L912 BasicCegarLoop]: 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-15 11:16:47,613 INFO L913 BasicCegarLoop]: 193 mSDtfsCounter, 795 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:16:47,613 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [795 Valid, 210 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 11:16:47,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2022-04-15 11:16:47,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 389. [2022-04-15 11:16:47,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:16:47,682 INFO L82 GeneralOperation]: Start isEquivalent. First operand 403 states. Second operand has 389 states, 384 states have (on average 1.4375) internal successors, (552), 384 states have internal predecessors, (552), 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-15 11:16:47,682 INFO L74 IsIncluded]: Start isIncluded. First operand 403 states. Second operand has 389 states, 384 states have (on average 1.4375) internal successors, (552), 384 states have internal predecessors, (552), 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-15 11:16:47,682 INFO L87 Difference]: Start difference. First operand 403 states. Second operand has 389 states, 384 states have (on average 1.4375) internal successors, (552), 384 states have internal predecessors, (552), 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-15 11:16:47,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:47,688 INFO L93 Difference]: Finished difference Result 403 states and 579 transitions. [2022-04-15 11:16:47,688 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 579 transitions. [2022-04-15 11:16:47,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:47,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:47,689 INFO L74 IsIncluded]: Start isIncluded. First operand has 389 states, 384 states have (on average 1.4375) internal successors, (552), 384 states have internal predecessors, (552), 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 403 states. [2022-04-15 11:16:47,689 INFO L87 Difference]: Start difference. First operand has 389 states, 384 states have (on average 1.4375) internal successors, (552), 384 states have internal predecessors, (552), 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 403 states. [2022-04-15 11:16:47,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:47,694 INFO L93 Difference]: Finished difference Result 403 states and 579 transitions. [2022-04-15 11:16:47,694 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 579 transitions. [2022-04-15 11:16:47,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:47,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:47,695 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:16:47,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:16:47,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 384 states have (on average 1.4375) internal successors, (552), 384 states have internal predecessors, (552), 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-15 11:16:47,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 556 transitions. [2022-04-15 11:16:47,701 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 556 transitions. Word has length 49 [2022-04-15 11:16:47,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:16:47,702 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 556 transitions. [2022-04-15 11:16:47,702 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 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-15 11:16:47,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 389 states and 556 transitions. [2022-04-15 11:16:48,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 556 edges. 556 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:48,531 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 556 transitions. [2022-04-15 11:16:48,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 11:16:48,532 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:16:48,532 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:16:48,532 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-15 11:16:48,532 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:16:48,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:16:48,533 INFO L85 PathProgramCache]: Analyzing trace with hash -396811972, now seen corresponding path program 1 times [2022-04-15 11:16:48,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:48,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2132297937] [2022-04-15 11:16:48,534 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:16:48,534 INFO L85 PathProgramCache]: Analyzing trace with hash -396811972, now seen corresponding path program 2 times [2022-04-15 11:16:48,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:16:48,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369551483] [2022-04-15 11:16:48,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:16:48,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:16:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:48,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:16:48,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:48,610 INFO L290 TraceCheckUtils]: 0: Hoare triple {42078#(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); {42070#true} is VALID [2022-04-15 11:16:48,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {42070#true} assume true; {42070#true} is VALID [2022-04-15 11:16:48,611 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42070#true} {42070#true} #752#return; {42070#true} is VALID [2022-04-15 11:16:48,611 INFO L272 TraceCheckUtils]: 0: Hoare triple {42070#true} call ULTIMATE.init(); {42078#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:16:48,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {42078#(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); {42070#true} is VALID [2022-04-15 11:16:48,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {42070#true} assume true; {42070#true} is VALID [2022-04-15 11:16:48,611 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42070#true} {42070#true} #752#return; {42070#true} is VALID [2022-04-15 11:16:48,611 INFO L272 TraceCheckUtils]: 4: Hoare triple {42070#true} call #t~ret59 := main(); {42070#true} is VALID [2022-04-15 11:16:48,612 INFO L290 TraceCheckUtils]: 5: Hoare triple {42070#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {42075#(<= main_~s~0 8464)} is VALID [2022-04-15 11:16:48,612 INFO L272 TraceCheckUtils]: 6: Hoare triple {42075#(<= main_~s~0 8464)} call #t~ret58 := ssl3_accept(~s~0); {42076#(not (= |ssl3_accept_#in~initial_state| 8561))} is VALID [2022-04-15 11:16:48,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {42076#(not (= |ssl3_accept_#in~initial_state| 8561))} ~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;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;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~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-15 11:16:48,613 INFO L290 TraceCheckUtils]: 8: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-15 11:16:48,614 INFO L290 TraceCheckUtils]: 9: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-15 11:16:48,614 INFO L290 TraceCheckUtils]: 10: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} assume !(0 != 12288 + ~tmp___1~0); {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-15 11:16:48,614 INFO L290 TraceCheckUtils]: 11: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} assume !(0 == ~s__cert~0); {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-15 11:16:48,614 INFO L290 TraceCheckUtils]: 12: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} assume !false; {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-15 11:16:48,615 INFO L290 TraceCheckUtils]: 13: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} ~state~0 := ~s__state~0; {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-15 11:16:48,615 INFO L290 TraceCheckUtils]: 14: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} assume !(12292 == ~s__state~0); {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-15 11:16:48,615 INFO L290 TraceCheckUtils]: 15: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} assume !(16384 == ~s__state~0); {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-15 11:16:48,615 INFO L290 TraceCheckUtils]: 16: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} assume !(8192 == ~s__state~0); {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-15 11:16:48,616 INFO L290 TraceCheckUtils]: 17: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} assume !(24576 == ~s__state~0); {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-15 11:16:48,616 INFO L290 TraceCheckUtils]: 18: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} assume !(8195 == ~s__state~0); {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-15 11:16:48,616 INFO L290 TraceCheckUtils]: 19: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} assume !(8480 == ~s__state~0); {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-15 11:16:48,616 INFO L290 TraceCheckUtils]: 20: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} assume !(8481 == ~s__state~0); {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-15 11:16:48,617 INFO L290 TraceCheckUtils]: 21: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} assume !(8482 == ~s__state~0); {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-15 11:16:48,617 INFO L290 TraceCheckUtils]: 22: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} assume !(8464 == ~s__state~0); {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-15 11:16:48,617 INFO L290 TraceCheckUtils]: 23: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} assume !(8465 == ~s__state~0); {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-15 11:16:48,617 INFO L290 TraceCheckUtils]: 24: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} assume !(8466 == ~s__state~0); {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-15 11:16:48,618 INFO L290 TraceCheckUtils]: 25: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} assume !(8496 == ~s__state~0); {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-15 11:16:48,618 INFO L290 TraceCheckUtils]: 26: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} assume !(8497 == ~s__state~0); {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-15 11:16:48,618 INFO L290 TraceCheckUtils]: 27: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} assume !(8512 == ~s__state~0); {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-15 11:16:48,618 INFO L290 TraceCheckUtils]: 28: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} assume !(8513 == ~s__state~0); {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-15 11:16:48,619 INFO L290 TraceCheckUtils]: 29: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} assume !(8528 == ~s__state~0); {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-15 11:16:48,619 INFO L290 TraceCheckUtils]: 30: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} assume !(8529 == ~s__state~0); {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-15 11:16:48,619 INFO L290 TraceCheckUtils]: 31: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} assume !(8544 == ~s__state~0); {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-15 11:16:48,619 INFO L290 TraceCheckUtils]: 32: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} assume !(8545 == ~s__state~0); {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-15 11:16:48,620 INFO L290 TraceCheckUtils]: 33: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} assume !(8560 == ~s__state~0); {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-15 11:16:48,620 INFO L290 TraceCheckUtils]: 34: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} assume 8561 == ~s__state~0; {42071#false} is VALID [2022-04-15 11:16:48,620 INFO L290 TraceCheckUtils]: 35: Hoare triple {42071#false} assume -2147483648 <= #t~nondet46 && #t~nondet46 <= 2147483647;~ret~0 := #t~nondet46;havoc #t~nondet46; {42071#false} is VALID [2022-04-15 11:16:48,620 INFO L290 TraceCheckUtils]: 36: Hoare triple {42071#false} assume !(~ret~0 <= 0);~s__s3__tmp__next_state___0~0 := 8576;~s__state~0 := 8448;~s__init_num~0 := 0; {42071#false} is VALID [2022-04-15 11:16:48,620 INFO L290 TraceCheckUtils]: 37: Hoare triple {42071#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {42071#false} is VALID [2022-04-15 11:16:48,620 INFO L290 TraceCheckUtils]: 38: Hoare triple {42071#false} assume 0 == ~s__s3__tmp__reuse_message~0; {42071#false} is VALID [2022-04-15 11:16:48,620 INFO L290 TraceCheckUtils]: 39: Hoare triple {42071#false} assume 0 == ~skip~0; {42071#false} is VALID [2022-04-15 11:16:48,620 INFO L290 TraceCheckUtils]: 40: Hoare triple {42071#false} assume 8560 == ~state~0; {42071#false} is VALID [2022-04-15 11:16:48,620 INFO L290 TraceCheckUtils]: 41: Hoare triple {42071#false} assume 8448 == ~s__state~0; {42071#false} is VALID [2022-04-15 11:16:48,621 INFO L290 TraceCheckUtils]: 42: Hoare triple {42071#false} assume -1 != ~s__verify_mode~0; {42071#false} is VALID [2022-04-15 11:16:48,621 INFO L290 TraceCheckUtils]: 43: Hoare triple {42071#false} assume -2 != ~s__verify_mode~0; {42071#false} is VALID [2022-04-15 11:16:48,621 INFO L290 TraceCheckUtils]: 44: Hoare triple {42071#false} assume 9021 != ~__cil_tmp61~0 % 4294967296; {42071#false} is VALID [2022-04-15 11:16:48,621 INFO L290 TraceCheckUtils]: 45: Hoare triple {42071#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {42071#false} is VALID [2022-04-15 11:16:48,621 INFO L290 TraceCheckUtils]: 46: Hoare triple {42071#false} assume 4 != ~blastFlag~0; {42071#false} is VALID [2022-04-15 11:16:48,621 INFO L290 TraceCheckUtils]: 47: Hoare triple {42071#false} assume 1024 != ~tmp___7~0; {42071#false} is VALID [2022-04-15 11:16:48,621 INFO L290 TraceCheckUtils]: 48: Hoare triple {42071#false} assume !false; {42071#false} is VALID [2022-04-15 11:16:48,621 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-15 11:16:48,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:16:48,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369551483] [2022-04-15 11:16:48,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369551483] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:48,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:48,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:48,622 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:16:48,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2132297937] [2022-04-15 11:16:48,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2132297937] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:48,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:48,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:48,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826346730] [2022-04-15 11:16:48,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:16:48,622 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 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 49 [2022-04-15 11:16:48,622 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:16:48,623 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 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-15 11:16:48,648 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:48,648 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 11:16:48,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:48,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 11:16:48,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:16:48,649 INFO L87 Difference]: Start difference. First operand 389 states and 556 transitions. Second operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 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-15 11:16:49,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:49,426 INFO L93 Difference]: Finished difference Result 768 states and 1100 transitions. [2022-04-15 11:16:49,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 11:16:49,426 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 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 49 [2022-04-15 11:16:49,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:16:49,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 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-15 11:16:49,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 539 transitions. [2022-04-15 11:16:49,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 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-15 11:16:49,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 539 transitions. [2022-04-15 11:16:49,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 539 transitions. [2022-04-15 11:16:49,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 539 edges. 539 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:49,738 INFO L225 Difference]: With dead ends: 768 [2022-04-15 11:16:49,739 INFO L226 Difference]: Without dead ends: 393 [2022-04-15 11:16:49,739 INFO L912 BasicCegarLoop]: 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-15 11:16:49,740 INFO L913 BasicCegarLoop]: 200 mSDtfsCounter, 746 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:16:49,740 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [746 Valid, 217 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 11:16:49,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2022-04-15 11:16:49,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 391. [2022-04-15 11:16:49,796 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:16:49,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 393 states. Second operand has 391 states, 386 states have (on average 1.4378238341968912) internal successors, (555), 386 states have internal predecessors, (555), 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-15 11:16:49,796 INFO L74 IsIncluded]: Start isIncluded. First operand 393 states. Second operand has 391 states, 386 states have (on average 1.4378238341968912) internal successors, (555), 386 states have internal predecessors, (555), 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-15 11:16:49,797 INFO L87 Difference]: Start difference. First operand 393 states. Second operand has 391 states, 386 states have (on average 1.4378238341968912) internal successors, (555), 386 states have internal predecessors, (555), 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-15 11:16:49,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:49,802 INFO L93 Difference]: Finished difference Result 393 states and 561 transitions. [2022-04-15 11:16:49,802 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 561 transitions. [2022-04-15 11:16:49,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:49,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:49,803 INFO L74 IsIncluded]: Start isIncluded. First operand has 391 states, 386 states have (on average 1.4378238341968912) internal successors, (555), 386 states have internal predecessors, (555), 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 393 states. [2022-04-15 11:16:49,803 INFO L87 Difference]: Start difference. First operand has 391 states, 386 states have (on average 1.4378238341968912) internal successors, (555), 386 states have internal predecessors, (555), 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 393 states. [2022-04-15 11:16:49,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:49,808 INFO L93 Difference]: Finished difference Result 393 states and 561 transitions. [2022-04-15 11:16:49,808 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 561 transitions. [2022-04-15 11:16:49,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:49,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:49,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:16:49,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:16:49,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 386 states have (on average 1.4378238341968912) internal successors, (555), 386 states have internal predecessors, (555), 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-15 11:16:49,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 559 transitions. [2022-04-15 11:16:49,815 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 559 transitions. Word has length 49 [2022-04-15 11:16:49,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:16:49,815 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 559 transitions. [2022-04-15 11:16:49,815 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 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-15 11:16:49,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 391 states and 559 transitions. [2022-04-15 11:16:50,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 559 edges. 559 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:50,713 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 559 transitions. [2022-04-15 11:16:50,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 11:16:50,713 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:16:50,713 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:16:50,713 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-15 11:16:50,714 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:16:50,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:16:50,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1088761570, now seen corresponding path program 1 times [2022-04-15 11:16:50,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:50,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [698696346] [2022-04-15 11:16:50,714 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:16:50,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1088761570, now seen corresponding path program 2 times [2022-04-15 11:16:50,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:16:50,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305200493] [2022-04-15 11:16:50,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:16:50,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:16:50,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:50,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:16:50,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:50,784 INFO L290 TraceCheckUtils]: 0: Hoare triple {45199#(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); {45191#true} is VALID [2022-04-15 11:16:50,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {45191#true} assume true; {45191#true} is VALID [2022-04-15 11:16:50,785 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45191#true} {45191#true} #752#return; {45191#true} is VALID [2022-04-15 11:16:50,785 INFO L272 TraceCheckUtils]: 0: Hoare triple {45191#true} call ULTIMATE.init(); {45199#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:16:50,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {45199#(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); {45191#true} is VALID [2022-04-15 11:16:50,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {45191#true} assume true; {45191#true} is VALID [2022-04-15 11:16:50,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45191#true} {45191#true} #752#return; {45191#true} is VALID [2022-04-15 11:16:50,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {45191#true} call #t~ret59 := main(); {45191#true} is VALID [2022-04-15 11:16:50,786 INFO L290 TraceCheckUtils]: 5: Hoare triple {45191#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {45196#(<= 8464 main_~s~0)} is VALID [2022-04-15 11:16:50,786 INFO L272 TraceCheckUtils]: 6: Hoare triple {45196#(<= 8464 main_~s~0)} call #t~ret58 := ssl3_accept(~s~0); {45197#(not (= 8448 |ssl3_accept_#in~initial_state|))} is VALID [2022-04-15 11:16:50,787 INFO L290 TraceCheckUtils]: 7: Hoare triple {45197#(not (= 8448 |ssl3_accept_#in~initial_state|))} ~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;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;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~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:50,788 INFO L290 TraceCheckUtils]: 8: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:50,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:50,788 INFO L290 TraceCheckUtils]: 10: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume !(0 != 12288 + ~tmp___1~0); {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:50,789 INFO L290 TraceCheckUtils]: 11: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume !(0 == ~s__cert~0); {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:50,789 INFO L290 TraceCheckUtils]: 12: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume !false; {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:50,789 INFO L290 TraceCheckUtils]: 13: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} ~state~0 := ~s__state~0; {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:50,789 INFO L290 TraceCheckUtils]: 14: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume !(12292 == ~s__state~0); {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:50,790 INFO L290 TraceCheckUtils]: 15: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume !(16384 == ~s__state~0); {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:50,790 INFO L290 TraceCheckUtils]: 16: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume !(8192 == ~s__state~0); {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:50,790 INFO L290 TraceCheckUtils]: 17: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume !(24576 == ~s__state~0); {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:50,791 INFO L290 TraceCheckUtils]: 18: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume !(8195 == ~s__state~0); {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:50,791 INFO L290 TraceCheckUtils]: 19: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume !(8480 == ~s__state~0); {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:50,791 INFO L290 TraceCheckUtils]: 20: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume !(8481 == ~s__state~0); {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:50,791 INFO L290 TraceCheckUtils]: 21: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume !(8482 == ~s__state~0); {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:50,792 INFO L290 TraceCheckUtils]: 22: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume !(8464 == ~s__state~0); {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:50,792 INFO L290 TraceCheckUtils]: 23: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume !(8465 == ~s__state~0); {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:50,792 INFO L290 TraceCheckUtils]: 24: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume !(8466 == ~s__state~0); {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:50,793 INFO L290 TraceCheckUtils]: 25: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume !(8496 == ~s__state~0); {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:50,793 INFO L290 TraceCheckUtils]: 26: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume !(8497 == ~s__state~0); {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:50,793 INFO L290 TraceCheckUtils]: 27: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume !(8512 == ~s__state~0); {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:50,793 INFO L290 TraceCheckUtils]: 28: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume !(8513 == ~s__state~0); {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:50,794 INFO L290 TraceCheckUtils]: 29: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume !(8528 == ~s__state~0); {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:50,794 INFO L290 TraceCheckUtils]: 30: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume !(8529 == ~s__state~0); {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:50,794 INFO L290 TraceCheckUtils]: 31: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume !(8544 == ~s__state~0); {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:50,795 INFO L290 TraceCheckUtils]: 32: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume !(8545 == ~s__state~0); {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:50,795 INFO L290 TraceCheckUtils]: 33: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume !(8560 == ~s__state~0); {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:50,795 INFO L290 TraceCheckUtils]: 34: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume !(8561 == ~s__state~0); {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-15 11:16:50,795 INFO L290 TraceCheckUtils]: 35: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume 8448 == ~s__state~0; {45192#false} is VALID [2022-04-15 11:16:50,796 INFO L290 TraceCheckUtils]: 36: Hoare triple {45192#false} assume !(~num1~0 > 0); {45192#false} is VALID [2022-04-15 11:16:50,796 INFO L290 TraceCheckUtils]: 37: Hoare triple {45192#false} ~s__state~0 := ~s__s3__tmp__next_state___0~0; {45192#false} is VALID [2022-04-15 11:16:50,796 INFO L290 TraceCheckUtils]: 38: Hoare triple {45192#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {45192#false} is VALID [2022-04-15 11:16:50,796 INFO L290 TraceCheckUtils]: 39: Hoare triple {45192#false} assume 0 == ~s__s3__tmp__reuse_message~0; {45192#false} is VALID [2022-04-15 11:16:50,796 INFO L290 TraceCheckUtils]: 40: Hoare triple {45192#false} assume 0 == ~skip~0; {45192#false} is VALID [2022-04-15 11:16:50,796 INFO L290 TraceCheckUtils]: 41: Hoare triple {45192#false} assume 8560 == ~state~0; {45192#false} is VALID [2022-04-15 11:16:50,796 INFO L290 TraceCheckUtils]: 42: Hoare triple {45192#false} assume 8448 == ~s__state~0; {45192#false} is VALID [2022-04-15 11:16:50,796 INFO L290 TraceCheckUtils]: 43: Hoare triple {45192#false} assume -1 != ~s__verify_mode~0; {45192#false} is VALID [2022-04-15 11:16:50,796 INFO L290 TraceCheckUtils]: 44: Hoare triple {45192#false} assume -2 != ~s__verify_mode~0; {45192#false} is VALID [2022-04-15 11:16:50,796 INFO L290 TraceCheckUtils]: 45: Hoare triple {45192#false} assume 9021 != ~__cil_tmp61~0 % 4294967296; {45192#false} is VALID [2022-04-15 11:16:50,796 INFO L290 TraceCheckUtils]: 46: Hoare triple {45192#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {45192#false} is VALID [2022-04-15 11:16:50,796 INFO L290 TraceCheckUtils]: 47: Hoare triple {45192#false} assume 4 != ~blastFlag~0; {45192#false} is VALID [2022-04-15 11:16:50,796 INFO L290 TraceCheckUtils]: 48: Hoare triple {45192#false} assume 1024 != ~tmp___7~0; {45192#false} is VALID [2022-04-15 11:16:50,796 INFO L290 TraceCheckUtils]: 49: Hoare triple {45192#false} assume !false; {45192#false} is VALID [2022-04-15 11:16:50,797 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-15 11:16:50,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:16:50,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305200493] [2022-04-15 11:16:50,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305200493] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:50,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:50,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:50,798 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:16:50,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [698696346] [2022-04-15 11:16:50,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [698696346] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:50,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:50,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:50,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772529985] [2022-04-15 11:16:50,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:16:50,798 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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 50 [2022-04-15 11:16:50,798 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:16:50,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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-15 11:16:50,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:50,829 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 11:16:50,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:50,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 11:16:50,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:16:50,830 INFO L87 Difference]: Start difference. First operand 391 states and 559 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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-15 11:16:51,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:51,692 INFO L93 Difference]: Finished difference Result 832 states and 1196 transitions. [2022-04-15 11:16:51,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 11:16:51,692 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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 50 [2022-04-15 11:16:51,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:16:51,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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-15 11:16:51,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 552 transitions. [2022-04-15 11:16:51,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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-15 11:16:51,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 552 transitions. [2022-04-15 11:16:51,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 552 transitions. [2022-04-15 11:16:51,982 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 552 edges. 552 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:51,990 INFO L225 Difference]: With dead ends: 832 [2022-04-15 11:16:51,990 INFO L226 Difference]: Without dead ends: 455 [2022-04-15 11:16:51,991 INFO L912 BasicCegarLoop]: 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-15 11:16:51,992 INFO L913 BasicCegarLoop]: 196 mSDtfsCounter, 739 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:16:51,992 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [739 Valid, 213 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 11:16:51,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2022-04-15 11:16:52,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 453. [2022-04-15 11:16:52,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:16:52,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 455 states. Second operand has 453 states, 448 states have (on average 1.4308035714285714) internal successors, (641), 448 states have internal predecessors, (641), 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-15 11:16:52,067 INFO L74 IsIncluded]: Start isIncluded. First operand 455 states. Second operand has 453 states, 448 states have (on average 1.4308035714285714) internal successors, (641), 448 states have internal predecessors, (641), 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-15 11:16:52,067 INFO L87 Difference]: Start difference. First operand 455 states. Second operand has 453 states, 448 states have (on average 1.4308035714285714) internal successors, (641), 448 states have internal predecessors, (641), 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-15 11:16:52,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:52,074 INFO L93 Difference]: Finished difference Result 455 states and 646 transitions. [2022-04-15 11:16:52,074 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 646 transitions. [2022-04-15 11:16:52,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:52,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:52,075 INFO L74 IsIncluded]: Start isIncluded. First operand has 453 states, 448 states have (on average 1.4308035714285714) internal successors, (641), 448 states have internal predecessors, (641), 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 455 states. [2022-04-15 11:16:52,075 INFO L87 Difference]: Start difference. First operand has 453 states, 448 states have (on average 1.4308035714285714) internal successors, (641), 448 states have internal predecessors, (641), 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 455 states. [2022-04-15 11:16:52,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:52,082 INFO L93 Difference]: Finished difference Result 455 states and 646 transitions. [2022-04-15 11:16:52,082 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 646 transitions. [2022-04-15 11:16:52,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:52,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:52,083 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:16:52,083 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:16:52,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 448 states have (on average 1.4308035714285714) internal successors, (641), 448 states have internal predecessors, (641), 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-15 11:16:52,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 645 transitions. [2022-04-15 11:16:52,092 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 645 transitions. Word has length 50 [2022-04-15 11:16:52,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:16:52,092 INFO L478 AbstractCegarLoop]: Abstraction has 453 states and 645 transitions. [2022-04-15 11:16:52,092 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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-15 11:16:52,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 453 states and 645 transitions. [2022-04-15 11:16:53,122 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 645 edges. 645 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:53,122 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 645 transitions. [2022-04-15 11:16:53,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 11:16:53,123 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:16:53,123 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:16:53,123 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-15 11:16:53,123 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:16:53,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:16:53,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1090858659, now seen corresponding path program 1 times [2022-04-15 11:16:53,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:53,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [241715501] [2022-04-15 11:16:53,124 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:16:53,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1090858659, now seen corresponding path program 2 times [2022-04-15 11:16:53,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:16:53,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401807797] [2022-04-15 11:16:53,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:16:53,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:16:53,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:53,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:16:53,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:53,176 INFO L290 TraceCheckUtils]: 0: Hoare triple {48696#(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); {48688#true} is VALID [2022-04-15 11:16:53,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {48688#true} assume true; {48688#true} is VALID [2022-04-15 11:16:53,176 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48688#true} {48688#true} #752#return; {48688#true} is VALID [2022-04-15 11:16:53,177 INFO L272 TraceCheckUtils]: 0: Hoare triple {48688#true} call ULTIMATE.init(); {48696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:16:53,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {48696#(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); {48688#true} is VALID [2022-04-15 11:16:53,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {48688#true} assume true; {48688#true} is VALID [2022-04-15 11:16:53,177 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48688#true} {48688#true} #752#return; {48688#true} is VALID [2022-04-15 11:16:53,177 INFO L272 TraceCheckUtils]: 4: Hoare triple {48688#true} call #t~ret59 := main(); {48688#true} is VALID [2022-04-15 11:16:53,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {48688#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {48693#(<= main_~s~0 8464)} is VALID [2022-04-15 11:16:53,178 INFO L272 TraceCheckUtils]: 6: Hoare triple {48693#(<= main_~s~0 8464)} call #t~ret58 := ssl3_accept(~s~0); {48694#(not (= 8640 |ssl3_accept_#in~initial_state|))} is VALID [2022-04-15 11:16:53,179 INFO L290 TraceCheckUtils]: 7: Hoare triple {48694#(not (= 8640 |ssl3_accept_#in~initial_state|))} ~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;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;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~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-15 11:16:53,179 INFO L290 TraceCheckUtils]: 8: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-15 11:16:53,180 INFO L290 TraceCheckUtils]: 9: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-15 11:16:53,180 INFO L290 TraceCheckUtils]: 10: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(0 != 12288 + ~tmp___1~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-15 11:16:53,180 INFO L290 TraceCheckUtils]: 11: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(0 == ~s__cert~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-15 11:16:53,181 INFO L290 TraceCheckUtils]: 12: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !false; {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-15 11:16:53,181 INFO L290 TraceCheckUtils]: 13: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} ~state~0 := ~s__state~0; {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-15 11:16:53,181 INFO L290 TraceCheckUtils]: 14: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(12292 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-15 11:16:53,181 INFO L290 TraceCheckUtils]: 15: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(16384 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-15 11:16:53,182 INFO L290 TraceCheckUtils]: 16: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(8192 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-15 11:16:53,182 INFO L290 TraceCheckUtils]: 17: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(24576 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-15 11:16:53,182 INFO L290 TraceCheckUtils]: 18: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(8195 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-15 11:16:53,183 INFO L290 TraceCheckUtils]: 19: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(8480 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-15 11:16:53,183 INFO L290 TraceCheckUtils]: 20: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(8481 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-15 11:16:53,183 INFO L290 TraceCheckUtils]: 21: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(8482 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-15 11:16:53,184 INFO L290 TraceCheckUtils]: 22: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(8464 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-15 11:16:53,184 INFO L290 TraceCheckUtils]: 23: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(8465 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-15 11:16:53,184 INFO L290 TraceCheckUtils]: 24: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(8466 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-15 11:16:53,184 INFO L290 TraceCheckUtils]: 25: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(8496 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-15 11:16:53,185 INFO L290 TraceCheckUtils]: 26: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(8497 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-15 11:16:53,185 INFO L290 TraceCheckUtils]: 27: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(8512 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-15 11:16:53,185 INFO L290 TraceCheckUtils]: 28: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(8513 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-15 11:16:53,186 INFO L290 TraceCheckUtils]: 29: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(8528 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-15 11:16:53,186 INFO L290 TraceCheckUtils]: 30: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(8529 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-15 11:16:53,186 INFO L290 TraceCheckUtils]: 31: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(8544 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-15 11:16:53,186 INFO L290 TraceCheckUtils]: 32: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(8545 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-15 11:16:53,187 INFO L290 TraceCheckUtils]: 33: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(8560 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-15 11:16:53,187 INFO L290 TraceCheckUtils]: 34: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(8561 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-15 11:16:53,187 INFO L290 TraceCheckUtils]: 35: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(8448 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-15 11:16:53,188 INFO L290 TraceCheckUtils]: 36: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(8576 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-15 11:16:53,188 INFO L290 TraceCheckUtils]: 37: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(8577 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-15 11:16:53,188 INFO L290 TraceCheckUtils]: 38: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(8592 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-15 11:16:53,189 INFO L290 TraceCheckUtils]: 39: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(8593 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-15 11:16:53,189 INFO L290 TraceCheckUtils]: 40: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(8608 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-15 11:16:53,189 INFO L290 TraceCheckUtils]: 41: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(8609 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-15 11:16:53,190 INFO L290 TraceCheckUtils]: 42: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume 8640 == ~s__state~0; {48689#false} is VALID [2022-04-15 11:16:53,190 INFO L290 TraceCheckUtils]: 43: Hoare triple {48689#false} assume -2147483648 <= #t~nondet51 && #t~nondet51 <= 2147483647;~ret~0 := #t~nondet51;havoc #t~nondet51; {48689#false} is VALID [2022-04-15 11:16:53,190 INFO L290 TraceCheckUtils]: 44: Hoare triple {48689#false} assume !(9 == ~blastFlag~0); {48689#false} is VALID [2022-04-15 11:16:53,190 INFO L290 TraceCheckUtils]: 45: Hoare triple {48689#false} assume !(12 == ~blastFlag~0); {48689#false} is VALID [2022-04-15 11:16:53,190 INFO L290 TraceCheckUtils]: 46: Hoare triple {48689#false} assume !(15 == ~blastFlag~0); {48689#false} is VALID [2022-04-15 11:16:53,190 INFO L290 TraceCheckUtils]: 47: Hoare triple {48689#false} assume !(18 == ~blastFlag~0); {48689#false} is VALID [2022-04-15 11:16:53,190 INFO L290 TraceCheckUtils]: 48: Hoare triple {48689#false} assume 21 == ~blastFlag~0; {48689#false} is VALID [2022-04-15 11:16:53,190 INFO L290 TraceCheckUtils]: 49: Hoare triple {48689#false} assume !false; {48689#false} is VALID [2022-04-15 11:16:53,190 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-15 11:16:53,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:16:53,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401807797] [2022-04-15 11:16:53,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401807797] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:53,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:53,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:53,191 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:16:53,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [241715501] [2022-04-15 11:16:53,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [241715501] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:53,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:53,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:53,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253274063] [2022-04-15 11:16:53,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:16:53,192 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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 50 [2022-04-15 11:16:53,192 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:16:53,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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-15 11:16:53,224 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:53,225 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 11:16:53,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:53,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 11:16:53,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:16:53,225 INFO L87 Difference]: Start difference. First operand 453 states and 645 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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-15 11:16:54,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:54,020 INFO L93 Difference]: Finished difference Result 944 states and 1344 transitions. [2022-04-15 11:16:54,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 11:16:54,020 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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 50 [2022-04-15 11:16:54,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:16:54,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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-15 11:16:54,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 567 transitions. [2022-04-15 11:16:54,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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-15 11:16:54,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 567 transitions. [2022-04-15 11:16:54,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 567 transitions. [2022-04-15 11:16:54,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 567 edges. 567 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:54,276 INFO L225 Difference]: With dead ends: 944 [2022-04-15 11:16:54,276 INFO L226 Difference]: Without dead ends: 505 [2022-04-15 11:16:54,277 INFO L912 BasicCegarLoop]: 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-15 11:16:54,277 INFO L913 BasicCegarLoop]: 195 mSDtfsCounter, 809 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:16:54,277 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [809 Valid, 212 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 11:16:54,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-04-15 11:16:54,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 495. [2022-04-15 11:16:54,368 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:16:54,368 INFO L82 GeneralOperation]: Start isEquivalent. First operand 505 states. Second operand has 495 states, 490 states have (on average 1.4224489795918367) internal successors, (697), 490 states have internal predecessors, (697), 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-15 11:16:54,369 INFO L74 IsIncluded]: Start isIncluded. First operand 505 states. Second operand has 495 states, 490 states have (on average 1.4224489795918367) internal successors, (697), 490 states have internal predecessors, (697), 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-15 11:16:54,369 INFO L87 Difference]: Start difference. First operand 505 states. Second operand has 495 states, 490 states have (on average 1.4224489795918367) internal successors, (697), 490 states have internal predecessors, (697), 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-15 11:16:54,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:54,377 INFO L93 Difference]: Finished difference Result 505 states and 716 transitions. [2022-04-15 11:16:54,377 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 716 transitions. [2022-04-15 11:16:54,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:54,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:54,378 INFO L74 IsIncluded]: Start isIncluded. First operand has 495 states, 490 states have (on average 1.4224489795918367) internal successors, (697), 490 states have internal predecessors, (697), 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 505 states. [2022-04-15 11:16:54,378 INFO L87 Difference]: Start difference. First operand has 495 states, 490 states have (on average 1.4224489795918367) internal successors, (697), 490 states have internal predecessors, (697), 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 505 states. [2022-04-15 11:16:54,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:54,386 INFO L93 Difference]: Finished difference Result 505 states and 716 transitions. [2022-04-15 11:16:54,386 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 716 transitions. [2022-04-15 11:16:54,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:54,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:54,386 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:16:54,386 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:16:54,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 490 states have (on average 1.4224489795918367) internal successors, (697), 490 states have internal predecessors, (697), 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-15 11:16:54,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 701 transitions. [2022-04-15 11:16:54,396 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 701 transitions. Word has length 50 [2022-04-15 11:16:54,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:16:54,396 INFO L478 AbstractCegarLoop]: Abstraction has 495 states and 701 transitions. [2022-04-15 11:16:54,397 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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-15 11:16:54,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 495 states and 701 transitions. [2022-04-15 11:16:55,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 701 edges. 701 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:55,389 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 701 transitions. [2022-04-15 11:16:55,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-15 11:16:55,390 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:16:55,390 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:16:55,390 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-15 11:16:55,390 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:16:55,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:16:55,390 INFO L85 PathProgramCache]: Analyzing trace with hash -163662636, now seen corresponding path program 1 times [2022-04-15 11:16:55,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:55,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [879141928] [2022-04-15 11:16:55,391 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:16:55,391 INFO L85 PathProgramCache]: Analyzing trace with hash -163662636, now seen corresponding path program 2 times [2022-04-15 11:16:55,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:16:55,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34612278] [2022-04-15 11:16:55,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:16:55,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:16:55,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:55,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:16:55,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:55,458 INFO L290 TraceCheckUtils]: 0: Hoare triple {52601#(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); {52593#true} is VALID [2022-04-15 11:16:55,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {52593#true} assume true; {52593#true} is VALID [2022-04-15 11:16:55,458 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52593#true} {52593#true} #752#return; {52593#true} is VALID [2022-04-15 11:16:55,458 INFO L272 TraceCheckUtils]: 0: Hoare triple {52593#true} call ULTIMATE.init(); {52601#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:16:55,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {52601#(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); {52593#true} is VALID [2022-04-15 11:16:55,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {52593#true} assume true; {52593#true} is VALID [2022-04-15 11:16:55,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52593#true} {52593#true} #752#return; {52593#true} is VALID [2022-04-15 11:16:55,458 INFO L272 TraceCheckUtils]: 4: Hoare triple {52593#true} call #t~ret59 := main(); {52593#true} is VALID [2022-04-15 11:16:55,459 INFO L290 TraceCheckUtils]: 5: Hoare triple {52593#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {52598#(<= main_~s~0 8464)} is VALID [2022-04-15 11:16:55,459 INFO L272 TraceCheckUtils]: 6: Hoare triple {52598#(<= main_~s~0 8464)} call #t~ret58 := ssl3_accept(~s~0); {52599#(not (= 8641 |ssl3_accept_#in~initial_state|))} is VALID [2022-04-15 11:16:55,460 INFO L290 TraceCheckUtils]: 7: Hoare triple {52599#(not (= 8641 |ssl3_accept_#in~initial_state|))} ~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;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;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~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-15 11:16:55,461 INFO L290 TraceCheckUtils]: 8: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-15 11:16:55,461 INFO L290 TraceCheckUtils]: 9: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-15 11:16:55,461 INFO L290 TraceCheckUtils]: 10: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(0 != 12288 + ~tmp___1~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-15 11:16:55,461 INFO L290 TraceCheckUtils]: 11: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(0 == ~s__cert~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-15 11:16:55,461 INFO L290 TraceCheckUtils]: 12: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !false; {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-15 11:16:55,462 INFO L290 TraceCheckUtils]: 13: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} ~state~0 := ~s__state~0; {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-15 11:16:55,462 INFO L290 TraceCheckUtils]: 14: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(12292 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-15 11:16:55,462 INFO L290 TraceCheckUtils]: 15: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(16384 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-15 11:16:55,462 INFO L290 TraceCheckUtils]: 16: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8192 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-15 11:16:55,463 INFO L290 TraceCheckUtils]: 17: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(24576 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-15 11:16:55,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8195 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-15 11:16:55,463 INFO L290 TraceCheckUtils]: 19: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8480 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-15 11:16:55,463 INFO L290 TraceCheckUtils]: 20: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8481 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-15 11:16:55,464 INFO L290 TraceCheckUtils]: 21: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8482 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-15 11:16:55,464 INFO L290 TraceCheckUtils]: 22: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8464 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-15 11:16:55,464 INFO L290 TraceCheckUtils]: 23: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8465 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-15 11:16:55,464 INFO L290 TraceCheckUtils]: 24: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8466 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-15 11:16:55,465 INFO L290 TraceCheckUtils]: 25: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8496 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-15 11:16:55,465 INFO L290 TraceCheckUtils]: 26: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8497 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-15 11:16:55,465 INFO L290 TraceCheckUtils]: 27: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8512 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-15 11:16:55,465 INFO L290 TraceCheckUtils]: 28: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8513 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-15 11:16:55,466 INFO L290 TraceCheckUtils]: 29: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8528 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-15 11:16:55,466 INFO L290 TraceCheckUtils]: 30: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8529 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-15 11:16:55,466 INFO L290 TraceCheckUtils]: 31: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8544 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-15 11:16:55,466 INFO L290 TraceCheckUtils]: 32: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8545 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-15 11:16:55,467 INFO L290 TraceCheckUtils]: 33: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8560 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-15 11:16:55,467 INFO L290 TraceCheckUtils]: 34: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8561 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-15 11:16:55,467 INFO L290 TraceCheckUtils]: 35: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8448 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-15 11:16:55,467 INFO L290 TraceCheckUtils]: 36: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8576 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-15 11:16:55,468 INFO L290 TraceCheckUtils]: 37: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8577 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-15 11:16:55,468 INFO L290 TraceCheckUtils]: 38: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8592 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-15 11:16:55,468 INFO L290 TraceCheckUtils]: 39: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8593 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-15 11:16:55,468 INFO L290 TraceCheckUtils]: 40: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8608 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-15 11:16:55,469 INFO L290 TraceCheckUtils]: 41: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8609 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-15 11:16:55,469 INFO L290 TraceCheckUtils]: 42: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8640 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-15 11:16:55,469 INFO L290 TraceCheckUtils]: 43: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume 8641 == ~s__state~0; {52594#false} is VALID [2022-04-15 11:16:55,469 INFO L290 TraceCheckUtils]: 44: Hoare triple {52594#false} assume -2147483648 <= #t~nondet51 && #t~nondet51 <= 2147483647;~ret~0 := #t~nondet51;havoc #t~nondet51; {52594#false} is VALID [2022-04-15 11:16:55,469 INFO L290 TraceCheckUtils]: 45: Hoare triple {52594#false} assume !(9 == ~blastFlag~0); {52594#false} is VALID [2022-04-15 11:16:55,469 INFO L290 TraceCheckUtils]: 46: Hoare triple {52594#false} assume !(12 == ~blastFlag~0); {52594#false} is VALID [2022-04-15 11:16:55,469 INFO L290 TraceCheckUtils]: 47: Hoare triple {52594#false} assume !(15 == ~blastFlag~0); {52594#false} is VALID [2022-04-15 11:16:55,469 INFO L290 TraceCheckUtils]: 48: Hoare triple {52594#false} assume !(18 == ~blastFlag~0); {52594#false} is VALID [2022-04-15 11:16:55,469 INFO L290 TraceCheckUtils]: 49: Hoare triple {52594#false} assume 21 == ~blastFlag~0; {52594#false} is VALID [2022-04-15 11:16:55,470 INFO L290 TraceCheckUtils]: 50: Hoare triple {52594#false} assume !false; {52594#false} is VALID [2022-04-15 11:16:55,470 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-15 11:16:55,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:16:55,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34612278] [2022-04-15 11:16:55,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34612278] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:55,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:55,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:55,471 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:16:55,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [879141928] [2022-04-15 11:16:55,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [879141928] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:55,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:55,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:55,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245503277] [2022-04-15 11:16:55,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:16:55,472 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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 51 [2022-04-15 11:16:55,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:16:55,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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-15 11:16:55,509 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-15 11:16:55,510 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 11:16:55,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:55,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 11:16:55,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:16:55,510 INFO L87 Difference]: Start difference. First operand 495 states and 701 transitions. Second operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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-15 11:16:56,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:56,450 INFO L93 Difference]: Finished difference Result 995 states and 1416 transitions. [2022-04-15 11:16:56,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 11:16:56,450 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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 51 [2022-04-15 11:16:56,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:16:56,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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-15 11:16:56,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 569 transitions. [2022-04-15 11:16:56,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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-15 11:16:56,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 569 transitions. [2022-04-15 11:16:56,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 569 transitions. [2022-04-15 11:16:56,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 569 edges. 569 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:56,831 INFO L225 Difference]: With dead ends: 995 [2022-04-15 11:16:56,832 INFO L226 Difference]: Without dead ends: 514 [2022-04-15 11:16:56,832 INFO L912 BasicCegarLoop]: 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-15 11:16:56,833 INFO L913 BasicCegarLoop]: 195 mSDtfsCounter, 812 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:16:56,833 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [812 Valid, 212 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 11:16:56,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2022-04-15 11:16:56,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 504. [2022-04-15 11:16:56,913 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:16:56,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 514 states. Second operand has 504 states, 499 states have (on average 1.4288577154308617) internal successors, (713), 499 states have internal predecessors, (713), 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-15 11:16:56,914 INFO L74 IsIncluded]: Start isIncluded. First operand 514 states. Second operand has 504 states, 499 states have (on average 1.4288577154308617) internal successors, (713), 499 states have internal predecessors, (713), 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-15 11:16:56,914 INFO L87 Difference]: Start difference. First operand 514 states. Second operand has 504 states, 499 states have (on average 1.4288577154308617) internal successors, (713), 499 states have internal predecessors, (713), 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-15 11:16:56,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:56,922 INFO L93 Difference]: Finished difference Result 514 states and 732 transitions. [2022-04-15 11:16:56,922 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 732 transitions. [2022-04-15 11:16:56,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:56,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:56,923 INFO L74 IsIncluded]: Start isIncluded. First operand has 504 states, 499 states have (on average 1.4288577154308617) internal successors, (713), 499 states have internal predecessors, (713), 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 514 states. [2022-04-15 11:16:56,923 INFO L87 Difference]: Start difference. First operand has 504 states, 499 states have (on average 1.4288577154308617) internal successors, (713), 499 states have internal predecessors, (713), 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 514 states. [2022-04-15 11:16:56,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:56,931 INFO L93 Difference]: Finished difference Result 514 states and 732 transitions. [2022-04-15 11:16:56,931 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 732 transitions. [2022-04-15 11:16:56,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:56,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:56,932 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:16:56,932 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:16:56,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 499 states have (on average 1.4288577154308617) internal successors, (713), 499 states have internal predecessors, (713), 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-15 11:16:56,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 717 transitions. [2022-04-15 11:16:56,942 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 717 transitions. Word has length 51 [2022-04-15 11:16:56,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:16:56,942 INFO L478 AbstractCegarLoop]: Abstraction has 504 states and 717 transitions. [2022-04-15 11:16:56,942 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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-15 11:16:56,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 504 states and 717 transitions. [2022-04-15 11:16:58,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 717 edges. 717 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:58,163 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 717 transitions. [2022-04-15 11:16:58,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-15 11:16:58,163 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:16:58,163 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:16:58,163 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-15 11:16:58,163 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:16:58,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:16:58,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1175453866, now seen corresponding path program 1 times [2022-04-15 11:16:58,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:58,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1484022727] [2022-04-15 11:16:58,164 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:16:58,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1175453866, now seen corresponding path program 2 times [2022-04-15 11:16:58,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:16:58,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581041215] [2022-04-15 11:16:58,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:16:58,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:16:58,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:58,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:16:58,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:58,214 INFO L290 TraceCheckUtils]: 0: Hoare triple {56644#(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); {56636#true} is VALID [2022-04-15 11:16:58,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {56636#true} assume true; {56636#true} is VALID [2022-04-15 11:16:58,214 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56636#true} {56636#true} #752#return; {56636#true} is VALID [2022-04-15 11:16:58,215 INFO L272 TraceCheckUtils]: 0: Hoare triple {56636#true} call ULTIMATE.init(); {56644#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:16:58,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {56644#(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); {56636#true} is VALID [2022-04-15 11:16:58,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {56636#true} assume true; {56636#true} is VALID [2022-04-15 11:16:58,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56636#true} {56636#true} #752#return; {56636#true} is VALID [2022-04-15 11:16:58,215 INFO L272 TraceCheckUtils]: 4: Hoare triple {56636#true} call #t~ret59 := main(); {56636#true} is VALID [2022-04-15 11:16:58,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {56636#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {56641#(<= main_~s~0 8464)} is VALID [2022-04-15 11:16:58,216 INFO L272 TraceCheckUtils]: 6: Hoare triple {56641#(<= main_~s~0 8464)} call #t~ret58 := ssl3_accept(~s~0); {56642#(not (= |ssl3_accept_#in~initial_state| 8672))} is VALID [2022-04-15 11:16:58,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {56642#(not (= |ssl3_accept_#in~initial_state| 8672))} ~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;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;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~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-15 11:16:58,217 INFO L290 TraceCheckUtils]: 8: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-15 11:16:58,218 INFO L290 TraceCheckUtils]: 9: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-15 11:16:58,218 INFO L290 TraceCheckUtils]: 10: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(0 != 12288 + ~tmp___1~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-15 11:16:58,218 INFO L290 TraceCheckUtils]: 11: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(0 == ~s__cert~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-15 11:16:58,219 INFO L290 TraceCheckUtils]: 12: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !false; {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-15 11:16:58,219 INFO L290 TraceCheckUtils]: 13: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} ~state~0 := ~s__state~0; {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-15 11:16:58,219 INFO L290 TraceCheckUtils]: 14: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(12292 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-15 11:16:58,220 INFO L290 TraceCheckUtils]: 15: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(16384 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-15 11:16:58,220 INFO L290 TraceCheckUtils]: 16: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8192 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-15 11:16:58,220 INFO L290 TraceCheckUtils]: 17: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(24576 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-15 11:16:58,221 INFO L290 TraceCheckUtils]: 18: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8195 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-15 11:16:58,221 INFO L290 TraceCheckUtils]: 19: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8480 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-15 11:16:58,221 INFO L290 TraceCheckUtils]: 20: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8481 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-15 11:16:58,222 INFO L290 TraceCheckUtils]: 21: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8482 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-15 11:16:58,222 INFO L290 TraceCheckUtils]: 22: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8464 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-15 11:16:58,222 INFO L290 TraceCheckUtils]: 23: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8465 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-15 11:16:58,223 INFO L290 TraceCheckUtils]: 24: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8466 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-15 11:16:58,223 INFO L290 TraceCheckUtils]: 25: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8496 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-15 11:16:58,223 INFO L290 TraceCheckUtils]: 26: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8497 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-15 11:16:58,223 INFO L290 TraceCheckUtils]: 27: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8512 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-15 11:16:58,224 INFO L290 TraceCheckUtils]: 28: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8513 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-15 11:16:58,224 INFO L290 TraceCheckUtils]: 29: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8528 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-15 11:16:58,224 INFO L290 TraceCheckUtils]: 30: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8529 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-15 11:16:58,225 INFO L290 TraceCheckUtils]: 31: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8544 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-15 11:16:58,225 INFO L290 TraceCheckUtils]: 32: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8545 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-15 11:16:58,225 INFO L290 TraceCheckUtils]: 33: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8560 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-15 11:16:58,225 INFO L290 TraceCheckUtils]: 34: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8561 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-15 11:16:58,226 INFO L290 TraceCheckUtils]: 35: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8448 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-15 11:16:58,226 INFO L290 TraceCheckUtils]: 36: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8576 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-15 11:16:58,226 INFO L290 TraceCheckUtils]: 37: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8577 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-15 11:16:58,227 INFO L290 TraceCheckUtils]: 38: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8592 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-15 11:16:58,227 INFO L290 TraceCheckUtils]: 39: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8593 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-15 11:16:58,227 INFO L290 TraceCheckUtils]: 40: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8608 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-15 11:16:58,228 INFO L290 TraceCheckUtils]: 41: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8609 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-15 11:16:58,228 INFO L290 TraceCheckUtils]: 42: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8640 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-15 11:16:58,228 INFO L290 TraceCheckUtils]: 43: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8641 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-15 11:16:58,228 INFO L290 TraceCheckUtils]: 44: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8656 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-15 11:16:58,229 INFO L290 TraceCheckUtils]: 45: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8657 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-15 11:16:58,229 INFO L290 TraceCheckUtils]: 46: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume 8672 == ~s__state~0; {56637#false} is VALID [2022-04-15 11:16:58,229 INFO L290 TraceCheckUtils]: 47: Hoare triple {56637#false} assume -2147483648 <= #t~nondet53 && #t~nondet53 <= 2147483647;~ret~0 := #t~nondet53;havoc #t~nondet53; {56637#false} is VALID [2022-04-15 11:16:58,229 INFO L290 TraceCheckUtils]: 48: Hoare triple {56637#false} assume 11 == ~blastFlag~0;~blastFlag~0 := 12; {56637#false} is VALID [2022-04-15 11:16:58,229 INFO L290 TraceCheckUtils]: 49: Hoare triple {56637#false} assume !(~ret~0 <= 0);~s__state~0 := 8448; {56637#false} is VALID [2022-04-15 11:16:58,229 INFO L290 TraceCheckUtils]: 50: Hoare triple {56637#false} assume 0 != ~s__hit~0;~s__s3__tmp__next_state___0~0 := 8640; {56637#false} is VALID [2022-04-15 11:16:58,229 INFO L290 TraceCheckUtils]: 51: Hoare triple {56637#false} ~s__init_num~0 := 0; {56637#false} is VALID [2022-04-15 11:16:58,230 INFO L290 TraceCheckUtils]: 52: Hoare triple {56637#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {56637#false} is VALID [2022-04-15 11:16:58,230 INFO L290 TraceCheckUtils]: 53: Hoare triple {56637#false} assume 0 == ~s__s3__tmp__reuse_message~0; {56637#false} is VALID [2022-04-15 11:16:58,230 INFO L290 TraceCheckUtils]: 54: Hoare triple {56637#false} assume 0 == ~skip~0; {56637#false} is VALID [2022-04-15 11:16:58,230 INFO L290 TraceCheckUtils]: 55: Hoare triple {56637#false} assume 8560 == ~state~0; {56637#false} is VALID [2022-04-15 11:16:58,230 INFO L290 TraceCheckUtils]: 56: Hoare triple {56637#false} assume 8448 == ~s__state~0; {56637#false} is VALID [2022-04-15 11:16:58,230 INFO L290 TraceCheckUtils]: 57: Hoare triple {56637#false} assume -1 != ~s__verify_mode~0; {56637#false} is VALID [2022-04-15 11:16:58,230 INFO L290 TraceCheckUtils]: 58: Hoare triple {56637#false} assume -2 != ~s__verify_mode~0; {56637#false} is VALID [2022-04-15 11:16:58,230 INFO L290 TraceCheckUtils]: 59: Hoare triple {56637#false} assume 9021 != ~__cil_tmp61~0 % 4294967296; {56637#false} is VALID [2022-04-15 11:16:58,230 INFO L290 TraceCheckUtils]: 60: Hoare triple {56637#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {56637#false} is VALID [2022-04-15 11:16:58,230 INFO L290 TraceCheckUtils]: 61: Hoare triple {56637#false} assume 4 != ~blastFlag~0; {56637#false} is VALID [2022-04-15 11:16:58,230 INFO L290 TraceCheckUtils]: 62: Hoare triple {56637#false} assume 1024 != ~tmp___7~0; {56637#false} is VALID [2022-04-15 11:16:58,230 INFO L290 TraceCheckUtils]: 63: Hoare triple {56637#false} assume !false; {56637#false} is VALID [2022-04-15 11:16:58,231 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-15 11:16:58,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:16:58,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581041215] [2022-04-15 11:16:58,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581041215] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:58,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:58,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:58,231 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:16:58,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1484022727] [2022-04-15 11:16:58,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1484022727] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:58,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:58,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:58,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913239672] [2022-04-15 11:16:58,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:16:58,232 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 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 64 [2022-04-15 11:16:58,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:16:58,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 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-15 11:16:58,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:58,274 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 11:16:58,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:58,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 11:16:58,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:16:58,274 INFO L87 Difference]: Start difference. First operand 504 states and 717 transitions. Second operand has 6 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 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-15 11:16:59,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:59,138 INFO L93 Difference]: Finished difference Result 1045 states and 1487 transitions. [2022-04-15 11:16:59,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 11:16:59,139 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 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 64 [2022-04-15 11:16:59,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:16:59,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 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-15 11:16:59,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 569 transitions. [2022-04-15 11:16:59,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 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-15 11:16:59,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 569 transitions. [2022-04-15 11:16:59,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 569 transitions. [2022-04-15 11:16:59,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 569 edges. 569 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:59,516 INFO L225 Difference]: With dead ends: 1045 [2022-04-15 11:16:59,516 INFO L226 Difference]: Without dead ends: 555 [2022-04-15 11:16:59,517 INFO L912 BasicCegarLoop]: 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-15 11:16:59,517 INFO L913 BasicCegarLoop]: 196 mSDtfsCounter, 807 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:16:59,518 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [807 Valid, 213 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 11:16:59,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2022-04-15 11:16:59,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 549. [2022-04-15 11:16:59,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:16:59,608 INFO L82 GeneralOperation]: Start isEquivalent. First operand 555 states. Second operand has 549 states, 544 states have (on average 1.4209558823529411) internal successors, (773), 544 states have internal predecessors, (773), 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-15 11:16:59,609 INFO L74 IsIncluded]: Start isIncluded. First operand 555 states. Second operand has 549 states, 544 states have (on average 1.4209558823529411) internal successors, (773), 544 states have internal predecessors, (773), 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-15 11:16:59,609 INFO L87 Difference]: Start difference. First operand 555 states. Second operand has 549 states, 544 states have (on average 1.4209558823529411) internal successors, (773), 544 states have internal predecessors, (773), 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-15 11:16:59,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:59,618 INFO L93 Difference]: Finished difference Result 555 states and 787 transitions. [2022-04-15 11:16:59,618 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 787 transitions. [2022-04-15 11:16:59,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:59,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:59,619 INFO L74 IsIncluded]: Start isIncluded. First operand has 549 states, 544 states have (on average 1.4209558823529411) internal successors, (773), 544 states have internal predecessors, (773), 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 555 states. [2022-04-15 11:16:59,619 INFO L87 Difference]: Start difference. First operand has 549 states, 544 states have (on average 1.4209558823529411) internal successors, (773), 544 states have internal predecessors, (773), 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 555 states. [2022-04-15 11:16:59,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:59,628 INFO L93 Difference]: Finished difference Result 555 states and 787 transitions. [2022-04-15 11:16:59,628 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 787 transitions. [2022-04-15 11:16:59,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:59,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:59,628 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:16:59,628 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:16:59,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 544 states have (on average 1.4209558823529411) internal successors, (773), 544 states have internal predecessors, (773), 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-15 11:16:59,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 777 transitions. [2022-04-15 11:16:59,640 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 777 transitions. Word has length 64 [2022-04-15 11:16:59,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:16:59,640 INFO L478 AbstractCegarLoop]: Abstraction has 549 states and 777 transitions. [2022-04-15 11:16:59,640 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 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-15 11:16:59,640 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 549 states and 777 transitions. [2022-04-15 11:17:00,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 777 edges. 777 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:00,903 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 777 transitions. [2022-04-15 11:17:00,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-15 11:17:00,904 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:00,904 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:17:00,904 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-15 11:17:00,904 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:00,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:00,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1954305357, now seen corresponding path program 1 times [2022-04-15 11:17:00,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:00,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1900852032] [2022-04-15 11:17:00,905 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:17:00,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1954305357, now seen corresponding path program 2 times [2022-04-15 11:17:00,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:17:00,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404100161] [2022-04-15 11:17:00,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:17:00,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:17:00,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:00,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:17:00,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:17:00,982 INFO L290 TraceCheckUtils]: 0: Hoare triple {60959#(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); {60951#true} is VALID [2022-04-15 11:17:00,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {60951#true} assume true; {60951#true} is VALID [2022-04-15 11:17:00,983 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60951#true} {60951#true} #752#return; {60951#true} is VALID [2022-04-15 11:17:00,983 INFO L272 TraceCheckUtils]: 0: Hoare triple {60951#true} call ULTIMATE.init(); {60959#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:17:00,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {60959#(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); {60951#true} is VALID [2022-04-15 11:17:00,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {60951#true} assume true; {60951#true} is VALID [2022-04-15 11:17:00,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60951#true} {60951#true} #752#return; {60951#true} is VALID [2022-04-15 11:17:00,983 INFO L272 TraceCheckUtils]: 4: Hoare triple {60951#true} call #t~ret59 := main(); {60951#true} is VALID [2022-04-15 11:17:00,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {60951#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {60956#(<= main_~s~0 8464)} is VALID [2022-04-15 11:17:00,984 INFO L272 TraceCheckUtils]: 6: Hoare triple {60956#(<= main_~s~0 8464)} call #t~ret58 := ssl3_accept(~s~0); {60957#(not (= 8673 |ssl3_accept_#in~initial_state|))} is VALID [2022-04-15 11:17:00,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {60957#(not (= 8673 |ssl3_accept_#in~initial_state|))} ~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;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;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~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-15 11:17:00,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-15 11:17:00,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-15 11:17:00,986 INFO L290 TraceCheckUtils]: 10: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(0 != 12288 + ~tmp___1~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-15 11:17:00,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(0 == ~s__cert~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-15 11:17:00,987 INFO L290 TraceCheckUtils]: 12: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !false; {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-15 11:17:00,987 INFO L290 TraceCheckUtils]: 13: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} ~state~0 := ~s__state~0; {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-15 11:17:00,987 INFO L290 TraceCheckUtils]: 14: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(12292 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-15 11:17:00,988 INFO L290 TraceCheckUtils]: 15: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(16384 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-15 11:17:00,988 INFO L290 TraceCheckUtils]: 16: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8192 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-15 11:17:00,988 INFO L290 TraceCheckUtils]: 17: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(24576 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-15 11:17:00,989 INFO L290 TraceCheckUtils]: 18: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8195 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-15 11:17:00,989 INFO L290 TraceCheckUtils]: 19: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8480 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-15 11:17:00,989 INFO L290 TraceCheckUtils]: 20: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8481 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-15 11:17:00,989 INFO L290 TraceCheckUtils]: 21: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8482 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-15 11:17:00,990 INFO L290 TraceCheckUtils]: 22: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8464 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-15 11:17:00,990 INFO L290 TraceCheckUtils]: 23: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8465 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-15 11:17:00,990 INFO L290 TraceCheckUtils]: 24: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8466 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-15 11:17:00,991 INFO L290 TraceCheckUtils]: 25: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8496 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-15 11:17:00,991 INFO L290 TraceCheckUtils]: 26: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8497 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-15 11:17:00,991 INFO L290 TraceCheckUtils]: 27: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8512 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-15 11:17:00,992 INFO L290 TraceCheckUtils]: 28: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8513 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-15 11:17:00,992 INFO L290 TraceCheckUtils]: 29: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8528 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-15 11:17:00,992 INFO L290 TraceCheckUtils]: 30: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8529 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-15 11:17:00,993 INFO L290 TraceCheckUtils]: 31: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8544 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-15 11:17:00,993 INFO L290 TraceCheckUtils]: 32: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8545 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-15 11:17:00,993 INFO L290 TraceCheckUtils]: 33: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8560 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-15 11:17:00,993 INFO L290 TraceCheckUtils]: 34: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8561 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-15 11:17:00,994 INFO L290 TraceCheckUtils]: 35: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8448 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-15 11:17:00,994 INFO L290 TraceCheckUtils]: 36: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8576 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-15 11:17:00,994 INFO L290 TraceCheckUtils]: 37: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8577 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-15 11:17:00,995 INFO L290 TraceCheckUtils]: 38: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8592 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-15 11:17:00,995 INFO L290 TraceCheckUtils]: 39: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8593 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-15 11:17:00,995 INFO L290 TraceCheckUtils]: 40: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8608 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-15 11:17:00,996 INFO L290 TraceCheckUtils]: 41: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8609 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-15 11:17:00,996 INFO L290 TraceCheckUtils]: 42: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8640 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-15 11:17:00,996 INFO L290 TraceCheckUtils]: 43: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8641 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-15 11:17:00,997 INFO L290 TraceCheckUtils]: 44: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8656 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-15 11:17:00,997 INFO L290 TraceCheckUtils]: 45: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8657 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-15 11:17:00,997 INFO L290 TraceCheckUtils]: 46: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8672 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-15 11:17:00,997 INFO L290 TraceCheckUtils]: 47: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume 8673 == ~s__state~0; {60952#false} is VALID [2022-04-15 11:17:00,998 INFO L290 TraceCheckUtils]: 48: Hoare triple {60952#false} assume -2147483648 <= #t~nondet53 && #t~nondet53 <= 2147483647;~ret~0 := #t~nondet53;havoc #t~nondet53; {60952#false} is VALID [2022-04-15 11:17:00,998 INFO L290 TraceCheckUtils]: 49: Hoare triple {60952#false} assume 11 == ~blastFlag~0;~blastFlag~0 := 12; {60952#false} is VALID [2022-04-15 11:17:00,998 INFO L290 TraceCheckUtils]: 50: Hoare triple {60952#false} assume !(~ret~0 <= 0);~s__state~0 := 8448; {60952#false} is VALID [2022-04-15 11:17:00,998 INFO L290 TraceCheckUtils]: 51: Hoare triple {60952#false} assume 0 != ~s__hit~0;~s__s3__tmp__next_state___0~0 := 8640; {60952#false} is VALID [2022-04-15 11:17:00,998 INFO L290 TraceCheckUtils]: 52: Hoare triple {60952#false} ~s__init_num~0 := 0; {60952#false} is VALID [2022-04-15 11:17:00,998 INFO L290 TraceCheckUtils]: 53: Hoare triple {60952#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {60952#false} is VALID [2022-04-15 11:17:00,998 INFO L290 TraceCheckUtils]: 54: Hoare triple {60952#false} assume 0 == ~s__s3__tmp__reuse_message~0; {60952#false} is VALID [2022-04-15 11:17:00,998 INFO L290 TraceCheckUtils]: 55: Hoare triple {60952#false} assume 0 == ~skip~0; {60952#false} is VALID [2022-04-15 11:17:00,998 INFO L290 TraceCheckUtils]: 56: Hoare triple {60952#false} assume 8560 == ~state~0; {60952#false} is VALID [2022-04-15 11:17:00,998 INFO L290 TraceCheckUtils]: 57: Hoare triple {60952#false} assume 8448 == ~s__state~0; {60952#false} is VALID [2022-04-15 11:17:00,998 INFO L290 TraceCheckUtils]: 58: Hoare triple {60952#false} assume -1 != ~s__verify_mode~0; {60952#false} is VALID [2022-04-15 11:17:00,998 INFO L290 TraceCheckUtils]: 59: Hoare triple {60952#false} assume -2 != ~s__verify_mode~0; {60952#false} is VALID [2022-04-15 11:17:00,998 INFO L290 TraceCheckUtils]: 60: Hoare triple {60952#false} assume 9021 != ~__cil_tmp61~0 % 4294967296; {60952#false} is VALID [2022-04-15 11:17:00,998 INFO L290 TraceCheckUtils]: 61: Hoare triple {60952#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {60952#false} is VALID [2022-04-15 11:17:00,999 INFO L290 TraceCheckUtils]: 62: Hoare triple {60952#false} assume 4 != ~blastFlag~0; {60952#false} is VALID [2022-04-15 11:17:00,999 INFO L290 TraceCheckUtils]: 63: Hoare triple {60952#false} assume 1024 != ~tmp___7~0; {60952#false} is VALID [2022-04-15 11:17:00,999 INFO L290 TraceCheckUtils]: 64: Hoare triple {60952#false} assume !false; {60952#false} is VALID [2022-04-15 11:17:00,999 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-15 11:17:00,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:17:00,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404100161] [2022-04-15 11:17:00,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404100161] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:00,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:00,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:17:00,999 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:17:00,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1900852032] [2022-04-15 11:17:01,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1900852032] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:17:01,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:17:01,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:17:01,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030565220] [2022-04-15 11:17:01,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:17:01,000 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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 65 [2022-04-15 11:17:01,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:17:01,000 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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-15 11:17:01,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:01,044 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 11:17:01,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:01,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 11:17:01,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:17:01,045 INFO L87 Difference]: Start difference. First operand 549 states and 777 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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-15 11:17:01,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:01,903 INFO L93 Difference]: Finished difference Result 1094 states and 1553 transitions. [2022-04-15 11:17:01,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 11:17:01,904 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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 65 [2022-04-15 11:17:01,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:17:01,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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-15 11:17:01,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 570 transitions. [2022-04-15 11:17:01,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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-15 11:17:01,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 570 transitions. [2022-04-15 11:17:01,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 570 transitions. [2022-04-15 11:17:02,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 570 edges. 570 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:02,234 INFO L225 Difference]: With dead ends: 1094 [2022-04-15 11:17:02,234 INFO L226 Difference]: Without dead ends: 557 [2022-04-15 11:17:02,250 INFO L912 BasicCegarLoop]: 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-15 11:17:02,250 INFO L913 BasicCegarLoop]: 194 mSDtfsCounter, 815 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:17:02,250 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [815 Valid, 211 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 11:17:02,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2022-04-15 11:17:02,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 551. [2022-04-15 11:17:02,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:17:02,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 557 states. Second operand has 551 states, 546 states have (on average 1.4212454212454213) internal successors, (776), 546 states have internal predecessors, (776), 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-15 11:17:02,357 INFO L74 IsIncluded]: Start isIncluded. First operand 557 states. Second operand has 551 states, 546 states have (on average 1.4212454212454213) internal successors, (776), 546 states have internal predecessors, (776), 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-15 11:17:02,357 INFO L87 Difference]: Start difference. First operand 557 states. Second operand has 551 states, 546 states have (on average 1.4212454212454213) internal successors, (776), 546 states have internal predecessors, (776), 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-15 11:17:02,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:02,367 INFO L93 Difference]: Finished difference Result 557 states and 790 transitions. [2022-04-15 11:17:02,367 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 790 transitions. [2022-04-15 11:17:02,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:02,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:02,368 INFO L74 IsIncluded]: Start isIncluded. First operand has 551 states, 546 states have (on average 1.4212454212454213) internal successors, (776), 546 states have internal predecessors, (776), 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 557 states. [2022-04-15 11:17:02,368 INFO L87 Difference]: Start difference. First operand has 551 states, 546 states have (on average 1.4212454212454213) internal successors, (776), 546 states have internal predecessors, (776), 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 557 states. [2022-04-15 11:17:02,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:17:02,378 INFO L93 Difference]: Finished difference Result 557 states and 790 transitions. [2022-04-15 11:17:02,378 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 790 transitions. [2022-04-15 11:17:02,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:17:02,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:17:02,378 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:17:02,378 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:17:02,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 546 states have (on average 1.4212454212454213) internal successors, (776), 546 states have internal predecessors, (776), 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-15 11:17:02,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 780 transitions. [2022-04-15 11:17:02,391 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 780 transitions. Word has length 65 [2022-04-15 11:17:02,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:17:02,391 INFO L478 AbstractCegarLoop]: Abstraction has 551 states and 780 transitions. [2022-04-15 11:17:02,391 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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-15 11:17:02,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 551 states and 780 transitions. [2022-04-15 11:17:03,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 780 edges. 780 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:17:03,848 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 780 transitions. [2022-04-15 11:17:03,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-15 11:17:03,848 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:17:03,848 INFO L499 BasicCegarLoop]: 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, 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] [2022-04-15 11:17:03,849 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-15 11:17:03,849 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:17:03,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:17:03,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1606826053, now seen corresponding path program 1 times [2022-04-15 11:17:03,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:17:03,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1005628873] [2022-04-15 11:17:04,174 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:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) 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-15 11:17:04,180 INFO L158 Benchmark]: Toolchain (without parser) took 51521.70ms. Allocated memory was 209.7MB in the beginning and 419.4MB in the end (delta: 209.7MB). Free memory was 160.9MB in the beginning and 215.8MB in the end (delta: -55.0MB). Peak memory consumption was 155.5MB. Max. memory is 8.0GB. [2022-04-15 11:17:04,180 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 209.7MB. Free memory was 177.4MB in the beginning and 177.3MB in the end (delta: 75.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 11:17:04,181 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.60ms. Allocated memory is still 209.7MB. Free memory was 160.7MB in the beginning and 181.1MB in the end (delta: -20.4MB). Peak memory consumption was 14.2MB. Max. memory is 8.0GB. [2022-04-15 11:17:04,181 INFO L158 Benchmark]: Boogie Preprocessor took 41.37ms. Allocated memory is still 209.7MB. Free memory was 181.1MB in the beginning and 178.3MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-04-15 11:17:04,181 INFO L158 Benchmark]: RCFGBuilder took 636.11ms. Allocated memory is still 209.7MB. Free memory was 178.3MB in the beginning and 139.5MB in the end (delta: 38.8MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. [2022-04-15 11:17:04,181 INFO L158 Benchmark]: TraceAbstraction took 50468.92ms. Allocated memory was 209.7MB in the beginning and 419.4MB in the end (delta: 209.7MB). Free memory was 139.0MB in the beginning and 215.8MB in the end (delta: -76.8MB). Peak memory consumption was 133.9MB. Max. memory is 8.0GB. [2022-04-15 11:17:04,183 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.09ms. Allocated memory is still 209.7MB. Free memory was 177.4MB in the beginning and 177.3MB in the end (delta: 75.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 371.60ms. Allocated memory is still 209.7MB. Free memory was 160.7MB in the beginning and 181.1MB in the end (delta: -20.4MB). Peak memory consumption was 14.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.37ms. Allocated memory is still 209.7MB. Free memory was 181.1MB in the beginning and 178.3MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 636.11ms. Allocated memory is still 209.7MB. Free memory was 178.3MB in the beginning and 139.5MB in the end (delta: 38.8MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. * TraceAbstraction took 50468.92ms. Allocated memory was 209.7MB in the beginning and 419.4MB in the end (delta: 209.7MB). Free memory was 139.0MB in the beginning and 215.8MB in the end (delta: -76.8MB). Peak memory consumption was 133.9MB. 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-15 11:17:04,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...