/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_13.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 11:16:13,135 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 11:16:13,137 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 11:16:13,169 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 11:16:13,169 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 11:16:13,170 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 11:16:13,176 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 11:16:13,182 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 11:16:13,184 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 11:16:13,190 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 11:16:13,190 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 11:16:13,191 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 11:16:13,191 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 11:16:13,192 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 11:16:13,193 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 11:16:13,194 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 11:16:13,194 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 11:16:13,195 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 11:16:13,196 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 11:16:13,197 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 11:16:13,198 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 11:16:13,202 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 11:16:13,204 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 11:16:13,205 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 11:16:13,206 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 11:16:13,214 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 11:16:13,214 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 11:16:13,215 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 11:16:13,216 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 11:16:13,216 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 11:16:13,217 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 11:16:13,217 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 11:16:13,219 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 11:16:13,219 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 11:16:13,220 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 11:16:13,221 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 11:16:13,221 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 11:16:13,221 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 11:16:13,222 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 11:16:13,222 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 11:16:13,222 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 11:16:13,225 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 11:16:13,226 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:13,235 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 11:16:13,236 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 11:16:13,237 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 11:16:13,237 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 11:16:13,237 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 11:16:13,237 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 11:16:13,237 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 11:16:13,237 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 11:16:13,237 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 11:16:13,238 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 11:16:13,238 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 11:16:13,238 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 11:16:13,239 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 11:16:13,239 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 11:16:13,239 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 11:16:13,239 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 11:16:13,239 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 11:16:13,239 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 11:16:13,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:16:13,239 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 11:16:13,240 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 11:16:13,240 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 11:16:13,240 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 11:16:13,240 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 11:16:13,240 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 11:16:13,240 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:13,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 11:16:13,511 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 11:16:13,514 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 11:16:13,515 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 11:16:13,515 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 11:16:13,516 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_13.cil.c [2022-04-15 11:16:13,577 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/842ca7e11/d17d4eea576e4d1e92c76af3795c708d/FLAGb713e976f [2022-04-15 11:16:13,962 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 11:16:13,963 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_13.cil.c [2022-04-15 11:16:13,977 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/842ca7e11/d17d4eea576e4d1e92c76af3795c708d/FLAGb713e976f [2022-04-15 11:16:14,368 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/842ca7e11/d17d4eea576e4d1e92c76af3795c708d [2022-04-15 11:16:14,370 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 11:16:14,371 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 11:16:14,374 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 11:16:14,374 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 11:16:14,384 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 11:16:14,385 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:16:14" (1/1) ... [2022-04-15 11:16:14,386 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ea6a5a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:16:14, skipping insertion in model container [2022-04-15 11:16:14,386 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:16:14" (1/1) ... [2022-04-15 11:16:14,392 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 11:16:14,425 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 11:16:14,642 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_13.cil.c[45032,45045] [2022-04-15 11:16:14,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:16:14,657 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 11:16:14,711 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_13.cil.c[45032,45045] [2022-04-15 11:16:14,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:16:14,734 INFO L208 MainTranslator]: Completed translation [2022-04-15 11:16:14,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:16:14 WrapperNode [2022-04-15 11:16:14,735 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 11:16:14,736 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 11:16:14,736 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 11:16:14,736 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 11:16:14,745 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:14" (1/1) ... [2022-04-15 11:16:14,745 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:14" (1/1) ... [2022-04-15 11:16:14,764 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:14" (1/1) ... [2022-04-15 11:16:14,765 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:14" (1/1) ... [2022-04-15 11:16:14,781 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:14" (1/1) ... [2022-04-15 11:16:14,794 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:14" (1/1) ... [2022-04-15 11:16:14,797 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:14" (1/1) ... [2022-04-15 11:16:14,801 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 11:16:14,801 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 11:16:14,802 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 11:16:14,802 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 11:16:14,802 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:16:14" (1/1) ... [2022-04-15 11:16:14,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:16:14,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:16:14,845 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:14,859 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:14,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 11:16:14,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 11:16:14,889 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 11:16:14,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-15 11:16:14,889 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 11:16:14,889 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 11:16:14,889 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 11:16:14,890 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 11:16:14,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 11:16:14,890 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-15 11:16:14,890 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 11:16:14,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-15 11:16:14,893 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-15 11:16:14,893 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 11:16:14,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 11:16:14,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 11:16:14,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 11:16:14,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 11:16:14,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 11:16:14,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 11:16:14,999 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 11:16:15,001 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 11:16:15,075 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:16:15,618 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-04-15 11:16:15,619 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-04-15 11:16:15,628 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 11:16:15,639 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 11:16:15,639 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 11:16:15,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:16:15 BoogieIcfgContainer [2022-04-15 11:16:15,641 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 11:16:15,644 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 11:16:15,644 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 11:16:15,648 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 11:16:15,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 11:16:14" (1/3) ... [2022-04-15 11:16:15,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a2a61ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:16:15, skipping insertion in model container [2022-04-15 11:16:15,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:16:14" (2/3) ... [2022-04-15 11:16:15,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a2a61ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:16:15, skipping insertion in model container [2022-04-15 11:16:15,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:16:15" (3/3) ... [2022-04-15 11:16:15,650 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_13.cil.c [2022-04-15 11:16:15,655 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 11:16:15,656 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 11:16:15,706 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 11:16:15,714 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:15,714 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 11:16:15,756 INFO L276 IsEmpty]: Start isEmpty. Operand has 162 states, 154 states have (on average 1.7272727272727273) internal successors, (266), 155 states have internal predecessors, (266), 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:15,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 11:16:15,768 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:16:15,769 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] [2022-04-15 11:16:15,770 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:16:15,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:16:15,774 INFO L85 PathProgramCache]: Analyzing trace with hash -963493744, now seen corresponding path program 1 times [2022-04-15 11:16:15,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:15,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1101314635] [2022-04-15 11:16:15,792 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:16:15,793 INFO L85 PathProgramCache]: Analyzing trace with hash -963493744, now seen corresponding path program 2 times [2022-04-15 11:16:15,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:16:15,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826499709] [2022-04-15 11:16:15,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:16:15,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:16:15,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:16,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:16:16,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:16,133 INFO L290 TraceCheckUtils]: 0: Hoare triple {172#(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); {165#true} is VALID [2022-04-15 11:16:16,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {165#true} assume true; {165#true} is VALID [2022-04-15 11:16:16,133 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {165#true} {165#true} #674#return; {165#true} is VALID [2022-04-15 11:16:16,135 INFO L272 TraceCheckUtils]: 0: Hoare triple {165#true} call ULTIMATE.init(); {172#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:16:16,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {172#(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); {165#true} is VALID [2022-04-15 11:16:16,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {165#true} assume true; {165#true} is VALID [2022-04-15 11:16:16,136 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {165#true} {165#true} #674#return; {165#true} is VALID [2022-04-15 11:16:16,136 INFO L272 TraceCheckUtils]: 4: Hoare triple {165#true} call #t~ret59 := main(); {165#true} is VALID [2022-04-15 11:16:16,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {165#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {165#true} is VALID [2022-04-15 11:16:16,137 INFO L272 TraceCheckUtils]: 6: Hoare triple {165#true} call #t~ret58 := ssl3_accept(~s~0); {165#true} is VALID [2022-04-15 11:16:16,138 INFO L290 TraceCheckUtils]: 7: Hoare triple {165#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;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___7~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___8~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___9~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___10~0 := #t~nondet29;havoc #t~nondet29;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;havoc ~__cil_tmp61~0;~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; {165#true} is VALID [2022-04-15 11:16:16,143 INFO L290 TraceCheckUtils]: 8: Hoare triple {165#true} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {165#true} is VALID [2022-04-15 11:16:16,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {165#true} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {165#true} is VALID [2022-04-15 11:16:16,143 INFO L290 TraceCheckUtils]: 10: Hoare triple {165#true} assume !(0 != 12288 + ~tmp___1~0); {165#true} is VALID [2022-04-15 11:16:16,143 INFO L290 TraceCheckUtils]: 11: Hoare triple {165#true} assume !(0 == ~s__cert~0); {165#true} is VALID [2022-04-15 11:16:16,144 INFO L290 TraceCheckUtils]: 12: Hoare triple {165#true} assume !false; {165#true} is VALID [2022-04-15 11:16:16,144 INFO L290 TraceCheckUtils]: 13: Hoare triple {165#true} ~state~0 := ~s__state~0; {170#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-15 11:16:16,145 INFO L290 TraceCheckUtils]: 14: Hoare triple {170#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(12292 == ~s__state~0); {170#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-15 11:16:16,145 INFO L290 TraceCheckUtils]: 15: Hoare triple {170#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(16384 == ~s__state~0); {170#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-15 11:16:16,146 INFO L290 TraceCheckUtils]: 16: Hoare triple {170#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8192 == ~s__state~0); {170#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-15 11:16:16,146 INFO L290 TraceCheckUtils]: 17: Hoare triple {170#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(24576 == ~s__state~0); {170#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-15 11:16:16,147 INFO L290 TraceCheckUtils]: 18: Hoare triple {170#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8195 == ~s__state~0); {170#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-15 11:16:16,149 INFO L290 TraceCheckUtils]: 19: Hoare triple {170#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume 8480 == ~s__state~0; {171#(<= ssl3_accept_~state~0 8480)} is VALID [2022-04-15 11:16:16,149 INFO L290 TraceCheckUtils]: 20: Hoare triple {171#(<= ssl3_accept_~state~0 8480)} ~s__shutdown~0 := 0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~ret~0 := #t~nondet35;havoc #t~nondet35; {171#(<= ssl3_accept_~state~0 8480)} is VALID [2022-04-15 11:16:16,150 INFO L290 TraceCheckUtils]: 21: Hoare triple {171#(<= ssl3_accept_~state~0 8480)} assume !(~ret~0 <= 0);~s__s3__tmp__next_state___0~0 := 8482;~s__state~0 := 8448;~s__init_num~0 := 0; {171#(<= ssl3_accept_~state~0 8480)} is VALID [2022-04-15 11:16:16,150 INFO L290 TraceCheckUtils]: 22: Hoare triple {171#(<= ssl3_accept_~state~0 8480)} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {171#(<= ssl3_accept_~state~0 8480)} is VALID [2022-04-15 11:16:16,151 INFO L290 TraceCheckUtils]: 23: Hoare triple {171#(<= ssl3_accept_~state~0 8480)} assume 0 == ~s__s3__tmp__reuse_message~0; {171#(<= ssl3_accept_~state~0 8480)} is VALID [2022-04-15 11:16:16,151 INFO L290 TraceCheckUtils]: 24: Hoare triple {171#(<= ssl3_accept_~state~0 8480)} assume 0 == ~skip~0; {171#(<= ssl3_accept_~state~0 8480)} is VALID [2022-04-15 11:16:16,152 INFO L290 TraceCheckUtils]: 25: Hoare triple {171#(<= ssl3_accept_~state~0 8480)} assume 8528 == ~state~0; {166#false} is VALID [2022-04-15 11:16:16,152 INFO L290 TraceCheckUtils]: 26: Hoare triple {166#false} assume 8544 == ~s__state~0; {166#false} is VALID [2022-04-15 11:16:16,152 INFO L290 TraceCheckUtils]: 27: Hoare triple {166#false} assume 1024 != ~tmp___7~0; {166#false} is VALID [2022-04-15 11:16:16,152 INFO L290 TraceCheckUtils]: 28: Hoare triple {166#false} assume 512 != ~tmp___7~0; {166#false} is VALID [2022-04-15 11:16:16,153 INFO L290 TraceCheckUtils]: 29: Hoare triple {166#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {166#false} is VALID [2022-04-15 11:16:16,153 INFO L290 TraceCheckUtils]: 30: Hoare triple {166#false} assume 4294967266 != ~l~0 % 4294967296; {166#false} is VALID [2022-04-15 11:16:16,153 INFO L290 TraceCheckUtils]: 31: Hoare triple {166#false} assume !false; {166#false} is VALID [2022-04-15 11:16:16,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:16,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:16:16,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826499709] [2022-04-15 11:16:16,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826499709] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:16,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:16,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:16:16,159 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:16:16,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1101314635] [2022-04-15 11:16:16,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1101314635] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:16,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:16,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:16:16,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284879810] [2022-04-15 11:16:16,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:16:16,168 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-15 11:16:16,169 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:16:16,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:16,210 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:16,211 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:16:16,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:16,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:16:16,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:16:16,262 INFO L87 Difference]: Start difference. First operand has 162 states, 154 states have (on average 1.7272727272727273) internal successors, (266), 155 states have internal predecessors, (266), 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 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:17,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:17,659 INFO L93 Difference]: Finished difference Result 364 states and 611 transitions. [2022-04-15 11:16:17,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 11:16:17,660 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-15 11:16:17,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:16:17,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:17,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 611 transitions. [2022-04-15 11:16:17,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:17,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 611 transitions. [2022-04-15 11:16:17,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 611 transitions. [2022-04-15 11:16:18,245 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 611 edges. 611 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:18,259 INFO L225 Difference]: With dead ends: 364 [2022-04-15 11:16:18,260 INFO L226 Difference]: Without dead ends: 185 [2022-04-15 11:16:18,263 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-15 11:16:18,266 INFO L913 BasicCegarLoop]: 231 mSDtfsCounter, 542 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:16:18,266 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [543 Valid, 246 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 11:16:18,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-04-15 11:16:18,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 162. [2022-04-15 11:16:18,384 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:16:18,385 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand has 162 states, 157 states have (on average 1.5414012738853504) internal successors, (242), 157 states have internal predecessors, (242), 3 states have call successors, (3), 3 states 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,387 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand has 162 states, 157 states have (on average 1.5414012738853504) internal successors, (242), 157 states have internal predecessors, (242), 3 states have call successors, (3), 3 states 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,387 INFO L87 Difference]: Start difference. First operand 185 states. Second operand has 162 states, 157 states have (on average 1.5414012738853504) internal successors, (242), 157 states have internal predecessors, (242), 3 states have call successors, (3), 3 states 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,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:18,396 INFO L93 Difference]: Finished difference Result 185 states and 276 transitions. [2022-04-15 11:16:18,396 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 276 transitions. [2022-04-15 11:16:18,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:18,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:18,398 INFO L74 IsIncluded]: Start isIncluded. First operand has 162 states, 157 states have (on average 1.5414012738853504) internal successors, (242), 157 states have internal predecessors, (242), 3 states have call successors, (3), 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 185 states. [2022-04-15 11:16:18,399 INFO L87 Difference]: Start difference. First operand has 162 states, 157 states have (on average 1.5414012738853504) internal successors, (242), 157 states have internal predecessors, (242), 3 states have call successors, (3), 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 185 states. [2022-04-15 11:16:18,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:18,407 INFO L93 Difference]: Finished difference Result 185 states and 276 transitions. [2022-04-15 11:16:18,407 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 276 transitions. [2022-04-15 11:16:18,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:18,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:18,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:16:18,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:16:18,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 157 states have (on average 1.5414012738853504) internal successors, (242), 157 states have internal predecessors, (242), 3 states have call successors, (3), 3 states 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,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 246 transitions. [2022-04-15 11:16:18,416 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 246 transitions. Word has length 32 [2022-04-15 11:16:18,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:16:18,417 INFO L478 AbstractCegarLoop]: Abstraction has 162 states and 246 transitions. [2022-04-15 11:16:18,417 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:18,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 162 states and 246 transitions. [2022-04-15 11:16:18,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 246 edges. 246 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:18,644 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 246 transitions. [2022-04-15 11:16:18,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 11:16:18,645 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:16:18,645 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] [2022-04-15 11:16:18,645 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 11:16:18,646 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:16:18,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:16:18,646 INFO L85 PathProgramCache]: Analyzing trace with hash -76895489, now seen corresponding path program 1 times [2022-04-15 11:16:18,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:18,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2024359358] [2022-04-15 11:16:18,647 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:16:18,647 INFO L85 PathProgramCache]: Analyzing trace with hash -76895489, now seen corresponding path program 2 times [2022-04-15 11:16:18,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:16:18,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306259362] [2022-04-15 11:16:18,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:16:18,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:16:18,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:18,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:16:18,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:18,732 INFO L290 TraceCheckUtils]: 0: Hoare triple {1613#(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); {1606#true} is VALID [2022-04-15 11:16:18,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {1606#true} assume true; {1606#true} is VALID [2022-04-15 11:16:18,733 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1606#true} {1606#true} #674#return; {1606#true} is VALID [2022-04-15 11:16:18,733 INFO L272 TraceCheckUtils]: 0: Hoare triple {1606#true} call ULTIMATE.init(); {1613#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:16:18,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {1613#(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); {1606#true} is VALID [2022-04-15 11:16:18,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {1606#true} assume true; {1606#true} is VALID [2022-04-15 11:16:18,734 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1606#true} {1606#true} #674#return; {1606#true} is VALID [2022-04-15 11:16:18,734 INFO L272 TraceCheckUtils]: 4: Hoare triple {1606#true} call #t~ret59 := main(); {1606#true} is VALID [2022-04-15 11:16:18,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {1606#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {1606#true} is VALID [2022-04-15 11:16:18,734 INFO L272 TraceCheckUtils]: 6: Hoare triple {1606#true} call #t~ret58 := ssl3_accept(~s~0); {1606#true} is VALID [2022-04-15 11:16:18,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {1606#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;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___7~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___8~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___9~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___10~0 := #t~nondet29;havoc #t~nondet29;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;havoc ~__cil_tmp61~0;~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; {1606#true} is VALID [2022-04-15 11:16:18,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {1606#true} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {1606#true} is VALID [2022-04-15 11:16:18,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {1606#true} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {1606#true} is VALID [2022-04-15 11:16:18,735 INFO L290 TraceCheckUtils]: 10: Hoare triple {1606#true} assume !(0 != 12288 + ~tmp___1~0); {1606#true} is VALID [2022-04-15 11:16:18,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {1606#true} assume !(0 == ~s__cert~0); {1606#true} is VALID [2022-04-15 11:16:18,735 INFO L290 TraceCheckUtils]: 12: Hoare triple {1606#true} assume !false; {1606#true} is VALID [2022-04-15 11:16:18,736 INFO L290 TraceCheckUtils]: 13: Hoare triple {1606#true} ~state~0 := ~s__state~0; {1611#(<= ssl3_accept_~s__state~0 ssl3_accept_~state~0)} is VALID [2022-04-15 11:16:18,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {1611#(<= ssl3_accept_~s__state~0 ssl3_accept_~state~0)} assume 12292 == ~s__state~0; {1612#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-15 11:16:18,737 INFO L290 TraceCheckUtils]: 15: Hoare triple {1612#(<= 12292 ssl3_accept_~state~0)} ~s__new_session~0 := 1; {1612#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-15 11:16:18,737 INFO L290 TraceCheckUtils]: 16: Hoare triple {1612#(<= 12292 ssl3_accept_~state~0)} ~s__server~0 := 1; {1612#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-15 11:16:18,738 INFO L290 TraceCheckUtils]: 17: Hoare triple {1612#(<= 12292 ssl3_accept_~state~0)} assume 0 != ~cb~0; {1612#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-15 11:16:18,738 INFO L290 TraceCheckUtils]: 18: Hoare triple {1612#(<= 12292 ssl3_accept_~state~0)} ~__cil_tmp55~0 := 8 * ~s__version~0; {1612#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-15 11:16:18,738 INFO L290 TraceCheckUtils]: 19: Hoare triple {1612#(<= 12292 ssl3_accept_~state~0)} assume !(3 != ~__cil_tmp55~0);~s__type~0 := 8192; {1612#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-15 11:16:18,739 INFO L290 TraceCheckUtils]: 20: Hoare triple {1612#(<= 12292 ssl3_accept_~state~0)} assume !(0 == ~s__init_buf___0~0); {1612#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-15 11:16:18,739 INFO L290 TraceCheckUtils]: 21: Hoare triple {1612#(<= 12292 ssl3_accept_~state~0)} assume !(0 == ~tmp___4~0);~s__init_num~0 := 0; {1612#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-15 11:16:18,740 INFO L290 TraceCheckUtils]: 22: Hoare triple {1612#(<= 12292 ssl3_accept_~state~0)} 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; {1612#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-15 11:16:18,740 INFO L290 TraceCheckUtils]: 23: Hoare triple {1612#(<= 12292 ssl3_accept_~state~0)} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {1612#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-15 11:16:18,741 INFO L290 TraceCheckUtils]: 24: Hoare triple {1612#(<= 12292 ssl3_accept_~state~0)} assume 0 == ~s__s3__tmp__reuse_message~0; {1612#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-15 11:16:18,741 INFO L290 TraceCheckUtils]: 25: Hoare triple {1612#(<= 12292 ssl3_accept_~state~0)} assume 0 == ~skip~0; {1612#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-15 11:16:18,741 INFO L290 TraceCheckUtils]: 26: Hoare triple {1612#(<= 12292 ssl3_accept_~state~0)} assume 8528 == ~state~0; {1607#false} is VALID [2022-04-15 11:16:18,742 INFO L290 TraceCheckUtils]: 27: Hoare triple {1607#false} assume 8544 == ~s__state~0; {1607#false} is VALID [2022-04-15 11:16:18,742 INFO L290 TraceCheckUtils]: 28: Hoare triple {1607#false} assume 1024 != ~tmp___7~0; {1607#false} is VALID [2022-04-15 11:16:18,742 INFO L290 TraceCheckUtils]: 29: Hoare triple {1607#false} assume 512 != ~tmp___7~0; {1607#false} is VALID [2022-04-15 11:16:18,742 INFO L290 TraceCheckUtils]: 30: Hoare triple {1607#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {1607#false} is VALID [2022-04-15 11:16:18,742 INFO L290 TraceCheckUtils]: 31: Hoare triple {1607#false} assume 4294967266 != ~l~0 % 4294967296; {1607#false} is VALID [2022-04-15 11:16:18,742 INFO L290 TraceCheckUtils]: 32: Hoare triple {1607#false} assume !false; {1607#false} is VALID [2022-04-15 11:16:18,743 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:18,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:16:18,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306259362] [2022-04-15 11:16:18,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306259362] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:18,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:18,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:16:18,744 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:16:18,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2024359358] [2022-04-15 11:16:18,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2024359358] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:18,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:18,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:16:18,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861653644] [2022-04-15 11:16:18,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:16:18,745 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 11:16:18,746 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:16:18,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:18,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:18,770 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:16:18,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:18,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:16:18,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:16:18,771 INFO L87 Difference]: Start difference. First operand 162 states and 246 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:19,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:19,780 INFO L93 Difference]: Finished difference Result 330 states and 501 transitions. [2022-04-15 11:16:19,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:16:19,780 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 11:16:19,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:16:19,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:19,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-15 11:16:19,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:19,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-15 11:16:19,791 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 466 transitions. [2022-04-15 11:16:20,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 466 edges. 466 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:20,172 INFO L225 Difference]: With dead ends: 330 [2022-04-15 11:16:20,172 INFO L226 Difference]: Without dead ends: 182 [2022-04-15 11:16:20,173 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-15 11:16:20,174 INFO L913 BasicCegarLoop]: 169 mSDtfsCounter, 424 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:16:20,175 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [424 Valid, 181 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 11:16:20,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-04-15 11:16:20,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 152. [2022-04-15 11:16:20,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:16:20,333 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand has 152 states, 147 states have (on average 1.5578231292517006) internal successors, (229), 147 states have internal predecessors, (229), 3 states have call successors, (3), 3 states 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,334 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand has 152 states, 147 states have (on average 1.5578231292517006) internal successors, (229), 147 states have internal predecessors, (229), 3 states have call successors, (3), 3 states 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,334 INFO L87 Difference]: Start difference. First operand 182 states. Second operand has 152 states, 147 states have (on average 1.5578231292517006) internal successors, (229), 147 states have internal predecessors, (229), 3 states have call successors, (3), 3 states 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,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:20,343 INFO L93 Difference]: Finished difference Result 182 states and 272 transitions. [2022-04-15 11:16:20,343 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 272 transitions. [2022-04-15 11:16:20,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:20,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:20,345 INFO L74 IsIncluded]: Start isIncluded. First operand has 152 states, 147 states have (on average 1.5578231292517006) internal successors, (229), 147 states have internal predecessors, (229), 3 states have call successors, (3), 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 182 states. [2022-04-15 11:16:20,345 INFO L87 Difference]: Start difference. First operand has 152 states, 147 states have (on average 1.5578231292517006) internal successors, (229), 147 states have internal predecessors, (229), 3 states have call successors, (3), 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 182 states. [2022-04-15 11:16:20,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:20,354 INFO L93 Difference]: Finished difference Result 182 states and 272 transitions. [2022-04-15 11:16:20,354 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 272 transitions. [2022-04-15 11:16:20,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:20,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:20,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:16:20,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:16:20,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 147 states have (on average 1.5578231292517006) internal successors, (229), 147 states have internal predecessors, (229), 3 states have call successors, (3), 3 states 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,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 233 transitions. [2022-04-15 11:16:20,363 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 233 transitions. Word has length 33 [2022-04-15 11:16:20,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:16:20,363 INFO L478 AbstractCegarLoop]: Abstraction has 152 states and 233 transitions. [2022-04-15 11:16:20,364 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:20,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 152 states and 233 transitions. [2022-04-15 11:16:20,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 233 edges. 233 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:20,588 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 233 transitions. [2022-04-15 11:16:20,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 11:16:20,588 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:16:20,588 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] [2022-04-15 11:16:20,589 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 11:16:20,589 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:16:20,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:16:20,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1425858867, now seen corresponding path program 1 times [2022-04-15 11:16:20,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:20,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [927373700] [2022-04-15 11:16:20,590 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:16:20,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1425858867, now seen corresponding path program 2 times [2022-04-15 11:16:20,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:16:20,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047622196] [2022-04-15 11:16:20,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:16:20,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:16:20,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:20,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:16:20,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:20,681 INFO L290 TraceCheckUtils]: 0: Hoare triple {2956#(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); {2950#true} is VALID [2022-04-15 11:16:20,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-15 11:16:20,682 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2950#true} {2950#true} #674#return; {2950#true} is VALID [2022-04-15 11:16:20,682 INFO L272 TraceCheckUtils]: 0: Hoare triple {2950#true} call ULTIMATE.init(); {2956#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:16:20,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {2956#(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); {2950#true} is VALID [2022-04-15 11:16:20,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-15 11:16:20,683 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2950#true} {2950#true} #674#return; {2950#true} is VALID [2022-04-15 11:16:20,683 INFO L272 TraceCheckUtils]: 4: Hoare triple {2950#true} call #t~ret59 := main(); {2950#true} is VALID [2022-04-15 11:16:20,683 INFO L290 TraceCheckUtils]: 5: Hoare triple {2950#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {2950#true} is VALID [2022-04-15 11:16:20,683 INFO L272 TraceCheckUtils]: 6: Hoare triple {2950#true} call #t~ret58 := ssl3_accept(~s~0); {2950#true} is VALID [2022-04-15 11:16:20,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {2950#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;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___7~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___8~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___9~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___10~0 := #t~nondet29;havoc #t~nondet29;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;havoc ~__cil_tmp61~0;~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; {2950#true} is VALID [2022-04-15 11:16:20,684 INFO L290 TraceCheckUtils]: 8: Hoare triple {2950#true} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {2950#true} is VALID [2022-04-15 11:16:20,684 INFO L290 TraceCheckUtils]: 9: Hoare triple {2950#true} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {2950#true} is VALID [2022-04-15 11:16:20,684 INFO L290 TraceCheckUtils]: 10: Hoare triple {2950#true} assume !(0 != 12288 + ~tmp___1~0); {2950#true} is VALID [2022-04-15 11:16:20,684 INFO L290 TraceCheckUtils]: 11: Hoare triple {2950#true} assume !(0 == ~s__cert~0); {2950#true} is VALID [2022-04-15 11:16:20,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {2950#true} assume !false; {2950#true} is VALID [2022-04-15 11:16:20,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {2950#true} ~state~0 := ~s__state~0; {2950#true} is VALID [2022-04-15 11:16:20,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {2950#true} assume !(12292 == ~s__state~0); {2950#true} is VALID [2022-04-15 11:16:20,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {2950#true} assume !(16384 == ~s__state~0); {2950#true} is VALID [2022-04-15 11:16:20,685 INFO L290 TraceCheckUtils]: 16: Hoare triple {2950#true} assume !(8192 == ~s__state~0); {2950#true} is VALID [2022-04-15 11:16:20,685 INFO L290 TraceCheckUtils]: 17: Hoare triple {2950#true} assume !(24576 == ~s__state~0); {2950#true} is VALID [2022-04-15 11:16:20,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {2950#true} assume !(8195 == ~s__state~0); {2950#true} is VALID [2022-04-15 11:16:20,685 INFO L290 TraceCheckUtils]: 19: Hoare triple {2950#true} assume !(8480 == ~s__state~0); {2950#true} is VALID [2022-04-15 11:16:20,685 INFO L290 TraceCheckUtils]: 20: Hoare triple {2950#true} assume !(8481 == ~s__state~0); {2950#true} is VALID [2022-04-15 11:16:20,686 INFO L290 TraceCheckUtils]: 21: Hoare triple {2950#true} assume 8482 == ~s__state~0; {2950#true} is VALID [2022-04-15 11:16:20,686 INFO L290 TraceCheckUtils]: 22: Hoare triple {2950#true} ~s__state~0 := 3; {2955#(= ssl3_accept_~s__state~0 3)} is VALID [2022-04-15 11:16:20,687 INFO L290 TraceCheckUtils]: 23: Hoare triple {2955#(= ssl3_accept_~s__state~0 3)} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {2955#(= ssl3_accept_~s__state~0 3)} is VALID [2022-04-15 11:16:20,687 INFO L290 TraceCheckUtils]: 24: Hoare triple {2955#(= ssl3_accept_~s__state~0 3)} assume 0 == ~s__s3__tmp__reuse_message~0; {2955#(= ssl3_accept_~s__state~0 3)} is VALID [2022-04-15 11:16:20,687 INFO L290 TraceCheckUtils]: 25: Hoare triple {2955#(= ssl3_accept_~s__state~0 3)} assume 0 == ~skip~0; {2955#(= ssl3_accept_~s__state~0 3)} is VALID [2022-04-15 11:16:20,688 INFO L290 TraceCheckUtils]: 26: Hoare triple {2955#(= ssl3_accept_~s__state~0 3)} assume 8528 == ~state~0; {2955#(= ssl3_accept_~s__state~0 3)} is VALID [2022-04-15 11:16:20,688 INFO L290 TraceCheckUtils]: 27: Hoare triple {2955#(= ssl3_accept_~s__state~0 3)} assume 8544 == ~s__state~0; {2951#false} is VALID [2022-04-15 11:16:20,688 INFO L290 TraceCheckUtils]: 28: Hoare triple {2951#false} assume 1024 != ~tmp___7~0; {2951#false} is VALID [2022-04-15 11:16:20,688 INFO L290 TraceCheckUtils]: 29: Hoare triple {2951#false} assume 512 != ~tmp___7~0; {2951#false} is VALID [2022-04-15 11:16:20,689 INFO L290 TraceCheckUtils]: 30: Hoare triple {2951#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {2951#false} is VALID [2022-04-15 11:16:20,689 INFO L290 TraceCheckUtils]: 31: Hoare triple {2951#false} assume 4294967266 != ~l~0 % 4294967296; {2951#false} is VALID [2022-04-15 11:16:20,689 INFO L290 TraceCheckUtils]: 32: Hoare triple {2951#false} assume !false; {2951#false} is VALID [2022-04-15 11:16:20,689 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,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:16:20,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047622196] [2022-04-15 11:16:20,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047622196] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:20,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:20,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:16:20,690 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:16:20,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [927373700] [2022-04-15 11:16:20,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [927373700] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:20,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:20,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:16:20,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537800520] [2022-04-15 11:16:20,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:16:20,691 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 11:16:20,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:16:20,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:20,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:20,714 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:16:20,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:20,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:16:20,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:16:20,715 INFO L87 Difference]: Start difference. First operand 152 states and 233 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:21,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:21,539 INFO L93 Difference]: Finished difference Result 337 states and 535 transitions. [2022-04-15 11:16:21,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:16:21,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 11:16:21,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:16:21,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:21,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 519 transitions. [2022-04-15 11:16:21,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:21,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 519 transitions. [2022-04-15 11:16:21,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 519 transitions. [2022-04-15 11:16:21,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 519 edges. 519 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:21,919 INFO L225 Difference]: With dead ends: 337 [2022-04-15 11:16:21,919 INFO L226 Difference]: Without dead ends: 151 [2022-04-15 11:16:21,920 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:16:21,921 INFO L913 BasicCegarLoop]: 237 mSDtfsCounter, 269 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:16:21,921 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [269 Valid, 244 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 11:16:21,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-04-15 11:16:22,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2022-04-15 11:16:22,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:16:22,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 151 states. Second operand has 151 states, 146 states have (on average 1.547945205479452) internal successors, (226), 146 states have internal predecessors, (226), 3 states have call successors, (3), 3 states 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,113 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand has 151 states, 146 states have (on average 1.547945205479452) internal successors, (226), 146 states have internal predecessors, (226), 3 states have call successors, (3), 3 states 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,114 INFO L87 Difference]: Start difference. First operand 151 states. Second operand has 151 states, 146 states have (on average 1.547945205479452) internal successors, (226), 146 states have internal predecessors, (226), 3 states have call successors, (3), 3 states 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,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:22,118 INFO L93 Difference]: Finished difference Result 151 states and 230 transitions. [2022-04-15 11:16:22,118 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 230 transitions. [2022-04-15 11:16:22,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:22,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:22,119 INFO L74 IsIncluded]: Start isIncluded. First operand has 151 states, 146 states have (on average 1.547945205479452) internal successors, (226), 146 states have internal predecessors, (226), 3 states have call successors, (3), 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 151 states. [2022-04-15 11:16:22,122 INFO L87 Difference]: Start difference. First operand has 151 states, 146 states have (on average 1.547945205479452) internal successors, (226), 146 states have internal predecessors, (226), 3 states have call successors, (3), 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 151 states. [2022-04-15 11:16:22,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:22,126 INFO L93 Difference]: Finished difference Result 151 states and 230 transitions. [2022-04-15 11:16:22,126 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 230 transitions. [2022-04-15 11:16:22,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:22,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:22,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:16:22,128 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:16:22,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 146 states have (on average 1.547945205479452) internal successors, (226), 146 states have internal predecessors, (226), 3 states have call successors, (3), 3 states 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,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 230 transitions. [2022-04-15 11:16:22,132 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 230 transitions. Word has length 33 [2022-04-15 11:16:22,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:16:22,133 INFO L478 AbstractCegarLoop]: Abstraction has 151 states and 230 transitions. [2022-04-15 11:16:22,133 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:22,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 151 states and 230 transitions. [2022-04-15 11:16:22,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 230 edges. 230 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:22,313 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 230 transitions. [2022-04-15 11:16:22,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 11:16:22,313 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:16:22,313 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] [2022-04-15 11:16:22,314 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 11:16:22,314 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:16:22,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:16:22,314 INFO L85 PathProgramCache]: Analyzing trace with hash -319735020, now seen corresponding path program 1 times [2022-04-15 11:16:22,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:22,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [710906532] [2022-04-15 11:16:22,315 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:16:22,315 INFO L85 PathProgramCache]: Analyzing trace with hash -319735020, now seen corresponding path program 2 times [2022-04-15 11:16:22,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:16:22,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651649597] [2022-04-15 11:16:22,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:16:22,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:16:22,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:22,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:16:22,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:22,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {4247#(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); {4240#true} is VALID [2022-04-15 11:16:22,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {4240#true} assume true; {4240#true} is VALID [2022-04-15 11:16:22,395 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4240#true} {4240#true} #674#return; {4240#true} is VALID [2022-04-15 11:16:22,396 INFO L272 TraceCheckUtils]: 0: Hoare triple {4240#true} call ULTIMATE.init(); {4247#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:16:22,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {4247#(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); {4240#true} is VALID [2022-04-15 11:16:22,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {4240#true} assume true; {4240#true} is VALID [2022-04-15 11:16:22,396 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4240#true} {4240#true} #674#return; {4240#true} is VALID [2022-04-15 11:16:22,396 INFO L272 TraceCheckUtils]: 4: Hoare triple {4240#true} call #t~ret59 := main(); {4240#true} is VALID [2022-04-15 11:16:22,420 INFO L290 TraceCheckUtils]: 5: Hoare triple {4240#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {4240#true} is VALID [2022-04-15 11:16:22,421 INFO L272 TraceCheckUtils]: 6: Hoare triple {4240#true} call #t~ret58 := ssl3_accept(~s~0); {4240#true} is VALID [2022-04-15 11:16:22,422 INFO L290 TraceCheckUtils]: 7: Hoare triple {4240#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;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___7~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___8~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___9~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___10~0 := #t~nondet29;havoc #t~nondet29;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;havoc ~__cil_tmp61~0;~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; {4240#true} is VALID [2022-04-15 11:16:22,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {4240#true} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {4240#true} is VALID [2022-04-15 11:16:22,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {4240#true} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {4240#true} is VALID [2022-04-15 11:16:22,422 INFO L290 TraceCheckUtils]: 10: Hoare triple {4240#true} assume !(0 != 12288 + ~tmp___1~0); {4240#true} is VALID [2022-04-15 11:16:22,422 INFO L290 TraceCheckUtils]: 11: Hoare triple {4240#true} assume !(0 == ~s__cert~0); {4240#true} is VALID [2022-04-15 11:16:22,423 INFO L290 TraceCheckUtils]: 12: Hoare triple {4240#true} assume !false; {4240#true} is VALID [2022-04-15 11:16:22,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {4240#true} ~state~0 := ~s__state~0; {4245#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-15 11:16:22,432 INFO L290 TraceCheckUtils]: 14: Hoare triple {4245#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(12292 == ~s__state~0); {4245#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-15 11:16:22,433 INFO L290 TraceCheckUtils]: 15: Hoare triple {4245#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(16384 == ~s__state~0); {4245#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-15 11:16:22,433 INFO L290 TraceCheckUtils]: 16: Hoare triple {4245#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8192 == ~s__state~0); {4245#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-15 11:16:22,434 INFO L290 TraceCheckUtils]: 17: Hoare triple {4245#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(24576 == ~s__state~0); {4245#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-15 11:16:22,434 INFO L290 TraceCheckUtils]: 18: Hoare triple {4245#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8195 == ~s__state~0); {4245#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-15 11:16:22,436 INFO L290 TraceCheckUtils]: 19: Hoare triple {4245#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8480 == ~s__state~0); {4245#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-15 11:16:22,437 INFO L290 TraceCheckUtils]: 20: Hoare triple {4245#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume 8481 == ~s__state~0; {4246#(<= ssl3_accept_~state~0 8481)} is VALID [2022-04-15 11:16:22,437 INFO L290 TraceCheckUtils]: 21: Hoare triple {4246#(<= ssl3_accept_~state~0 8481)} ~s__shutdown~0 := 0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~ret~0 := #t~nondet35;havoc #t~nondet35; {4246#(<= ssl3_accept_~state~0 8481)} is VALID [2022-04-15 11:16:22,438 INFO L290 TraceCheckUtils]: 22: Hoare triple {4246#(<= ssl3_accept_~state~0 8481)} assume !(~ret~0 <= 0);~s__s3__tmp__next_state___0~0 := 8482;~s__state~0 := 8448;~s__init_num~0 := 0; {4246#(<= ssl3_accept_~state~0 8481)} is VALID [2022-04-15 11:16:22,438 INFO L290 TraceCheckUtils]: 23: Hoare triple {4246#(<= ssl3_accept_~state~0 8481)} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {4246#(<= ssl3_accept_~state~0 8481)} is VALID [2022-04-15 11:16:22,439 INFO L290 TraceCheckUtils]: 24: Hoare triple {4246#(<= ssl3_accept_~state~0 8481)} assume 0 == ~s__s3__tmp__reuse_message~0; {4246#(<= ssl3_accept_~state~0 8481)} is VALID [2022-04-15 11:16:22,439 INFO L290 TraceCheckUtils]: 25: Hoare triple {4246#(<= ssl3_accept_~state~0 8481)} assume 0 == ~skip~0; {4246#(<= ssl3_accept_~state~0 8481)} is VALID [2022-04-15 11:16:22,440 INFO L290 TraceCheckUtils]: 26: Hoare triple {4246#(<= ssl3_accept_~state~0 8481)} assume 8528 == ~state~0; {4241#false} is VALID [2022-04-15 11:16:22,440 INFO L290 TraceCheckUtils]: 27: Hoare triple {4241#false} assume 8544 == ~s__state~0; {4241#false} is VALID [2022-04-15 11:16:22,440 INFO L290 TraceCheckUtils]: 28: Hoare triple {4241#false} assume 1024 != ~tmp___7~0; {4241#false} is VALID [2022-04-15 11:16:22,440 INFO L290 TraceCheckUtils]: 29: Hoare triple {4241#false} assume 512 != ~tmp___7~0; {4241#false} is VALID [2022-04-15 11:16:22,441 INFO L290 TraceCheckUtils]: 30: Hoare triple {4241#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {4241#false} is VALID [2022-04-15 11:16:22,441 INFO L290 TraceCheckUtils]: 31: Hoare triple {4241#false} assume 4294967266 != ~l~0 % 4294967296; {4241#false} is VALID [2022-04-15 11:16:22,441 INFO L290 TraceCheckUtils]: 32: Hoare triple {4241#false} assume !false; {4241#false} is VALID [2022-04-15 11:16:22,441 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,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:16:22,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651649597] [2022-04-15 11:16:22,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651649597] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:22,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:22,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:16:22,442 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:16:22,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [710906532] [2022-04-15 11:16:22,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [710906532] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:22,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:22,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:16:22,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297294580] [2022-04-15 11:16:22,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:16:22,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 11:16:22,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:16:22,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:22,467 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:22,467 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:16:22,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:22,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:16:22,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:16:22,468 INFO L87 Difference]: Start difference. First operand 151 states and 230 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:23,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:23,471 INFO L93 Difference]: Finished difference Result 329 states and 498 transitions. [2022-04-15 11:16:23,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 11:16:23,472 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 11:16:23,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:16:23,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:23,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 476 transitions. [2022-04-15 11:16:23,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:23,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 476 transitions. [2022-04-15 11:16:23,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 476 transitions. [2022-04-15 11:16:23,845 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:23,848 INFO L225 Difference]: With dead ends: 329 [2022-04-15 11:16:23,848 INFO L226 Difference]: Without dead ends: 192 [2022-04-15 11:16:23,848 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-15 11:16:23,849 INFO L913 BasicCegarLoop]: 176 mSDtfsCounter, 421 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:16:23,849 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [421 Valid, 188 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 11:16:23,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-04-15 11:16:24,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 149. [2022-04-15 11:16:24,029 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:16:24,029 INFO L82 GeneralOperation]: Start isEquivalent. First operand 192 states. Second operand has 149 states, 144 states have (on average 1.5555555555555556) internal successors, (224), 144 states have internal predecessors, (224), 3 states have call successors, (3), 3 states 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,030 INFO L74 IsIncluded]: Start isIncluded. First operand 192 states. Second operand has 149 states, 144 states have (on average 1.5555555555555556) internal successors, (224), 144 states have internal predecessors, (224), 3 states have call successors, (3), 3 states 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,030 INFO L87 Difference]: Start difference. First operand 192 states. Second operand has 149 states, 144 states have (on average 1.5555555555555556) internal successors, (224), 144 states have internal predecessors, (224), 3 states have call successors, (3), 3 states 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,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:24,035 INFO L93 Difference]: Finished difference Result 192 states and 285 transitions. [2022-04-15 11:16:24,035 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 285 transitions. [2022-04-15 11:16:24,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:24,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:24,036 INFO L74 IsIncluded]: Start isIncluded. First operand has 149 states, 144 states have (on average 1.5555555555555556) internal successors, (224), 144 states have internal predecessors, (224), 3 states have call successors, (3), 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 192 states. [2022-04-15 11:16:24,037 INFO L87 Difference]: Start difference. First operand has 149 states, 144 states have (on average 1.5555555555555556) internal successors, (224), 144 states have internal predecessors, (224), 3 states have call successors, (3), 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 192 states. [2022-04-15 11:16:24,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:24,042 INFO L93 Difference]: Finished difference Result 192 states and 285 transitions. [2022-04-15 11:16:24,043 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 285 transitions. [2022-04-15 11:16:24,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:24,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:24,043 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:16:24,043 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:16:24,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 144 states have (on average 1.5555555555555556) internal successors, (224), 144 states have internal predecessors, (224), 3 states have call successors, (3), 3 states 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,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 228 transitions. [2022-04-15 11:16:24,048 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 228 transitions. Word has length 33 [2022-04-15 11:16:24,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:16:24,049 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 228 transitions. [2022-04-15 11:16:24,049 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:24,049 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 149 states and 228 transitions. [2022-04-15 11:16:24,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 228 edges. 228 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:24,252 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 228 transitions. [2022-04-15 11:16:24,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 11:16:24,253 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:16:24,253 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:24,254 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 11:16:24,254 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:16:24,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:16:24,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1614356125, now seen corresponding path program 1 times [2022-04-15 11:16:24,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:24,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1227819802] [2022-04-15 11:16:24,255 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:16:24,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1614356125, now seen corresponding path program 2 times [2022-04-15 11:16:24,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:16:24,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049357382] [2022-04-15 11:16:24,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:16:24,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:16:24,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:24,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:16:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:24,335 INFO L290 TraceCheckUtils]: 0: Hoare triple {5605#(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); {5599#true} is VALID [2022-04-15 11:16:24,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {5599#true} assume true; {5599#true} is VALID [2022-04-15 11:16:24,336 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5599#true} {5599#true} #674#return; {5599#true} is VALID [2022-04-15 11:16:24,336 INFO L272 TraceCheckUtils]: 0: Hoare triple {5599#true} call ULTIMATE.init(); {5605#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:16:24,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {5605#(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); {5599#true} is VALID [2022-04-15 11:16:24,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {5599#true} assume true; {5599#true} is VALID [2022-04-15 11:16:24,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5599#true} {5599#true} #674#return; {5599#true} is VALID [2022-04-15 11:16:24,337 INFO L272 TraceCheckUtils]: 4: Hoare triple {5599#true} call #t~ret59 := main(); {5599#true} is VALID [2022-04-15 11:16:24,337 INFO L290 TraceCheckUtils]: 5: Hoare triple {5599#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {5599#true} is VALID [2022-04-15 11:16:24,337 INFO L272 TraceCheckUtils]: 6: Hoare triple {5599#true} call #t~ret58 := ssl3_accept(~s~0); {5599#true} is VALID [2022-04-15 11:16:24,337 INFO L290 TraceCheckUtils]: 7: Hoare triple {5599#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;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___7~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___8~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___9~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___10~0 := #t~nondet29;havoc #t~nondet29;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;havoc ~__cil_tmp61~0;~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; {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:16:24,338 INFO L290 TraceCheckUtils]: 8: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:16:24,338 INFO L290 TraceCheckUtils]: 9: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:16:24,338 INFO L290 TraceCheckUtils]: 10: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume !(0 != 12288 + ~tmp___1~0); {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:16:24,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == ~s__cert~0); {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:16:24,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume !false; {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:16:24,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} ~state~0 := ~s__state~0; {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:16:24,340 INFO L290 TraceCheckUtils]: 14: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == ~s__state~0); {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:16:24,340 INFO L290 TraceCheckUtils]: 15: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == ~s__state~0); {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:16:24,340 INFO L290 TraceCheckUtils]: 16: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == ~s__state~0); {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:16:24,341 INFO L290 TraceCheckUtils]: 17: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == ~s__state~0); {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:16:24,341 INFO L290 TraceCheckUtils]: 18: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == ~s__state~0); {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:16:24,341 INFO L290 TraceCheckUtils]: 19: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == ~s__state~0); {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:16:24,342 INFO L290 TraceCheckUtils]: 20: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == ~s__state~0); {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:16:24,342 INFO L290 TraceCheckUtils]: 21: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == ~s__state~0); {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:16:24,342 INFO L290 TraceCheckUtils]: 22: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == ~s__state~0); {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:16:24,343 INFO L290 TraceCheckUtils]: 23: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == ~s__state~0); {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:16:24,343 INFO L290 TraceCheckUtils]: 24: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == ~s__state~0); {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:16:24,343 INFO L290 TraceCheckUtils]: 25: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == ~s__state~0); {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:16:24,344 INFO L290 TraceCheckUtils]: 26: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == ~s__state~0); {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:16:24,344 INFO L290 TraceCheckUtils]: 27: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == ~s__state~0); {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:16:24,344 INFO L290 TraceCheckUtils]: 28: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == ~s__state~0); {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:16:24,345 INFO L290 TraceCheckUtils]: 29: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == ~s__state~0); {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:16:24,345 INFO L290 TraceCheckUtils]: 30: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == ~s__state~0); {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:16:24,346 INFO L290 TraceCheckUtils]: 31: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume 8544 == ~s__state~0; {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:16:24,346 INFO L290 TraceCheckUtils]: 32: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume 0 != 1 + ~s__verify_mode~0; {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:16:24,347 INFO L290 TraceCheckUtils]: 33: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume !(0 != ~s__session__peer~0); {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:16:24,347 INFO L290 TraceCheckUtils]: 34: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet44 && #t~nondet44 <= 2147483647;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet44;havoc #t~nondet44;~__cil_tmp61~0 := ~s__s3__tmp__new_cipher__algorithms~0; {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:16:24,347 INFO L290 TraceCheckUtils]: 35: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume !(0 != (256 + ~__cil_tmp61~0) % 4294967296); {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:16:24,348 INFO L290 TraceCheckUtils]: 36: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} ~s__s3__tmp__cert_request~0 := 1;assume -2147483648 <= #t~nondet45 && #t~nondet45 <= 2147483647;~ret~0 := #t~nondet45;havoc #t~nondet45; {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:16:24,348 INFO L290 TraceCheckUtils]: 37: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume 8 == ~blastFlag~0; {5600#false} is VALID [2022-04-15 11:16:24,348 INFO L290 TraceCheckUtils]: 38: Hoare triple {5600#false} assume !false; {5600#false} is VALID [2022-04-15 11:16:24,349 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:24,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:16:24,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049357382] [2022-04-15 11:16:24,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049357382] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:24,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:24,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:16:24,349 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:16:24,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1227819802] [2022-04-15 11:16:24,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1227819802] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:24,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:24,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:16:24,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59693014] [2022-04-15 11:16:24,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:16:24,350 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (3), 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 39 [2022-04-15 11:16:24,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:16:24,351 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (3), 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,377 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:24,378 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:16:24,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:24,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:16:24,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:16:24,379 INFO L87 Difference]: Start difference. First operand 149 states and 228 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (3), 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:25,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:25,239 INFO L93 Difference]: Finished difference Result 418 states and 647 transitions. [2022-04-15 11:16:25,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:16:25,239 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (3), 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 39 [2022-04-15 11:16:25,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:16:25,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (3), 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:25,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 629 transitions. [2022-04-15 11:16:25,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (3), 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:25,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 629 transitions. [2022-04-15 11:16:25,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 629 transitions. [2022-04-15 11:16:25,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 629 edges. 629 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:25,680 INFO L225 Difference]: With dead ends: 418 [2022-04-15 11:16:25,681 INFO L226 Difference]: Without dead ends: 283 [2022-04-15 11:16:25,681 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:16:25,682 INFO L913 BasicCegarLoop]: 212 mSDtfsCounter, 581 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:16:25,682 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [581 Valid, 219 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:16:25,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-04-15 11:16:26,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 281. [2022-04-15 11:16:26,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:16:26,007 INFO L82 GeneralOperation]: Start isEquivalent. First operand 283 states. Second operand has 281 states, 276 states have (on average 1.5289855072463767) internal successors, (422), 276 states have internal predecessors, (422), 3 states have call successors, (3), 3 states 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,008 INFO L74 IsIncluded]: Start isIncluded. First operand 283 states. Second operand has 281 states, 276 states have (on average 1.5289855072463767) internal successors, (422), 276 states have internal predecessors, (422), 3 states have call successors, (3), 3 states 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,009 INFO L87 Difference]: Start difference. First operand 283 states. Second operand has 281 states, 276 states have (on average 1.5289855072463767) internal successors, (422), 276 states have internal predecessors, (422), 3 states have call successors, (3), 3 states 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,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:26,015 INFO L93 Difference]: Finished difference Result 283 states and 427 transitions. [2022-04-15 11:16:26,015 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 427 transitions. [2022-04-15 11:16:26,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:26,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:26,017 INFO L74 IsIncluded]: Start isIncluded. First operand has 281 states, 276 states have (on average 1.5289855072463767) internal successors, (422), 276 states have internal predecessors, (422), 3 states have call successors, (3), 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 283 states. [2022-04-15 11:16:26,017 INFO L87 Difference]: Start difference. First operand has 281 states, 276 states have (on average 1.5289855072463767) internal successors, (422), 276 states have internal predecessors, (422), 3 states have call successors, (3), 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 283 states. [2022-04-15 11:16:26,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:26,023 INFO L93 Difference]: Finished difference Result 283 states and 427 transitions. [2022-04-15 11:16:26,024 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 427 transitions. [2022-04-15 11:16:26,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:26,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:26,024 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:16:26,024 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:16:26,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 276 states have (on average 1.5289855072463767) internal successors, (422), 276 states have internal predecessors, (422), 3 states have call successors, (3), 3 states 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,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 426 transitions. [2022-04-15 11:16:26,032 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 426 transitions. Word has length 39 [2022-04-15 11:16:26,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:16:26,032 INFO L478 AbstractCegarLoop]: Abstraction has 281 states and 426 transitions. [2022-04-15 11:16:26,033 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (3), 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:26,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 281 states and 426 transitions. [2022-04-15 11:16:26,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 426 edges. 426 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:26,374 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 426 transitions. [2022-04-15 11:16:26,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 11:16:26,376 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:16:26,376 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] [2022-04-15 11:16:26,376 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 11:16:26,376 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:16:26,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:16:26,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1772802082, now seen corresponding path program 1 times [2022-04-15 11:16:26,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:26,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1460181947] [2022-04-15 11:16:26,377 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:16:26,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1772802082, now seen corresponding path program 2 times [2022-04-15 11:16:26,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:16:26,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831759519] [2022-04-15 11:16:26,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:16:26,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:16:26,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:26,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:16:26,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:26,474 INFO L290 TraceCheckUtils]: 0: Hoare triple {7580#(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); {7574#true} is VALID [2022-04-15 11:16:26,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {7574#true} assume true; {7574#true} is VALID [2022-04-15 11:16:26,475 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7574#true} {7574#true} #674#return; {7574#true} is VALID [2022-04-15 11:16:26,476 INFO L272 TraceCheckUtils]: 0: Hoare triple {7574#true} call ULTIMATE.init(); {7580#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:16:26,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {7580#(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); {7574#true} is VALID [2022-04-15 11:16:26,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {7574#true} assume true; {7574#true} is VALID [2022-04-15 11:16:26,477 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7574#true} {7574#true} #674#return; {7574#true} is VALID [2022-04-15 11:16:26,477 INFO L272 TraceCheckUtils]: 4: Hoare triple {7574#true} call #t~ret59 := main(); {7574#true} is VALID [2022-04-15 11:16:26,477 INFO L290 TraceCheckUtils]: 5: Hoare triple {7574#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {7574#true} is VALID [2022-04-15 11:16:26,477 INFO L272 TraceCheckUtils]: 6: Hoare triple {7574#true} call #t~ret58 := ssl3_accept(~s~0); {7574#true} is VALID [2022-04-15 11:16:26,477 INFO L290 TraceCheckUtils]: 7: Hoare triple {7574#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;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___7~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___8~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___9~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___10~0 := #t~nondet29;havoc #t~nondet29;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;havoc ~__cil_tmp61~0;~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; {7574#true} is VALID [2022-04-15 11:16:26,477 INFO L290 TraceCheckUtils]: 8: Hoare triple {7574#true} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {7574#true} is VALID [2022-04-15 11:16:26,477 INFO L290 TraceCheckUtils]: 9: Hoare triple {7574#true} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {7574#true} is VALID [2022-04-15 11:16:26,478 INFO L290 TraceCheckUtils]: 10: Hoare triple {7574#true} assume !(0 != 12288 + ~tmp___1~0); {7574#true} is VALID [2022-04-15 11:16:26,478 INFO L290 TraceCheckUtils]: 11: Hoare triple {7574#true} assume !(0 == ~s__cert~0); {7574#true} is VALID [2022-04-15 11:16:26,478 INFO L290 TraceCheckUtils]: 12: Hoare triple {7574#true} assume !false; {7574#true} is VALID [2022-04-15 11:16:26,481 INFO L290 TraceCheckUtils]: 13: Hoare triple {7574#true} ~state~0 := ~s__state~0; {7574#true} is VALID [2022-04-15 11:16:26,481 INFO L290 TraceCheckUtils]: 14: Hoare triple {7574#true} assume !(12292 == ~s__state~0); {7574#true} is VALID [2022-04-15 11:16:26,482 INFO L290 TraceCheckUtils]: 15: Hoare triple {7574#true} assume !(16384 == ~s__state~0); {7574#true} is VALID [2022-04-15 11:16:26,482 INFO L290 TraceCheckUtils]: 16: Hoare triple {7574#true} assume !(8192 == ~s__state~0); {7574#true} is VALID [2022-04-15 11:16:26,482 INFO L290 TraceCheckUtils]: 17: Hoare triple {7574#true} assume !(24576 == ~s__state~0); {7574#true} is VALID [2022-04-15 11:16:26,482 INFO L290 TraceCheckUtils]: 18: Hoare triple {7574#true} assume !(8195 == ~s__state~0); {7574#true} is VALID [2022-04-15 11:16:26,482 INFO L290 TraceCheckUtils]: 19: Hoare triple {7574#true} assume !(8480 == ~s__state~0); {7574#true} is VALID [2022-04-15 11:16:26,482 INFO L290 TraceCheckUtils]: 20: Hoare triple {7574#true} assume !(8481 == ~s__state~0); {7574#true} is VALID [2022-04-15 11:16:26,482 INFO L290 TraceCheckUtils]: 21: Hoare triple {7574#true} assume !(8482 == ~s__state~0); {7574#true} is VALID [2022-04-15 11:16:26,482 INFO L290 TraceCheckUtils]: 22: Hoare triple {7574#true} assume !(8464 == ~s__state~0); {7574#true} is VALID [2022-04-15 11:16:26,482 INFO L290 TraceCheckUtils]: 23: Hoare triple {7574#true} assume !(8465 == ~s__state~0); {7574#true} is VALID [2022-04-15 11:16:26,483 INFO L290 TraceCheckUtils]: 24: Hoare triple {7574#true} assume !(8466 == ~s__state~0); {7574#true} is VALID [2022-04-15 11:16:26,483 INFO L290 TraceCheckUtils]: 25: Hoare triple {7574#true} assume 8496 == ~s__state~0; {7574#true} is VALID [2022-04-15 11:16:26,483 INFO L290 TraceCheckUtils]: 26: Hoare triple {7574#true} assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~ret~0 := #t~nondet37;havoc #t~nondet37; {7574#true} is VALID [2022-04-15 11:16:26,483 INFO L290 TraceCheckUtils]: 27: Hoare triple {7574#true} assume !(1 == ~blastFlag~0); {7574#true} is VALID [2022-04-15 11:16:26,483 INFO L290 TraceCheckUtils]: 28: Hoare triple {7574#true} assume !(~ret~0 <= 0); {7574#true} is VALID [2022-04-15 11:16:26,484 INFO L290 TraceCheckUtils]: 29: Hoare triple {7574#true} assume 0 != ~s__hit~0;~s__state~0 := 8656; {7579#(<= 8656 ssl3_accept_~s__state~0)} is VALID [2022-04-15 11:16:26,484 INFO L290 TraceCheckUtils]: 30: Hoare triple {7579#(<= 8656 ssl3_accept_~s__state~0)} ~s__init_num~0 := 0; {7579#(<= 8656 ssl3_accept_~s__state~0)} is VALID [2022-04-15 11:16:26,485 INFO L290 TraceCheckUtils]: 31: Hoare triple {7579#(<= 8656 ssl3_accept_~s__state~0)} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {7579#(<= 8656 ssl3_accept_~s__state~0)} is VALID [2022-04-15 11:16:26,485 INFO L290 TraceCheckUtils]: 32: Hoare triple {7579#(<= 8656 ssl3_accept_~s__state~0)} assume 0 == ~s__s3__tmp__reuse_message~0; {7579#(<= 8656 ssl3_accept_~s__state~0)} is VALID [2022-04-15 11:16:26,485 INFO L290 TraceCheckUtils]: 33: Hoare triple {7579#(<= 8656 ssl3_accept_~s__state~0)} assume 0 == ~skip~0; {7579#(<= 8656 ssl3_accept_~s__state~0)} is VALID [2022-04-15 11:16:26,486 INFO L290 TraceCheckUtils]: 34: Hoare triple {7579#(<= 8656 ssl3_accept_~s__state~0)} assume 8528 == ~state~0; {7579#(<= 8656 ssl3_accept_~s__state~0)} is VALID [2022-04-15 11:16:26,486 INFO L290 TraceCheckUtils]: 35: Hoare triple {7579#(<= 8656 ssl3_accept_~s__state~0)} assume 8544 == ~s__state~0; {7575#false} is VALID [2022-04-15 11:16:26,486 INFO L290 TraceCheckUtils]: 36: Hoare triple {7575#false} assume 1024 != ~tmp___7~0; {7575#false} is VALID [2022-04-15 11:16:26,486 INFO L290 TraceCheckUtils]: 37: Hoare triple {7575#false} assume 512 != ~tmp___7~0; {7575#false} is VALID [2022-04-15 11:16:26,486 INFO L290 TraceCheckUtils]: 38: Hoare triple {7575#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {7575#false} is VALID [2022-04-15 11:16:26,487 INFO L290 TraceCheckUtils]: 39: Hoare triple {7575#false} assume 4294967266 != ~l~0 % 4294967296; {7575#false} is VALID [2022-04-15 11:16:26,487 INFO L290 TraceCheckUtils]: 40: Hoare triple {7575#false} assume !false; {7575#false} is VALID [2022-04-15 11:16:26,487 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,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:16:26,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831759519] [2022-04-15 11:16:26,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831759519] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:26,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:26,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:16:26,488 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:16:26,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1460181947] [2022-04-15 11:16:26,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1460181947] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:26,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:26,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:16:26,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184851343] [2022-04-15 11:16:26,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:16:26,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-15 11:16:26,489 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:16:26,489 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:26,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:26,517 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:16:26,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:26,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:16:26,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:16:26,519 INFO L87 Difference]: Start difference. First operand 281 states and 426 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:27,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:27,564 INFO L93 Difference]: Finished difference Result 662 states and 1032 transitions. [2022-04-15 11:16:27,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:16:27,564 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-15 11:16:27,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:16:27,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:27,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 525 transitions. [2022-04-15 11:16:27,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:27,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 525 transitions. [2022-04-15 11:16:27,572 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 525 transitions. [2022-04-15 11:16:27,968 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,979 INFO L225 Difference]: With dead ends: 662 [2022-04-15 11:16:27,980 INFO L226 Difference]: Without dead ends: 395 [2022-04-15 11:16:27,980 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:16:27,983 INFO L913 BasicCegarLoop]: 232 mSDtfsCounter, 302 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:16:27,983 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [302 Valid, 239 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 11:16:27,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2022-04-15 11:16:28,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 367. [2022-04-15 11:16:28,484 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:16:28,485 INFO L82 GeneralOperation]: Start isEquivalent. First operand 395 states. Second operand has 367 states, 362 states have (on average 1.4530386740331491) internal successors, (526), 362 states have internal predecessors, (526), 3 states have call successors, (3), 3 states 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,486 INFO L74 IsIncluded]: Start isIncluded. First operand 395 states. Second operand has 367 states, 362 states have (on average 1.4530386740331491) internal successors, (526), 362 states have internal predecessors, (526), 3 states have call successors, (3), 3 states 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,487 INFO L87 Difference]: Start difference. First operand 395 states. Second operand has 367 states, 362 states have (on average 1.4530386740331491) internal successors, (526), 362 states have internal predecessors, (526), 3 states have call successors, (3), 3 states 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,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:28,501 INFO L93 Difference]: Finished difference Result 395 states and 570 transitions. [2022-04-15 11:16:28,501 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 570 transitions. [2022-04-15 11:16:28,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:28,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:28,503 INFO L74 IsIncluded]: Start isIncluded. First operand has 367 states, 362 states have (on average 1.4530386740331491) internal successors, (526), 362 states have internal predecessors, (526), 3 states have call successors, (3), 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 395 states. [2022-04-15 11:16:28,504 INFO L87 Difference]: Start difference. First operand has 367 states, 362 states have (on average 1.4530386740331491) internal successors, (526), 362 states have internal predecessors, (526), 3 states have call successors, (3), 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 395 states. [2022-04-15 11:16:28,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:28,527 INFO L93 Difference]: Finished difference Result 395 states and 570 transitions. [2022-04-15 11:16:28,527 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 570 transitions. [2022-04-15 11:16:28,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:28,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:28,528 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:16:28,528 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:16:28,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 362 states have (on average 1.4530386740331491) internal successors, (526), 362 states have internal predecessors, (526), 3 states have call successors, (3), 3 states 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,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 530 transitions. [2022-04-15 11:16:28,539 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 530 transitions. Word has length 41 [2022-04-15 11:16:28,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:16:28,539 INFO L478 AbstractCegarLoop]: Abstraction has 367 states and 530 transitions. [2022-04-15 11:16:28,540 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:28,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 367 states and 530 transitions. [2022-04-15 11:16:28,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 530 edges. 530 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:28,981 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 530 transitions. [2022-04-15 11:16:28,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 11:16:28,982 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:16:28,982 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] [2022-04-15 11:16:28,982 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 11:16:28,982 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:16:28,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:16:28,983 INFO L85 PathProgramCache]: Analyzing trace with hash 2030967520, now seen corresponding path program 1 times [2022-04-15 11:16:28,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:28,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1197068521] [2022-04-15 11:16:28,983 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:16:28,983 INFO L85 PathProgramCache]: Analyzing trace with hash 2030967520, now seen corresponding path program 2 times [2022-04-15 11:16:28,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:16:28,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729511154] [2022-04-15 11:16:28,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:16:28,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:16:29,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:29,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:16:29,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:29,048 INFO L290 TraceCheckUtils]: 0: Hoare triple {10440#(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); {10434#true} is VALID [2022-04-15 11:16:29,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {10434#true} assume true; {10434#true} is VALID [2022-04-15 11:16:29,049 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10434#true} {10434#true} #674#return; {10434#true} is VALID [2022-04-15 11:16:29,049 INFO L272 TraceCheckUtils]: 0: Hoare triple {10434#true} call ULTIMATE.init(); {10440#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:16:29,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {10440#(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); {10434#true} is VALID [2022-04-15 11:16:29,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {10434#true} assume true; {10434#true} is VALID [2022-04-15 11:16:29,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10434#true} {10434#true} #674#return; {10434#true} is VALID [2022-04-15 11:16:29,050 INFO L272 TraceCheckUtils]: 4: Hoare triple {10434#true} call #t~ret59 := main(); {10434#true} is VALID [2022-04-15 11:16:29,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {10434#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {10434#true} is VALID [2022-04-15 11:16:29,050 INFO L272 TraceCheckUtils]: 6: Hoare triple {10434#true} call #t~ret58 := ssl3_accept(~s~0); {10434#true} is VALID [2022-04-15 11:16:29,050 INFO L290 TraceCheckUtils]: 7: Hoare triple {10434#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;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___7~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___8~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___9~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___10~0 := #t~nondet29;havoc #t~nondet29;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;havoc ~__cil_tmp61~0;~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; {10434#true} is VALID [2022-04-15 11:16:29,050 INFO L290 TraceCheckUtils]: 8: Hoare triple {10434#true} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {10434#true} is VALID [2022-04-15 11:16:29,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {10434#true} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {10434#true} is VALID [2022-04-15 11:16:29,051 INFO L290 TraceCheckUtils]: 10: Hoare triple {10434#true} assume !(0 != 12288 + ~tmp___1~0); {10434#true} is VALID [2022-04-15 11:16:29,051 INFO L290 TraceCheckUtils]: 11: Hoare triple {10434#true} assume !(0 == ~s__cert~0); {10434#true} is VALID [2022-04-15 11:16:29,051 INFO L290 TraceCheckUtils]: 12: Hoare triple {10434#true} assume !false; {10434#true} is VALID [2022-04-15 11:16:29,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {10434#true} ~state~0 := ~s__state~0; {10434#true} is VALID [2022-04-15 11:16:29,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {10434#true} assume !(12292 == ~s__state~0); {10434#true} is VALID [2022-04-15 11:16:29,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {10434#true} assume !(16384 == ~s__state~0); {10434#true} is VALID [2022-04-15 11:16:29,051 INFO L290 TraceCheckUtils]: 16: Hoare triple {10434#true} assume !(8192 == ~s__state~0); {10434#true} is VALID [2022-04-15 11:16:29,051 INFO L290 TraceCheckUtils]: 17: Hoare triple {10434#true} assume !(24576 == ~s__state~0); {10434#true} is VALID [2022-04-15 11:16:29,051 INFO L290 TraceCheckUtils]: 18: Hoare triple {10434#true} assume !(8195 == ~s__state~0); {10434#true} is VALID [2022-04-15 11:16:29,052 INFO L290 TraceCheckUtils]: 19: Hoare triple {10434#true} assume !(8480 == ~s__state~0); {10434#true} is VALID [2022-04-15 11:16:29,052 INFO L290 TraceCheckUtils]: 20: Hoare triple {10434#true} assume !(8481 == ~s__state~0); {10434#true} is VALID [2022-04-15 11:16:29,052 INFO L290 TraceCheckUtils]: 21: Hoare triple {10434#true} assume !(8482 == ~s__state~0); {10434#true} is VALID [2022-04-15 11:16:29,052 INFO L290 TraceCheckUtils]: 22: Hoare triple {10434#true} assume !(8464 == ~s__state~0); {10434#true} is VALID [2022-04-15 11:16:29,052 INFO L290 TraceCheckUtils]: 23: Hoare triple {10434#true} assume !(8465 == ~s__state~0); {10434#true} is VALID [2022-04-15 11:16:29,052 INFO L290 TraceCheckUtils]: 24: Hoare triple {10434#true} assume !(8466 == ~s__state~0); {10434#true} is VALID [2022-04-15 11:16:29,052 INFO L290 TraceCheckUtils]: 25: Hoare triple {10434#true} assume 8496 == ~s__state~0; {10434#true} is VALID [2022-04-15 11:16:29,052 INFO L290 TraceCheckUtils]: 26: Hoare triple {10434#true} assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~ret~0 := #t~nondet37;havoc #t~nondet37; {10434#true} is VALID [2022-04-15 11:16:29,052 INFO L290 TraceCheckUtils]: 27: Hoare triple {10434#true} assume !(1 == ~blastFlag~0); {10434#true} is VALID [2022-04-15 11:16:29,053 INFO L290 TraceCheckUtils]: 28: Hoare triple {10434#true} assume !(~ret~0 <= 0); {10434#true} is VALID [2022-04-15 11:16:29,053 INFO L290 TraceCheckUtils]: 29: Hoare triple {10434#true} assume !(0 != ~s__hit~0);~s__state~0 := 8512; {10439#(<= ssl3_accept_~s__state~0 8512)} is VALID [2022-04-15 11:16:29,053 INFO L290 TraceCheckUtils]: 30: Hoare triple {10439#(<= ssl3_accept_~s__state~0 8512)} ~s__init_num~0 := 0; {10439#(<= ssl3_accept_~s__state~0 8512)} is VALID [2022-04-15 11:16:29,054 INFO L290 TraceCheckUtils]: 31: Hoare triple {10439#(<= ssl3_accept_~s__state~0 8512)} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {10439#(<= ssl3_accept_~s__state~0 8512)} is VALID [2022-04-15 11:16:29,054 INFO L290 TraceCheckUtils]: 32: Hoare triple {10439#(<= ssl3_accept_~s__state~0 8512)} assume 0 == ~s__s3__tmp__reuse_message~0; {10439#(<= ssl3_accept_~s__state~0 8512)} is VALID [2022-04-15 11:16:29,054 INFO L290 TraceCheckUtils]: 33: Hoare triple {10439#(<= ssl3_accept_~s__state~0 8512)} assume 0 == ~skip~0; {10439#(<= ssl3_accept_~s__state~0 8512)} is VALID [2022-04-15 11:16:29,055 INFO L290 TraceCheckUtils]: 34: Hoare triple {10439#(<= ssl3_accept_~s__state~0 8512)} assume 8528 == ~state~0; {10439#(<= ssl3_accept_~s__state~0 8512)} is VALID [2022-04-15 11:16:29,055 INFO L290 TraceCheckUtils]: 35: Hoare triple {10439#(<= ssl3_accept_~s__state~0 8512)} assume 8544 == ~s__state~0; {10435#false} is VALID [2022-04-15 11:16:29,055 INFO L290 TraceCheckUtils]: 36: Hoare triple {10435#false} assume 1024 != ~tmp___7~0; {10435#false} is VALID [2022-04-15 11:16:29,055 INFO L290 TraceCheckUtils]: 37: Hoare triple {10435#false} assume 512 != ~tmp___7~0; {10435#false} is VALID [2022-04-15 11:16:29,055 INFO L290 TraceCheckUtils]: 38: Hoare triple {10435#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {10435#false} is VALID [2022-04-15 11:16:29,055 INFO L290 TraceCheckUtils]: 39: Hoare triple {10435#false} assume 4294967266 != ~l~0 % 4294967296; {10435#false} is VALID [2022-04-15 11:16:29,055 INFO L290 TraceCheckUtils]: 40: Hoare triple {10435#false} assume !false; {10435#false} is VALID [2022-04-15 11:16:29,056 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:29,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:16:29,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729511154] [2022-04-15 11:16:29,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729511154] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:29,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:29,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:16:29,056 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:16:29,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1197068521] [2022-04-15 11:16:29,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1197068521] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:29,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:29,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:16:29,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266440816] [2022-04-15 11:16:29,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:16:29,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-15 11:16:29,057 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:16:29,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:29,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:29,082 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:16:29,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:29,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:16:29,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:16:29,083 INFO L87 Difference]: Start difference. First operand 367 states and 530 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:30,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:30,387 INFO L93 Difference]: Finished difference Result 850 states and 1263 transitions. [2022-04-15 11:16:30,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:16:30,388 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-15 11:16:30,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:16:30,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:30,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 532 transitions. [2022-04-15 11:16:30,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:30,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 532 transitions. [2022-04-15 11:16:30,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 532 transitions. [2022-04-15 11:16:30,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 532 edges. 532 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:30,810 INFO L225 Difference]: With dead ends: 850 [2022-04-15 11:16:30,810 INFO L226 Difference]: Without dead ends: 473 [2022-04-15 11:16:30,811 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:16:30,812 INFO L913 BasicCegarLoop]: 234 mSDtfsCounter, 313 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:16:30,812 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [313 Valid, 241 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 11:16:30,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2022-04-15 11:16:31,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 461. [2022-04-15 11:16:31,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:16:31,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 473 states. Second operand has 461 states, 456 states have (on average 1.4473684210526316) internal successors, (660), 456 states have internal predecessors, (660), 3 states have call successors, (3), 3 states 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,459 INFO L74 IsIncluded]: Start isIncluded. First operand 473 states. Second operand has 461 states, 456 states have (on average 1.4473684210526316) internal successors, (660), 456 states have internal predecessors, (660), 3 states have call successors, (3), 3 states 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,460 INFO L87 Difference]: Start difference. First operand 473 states. Second operand has 461 states, 456 states have (on average 1.4473684210526316) internal successors, (660), 456 states have internal predecessors, (660), 3 states have call successors, (3), 3 states 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,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:31,474 INFO L93 Difference]: Finished difference Result 473 states and 679 transitions. [2022-04-15 11:16:31,474 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 679 transitions. [2022-04-15 11:16:31,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:31,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:31,476 INFO L74 IsIncluded]: Start isIncluded. First operand has 461 states, 456 states have (on average 1.4473684210526316) internal successors, (660), 456 states have internal predecessors, (660), 3 states have call successors, (3), 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 473 states. [2022-04-15 11:16:31,477 INFO L87 Difference]: Start difference. First operand has 461 states, 456 states have (on average 1.4473684210526316) internal successors, (660), 456 states have internal predecessors, (660), 3 states have call successors, (3), 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 473 states. [2022-04-15 11:16:31,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:31,492 INFO L93 Difference]: Finished difference Result 473 states and 679 transitions. [2022-04-15 11:16:31,492 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 679 transitions. [2022-04-15 11:16:31,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:31,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:31,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:16:31,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:16:31,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 456 states have (on average 1.4473684210526316) internal successors, (660), 456 states have internal predecessors, (660), 3 states have call successors, (3), 3 states 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,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 664 transitions. [2022-04-15 11:16:31,510 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 664 transitions. Word has length 41 [2022-04-15 11:16:31,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:16:31,510 INFO L478 AbstractCegarLoop]: Abstraction has 461 states and 664 transitions. [2022-04-15 11:16:31,510 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:31,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 461 states and 664 transitions. [2022-04-15 11:16:32,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 664 edges. 664 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:32,181 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 664 transitions. [2022-04-15 11:16:32,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 11:16:32,182 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:16:32,182 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] [2022-04-15 11:16:32,183 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 11:16:32,183 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:16:32,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:16:32,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1025513814, now seen corresponding path program 1 times [2022-04-15 11:16:32,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:32,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [334160134] [2022-04-15 11:16:32,184 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:16:32,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1025513814, now seen corresponding path program 2 times [2022-04-15 11:16:32,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:16:32,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974504394] [2022-04-15 11:16:32,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:16:32,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:16:32,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:32,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:16:32,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:32,250 INFO L290 TraceCheckUtils]: 0: Hoare triple {14020#(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); {14014#true} is VALID [2022-04-15 11:16:32,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {14014#true} assume true; {14014#true} is VALID [2022-04-15 11:16:32,250 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14014#true} {14014#true} #674#return; {14014#true} is VALID [2022-04-15 11:16:32,251 INFO L272 TraceCheckUtils]: 0: Hoare triple {14014#true} call ULTIMATE.init(); {14020#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:16:32,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {14020#(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); {14014#true} is VALID [2022-04-15 11:16:32,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {14014#true} assume true; {14014#true} is VALID [2022-04-15 11:16:32,251 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14014#true} {14014#true} #674#return; {14014#true} is VALID [2022-04-15 11:16:32,251 INFO L272 TraceCheckUtils]: 4: Hoare triple {14014#true} call #t~ret59 := main(); {14014#true} is VALID [2022-04-15 11:16:32,251 INFO L290 TraceCheckUtils]: 5: Hoare triple {14014#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {14014#true} is VALID [2022-04-15 11:16:32,251 INFO L272 TraceCheckUtils]: 6: Hoare triple {14014#true} call #t~ret58 := ssl3_accept(~s~0); {14014#true} is VALID [2022-04-15 11:16:32,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {14014#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;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___7~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___8~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___9~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___10~0 := #t~nondet29;havoc #t~nondet29;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;havoc ~__cil_tmp61~0;~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; {14014#true} is VALID [2022-04-15 11:16:32,252 INFO L290 TraceCheckUtils]: 8: Hoare triple {14014#true} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {14014#true} is VALID [2022-04-15 11:16:32,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {14014#true} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {14014#true} is VALID [2022-04-15 11:16:32,252 INFO L290 TraceCheckUtils]: 10: Hoare triple {14014#true} assume !(0 != 12288 + ~tmp___1~0); {14014#true} is VALID [2022-04-15 11:16:32,252 INFO L290 TraceCheckUtils]: 11: Hoare triple {14014#true} assume !(0 == ~s__cert~0); {14014#true} is VALID [2022-04-15 11:16:32,252 INFO L290 TraceCheckUtils]: 12: Hoare triple {14014#true} assume !false; {14014#true} is VALID [2022-04-15 11:16:32,252 INFO L290 TraceCheckUtils]: 13: Hoare triple {14014#true} ~state~0 := ~s__state~0; {14014#true} is VALID [2022-04-15 11:16:32,252 INFO L290 TraceCheckUtils]: 14: Hoare triple {14014#true} assume !(12292 == ~s__state~0); {14014#true} is VALID [2022-04-15 11:16:32,252 INFO L290 TraceCheckUtils]: 15: Hoare triple {14014#true} assume !(16384 == ~s__state~0); {14014#true} is VALID [2022-04-15 11:16:32,252 INFO L290 TraceCheckUtils]: 16: Hoare triple {14014#true} assume !(8192 == ~s__state~0); {14014#true} is VALID [2022-04-15 11:16:32,253 INFO L290 TraceCheckUtils]: 17: Hoare triple {14014#true} assume !(24576 == ~s__state~0); {14014#true} is VALID [2022-04-15 11:16:32,253 INFO L290 TraceCheckUtils]: 18: Hoare triple {14014#true} assume !(8195 == ~s__state~0); {14014#true} is VALID [2022-04-15 11:16:32,253 INFO L290 TraceCheckUtils]: 19: Hoare triple {14014#true} assume !(8480 == ~s__state~0); {14014#true} is VALID [2022-04-15 11:16:32,253 INFO L290 TraceCheckUtils]: 20: Hoare triple {14014#true} assume !(8481 == ~s__state~0); {14014#true} is VALID [2022-04-15 11:16:32,253 INFO L290 TraceCheckUtils]: 21: Hoare triple {14014#true} assume !(8482 == ~s__state~0); {14014#true} is VALID [2022-04-15 11:16:32,253 INFO L290 TraceCheckUtils]: 22: Hoare triple {14014#true} assume !(8464 == ~s__state~0); {14014#true} is VALID [2022-04-15 11:16:32,253 INFO L290 TraceCheckUtils]: 23: Hoare triple {14014#true} assume !(8465 == ~s__state~0); {14014#true} is VALID [2022-04-15 11:16:32,254 INFO L290 TraceCheckUtils]: 24: Hoare triple {14014#true} assume !(8466 == ~s__state~0); {14014#true} is VALID [2022-04-15 11:16:32,254 INFO L290 TraceCheckUtils]: 25: Hoare triple {14014#true} assume !(8496 == ~s__state~0); {14014#true} is VALID [2022-04-15 11:16:32,254 INFO L290 TraceCheckUtils]: 26: Hoare triple {14014#true} assume !(8497 == ~s__state~0); {14014#true} is VALID [2022-04-15 11:16:32,254 INFO L290 TraceCheckUtils]: 27: Hoare triple {14014#true} assume 8512 == ~s__state~0; {14014#true} is VALID [2022-04-15 11:16:32,254 INFO L290 TraceCheckUtils]: 28: Hoare triple {14014#true} 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; {14014#true} is VALID [2022-04-15 11:16:32,254 INFO L290 TraceCheckUtils]: 29: Hoare triple {14014#true} assume 0 != (256 + ~__cil_tmp56~0) % 4294967296;~skip~0 := 1; {14019#(= ssl3_accept_~skip~0 1)} is VALID [2022-04-15 11:16:32,255 INFO L290 TraceCheckUtils]: 30: Hoare triple {14019#(= ssl3_accept_~skip~0 1)} ~s__state~0 := 8528;~s__init_num~0 := 0; {14019#(= ssl3_accept_~skip~0 1)} is VALID [2022-04-15 11:16:32,256 INFO L290 TraceCheckUtils]: 31: Hoare triple {14019#(= ssl3_accept_~skip~0 1)} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {14019#(= ssl3_accept_~skip~0 1)} is VALID [2022-04-15 11:16:32,256 INFO L290 TraceCheckUtils]: 32: Hoare triple {14019#(= ssl3_accept_~skip~0 1)} assume 0 == ~s__s3__tmp__reuse_message~0; {14019#(= ssl3_accept_~skip~0 1)} is VALID [2022-04-15 11:16:32,257 INFO L290 TraceCheckUtils]: 33: Hoare triple {14019#(= ssl3_accept_~skip~0 1)} assume 0 == ~skip~0; {14015#false} is VALID [2022-04-15 11:16:32,257 INFO L290 TraceCheckUtils]: 34: Hoare triple {14015#false} assume 8528 == ~state~0; {14015#false} is VALID [2022-04-15 11:16:32,257 INFO L290 TraceCheckUtils]: 35: Hoare triple {14015#false} assume 8544 == ~s__state~0; {14015#false} is VALID [2022-04-15 11:16:32,257 INFO L290 TraceCheckUtils]: 36: Hoare triple {14015#false} assume 1024 != ~tmp___7~0; {14015#false} is VALID [2022-04-15 11:16:32,257 INFO L290 TraceCheckUtils]: 37: Hoare triple {14015#false} assume 512 != ~tmp___7~0; {14015#false} is VALID [2022-04-15 11:16:32,257 INFO L290 TraceCheckUtils]: 38: Hoare triple {14015#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {14015#false} is VALID [2022-04-15 11:16:32,257 INFO L290 TraceCheckUtils]: 39: Hoare triple {14015#false} assume 4294967266 != ~l~0 % 4294967296; {14015#false} is VALID [2022-04-15 11:16:32,257 INFO L290 TraceCheckUtils]: 40: Hoare triple {14015#false} assume !false; {14015#false} is VALID [2022-04-15 11:16:32,258 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:32,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:16:32,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974504394] [2022-04-15 11:16:32,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974504394] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:32,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:32,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:16:32,259 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:16:32,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [334160134] [2022-04-15 11:16:32,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [334160134] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:32,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:32,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:16:32,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803021565] [2022-04-15 11:16:32,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:16:32,260 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-15 11:16:32,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:16:32,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:32,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:32,287 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:16:32,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:32,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:16:32,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:16:32,288 INFO L87 Difference]: Start difference. First operand 461 states and 664 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:33,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:33,496 INFO L93 Difference]: Finished difference Result 920 states and 1326 transitions. [2022-04-15 11:16:33,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:16:33,496 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-15 11:16:33,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:16:33,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:33,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 434 transitions. [2022-04-15 11:16:33,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:33,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 434 transitions. [2022-04-15 11:16:33,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 434 transitions. [2022-04-15 11:16:33,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 434 edges. 434 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:33,843 INFO L225 Difference]: With dead ends: 920 [2022-04-15 11:16:33,843 INFO L226 Difference]: Without dead ends: 473 [2022-04-15 11:16:33,844 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:16:33,845 INFO L913 BasicCegarLoop]: 226 mSDtfsCounter, 221 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:16:33,845 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 233 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:16:33,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2022-04-15 11:16:34,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 471. [2022-04-15 11:16:34,540 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:16:34,541 INFO L82 GeneralOperation]: Start isEquivalent. First operand 473 states. Second operand has 471 states, 466 states have (on average 1.44206008583691) internal successors, (672), 466 states have internal predecessors, (672), 3 states have call successors, (3), 3 states 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,542 INFO L74 IsIncluded]: Start isIncluded. First operand 473 states. Second operand has 471 states, 466 states have (on average 1.44206008583691) internal successors, (672), 466 states have internal predecessors, (672), 3 states have call successors, (3), 3 states 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,543 INFO L87 Difference]: Start difference. First operand 473 states. Second operand has 471 states, 466 states have (on average 1.44206008583691) internal successors, (672), 466 states have internal predecessors, (672), 3 states have call successors, (3), 3 states 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,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:34,556 INFO L93 Difference]: Finished difference Result 473 states and 678 transitions. [2022-04-15 11:16:34,556 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 678 transitions. [2022-04-15 11:16:34,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:34,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:34,558 INFO L74 IsIncluded]: Start isIncluded. First operand has 471 states, 466 states have (on average 1.44206008583691) internal successors, (672), 466 states have internal predecessors, (672), 3 states have call successors, (3), 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 473 states. [2022-04-15 11:16:34,559 INFO L87 Difference]: Start difference. First operand has 471 states, 466 states have (on average 1.44206008583691) internal successors, (672), 466 states have internal predecessors, (672), 3 states have call successors, (3), 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 473 states. [2022-04-15 11:16:34,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:34,572 INFO L93 Difference]: Finished difference Result 473 states and 678 transitions. [2022-04-15 11:16:34,572 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 678 transitions. [2022-04-15 11:16:34,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:34,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:34,573 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:16:34,573 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:16:34,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 466 states have (on average 1.44206008583691) internal successors, (672), 466 states have internal predecessors, (672), 3 states have call successors, (3), 3 states 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,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 676 transitions. [2022-04-15 11:16:34,589 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 676 transitions. Word has length 41 [2022-04-15 11:16:34,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:16:34,589 INFO L478 AbstractCegarLoop]: Abstraction has 471 states and 676 transitions. [2022-04-15 11:16:34,590 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:34,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 471 states and 676 transitions. [2022-04-15 11:16:35,183 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 676 edges. 676 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:35,184 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 676 transitions. [2022-04-15 11:16:35,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 11:16:35,184 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:16:35,185 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:35,185 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 11:16:35,185 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:16:35,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:16:35,185 INFO L85 PathProgramCache]: Analyzing trace with hash 564813646, now seen corresponding path program 1 times [2022-04-15 11:16:35,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:35,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1973912973] [2022-04-15 11:16:35,186 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:16:35,186 INFO L85 PathProgramCache]: Analyzing trace with hash 564813646, now seen corresponding path program 2 times [2022-04-15 11:16:35,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:16:35,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363073668] [2022-04-15 11:16:35,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:16:35,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:16:35,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:35,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:16:35,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:35,241 INFO L290 TraceCheckUtils]: 0: Hoare triple {17759#(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); {17753#true} is VALID [2022-04-15 11:16:35,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {17753#true} assume true; {17753#true} is VALID [2022-04-15 11:16:35,241 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17753#true} {17753#true} #674#return; {17753#true} is VALID [2022-04-15 11:16:35,242 INFO L272 TraceCheckUtils]: 0: Hoare triple {17753#true} call ULTIMATE.init(); {17759#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:16:35,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {17759#(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); {17753#true} is VALID [2022-04-15 11:16:35,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {17753#true} assume true; {17753#true} is VALID [2022-04-15 11:16:35,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17753#true} {17753#true} #674#return; {17753#true} is VALID [2022-04-15 11:16:35,242 INFO L272 TraceCheckUtils]: 4: Hoare triple {17753#true} call #t~ret59 := main(); {17753#true} is VALID [2022-04-15 11:16:35,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {17753#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {17753#true} is VALID [2022-04-15 11:16:35,243 INFO L272 TraceCheckUtils]: 6: Hoare triple {17753#true} call #t~ret58 := ssl3_accept(~s~0); {17753#true} is VALID [2022-04-15 11:16:35,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {17753#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;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___7~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___8~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___9~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___10~0 := #t~nondet29;havoc #t~nondet29;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;havoc ~__cil_tmp61~0;~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; {17753#true} is VALID [2022-04-15 11:16:35,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {17753#true} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {17753#true} is VALID [2022-04-15 11:16:35,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {17753#true} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {17753#true} is VALID [2022-04-15 11:16:35,243 INFO L290 TraceCheckUtils]: 10: Hoare triple {17753#true} assume !(0 != 12288 + ~tmp___1~0); {17753#true} is VALID [2022-04-15 11:16:35,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {17753#true} assume !(0 == ~s__cert~0); {17753#true} is VALID [2022-04-15 11:16:35,243 INFO L290 TraceCheckUtils]: 12: Hoare triple {17753#true} assume !false; {17753#true} is VALID [2022-04-15 11:16:35,243 INFO L290 TraceCheckUtils]: 13: Hoare triple {17753#true} ~state~0 := ~s__state~0; {17753#true} is VALID [2022-04-15 11:16:35,243 INFO L290 TraceCheckUtils]: 14: Hoare triple {17753#true} assume !(12292 == ~s__state~0); {17753#true} is VALID [2022-04-15 11:16:35,244 INFO L290 TraceCheckUtils]: 15: Hoare triple {17753#true} assume !(16384 == ~s__state~0); {17753#true} is VALID [2022-04-15 11:16:35,244 INFO L290 TraceCheckUtils]: 16: Hoare triple {17753#true} assume !(8192 == ~s__state~0); {17753#true} is VALID [2022-04-15 11:16:35,244 INFO L290 TraceCheckUtils]: 17: Hoare triple {17753#true} assume !(24576 == ~s__state~0); {17753#true} is VALID [2022-04-15 11:16:35,244 INFO L290 TraceCheckUtils]: 18: Hoare triple {17753#true} assume !(8195 == ~s__state~0); {17753#true} is VALID [2022-04-15 11:16:35,244 INFO L290 TraceCheckUtils]: 19: Hoare triple {17753#true} assume !(8480 == ~s__state~0); {17753#true} is VALID [2022-04-15 11:16:35,244 INFO L290 TraceCheckUtils]: 20: Hoare triple {17753#true} assume !(8481 == ~s__state~0); {17753#true} is VALID [2022-04-15 11:16:35,244 INFO L290 TraceCheckUtils]: 21: Hoare triple {17753#true} assume !(8482 == ~s__state~0); {17753#true} is VALID [2022-04-15 11:16:35,244 INFO L290 TraceCheckUtils]: 22: Hoare triple {17753#true} assume !(8464 == ~s__state~0); {17753#true} is VALID [2022-04-15 11:16:35,245 INFO L290 TraceCheckUtils]: 23: Hoare triple {17753#true} assume !(8465 == ~s__state~0); {17753#true} is VALID [2022-04-15 11:16:35,245 INFO L290 TraceCheckUtils]: 24: Hoare triple {17753#true} assume !(8466 == ~s__state~0); {17753#true} is VALID [2022-04-15 11:16:35,245 INFO L290 TraceCheckUtils]: 25: Hoare triple {17753#true} assume !(8496 == ~s__state~0); {17753#true} is VALID [2022-04-15 11:16:35,245 INFO L290 TraceCheckUtils]: 26: Hoare triple {17753#true} assume !(8497 == ~s__state~0); {17753#true} is VALID [2022-04-15 11:16:35,245 INFO L290 TraceCheckUtils]: 27: Hoare triple {17753#true} assume 8512 == ~s__state~0; {17753#true} is VALID [2022-04-15 11:16:35,245 INFO L290 TraceCheckUtils]: 28: Hoare triple {17753#true} 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; {17753#true} is VALID [2022-04-15 11:16:35,245 INFO L290 TraceCheckUtils]: 29: Hoare triple {17753#true} assume !(0 != (256 + ~__cil_tmp56~0) % 4294967296);assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~ret~0 := #t~nondet39;havoc #t~nondet39; {17753#true} is VALID [2022-04-15 11:16:35,245 INFO L290 TraceCheckUtils]: 30: Hoare triple {17753#true} assume !(2 == ~blastFlag~0); {17753#true} is VALID [2022-04-15 11:16:35,245 INFO L290 TraceCheckUtils]: 31: Hoare triple {17753#true} assume !(~ret~0 <= 0); {17753#true} is VALID [2022-04-15 11:16:35,246 INFO L290 TraceCheckUtils]: 32: Hoare triple {17753#true} ~s__state~0 := 8528;~s__init_num~0 := 0; {17758#(<= ssl3_accept_~s__state~0 8528)} is VALID [2022-04-15 11:16:35,246 INFO L290 TraceCheckUtils]: 33: Hoare triple {17758#(<= ssl3_accept_~s__state~0 8528)} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {17758#(<= ssl3_accept_~s__state~0 8528)} is VALID [2022-04-15 11:16:35,246 INFO L290 TraceCheckUtils]: 34: Hoare triple {17758#(<= ssl3_accept_~s__state~0 8528)} assume 0 == ~s__s3__tmp__reuse_message~0; {17758#(<= ssl3_accept_~s__state~0 8528)} is VALID [2022-04-15 11:16:35,247 INFO L290 TraceCheckUtils]: 35: Hoare triple {17758#(<= ssl3_accept_~s__state~0 8528)} assume 0 == ~skip~0; {17758#(<= ssl3_accept_~s__state~0 8528)} is VALID [2022-04-15 11:16:35,247 INFO L290 TraceCheckUtils]: 36: Hoare triple {17758#(<= ssl3_accept_~s__state~0 8528)} assume 8528 == ~state~0; {17758#(<= ssl3_accept_~s__state~0 8528)} is VALID [2022-04-15 11:16:35,247 INFO L290 TraceCheckUtils]: 37: Hoare triple {17758#(<= ssl3_accept_~s__state~0 8528)} assume 8544 == ~s__state~0; {17754#false} is VALID [2022-04-15 11:16:35,247 INFO L290 TraceCheckUtils]: 38: Hoare triple {17754#false} assume 1024 != ~tmp___7~0; {17754#false} is VALID [2022-04-15 11:16:35,248 INFO L290 TraceCheckUtils]: 39: Hoare triple {17754#false} assume 512 != ~tmp___7~0; {17754#false} is VALID [2022-04-15 11:16:35,248 INFO L290 TraceCheckUtils]: 40: Hoare triple {17754#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {17754#false} is VALID [2022-04-15 11:16:35,248 INFO L290 TraceCheckUtils]: 41: Hoare triple {17754#false} assume 4294967266 != ~l~0 % 4294967296; {17754#false} is VALID [2022-04-15 11:16:35,248 INFO L290 TraceCheckUtils]: 42: Hoare triple {17754#false} assume !false; {17754#false} is VALID [2022-04-15 11:16:35,267 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:35,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:16:35,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363073668] [2022-04-15 11:16:35,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363073668] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:35,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:35,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:16:35,268 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:16:35,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1973912973] [2022-04-15 11:16:35,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1973912973] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:35,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:35,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:16:35,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792249709] [2022-04-15 11:16:35,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:16:35,269 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-15 11:16:35,269 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:16:35,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:35,295 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:35,295 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:16:35,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:35,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:16:35,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:16:35,296 INFO L87 Difference]: Start difference. First operand 471 states and 676 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:36,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:36,848 INFO L93 Difference]: Finished difference Result 1058 states and 1561 transitions. [2022-04-15 11:16:36,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:16:36,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-15 11:16:36,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:16:36,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:36,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 547 transitions. [2022-04-15 11:16:36,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:36,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 547 transitions. [2022-04-15 11:16:36,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 547 transitions. [2022-04-15 11:16:37,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 547 edges. 547 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:37,292 INFO L225 Difference]: With dead ends: 1058 [2022-04-15 11:16:37,292 INFO L226 Difference]: Without dead ends: 577 [2022-04-15 11:16:37,295 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:16:37,297 INFO L913 BasicCegarLoop]: 234 mSDtfsCounter, 352 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:16:37,297 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 241 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 11:16:37,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2022-04-15 11:16:38,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 533. [2022-04-15 11:16:38,145 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:16:38,146 INFO L82 GeneralOperation]: Start isEquivalent. First operand 577 states. Second operand has 533 states, 528 states have (on average 1.4621212121212122) internal successors, (772), 528 states have internal predecessors, (772), 3 states have call successors, (3), 3 states 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,147 INFO L74 IsIncluded]: Start isIncluded. First operand 577 states. Second operand has 533 states, 528 states have (on average 1.4621212121212122) internal successors, (772), 528 states have internal predecessors, (772), 3 states have call successors, (3), 3 states 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,148 INFO L87 Difference]: Start difference. First operand 577 states. Second operand has 533 states, 528 states have (on average 1.4621212121212122) internal successors, (772), 528 states have internal predecessors, (772), 3 states have call successors, (3), 3 states 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,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:38,165 INFO L93 Difference]: Finished difference Result 577 states and 837 transitions. [2022-04-15 11:16:38,165 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 837 transitions. [2022-04-15 11:16:38,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:38,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:38,167 INFO L74 IsIncluded]: Start isIncluded. First operand has 533 states, 528 states have (on average 1.4621212121212122) internal successors, (772), 528 states have internal predecessors, (772), 3 states have call successors, (3), 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 577 states. [2022-04-15 11:16:38,168 INFO L87 Difference]: Start difference. First operand has 533 states, 528 states have (on average 1.4621212121212122) internal successors, (772), 528 states have internal predecessors, (772), 3 states have call successors, (3), 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 577 states. [2022-04-15 11:16:38,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:38,185 INFO L93 Difference]: Finished difference Result 577 states and 837 transitions. [2022-04-15 11:16:38,186 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 837 transitions. [2022-04-15 11:16:38,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:38,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:38,187 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:16:38,187 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:16:38,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 528 states have (on average 1.4621212121212122) internal successors, (772), 528 states have internal predecessors, (772), 3 states have call successors, (3), 3 states 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,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 776 transitions. [2022-04-15 11:16:38,212 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 776 transitions. Word has length 43 [2022-04-15 11:16:38,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:16:38,212 INFO L478 AbstractCegarLoop]: Abstraction has 533 states and 776 transitions. [2022-04-15 11:16:38,212 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:38,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 533 states and 776 transitions. [2022-04-15 11:16:38,887 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 776 edges. 776 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:38,888 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 776 transitions. [2022-04-15 11:16:38,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 11:16:38,889 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:16:38,889 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] [2022-04-15 11:16:38,889 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 11:16:38,889 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:16:38,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:16:38,889 INFO L85 PathProgramCache]: Analyzing trace with hash 924583977, now seen corresponding path program 1 times [2022-04-15 11:16:38,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:38,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2007802448] [2022-04-15 11:16:38,890 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:16:38,890 INFO L85 PathProgramCache]: Analyzing trace with hash 924583977, now seen corresponding path program 2 times [2022-04-15 11:16:38,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:16:38,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711793445] [2022-04-15 11:16:38,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:16:38,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:16:38,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:38,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:16:38,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:38,951 INFO L290 TraceCheckUtils]: 0: Hoare triple {22107#(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); {22101#true} is VALID [2022-04-15 11:16:38,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {22101#true} assume true; {22101#true} is VALID [2022-04-15 11:16:38,951 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22101#true} {22101#true} #674#return; {22101#true} is VALID [2022-04-15 11:16:38,952 INFO L272 TraceCheckUtils]: 0: Hoare triple {22101#true} call ULTIMATE.init(); {22107#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:16:38,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {22107#(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); {22101#true} is VALID [2022-04-15 11:16:38,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {22101#true} assume true; {22101#true} is VALID [2022-04-15 11:16:38,952 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22101#true} {22101#true} #674#return; {22101#true} is VALID [2022-04-15 11:16:38,952 INFO L272 TraceCheckUtils]: 4: Hoare triple {22101#true} call #t~ret59 := main(); {22101#true} is VALID [2022-04-15 11:16:38,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {22101#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {22101#true} is VALID [2022-04-15 11:16:38,953 INFO L272 TraceCheckUtils]: 6: Hoare triple {22101#true} call #t~ret58 := ssl3_accept(~s~0); {22101#true} is VALID [2022-04-15 11:16:38,953 INFO L290 TraceCheckUtils]: 7: Hoare triple {22101#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;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___7~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___8~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___9~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___10~0 := #t~nondet29;havoc #t~nondet29;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;havoc ~__cil_tmp61~0;~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; {22101#true} is VALID [2022-04-15 11:16:38,953 INFO L290 TraceCheckUtils]: 8: Hoare triple {22101#true} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {22101#true} is VALID [2022-04-15 11:16:38,953 INFO L290 TraceCheckUtils]: 9: Hoare triple {22101#true} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {22101#true} is VALID [2022-04-15 11:16:38,953 INFO L290 TraceCheckUtils]: 10: Hoare triple {22101#true} assume !(0 != 12288 + ~tmp___1~0); {22101#true} is VALID [2022-04-15 11:16:38,953 INFO L290 TraceCheckUtils]: 11: Hoare triple {22101#true} assume !(0 == ~s__cert~0); {22101#true} is VALID [2022-04-15 11:16:38,953 INFO L290 TraceCheckUtils]: 12: Hoare triple {22101#true} assume !false; {22101#true} is VALID [2022-04-15 11:16:38,953 INFO L290 TraceCheckUtils]: 13: Hoare triple {22101#true} ~state~0 := ~s__state~0; {22101#true} is VALID [2022-04-15 11:16:38,954 INFO L290 TraceCheckUtils]: 14: Hoare triple {22101#true} assume !(12292 == ~s__state~0); {22101#true} is VALID [2022-04-15 11:16:38,954 INFO L290 TraceCheckUtils]: 15: Hoare triple {22101#true} assume !(16384 == ~s__state~0); {22101#true} is VALID [2022-04-15 11:16:38,954 INFO L290 TraceCheckUtils]: 16: Hoare triple {22101#true} assume !(8192 == ~s__state~0); {22101#true} is VALID [2022-04-15 11:16:38,954 INFO L290 TraceCheckUtils]: 17: Hoare triple {22101#true} assume !(24576 == ~s__state~0); {22101#true} is VALID [2022-04-15 11:16:38,954 INFO L290 TraceCheckUtils]: 18: Hoare triple {22101#true} assume !(8195 == ~s__state~0); {22101#true} is VALID [2022-04-15 11:16:38,954 INFO L290 TraceCheckUtils]: 19: Hoare triple {22101#true} assume !(8480 == ~s__state~0); {22101#true} is VALID [2022-04-15 11:16:38,954 INFO L290 TraceCheckUtils]: 20: Hoare triple {22101#true} assume !(8481 == ~s__state~0); {22101#true} is VALID [2022-04-15 11:16:38,954 INFO L290 TraceCheckUtils]: 21: Hoare triple {22101#true} assume !(8482 == ~s__state~0); {22101#true} is VALID [2022-04-15 11:16:38,955 INFO L290 TraceCheckUtils]: 22: Hoare triple {22101#true} assume !(8464 == ~s__state~0); {22101#true} is VALID [2022-04-15 11:16:38,955 INFO L290 TraceCheckUtils]: 23: Hoare triple {22101#true} assume !(8465 == ~s__state~0); {22101#true} is VALID [2022-04-15 11:16:38,955 INFO L290 TraceCheckUtils]: 24: Hoare triple {22101#true} assume !(8466 == ~s__state~0); {22101#true} is VALID [2022-04-15 11:16:38,955 INFO L290 TraceCheckUtils]: 25: Hoare triple {22101#true} assume !(8496 == ~s__state~0); {22101#true} is VALID [2022-04-15 11:16:38,955 INFO L290 TraceCheckUtils]: 26: Hoare triple {22101#true} assume !(8497 == ~s__state~0); {22101#true} is VALID [2022-04-15 11:16:38,955 INFO L290 TraceCheckUtils]: 27: Hoare triple {22101#true} assume !(8512 == ~s__state~0); {22101#true} is VALID [2022-04-15 11:16:38,955 INFO L290 TraceCheckUtils]: 28: Hoare triple {22101#true} assume !(8513 == ~s__state~0); {22101#true} is VALID [2022-04-15 11:16:38,955 INFO L290 TraceCheckUtils]: 29: Hoare triple {22101#true} assume 8528 == ~s__state~0; {22101#true} is VALID [2022-04-15 11:16:38,955 INFO L290 TraceCheckUtils]: 30: Hoare triple {22101#true} 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; {22101#true} is VALID [2022-04-15 11:16:38,956 INFO L290 TraceCheckUtils]: 31: Hoare triple {22101#true} assume !(0 != (2097152 + ~__cil_tmp57~0) % 4294967296);~s__s3__tmp__use_rsa_tmp~0 := 0; {22106#(= ssl3_accept_~s__s3__tmp__use_rsa_tmp~0 0)} is VALID [2022-04-15 11:16:38,956 INFO L290 TraceCheckUtils]: 32: Hoare triple {22106#(= ssl3_accept_~s__s3__tmp__use_rsa_tmp~0 0)} assume 0 != ~s__s3__tmp__use_rsa_tmp~0; {22102#false} is VALID [2022-04-15 11:16:38,956 INFO L290 TraceCheckUtils]: 33: Hoare triple {22102#false} assume -2147483648 <= #t~nondet43 && #t~nondet43 <= 2147483647;~ret~0 := #t~nondet43;havoc #t~nondet43; {22102#false} is VALID [2022-04-15 11:16:38,956 INFO L290 TraceCheckUtils]: 34: Hoare triple {22102#false} assume !(6 == ~blastFlag~0); {22102#false} is VALID [2022-04-15 11:16:38,956 INFO L290 TraceCheckUtils]: 35: Hoare triple {22102#false} assume !(~ret~0 <= 0); {22102#false} is VALID [2022-04-15 11:16:38,957 INFO L290 TraceCheckUtils]: 36: Hoare triple {22102#false} ~s__state~0 := 8544;~s__init_num~0 := 0; {22102#false} is VALID [2022-04-15 11:16:38,957 INFO L290 TraceCheckUtils]: 37: Hoare triple {22102#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {22102#false} is VALID [2022-04-15 11:16:38,957 INFO L290 TraceCheckUtils]: 38: Hoare triple {22102#false} assume 0 == ~s__s3__tmp__reuse_message~0; {22102#false} is VALID [2022-04-15 11:16:38,957 INFO L290 TraceCheckUtils]: 39: Hoare triple {22102#false} assume 0 == ~skip~0; {22102#false} is VALID [2022-04-15 11:16:38,957 INFO L290 TraceCheckUtils]: 40: Hoare triple {22102#false} assume 8528 == ~state~0; {22102#false} is VALID [2022-04-15 11:16:38,957 INFO L290 TraceCheckUtils]: 41: Hoare triple {22102#false} assume 8544 == ~s__state~0; {22102#false} is VALID [2022-04-15 11:16:38,957 INFO L290 TraceCheckUtils]: 42: Hoare triple {22102#false} assume 1024 != ~tmp___7~0; {22102#false} is VALID [2022-04-15 11:16:38,957 INFO L290 TraceCheckUtils]: 43: Hoare triple {22102#false} assume 512 != ~tmp___7~0; {22102#false} is VALID [2022-04-15 11:16:38,957 INFO L290 TraceCheckUtils]: 44: Hoare triple {22102#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {22102#false} is VALID [2022-04-15 11:16:38,957 INFO L290 TraceCheckUtils]: 45: Hoare triple {22102#false} assume 4294967266 != ~l~0 % 4294967296; {22102#false} is VALID [2022-04-15 11:16:38,957 INFO L290 TraceCheckUtils]: 46: Hoare triple {22102#false} assume !false; {22102#false} is VALID [2022-04-15 11:16:38,958 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,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:16:38,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711793445] [2022-04-15 11:16:38,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711793445] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:38,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:38,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:16:38,958 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:16:38,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2007802448] [2022-04-15 11:16:38,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2007802448] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:38,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:38,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:16:38,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116480255] [2022-04-15 11:16:38,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:16:38,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (3), 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 47 [2022-04-15 11:16:38,959 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:16:38,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (3), 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:38,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:38,987 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:16:38,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:38,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:16:38,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:16:38,988 INFO L87 Difference]: Start difference. First operand 533 states and 776 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (3), 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:41,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:41,112 INFO L93 Difference]: Finished difference Result 1555 states and 2264 transitions. [2022-04-15 11:16:41,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:16:41,112 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (3), 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 47 [2022-04-15 11:16:41,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:16:41,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (3), 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:41,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 617 transitions. [2022-04-15 11:16:41,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (3), 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:41,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 617 transitions. [2022-04-15 11:16:41,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 617 transitions. [2022-04-15 11:16:41,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 617 edges. 617 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:41,610 INFO L225 Difference]: With dead ends: 1555 [2022-04-15 11:16:41,610 INFO L226 Difference]: Without dead ends: 1036 [2022-04-15 11:16:41,611 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:16:41,612 INFO L913 BasicCegarLoop]: 409 mSDtfsCounter, 419 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:16:41,612 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [419 Valid, 416 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:16:41,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2022-04-15 11:16:42,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 535. [2022-04-15 11:16:42,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:16:42,394 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1036 states. Second operand has 535 states, 530 states have (on average 1.460377358490566) internal successors, (774), 530 states have internal predecessors, (774), 3 states have call successors, (3), 3 states 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,395 INFO L74 IsIncluded]: Start isIncluded. First operand 1036 states. Second operand has 535 states, 530 states have (on average 1.460377358490566) internal successors, (774), 530 states have internal predecessors, (774), 3 states have call successors, (3), 3 states 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,395 INFO L87 Difference]: Start difference. First operand 1036 states. Second operand has 535 states, 530 states have (on average 1.460377358490566) internal successors, (774), 530 states have internal predecessors, (774), 3 states have call successors, (3), 3 states 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,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:42,433 INFO L93 Difference]: Finished difference Result 1036 states and 1504 transitions. [2022-04-15 11:16:42,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1504 transitions. [2022-04-15 11:16:42,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:42,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:42,436 INFO L74 IsIncluded]: Start isIncluded. First operand has 535 states, 530 states have (on average 1.460377358490566) internal successors, (774), 530 states have internal predecessors, (774), 3 states have call successors, (3), 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 1036 states. [2022-04-15 11:16:42,436 INFO L87 Difference]: Start difference. First operand has 535 states, 530 states have (on average 1.460377358490566) internal successors, (774), 530 states have internal predecessors, (774), 3 states have call successors, (3), 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 1036 states. [2022-04-15 11:16:42,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:42,484 INFO L93 Difference]: Finished difference Result 1036 states and 1504 transitions. [2022-04-15 11:16:42,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1504 transitions. [2022-04-15 11:16:42,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:42,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:42,485 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:16:42,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:16:42,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 530 states have (on average 1.460377358490566) internal successors, (774), 530 states have internal predecessors, (774), 3 states have call successors, (3), 3 states 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,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 778 transitions. [2022-04-15 11:16:42,504 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 778 transitions. Word has length 47 [2022-04-15 11:16:42,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:16:42,505 INFO L478 AbstractCegarLoop]: Abstraction has 535 states and 778 transitions. [2022-04-15 11:16:42,505 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (3), 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:42,505 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 535 states and 778 transitions. [2022-04-15 11:16:43,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 778 edges. 778 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:43,230 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 778 transitions. [2022-04-15 11:16:43,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 11:16:43,231 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:16:43,231 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] [2022-04-15 11:16:43,231 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 11:16:43,232 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:16:43,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:16:43,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1945652331, now seen corresponding path program 1 times [2022-04-15 11:16:43,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:43,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [254224794] [2022-04-15 11:16:43,232 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:16:43,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1945652331, now seen corresponding path program 2 times [2022-04-15 11:16:43,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:16:43,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349218340] [2022-04-15 11:16:43,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:16:43,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:16:43,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:43,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:16:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:43,303 INFO L290 TraceCheckUtils]: 0: Hoare triple {28373#(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); {28365#true} is VALID [2022-04-15 11:16:43,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {28365#true} assume true; {28365#true} is VALID [2022-04-15 11:16:43,303 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28365#true} {28365#true} #674#return; {28365#true} is VALID [2022-04-15 11:16:43,304 INFO L272 TraceCheckUtils]: 0: Hoare triple {28365#true} call ULTIMATE.init(); {28373#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:16:43,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {28373#(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); {28365#true} is VALID [2022-04-15 11:16:43,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {28365#true} assume true; {28365#true} is VALID [2022-04-15 11:16:43,304 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28365#true} {28365#true} #674#return; {28365#true} is VALID [2022-04-15 11:16:43,304 INFO L272 TraceCheckUtils]: 4: Hoare triple {28365#true} call #t~ret59 := main(); {28365#true} is VALID [2022-04-15 11:16:43,304 INFO L290 TraceCheckUtils]: 5: Hoare triple {28365#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {28370#(<= main_~s~0 8464)} is VALID [2022-04-15 11:16:43,305 INFO L272 TraceCheckUtils]: 6: Hoare triple {28370#(<= main_~s~0 8464)} call #t~ret58 := ssl3_accept(~s~0); {28371#(<= |ssl3_accept_#in~initial_state| 8464)} is VALID [2022-04-15 11:16:43,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {28371#(<= |ssl3_accept_#in~initial_state| 8464)} ~initial_state := #in~initial_state;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__info_callback~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__in_handshake~0 := #t~nondet5;havoc #t~nondet5;havoc ~s__state~0;havoc ~s__new_session~0;havoc ~s__server~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__version~0 := #t~nondet6;havoc #t~nondet6;havoc ~s__type~0;havoc ~s__init_num~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__hit~0 := #t~nondet7;havoc #t~nondet7;havoc ~s__rwstate~0;~s__init_buf___0~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~s__debug~0 := #t~nondet8;havoc #t~nondet8;havoc ~s__shutdown~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~s__cert~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~s__options~0 := #t~nondet10;havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~s__verify_mode~0 := #t~nondet11;havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~s__session__peer~0 := #t~nondet12;havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~s__cert__pkeys__AT0__privatekey~0 := #t~nondet13;havoc #t~nondet13;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~s__ctx__info_callback~0 := #t~nondet14;havoc #t~nondet14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~s__ctx__stats__sess_accept_renegotiate~0 := #t~nondet15;havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~s__ctx__stats__sess_accept~0 := #t~nondet16;havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~s__ctx__stats__sess_accept_good~0 := #t~nondet17;havoc #t~nondet17;havoc ~s__s3__tmp__cert_request~0;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;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___7~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___8~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___9~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___10~0 := #t~nondet29;havoc #t~nondet29;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;havoc ~__cil_tmp61~0;~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; {28372#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-15 11:16:43,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {28372#(<= ssl3_accept_~s__state~0 8464)} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {28372#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-15 11:16:43,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {28372#(<= ssl3_accept_~s__state~0 8464)} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {28372#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-15 11:16:43,308 INFO L290 TraceCheckUtils]: 10: Hoare triple {28372#(<= ssl3_accept_~s__state~0 8464)} assume !(0 != 12288 + ~tmp___1~0); {28372#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-15 11:16:43,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {28372#(<= ssl3_accept_~s__state~0 8464)} assume !(0 == ~s__cert~0); {28372#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-15 11:16:43,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {28372#(<= ssl3_accept_~s__state~0 8464)} assume !false; {28372#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-15 11:16:43,309 INFO L290 TraceCheckUtils]: 13: Hoare triple {28372#(<= ssl3_accept_~s__state~0 8464)} ~state~0 := ~s__state~0; {28372#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-15 11:16:43,309 INFO L290 TraceCheckUtils]: 14: Hoare triple {28372#(<= ssl3_accept_~s__state~0 8464)} assume !(12292 == ~s__state~0); {28372#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-15 11:16:43,309 INFO L290 TraceCheckUtils]: 15: Hoare triple {28372#(<= ssl3_accept_~s__state~0 8464)} assume !(16384 == ~s__state~0); {28372#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-15 11:16:43,310 INFO L290 TraceCheckUtils]: 16: Hoare triple {28372#(<= ssl3_accept_~s__state~0 8464)} assume !(8192 == ~s__state~0); {28372#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-15 11:16:43,310 INFO L290 TraceCheckUtils]: 17: Hoare triple {28372#(<= ssl3_accept_~s__state~0 8464)} assume !(24576 == ~s__state~0); {28372#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-15 11:16:43,310 INFO L290 TraceCheckUtils]: 18: Hoare triple {28372#(<= ssl3_accept_~s__state~0 8464)} assume !(8195 == ~s__state~0); {28372#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-15 11:16:43,311 INFO L290 TraceCheckUtils]: 19: Hoare triple {28372#(<= ssl3_accept_~s__state~0 8464)} assume !(8480 == ~s__state~0); {28372#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-15 11:16:43,311 INFO L290 TraceCheckUtils]: 20: Hoare triple {28372#(<= ssl3_accept_~s__state~0 8464)} assume !(8481 == ~s__state~0); {28372#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-15 11:16:43,311 INFO L290 TraceCheckUtils]: 21: Hoare triple {28372#(<= ssl3_accept_~s__state~0 8464)} assume !(8482 == ~s__state~0); {28372#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-15 11:16:43,312 INFO L290 TraceCheckUtils]: 22: Hoare triple {28372#(<= ssl3_accept_~s__state~0 8464)} assume !(8464 == ~s__state~0); {28372#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-15 11:16:43,312 INFO L290 TraceCheckUtils]: 23: Hoare triple {28372#(<= ssl3_accept_~s__state~0 8464)} assume !(8465 == ~s__state~0); {28372#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-15 11:16:43,312 INFO L290 TraceCheckUtils]: 24: Hoare triple {28372#(<= ssl3_accept_~s__state~0 8464)} assume !(8466 == ~s__state~0); {28372#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-15 11:16:43,312 INFO L290 TraceCheckUtils]: 25: Hoare triple {28372#(<= ssl3_accept_~s__state~0 8464)} assume !(8496 == ~s__state~0); {28372#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-15 11:16:43,313 INFO L290 TraceCheckUtils]: 26: Hoare triple {28372#(<= ssl3_accept_~s__state~0 8464)} assume !(8497 == ~s__state~0); {28372#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-15 11:16:43,313 INFO L290 TraceCheckUtils]: 27: Hoare triple {28372#(<= ssl3_accept_~s__state~0 8464)} assume !(8512 == ~s__state~0); {28372#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-15 11:16:43,313 INFO L290 TraceCheckUtils]: 28: Hoare triple {28372#(<= ssl3_accept_~s__state~0 8464)} assume !(8513 == ~s__state~0); {28372#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-15 11:16:43,314 INFO L290 TraceCheckUtils]: 29: Hoare triple {28372#(<= ssl3_accept_~s__state~0 8464)} assume 8528 == ~s__state~0; {28366#false} is VALID [2022-04-15 11:16:43,314 INFO L290 TraceCheckUtils]: 30: Hoare triple {28366#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; {28366#false} is VALID [2022-04-15 11:16:43,314 INFO L290 TraceCheckUtils]: 31: Hoare triple {28366#false} assume 0 != (2097152 + ~__cil_tmp57~0) % 4294967296;~s__s3__tmp__use_rsa_tmp~0 := 1; {28366#false} is VALID [2022-04-15 11:16:43,314 INFO L290 TraceCheckUtils]: 32: Hoare triple {28366#false} assume 0 != ~s__s3__tmp__use_rsa_tmp~0; {28366#false} is VALID [2022-04-15 11:16:43,314 INFO L290 TraceCheckUtils]: 33: Hoare triple {28366#false} assume -2147483648 <= #t~nondet43 && #t~nondet43 <= 2147483647;~ret~0 := #t~nondet43;havoc #t~nondet43; {28366#false} is VALID [2022-04-15 11:16:43,314 INFO L290 TraceCheckUtils]: 34: Hoare triple {28366#false} assume !(6 == ~blastFlag~0); {28366#false} is VALID [2022-04-15 11:16:43,314 INFO L290 TraceCheckUtils]: 35: Hoare triple {28366#false} assume !(~ret~0 <= 0); {28366#false} is VALID [2022-04-15 11:16:43,315 INFO L290 TraceCheckUtils]: 36: Hoare triple {28366#false} ~s__state~0 := 8544;~s__init_num~0 := 0; {28366#false} is VALID [2022-04-15 11:16:43,315 INFO L290 TraceCheckUtils]: 37: Hoare triple {28366#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {28366#false} is VALID [2022-04-15 11:16:43,315 INFO L290 TraceCheckUtils]: 38: Hoare triple {28366#false} assume 0 == ~s__s3__tmp__reuse_message~0; {28366#false} is VALID [2022-04-15 11:16:43,315 INFO L290 TraceCheckUtils]: 39: Hoare triple {28366#false} assume 0 == ~skip~0; {28366#false} is VALID [2022-04-15 11:16:43,315 INFO L290 TraceCheckUtils]: 40: Hoare triple {28366#false} assume 8528 == ~state~0; {28366#false} is VALID [2022-04-15 11:16:43,315 INFO L290 TraceCheckUtils]: 41: Hoare triple {28366#false} assume 8544 == ~s__state~0; {28366#false} is VALID [2022-04-15 11:16:43,315 INFO L290 TraceCheckUtils]: 42: Hoare triple {28366#false} assume 1024 != ~tmp___7~0; {28366#false} is VALID [2022-04-15 11:16:43,315 INFO L290 TraceCheckUtils]: 43: Hoare triple {28366#false} assume 512 != ~tmp___7~0; {28366#false} is VALID [2022-04-15 11:16:43,315 INFO L290 TraceCheckUtils]: 44: Hoare triple {28366#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {28366#false} is VALID [2022-04-15 11:16:43,316 INFO L290 TraceCheckUtils]: 45: Hoare triple {28366#false} assume 4294967266 != ~l~0 % 4294967296; {28366#false} is VALID [2022-04-15 11:16:43,316 INFO L290 TraceCheckUtils]: 46: Hoare triple {28366#false} assume !false; {28366#false} is VALID [2022-04-15 11:16:43,316 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:43,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:16:43,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349218340] [2022-04-15 11:16:43,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349218340] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:43,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:43,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:43,317 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:16:43,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [254224794] [2022-04-15 11:16:43,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [254224794] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:43,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:43,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:43,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587748752] [2022-04-15 11:16:43,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:16:43,317 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 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 47 [2022-04-15 11:16:43,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:16:43,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 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,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:43,347 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 11:16:43,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:43,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 11:16:43,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:16:43,347 INFO L87 Difference]: Start difference. First operand 535 states and 778 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 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,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:45,586 INFO L93 Difference]: Finished difference Result 1175 states and 1726 transitions. [2022-04-15 11:16:45,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 11:16:45,587 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 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 47 [2022-04-15 11:16:45,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:16:45,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 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,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 526 transitions. [2022-04-15 11:16:45,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 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,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 526 transitions. [2022-04-15 11:16:45,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 526 transitions. [2022-04-15 11:16:45,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 526 edges. 526 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:45,934 INFO L225 Difference]: With dead ends: 1175 [2022-04-15 11:16:45,934 INFO L226 Difference]: Without dead ends: 642 [2022-04-15 11:16:45,935 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,935 INFO L913 BasicCegarLoop]: 181 mSDtfsCounter, 630 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:16:45,935 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [630 Valid, 198 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 11:16:45,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2022-04-15 11:16:47,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 595. [2022-04-15 11:16:47,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:16:47,170 INFO L82 GeneralOperation]: Start isEquivalent. First operand 642 states. Second operand has 595 states, 590 states have (on average 1.4508474576271186) internal successors, (856), 590 states have internal predecessors, (856), 3 states have call successors, (3), 3 states 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,171 INFO L74 IsIncluded]: Start isIncluded. First operand 642 states. Second operand has 595 states, 590 states have (on average 1.4508474576271186) internal successors, (856), 590 states have internal predecessors, (856), 3 states have call successors, (3), 3 states 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,171 INFO L87 Difference]: Start difference. First operand 642 states. Second operand has 595 states, 590 states have (on average 1.4508474576271186) internal successors, (856), 590 states have internal predecessors, (856), 3 states have call successors, (3), 3 states 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,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:47,194 INFO L93 Difference]: Finished difference Result 642 states and 911 transitions. [2022-04-15 11:16:47,194 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 911 transitions. [2022-04-15 11:16:47,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:47,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:47,196 INFO L74 IsIncluded]: Start isIncluded. First operand has 595 states, 590 states have (on average 1.4508474576271186) internal successors, (856), 590 states have internal predecessors, (856), 3 states have call successors, (3), 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 642 states. [2022-04-15 11:16:47,197 INFO L87 Difference]: Start difference. First operand has 595 states, 590 states have (on average 1.4508474576271186) internal successors, (856), 590 states have internal predecessors, (856), 3 states have call successors, (3), 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 642 states. [2022-04-15 11:16:47,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:47,219 INFO L93 Difference]: Finished difference Result 642 states and 911 transitions. [2022-04-15 11:16:47,219 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 911 transitions. [2022-04-15 11:16:47,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:47,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:47,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:16:47,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:16:47,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 590 states have (on average 1.4508474576271186) internal successors, (856), 590 states have internal predecessors, (856), 3 states have call successors, (3), 3 states 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,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 860 transitions. [2022-04-15 11:16:47,246 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 860 transitions. Word has length 47 [2022-04-15 11:16:47,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:16:47,246 INFO L478 AbstractCegarLoop]: Abstraction has 595 states and 860 transitions. [2022-04-15 11:16:47,246 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 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,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 595 states and 860 transitions. [2022-04-15 11:16:48,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 860 edges. 860 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:48,181 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 860 transitions. [2022-04-15 11:16:48,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-15 11:16:48,182 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:16:48,183 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:16:48,183 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 11:16:48,183 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:16:48,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:16:48,183 INFO L85 PathProgramCache]: Analyzing trace with hash 427057800, now seen corresponding path program 1 times [2022-04-15 11:16:48,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:48,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [139381158] [2022-04-15 11:16:48,458 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:16:48,465 INFO L158 Benchmark]: Toolchain (without parser) took 34093.58ms. Allocated memory was 182.5MB in the beginning and 351.3MB in the end (delta: 168.8MB). Free memory was 132.2MB in the beginning and 317.3MB in the end (delta: -185.0MB). Peak memory consumption was 183.8MB. Max. memory is 8.0GB. [2022-04-15 11:16:48,465 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 182.5MB. Free memory was 148.9MB in the beginning and 148.7MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 11:16:48,465 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.91ms. Allocated memory is still 182.5MB. Free memory was 131.9MB in the beginning and 152.8MB in the end (delta: -20.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-15 11:16:48,466 INFO L158 Benchmark]: Boogie Preprocessor took 65.07ms. Allocated memory is still 182.5MB. Free memory was 152.8MB in the beginning and 150.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 11:16:48,466 INFO L158 Benchmark]: RCFGBuilder took 840.01ms. Allocated memory is still 182.5MB. Free memory was 150.2MB in the beginning and 113.0MB in the end (delta: 37.2MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2022-04-15 11:16:48,469 INFO L158 Benchmark]: TraceAbstraction took 32819.77ms. Allocated memory was 182.5MB in the beginning and 351.3MB in the end (delta: 168.8MB). Free memory was 112.5MB in the beginning and 317.3MB in the end (delta: -204.8MB). Peak memory consumption was 165.9MB. Max. memory is 8.0GB. [2022-04-15 11:16:48,472 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.16ms. Allocated memory is still 182.5MB. Free memory was 148.9MB in the beginning and 148.7MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 360.91ms. Allocated memory is still 182.5MB. Free memory was 131.9MB in the beginning and 152.8MB in the end (delta: -20.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 65.07ms. Allocated memory is still 182.5MB. Free memory was 152.8MB in the beginning and 150.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 840.01ms. Allocated memory is still 182.5MB. Free memory was 150.2MB in the beginning and 113.0MB in the end (delta: 37.2MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 32819.77ms. Allocated memory was 182.5MB in the beginning and 351.3MB in the end (delta: 168.8MB). Free memory was 112.5MB in the beginning and 317.3MB in the end (delta: -204.8MB). Peak memory consumption was 165.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:16:48,507 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...