/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_14.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 08:15:07,570 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 08:15:07,571 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 08:15:07,602 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 08:15:07,603 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 08:15:07,604 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 08:15:07,605 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 08:15:07,606 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 08:15:07,608 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 08:15:07,609 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 08:15:07,610 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 08:15:07,610 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 08:15:07,611 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 08:15:07,612 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 08:15:07,612 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 08:15:07,615 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 08:15:07,615 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 08:15:07,619 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 08:15:07,623 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 08:15:07,631 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 08:15:07,632 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 08:15:07,633 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 08:15:07,634 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 08:15:07,635 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 08:15:07,635 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 08:15:07,637 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 08:15:07,638 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 08:15:07,638 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 08:15:07,639 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 08:15:07,639 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 08:15:07,640 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 08:15:07,640 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 08:15:07,640 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 08:15:07,641 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 08:15:07,641 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 08:15:07,642 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 08:15:07,642 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 08:15:07,647 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 08:15:07,648 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 08:15:07,648 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 08:15:07,649 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 08:15:07,650 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 08:15:07,651 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 08:15:07,662 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 08:15:07,662 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 08:15:07,663 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 08:15:07,664 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 08:15:07,664 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 08:15:07,664 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 08:15:07,664 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 08:15:07,664 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 08:15:07,664 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 08:15:07,665 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 08:15:07,665 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 08:15:07,665 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 08:15:07,665 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 08:15:07,666 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 08:15:07,666 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 08:15:07,666 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 08:15:07,666 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 08:15:07,666 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 08:15:07,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:15:07,667 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 08:15:07,667 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 08:15:07,667 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 08:15:07,667 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 08:15:07,667 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 08:15:07,667 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 08:15:07,667 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 08:15:07,870 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 08:15:07,893 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 08:15:07,895 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 08:15:07,896 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 08:15:07,897 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 08:15:07,898 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_14.cil.c [2022-04-28 08:15:07,960 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b03cee7c/45c7c0f979e74f84aaa9400dc5d67752/FLAGef33c4f72 [2022-04-28 08:15:08,336 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 08:15:08,336 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_14.cil.c [2022-04-28 08:15:08,345 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b03cee7c/45c7c0f979e74f84aaa9400dc5d67752/FLAGef33c4f72 [2022-04-28 08:15:08,356 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b03cee7c/45c7c0f979e74f84aaa9400dc5d67752 [2022-04-28 08:15:08,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 08:15:08,359 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 08:15:08,368 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 08:15:08,369 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 08:15:08,371 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 08:15:08,372 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:15:08" (1/1) ... [2022-04-28 08:15:08,373 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50d830d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:15:08, skipping insertion in model container [2022-04-28 08:15:08,373 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:15:08" (1/1) ... [2022-04-28 08:15:08,381 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 08:15:08,410 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 08:15:08,624 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_14.cil.c[45163,45176] [2022-04-28 08:15:08,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:15:08,636 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 08:15:08,682 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_14.cil.c[45163,45176] [2022-04-28 08:15:08,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:15:08,696 INFO L208 MainTranslator]: Completed translation [2022-04-28 08:15:08,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:15:08 WrapperNode [2022-04-28 08:15:08,697 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 08:15:08,697 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 08:15:08,697 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 08:15:08,698 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 08:15:08,706 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:15:08" (1/1) ... [2022-04-28 08:15:08,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:15:08" (1/1) ... [2022-04-28 08:15:08,714 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:15:08" (1/1) ... [2022-04-28 08:15:08,714 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:15:08" (1/1) ... [2022-04-28 08:15:08,731 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:15:08" (1/1) ... [2022-04-28 08:15:08,750 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:15:08" (1/1) ... [2022-04-28 08:15:08,752 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:15:08" (1/1) ... [2022-04-28 08:15:08,756 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 08:15:08,763 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 08:15:08,763 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 08:15:08,763 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 08:15:08,767 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:15:08" (1/1) ... [2022-04-28 08:15:08,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:15:08,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:15:08,800 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 08:15:08,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 08:15:08,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 08:15:08,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 08:15:08,847 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 08:15:08,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-28 08:15:08,847 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 08:15:08,847 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 08:15:08,847 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 08:15:08,848 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 08:15:08,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 08:15:08,848 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-28 08:15:08,848 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 08:15:08,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-28 08:15:08,851 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-28 08:15:08,851 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 08:15:08,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 08:15:08,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 08:15:08,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 08:15:08,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 08:15:08,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 08:15:08,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 08:15:08,979 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 08:15:08,981 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 08:15:09,078 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:15:09,591 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-04-28 08:15:09,591 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-04-28 08:15:09,598 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 08:15:09,605 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 08:15:09,605 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 08:15:09,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:15:09 BoogieIcfgContainer [2022-04-28 08:15:09,607 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 08:15:09,609 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 08:15:09,609 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 08:15:09,614 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 08:15:09,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 08:15:08" (1/3) ... [2022-04-28 08:15:09,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bb538ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:15:09, skipping insertion in model container [2022-04-28 08:15:09,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:15:08" (2/3) ... [2022-04-28 08:15:09,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bb538ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:15:09, skipping insertion in model container [2022-04-28 08:15:09,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:15:09" (3/3) ... [2022-04-28 08:15:09,616 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_14.cil.c [2022-04-28 08:15:09,628 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 08:15:09,628 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 08:15:09,667 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 08:15:09,673 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@560dcb60, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4a327c8f [2022-04-28 08:15:09,673 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 08:15:09,682 INFO L276 IsEmpty]: Start isEmpty. Operand has 160 states, 152 states have (on average 1.730263157894737) internal successors, (263), 153 states have internal predecessors, (263), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 08:15:09,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 08:15:09,690 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:15:09,690 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:15:09,690 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:15:09,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:15:09,699 INFO L85 PathProgramCache]: Analyzing trace with hash -242326358, now seen corresponding path program 1 times [2022-04-28 08:15:09,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:15:09,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [287877049] [2022-04-28 08:15:09,713 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:15:09,713 INFO L85 PathProgramCache]: Analyzing trace with hash -242326358, now seen corresponding path program 2 times [2022-04-28 08:15:09,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:15:09,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135027051] [2022-04-28 08:15:09,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:15:09,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:15:09,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:15:10,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:15:10,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:15:10,023 INFO L290 TraceCheckUtils]: 0: Hoare triple {169#(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); {163#true} is VALID [2022-04-28 08:15:10,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {163#true} assume true; {163#true} is VALID [2022-04-28 08:15:10,024 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {163#true} {163#true} #665#return; {163#true} is VALID [2022-04-28 08:15:10,026 INFO L272 TraceCheckUtils]: 0: Hoare triple {163#true} call ULTIMATE.init(); {169#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:15:10,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {169#(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); {163#true} is VALID [2022-04-28 08:15:10,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {163#true} assume true; {163#true} is VALID [2022-04-28 08:15:10,027 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {163#true} {163#true} #665#return; {163#true} is VALID [2022-04-28 08:15:10,027 INFO L272 TraceCheckUtils]: 4: Hoare triple {163#true} call #t~ret54 := main(); {163#true} is VALID [2022-04-28 08:15:10,027 INFO L290 TraceCheckUtils]: 5: Hoare triple {163#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {163#true} is VALID [2022-04-28 08:15:10,028 INFO L272 TraceCheckUtils]: 6: Hoare triple {163#true} call #t~ret53 := ssl3_accept(~s~0); {163#true} is VALID [2022-04-28 08:15:10,033 INFO L290 TraceCheckUtils]: 7: Hoare triple {163#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;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet19;havoc #t~nondet19;havoc ~s__s3__tmp__next_state___0~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~s__s3__tmp__new_cipher__algo_strength~0 := #t~nondet20;havoc #t~nondet20;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~num1~0 := #t~nondet21;havoc #t~nondet21;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___1~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___2~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___3~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___4~0 := #t~nondet25;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___5~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___6~0 := #t~nondet27;havoc #t~nondet27;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___8~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___9~0 := #t~nondet29;havoc #t~nondet29;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___10~0 := #t~nondet30;havoc #t~nondet30;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;havoc ~__cil_tmp61~0;~s__s3__tmp__reuse_message~0 := 0;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp~0 := #t~nondet31;havoc #t~nondet31;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {163#true} is VALID [2022-04-28 08:15:10,033 INFO L290 TraceCheckUtils]: 8: Hoare triple {163#true} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {163#true} is VALID [2022-04-28 08:15:10,033 INFO L290 TraceCheckUtils]: 9: Hoare triple {163#true} #t~post32 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post32;havoc #t~post32; {163#true} is VALID [2022-04-28 08:15:10,034 INFO L290 TraceCheckUtils]: 10: Hoare triple {163#true} assume !(0 != 12288 + ~tmp___1~0); {168#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-28 08:15:10,035 INFO L290 TraceCheckUtils]: 11: Hoare triple {168#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(0 == ~s__cert~0); {168#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-28 08:15:10,036 INFO L290 TraceCheckUtils]: 12: Hoare triple {168#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !false; {168#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-28 08:15:10,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {168#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} ~state~0 := ~s__state~0; {168#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-28 08:15:10,039 INFO L290 TraceCheckUtils]: 14: Hoare triple {168#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(12292 == ~s__state~0); {168#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-28 08:15:10,040 INFO L290 TraceCheckUtils]: 15: Hoare triple {168#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(16384 == ~s__state~0); {168#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-28 08:15:10,040 INFO L290 TraceCheckUtils]: 16: Hoare triple {168#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(8192 == ~s__state~0); {168#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-28 08:15:10,041 INFO L290 TraceCheckUtils]: 17: Hoare triple {168#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(24576 == ~s__state~0); {168#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-28 08:15:10,041 INFO L290 TraceCheckUtils]: 18: Hoare triple {168#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(8195 == ~s__state~0); {168#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-28 08:15:10,042 INFO L290 TraceCheckUtils]: 19: Hoare triple {168#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume 8480 == ~s__state~0; {168#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-28 08:15:10,042 INFO L290 TraceCheckUtils]: 20: Hoare triple {168#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} ~s__shutdown~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~ret~0 := #t~nondet36;havoc #t~nondet36; {168#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-28 08:15:10,043 INFO L290 TraceCheckUtils]: 21: Hoare triple {168#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(~ret~0 <= 0);~s__s3__tmp__next_state___0~0 := 8482;~s__state~0 := 8448;~s__init_num~0 := 0; {168#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-28 08:15:10,043 INFO L290 TraceCheckUtils]: 22: Hoare triple {168#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume 0 == ~s__s3__tmp__reuse_message~0; {168#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-28 08:15:10,044 INFO L290 TraceCheckUtils]: 23: Hoare triple {168#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume 0 == ~skip~0; {168#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-28 08:15:10,045 INFO L290 TraceCheckUtils]: 24: Hoare triple {168#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume -12288 != ~tmp___1~0; {164#false} is VALID [2022-04-28 08:15:10,045 INFO L290 TraceCheckUtils]: 25: Hoare triple {164#false} assume 8656 != ~s__state~0; {164#false} is VALID [2022-04-28 08:15:10,045 INFO L290 TraceCheckUtils]: 26: Hoare triple {164#false} assume -16384 != ~tmp___2~0; {164#false} is VALID [2022-04-28 08:15:10,045 INFO L290 TraceCheckUtils]: 27: Hoare triple {164#false} assume 8496 == ~state~0; {164#false} is VALID [2022-04-28 08:15:10,045 INFO L290 TraceCheckUtils]: 28: Hoare triple {164#false} assume !false; {164#false} is VALID [2022-04-28 08:15:10,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:15:10,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:15:10,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135027051] [2022-04-28 08:15:10,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135027051] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:15:10,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:15:10,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:15:10,050 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:15:10,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [287877049] [2022-04-28 08:15:10,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [287877049] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:15:10,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:15:10,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:15:10,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434490644] [2022-04-28 08:15:10,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:15:10,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (3), 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 29 [2022-04-28 08:15:10,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:15:10,062 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:10,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:15:10,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:15:10,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:15:10,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:15:10,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:15:10,131 INFO L87 Difference]: Start difference. First operand has 160 states, 152 states have (on average 1.730263157894737) internal successors, (263), 153 states have internal predecessors, (263), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:11,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:15:11,205 INFO L93 Difference]: Finished difference Result 445 states and 761 transitions. [2022-04-28 08:15:11,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:15:11,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (3), 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 29 [2022-04-28 08:15:11,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:15:11,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:11,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 761 transitions. [2022-04-28 08:15:11,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:11,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 761 transitions. [2022-04-28 08:15:11,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 761 transitions. [2022-04-28 08:15:11,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 761 edges. 761 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:15:11,938 INFO L225 Difference]: With dead ends: 445 [2022-04-28 08:15:11,938 INFO L226 Difference]: Without dead ends: 272 [2022-04-28 08:15:11,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:15:11,945 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 717 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:15:11,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 274 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 08:15:11,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-04-28 08:15:12,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 270. [2022-04-28 08:15:12,023 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:15:12,030 INFO L82 GeneralOperation]: Start isEquivalent. First operand 272 states. Second operand has 270 states, 265 states have (on average 1.5660377358490567) internal successors, (415), 265 states have internal predecessors, (415), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:12,031 INFO L74 IsIncluded]: Start isIncluded. First operand 272 states. Second operand has 270 states, 265 states have (on average 1.5660377358490567) internal successors, (415), 265 states have internal predecessors, (415), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:12,032 INFO L87 Difference]: Start difference. First operand 272 states. Second operand has 270 states, 265 states have (on average 1.5660377358490567) internal successors, (415), 265 states have internal predecessors, (415), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:12,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:15:12,054 INFO L93 Difference]: Finished difference Result 272 states and 420 transitions. [2022-04-28 08:15:12,060 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 420 transitions. [2022-04-28 08:15:12,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:15:12,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:15:12,068 INFO L74 IsIncluded]: Start isIncluded. First operand has 270 states, 265 states have (on average 1.5660377358490567) internal successors, (415), 265 states have internal predecessors, (415), 3 states have call successors, (3), 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 272 states. [2022-04-28 08:15:12,068 INFO L87 Difference]: Start difference. First operand has 270 states, 265 states have (on average 1.5660377358490567) internal successors, (415), 265 states have internal predecessors, (415), 3 states have call successors, (3), 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 272 states. [2022-04-28 08:15:12,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:15:12,085 INFO L93 Difference]: Finished difference Result 272 states and 420 transitions. [2022-04-28 08:15:12,085 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 420 transitions. [2022-04-28 08:15:12,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:15:12,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:15:12,087 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:15:12,087 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:15:12,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 265 states have (on average 1.5660377358490567) internal successors, (415), 265 states have internal predecessors, (415), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:12,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 419 transitions. [2022-04-28 08:15:12,105 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 419 transitions. Word has length 29 [2022-04-28 08:15:12,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:15:12,106 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 419 transitions. [2022-04-28 08:15:12,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:12,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 270 states and 419 transitions. [2022-04-28 08:15:12,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 419 edges. 419 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:15:12,472 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 419 transitions. [2022-04-28 08:15:12,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 08:15:12,473 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:15:12,473 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:15:12,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 08:15:12,474 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:15:12,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:15:12,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1753118860, now seen corresponding path program 1 times [2022-04-28 08:15:12,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:15:12,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1376183793] [2022-04-28 08:15:12,475 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:15:12,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1753118860, now seen corresponding path program 2 times [2022-04-28 08:15:12,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:15:12,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139394599] [2022-04-28 08:15:12,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:15:12,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:15:12,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:15:12,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:15:12,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:15:12,562 INFO L290 TraceCheckUtils]: 0: Hoare triple {2155#(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); {2148#true} is VALID [2022-04-28 08:15:12,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {2148#true} assume true; {2148#true} is VALID [2022-04-28 08:15:12,562 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2148#true} {2148#true} #665#return; {2148#true} is VALID [2022-04-28 08:15:12,563 INFO L272 TraceCheckUtils]: 0: Hoare triple {2148#true} call ULTIMATE.init(); {2155#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:15:12,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {2155#(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); {2148#true} is VALID [2022-04-28 08:15:12,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {2148#true} assume true; {2148#true} is VALID [2022-04-28 08:15:12,564 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2148#true} {2148#true} #665#return; {2148#true} is VALID [2022-04-28 08:15:12,564 INFO L272 TraceCheckUtils]: 4: Hoare triple {2148#true} call #t~ret54 := main(); {2148#true} is VALID [2022-04-28 08:15:12,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {2148#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {2148#true} is VALID [2022-04-28 08:15:12,564 INFO L272 TraceCheckUtils]: 6: Hoare triple {2148#true} call #t~ret53 := ssl3_accept(~s~0); {2148#true} is VALID [2022-04-28 08:15:12,564 INFO L290 TraceCheckUtils]: 7: Hoare triple {2148#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;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet19;havoc #t~nondet19;havoc ~s__s3__tmp__next_state___0~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~s__s3__tmp__new_cipher__algo_strength~0 := #t~nondet20;havoc #t~nondet20;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~num1~0 := #t~nondet21;havoc #t~nondet21;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___1~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___2~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___3~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___4~0 := #t~nondet25;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___5~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___6~0 := #t~nondet27;havoc #t~nondet27;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___8~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___9~0 := #t~nondet29;havoc #t~nondet29;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___10~0 := #t~nondet30;havoc #t~nondet30;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;havoc ~__cil_tmp61~0;~s__s3__tmp__reuse_message~0 := 0;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp~0 := #t~nondet31;havoc #t~nondet31;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {2148#true} is VALID [2022-04-28 08:15:12,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {2148#true} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {2148#true} is VALID [2022-04-28 08:15:12,565 INFO L290 TraceCheckUtils]: 9: Hoare triple {2148#true} #t~post32 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post32;havoc #t~post32; {2148#true} is VALID [2022-04-28 08:15:12,565 INFO L290 TraceCheckUtils]: 10: Hoare triple {2148#true} assume 0 != 12288 + ~tmp___1~0; {2148#true} is VALID [2022-04-28 08:15:12,565 INFO L290 TraceCheckUtils]: 11: Hoare triple {2148#true} assume 0 != 16384 + ~tmp___2~0; {2148#true} is VALID [2022-04-28 08:15:12,565 INFO L290 TraceCheckUtils]: 12: Hoare triple {2148#true} assume !(0 == ~s__cert~0); {2148#true} is VALID [2022-04-28 08:15:12,566 INFO L290 TraceCheckUtils]: 13: Hoare triple {2148#true} assume !false; {2148#true} is VALID [2022-04-28 08:15:12,566 INFO L290 TraceCheckUtils]: 14: Hoare triple {2148#true} ~state~0 := ~s__state~0; {2153#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-28 08:15:12,571 INFO L290 TraceCheckUtils]: 15: Hoare triple {2153#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(12292 == ~s__state~0); {2153#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-28 08:15:12,572 INFO L290 TraceCheckUtils]: 16: Hoare triple {2153#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(16384 == ~s__state~0); {2153#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-28 08:15:12,574 INFO L290 TraceCheckUtils]: 17: Hoare triple {2153#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8192 == ~s__state~0); {2153#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-28 08:15:12,575 INFO L290 TraceCheckUtils]: 18: Hoare triple {2153#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(24576 == ~s__state~0); {2153#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-28 08:15:12,576 INFO L290 TraceCheckUtils]: 19: Hoare triple {2153#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8195 == ~s__state~0); {2153#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-28 08:15:12,576 INFO L290 TraceCheckUtils]: 20: Hoare triple {2153#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume 8480 == ~s__state~0; {2154#(<= ssl3_accept_~state~0 8480)} is VALID [2022-04-28 08:15:12,577 INFO L290 TraceCheckUtils]: 21: Hoare triple {2154#(<= ssl3_accept_~state~0 8480)} ~s__shutdown~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~ret~0 := #t~nondet36;havoc #t~nondet36; {2154#(<= ssl3_accept_~state~0 8480)} is VALID [2022-04-28 08:15:12,577 INFO L290 TraceCheckUtils]: 22: Hoare triple {2154#(<= 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; {2154#(<= ssl3_accept_~state~0 8480)} is VALID [2022-04-28 08:15:12,578 INFO L290 TraceCheckUtils]: 23: Hoare triple {2154#(<= ssl3_accept_~state~0 8480)} assume 0 == ~s__s3__tmp__reuse_message~0; {2154#(<= ssl3_accept_~state~0 8480)} is VALID [2022-04-28 08:15:12,578 INFO L290 TraceCheckUtils]: 24: Hoare triple {2154#(<= ssl3_accept_~state~0 8480)} assume 0 == ~skip~0; {2154#(<= ssl3_accept_~state~0 8480)} is VALID [2022-04-28 08:15:12,579 INFO L290 TraceCheckUtils]: 25: Hoare triple {2154#(<= ssl3_accept_~state~0 8480)} assume -12288 != ~tmp___1~0; {2154#(<= ssl3_accept_~state~0 8480)} is VALID [2022-04-28 08:15:12,580 INFO L290 TraceCheckUtils]: 26: Hoare triple {2154#(<= ssl3_accept_~state~0 8480)} assume 8656 != ~s__state~0; {2154#(<= ssl3_accept_~state~0 8480)} is VALID [2022-04-28 08:15:12,580 INFO L290 TraceCheckUtils]: 27: Hoare triple {2154#(<= ssl3_accept_~state~0 8480)} assume -16384 != ~tmp___2~0; {2154#(<= ssl3_accept_~state~0 8480)} is VALID [2022-04-28 08:15:12,581 INFO L290 TraceCheckUtils]: 28: Hoare triple {2154#(<= ssl3_accept_~state~0 8480)} assume 8496 == ~state~0; {2149#false} is VALID [2022-04-28 08:15:12,581 INFO L290 TraceCheckUtils]: 29: Hoare triple {2149#false} assume !false; {2149#false} is VALID [2022-04-28 08:15:12,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:15:12,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:15:12,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139394599] [2022-04-28 08:15:12,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139394599] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:15:12,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:15:12,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:15:12,582 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:15:12,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1376183793] [2022-04-28 08:15:12,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1376183793] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:15:12,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:15:12,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:15:12,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281075569] [2022-04-28 08:15:12,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:15:12,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 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 30 [2022-04-28 08:15:12,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:15:12,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:12,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:15:12,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:15:12,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:15:12,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:15:12,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:15:12,606 INFO L87 Difference]: Start difference. First operand 270 states and 419 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:13,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:15:13,576 INFO L93 Difference]: Finished difference Result 350 states and 531 transitions. [2022-04-28 08:15:13,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 08:15:13,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 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 30 [2022-04-28 08:15:13,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:15:13,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:13,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 286 transitions. [2022-04-28 08:15:13,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:13,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 286 transitions. [2022-04-28 08:15:13,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 286 transitions. [2022-04-28 08:15:13,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 286 edges. 286 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:15:13,833 INFO L225 Difference]: With dead ends: 350 [2022-04-28 08:15:13,833 INFO L226 Difference]: Without dead ends: 348 [2022-04-28 08:15:13,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-28 08:15:13,835 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 439 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:15:13,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 191 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 08:15:13,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-04-28 08:15:14,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 288. [2022-04-28 08:15:14,044 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:15:14,045 INFO L82 GeneralOperation]: Start isEquivalent. First operand 348 states. Second operand has 288 states, 283 states have (on average 1.558303886925795) internal successors, (441), 283 states have internal predecessors, (441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:14,045 INFO L74 IsIncluded]: Start isIncluded. First operand 348 states. Second operand has 288 states, 283 states have (on average 1.558303886925795) internal successors, (441), 283 states have internal predecessors, (441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:14,046 INFO L87 Difference]: Start difference. First operand 348 states. Second operand has 288 states, 283 states have (on average 1.558303886925795) internal successors, (441), 283 states have internal predecessors, (441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:14,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:15:14,057 INFO L93 Difference]: Finished difference Result 348 states and 528 transitions. [2022-04-28 08:15:14,058 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 528 transitions. [2022-04-28 08:15:14,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:15:14,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:15:14,059 INFO L74 IsIncluded]: Start isIncluded. First operand has 288 states, 283 states have (on average 1.558303886925795) internal successors, (441), 283 states have internal predecessors, (441), 3 states have call successors, (3), 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 348 states. [2022-04-28 08:15:14,060 INFO L87 Difference]: Start difference. First operand has 288 states, 283 states have (on average 1.558303886925795) internal successors, (441), 283 states have internal predecessors, (441), 3 states have call successors, (3), 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 348 states. [2022-04-28 08:15:14,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:15:14,072 INFO L93 Difference]: Finished difference Result 348 states and 528 transitions. [2022-04-28 08:15:14,072 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 528 transitions. [2022-04-28 08:15:14,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:15:14,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:15:14,073 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:15:14,073 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:15:14,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 283 states have (on average 1.558303886925795) internal successors, (441), 283 states have internal predecessors, (441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:14,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 445 transitions. [2022-04-28 08:15:14,084 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 445 transitions. Word has length 30 [2022-04-28 08:15:14,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:15:14,085 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 445 transitions. [2022-04-28 08:15:14,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:14,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 288 states and 445 transitions. [2022-04-28 08:15:14,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 445 edges. 445 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:15:14,484 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 445 transitions. [2022-04-28 08:15:14,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 08:15:14,485 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:15:14,485 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:15:14,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 08:15:14,485 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:15:14,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:15:14,486 INFO L85 PathProgramCache]: Analyzing trace with hash 119204085, now seen corresponding path program 1 times [2022-04-28 08:15:14,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:15:14,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1260999539] [2022-04-28 08:15:14,487 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:15:14,487 INFO L85 PathProgramCache]: Analyzing trace with hash 119204085, now seen corresponding path program 2 times [2022-04-28 08:15:14,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:15:14,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277989567] [2022-04-28 08:15:14,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:15:14,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:15:14,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:15:14,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:15:14,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:15:14,568 INFO L290 TraceCheckUtils]: 0: Hoare triple {4146#(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); {4139#true} is VALID [2022-04-28 08:15:14,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {4139#true} assume true; {4139#true} is VALID [2022-04-28 08:15:14,569 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4139#true} {4139#true} #665#return; {4139#true} is VALID [2022-04-28 08:15:14,571 INFO L272 TraceCheckUtils]: 0: Hoare triple {4139#true} call ULTIMATE.init(); {4146#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:15:14,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {4146#(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); {4139#true} is VALID [2022-04-28 08:15:14,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {4139#true} assume true; {4139#true} is VALID [2022-04-28 08:15:14,572 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4139#true} {4139#true} #665#return; {4139#true} is VALID [2022-04-28 08:15:14,572 INFO L272 TraceCheckUtils]: 4: Hoare triple {4139#true} call #t~ret54 := main(); {4139#true} is VALID [2022-04-28 08:15:14,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {4139#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {4139#true} is VALID [2022-04-28 08:15:14,572 INFO L272 TraceCheckUtils]: 6: Hoare triple {4139#true} call #t~ret53 := ssl3_accept(~s~0); {4139#true} is VALID [2022-04-28 08:15:14,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {4139#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;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet19;havoc #t~nondet19;havoc ~s__s3__tmp__next_state___0~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~s__s3__tmp__new_cipher__algo_strength~0 := #t~nondet20;havoc #t~nondet20;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~num1~0 := #t~nondet21;havoc #t~nondet21;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___1~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___2~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___3~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___4~0 := #t~nondet25;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___5~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___6~0 := #t~nondet27;havoc #t~nondet27;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___8~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___9~0 := #t~nondet29;havoc #t~nondet29;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___10~0 := #t~nondet30;havoc #t~nondet30;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;havoc ~__cil_tmp61~0;~s__s3__tmp__reuse_message~0 := 0;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp~0 := #t~nondet31;havoc #t~nondet31;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {4139#true} is VALID [2022-04-28 08:15:14,573 INFO L290 TraceCheckUtils]: 8: Hoare triple {4139#true} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {4139#true} is VALID [2022-04-28 08:15:14,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {4139#true} #t~post32 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post32;havoc #t~post32; {4139#true} is VALID [2022-04-28 08:15:14,573 INFO L290 TraceCheckUtils]: 10: Hoare triple {4139#true} assume 0 != 12288 + ~tmp___1~0; {4139#true} is VALID [2022-04-28 08:15:14,573 INFO L290 TraceCheckUtils]: 11: Hoare triple {4139#true} assume 0 != 16384 + ~tmp___2~0; {4139#true} is VALID [2022-04-28 08:15:14,573 INFO L290 TraceCheckUtils]: 12: Hoare triple {4139#true} assume !(0 == ~s__cert~0); {4139#true} is VALID [2022-04-28 08:15:14,574 INFO L290 TraceCheckUtils]: 13: Hoare triple {4139#true} assume !false; {4139#true} is VALID [2022-04-28 08:15:14,574 INFO L290 TraceCheckUtils]: 14: Hoare triple {4139#true} ~state~0 := ~s__state~0; {4144#(<= ssl3_accept_~s__state~0 ssl3_accept_~state~0)} is VALID [2022-04-28 08:15:14,575 INFO L290 TraceCheckUtils]: 15: Hoare triple {4144#(<= ssl3_accept_~s__state~0 ssl3_accept_~state~0)} assume 12292 == ~s__state~0; {4145#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-28 08:15:14,575 INFO L290 TraceCheckUtils]: 16: Hoare triple {4145#(<= 12292 ssl3_accept_~state~0)} ~s__new_session~0 := 1; {4145#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-28 08:15:14,576 INFO L290 TraceCheckUtils]: 17: Hoare triple {4145#(<= 12292 ssl3_accept_~state~0)} ~s__server~0 := 1; {4145#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-28 08:15:14,576 INFO L290 TraceCheckUtils]: 18: Hoare triple {4145#(<= 12292 ssl3_accept_~state~0)} assume 0 != ~cb~0; {4145#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-28 08:15:14,577 INFO L290 TraceCheckUtils]: 19: Hoare triple {4145#(<= 12292 ssl3_accept_~state~0)} ~__cil_tmp55~0 := 8 * ~s__version~0; {4145#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-28 08:15:14,577 INFO L290 TraceCheckUtils]: 20: Hoare triple {4145#(<= 12292 ssl3_accept_~state~0)} assume !(3 != ~__cil_tmp55~0);~s__type~0 := 8192; {4145#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-28 08:15:14,578 INFO L290 TraceCheckUtils]: 21: Hoare triple {4145#(<= 12292 ssl3_accept_~state~0)} assume !(0 == ~s__init_buf___0~0); {4145#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-28 08:15:14,578 INFO L290 TraceCheckUtils]: 22: Hoare triple {4145#(<= 12292 ssl3_accept_~state~0)} assume !(0 == ~tmp___4~0);~s__init_num~0 := 0; {4145#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-28 08:15:14,579 INFO L290 TraceCheckUtils]: 23: Hoare triple {4145#(<= 12292 ssl3_accept_~state~0)} assume !(12292 != ~s__state~0);#t~post35 := ~s__ctx__stats__sess_accept_renegotiate~0;~s__ctx__stats__sess_accept_renegotiate~0 := 1 + #t~post35;havoc #t~post35;~s__state~0 := 8480; {4145#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-28 08:15:14,579 INFO L290 TraceCheckUtils]: 24: Hoare triple {4145#(<= 12292 ssl3_accept_~state~0)} assume 0 == ~s__s3__tmp__reuse_message~0; {4145#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-28 08:15:14,579 INFO L290 TraceCheckUtils]: 25: Hoare triple {4145#(<= 12292 ssl3_accept_~state~0)} assume 0 == ~skip~0; {4145#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-28 08:15:14,580 INFO L290 TraceCheckUtils]: 26: Hoare triple {4145#(<= 12292 ssl3_accept_~state~0)} assume -12288 != ~tmp___1~0; {4145#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-28 08:15:14,580 INFO L290 TraceCheckUtils]: 27: Hoare triple {4145#(<= 12292 ssl3_accept_~state~0)} assume 8656 != ~s__state~0; {4145#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-28 08:15:14,581 INFO L290 TraceCheckUtils]: 28: Hoare triple {4145#(<= 12292 ssl3_accept_~state~0)} assume -16384 != ~tmp___2~0; {4145#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-28 08:15:14,581 INFO L290 TraceCheckUtils]: 29: Hoare triple {4145#(<= 12292 ssl3_accept_~state~0)} assume 8496 == ~state~0; {4140#false} is VALID [2022-04-28 08:15:14,581 INFO L290 TraceCheckUtils]: 30: Hoare triple {4140#false} assume !false; {4140#false} is VALID [2022-04-28 08:15:14,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:15:14,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:15:14,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277989567] [2022-04-28 08:15:14,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277989567] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:15:14,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:15:14,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:15:14,583 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:15:14,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1260999539] [2022-04-28 08:15:14,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1260999539] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:15:14,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:15:14,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:15:14,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616663648] [2022-04-28 08:15:14,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:15:14,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 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 31 [2022-04-28 08:15:14,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:15:14,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:14,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:15:14,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:15:14,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:15:14,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:15:14,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:15:14,609 INFO L87 Difference]: Start difference. First operand 288 states and 445 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:15,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:15:15,754 INFO L93 Difference]: Finished difference Result 337 states and 514 transitions. [2022-04-28 08:15:15,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:15:15,754 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 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 31 [2022-04-28 08:15:15,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:15:15,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:15,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 262 transitions. [2022-04-28 08:15:15,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:15,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 262 transitions. [2022-04-28 08:15:15,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 262 transitions. [2022-04-28 08:15:15,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 262 edges. 262 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:15:15,980 INFO L225 Difference]: With dead ends: 337 [2022-04-28 08:15:15,980 INFO L226 Difference]: Without dead ends: 335 [2022-04-28 08:15:15,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-28 08:15:15,982 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 431 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:15:15,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 181 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 08:15:15,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2022-04-28 08:15:16,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 278. [2022-04-28 08:15:16,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:15:16,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 335 states. Second operand has 278 states, 273 states have (on average 1.5677655677655677) internal successors, (428), 273 states have internal predecessors, (428), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:16,331 INFO L74 IsIncluded]: Start isIncluded. First operand 335 states. Second operand has 278 states, 273 states have (on average 1.5677655677655677) internal successors, (428), 273 states have internal predecessors, (428), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:16,334 INFO L87 Difference]: Start difference. First operand 335 states. Second operand has 278 states, 273 states have (on average 1.5677655677655677) internal successors, (428), 273 states have internal predecessors, (428), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:16,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:15:16,350 INFO L93 Difference]: Finished difference Result 335 states and 512 transitions. [2022-04-28 08:15:16,350 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 512 transitions. [2022-04-28 08:15:16,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:15:16,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:15:16,352 INFO L74 IsIncluded]: Start isIncluded. First operand has 278 states, 273 states have (on average 1.5677655677655677) internal successors, (428), 273 states have internal predecessors, (428), 3 states have call successors, (3), 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 335 states. [2022-04-28 08:15:16,353 INFO L87 Difference]: Start difference. First operand has 278 states, 273 states have (on average 1.5677655677655677) internal successors, (428), 273 states have internal predecessors, (428), 3 states have call successors, (3), 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 335 states. [2022-04-28 08:15:16,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:15:16,371 INFO L93 Difference]: Finished difference Result 335 states and 512 transitions. [2022-04-28 08:15:16,371 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 512 transitions. [2022-04-28 08:15:16,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:15:16,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:15:16,372 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:15:16,372 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:15:16,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 273 states have (on average 1.5677655677655677) internal successors, (428), 273 states have internal predecessors, (428), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:16,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 432 transitions. [2022-04-28 08:15:16,381 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 432 transitions. Word has length 31 [2022-04-28 08:15:16,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:15:16,384 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 432 transitions. [2022-04-28 08:15:16,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:16,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 278 states and 432 transitions. [2022-04-28 08:15:16,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 432 edges. 432 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:15:16,785 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 432 transitions. [2022-04-28 08:15:16,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 08:15:16,785 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:15:16,785 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:15:16,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 08:15:16,786 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:15:16,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:15:16,786 INFO L85 PathProgramCache]: Analyzing trace with hash -103055551, now seen corresponding path program 1 times [2022-04-28 08:15:16,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:15:16,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1722620966] [2022-04-28 08:15:16,791 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:15:16,791 INFO L85 PathProgramCache]: Analyzing trace with hash -103055551, now seen corresponding path program 2 times [2022-04-28 08:15:16,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:15:16,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949095296] [2022-04-28 08:15:16,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:15:16,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:15:16,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:15:16,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:15:16,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:15:16,868 INFO L290 TraceCheckUtils]: 0: Hoare triple {6062#(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); {6055#true} is VALID [2022-04-28 08:15:16,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {6055#true} assume true; {6055#true} is VALID [2022-04-28 08:15:16,868 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6055#true} {6055#true} #665#return; {6055#true} is VALID [2022-04-28 08:15:16,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {6055#true} call ULTIMATE.init(); {6062#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:15:16,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {6062#(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); {6055#true} is VALID [2022-04-28 08:15:16,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {6055#true} assume true; {6055#true} is VALID [2022-04-28 08:15:16,869 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6055#true} {6055#true} #665#return; {6055#true} is VALID [2022-04-28 08:15:16,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {6055#true} call #t~ret54 := main(); {6055#true} is VALID [2022-04-28 08:15:16,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {6055#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {6055#true} is VALID [2022-04-28 08:15:16,870 INFO L272 TraceCheckUtils]: 6: Hoare triple {6055#true} call #t~ret53 := ssl3_accept(~s~0); {6055#true} is VALID [2022-04-28 08:15:16,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {6055#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;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet19;havoc #t~nondet19;havoc ~s__s3__tmp__next_state___0~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~s__s3__tmp__new_cipher__algo_strength~0 := #t~nondet20;havoc #t~nondet20;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~num1~0 := #t~nondet21;havoc #t~nondet21;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___1~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___2~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___3~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___4~0 := #t~nondet25;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___5~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___6~0 := #t~nondet27;havoc #t~nondet27;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___8~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___9~0 := #t~nondet29;havoc #t~nondet29;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___10~0 := #t~nondet30;havoc #t~nondet30;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;havoc ~__cil_tmp61~0;~s__s3__tmp__reuse_message~0 := 0;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp~0 := #t~nondet31;havoc #t~nondet31;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {6055#true} is VALID [2022-04-28 08:15:16,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {6055#true} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {6055#true} is VALID [2022-04-28 08:15:16,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {6055#true} #t~post32 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post32;havoc #t~post32; {6055#true} is VALID [2022-04-28 08:15:16,871 INFO L290 TraceCheckUtils]: 10: Hoare triple {6055#true} assume 0 != 12288 + ~tmp___1~0; {6055#true} is VALID [2022-04-28 08:15:16,871 INFO L290 TraceCheckUtils]: 11: Hoare triple {6055#true} assume 0 != 16384 + ~tmp___2~0; {6055#true} is VALID [2022-04-28 08:15:16,871 INFO L290 TraceCheckUtils]: 12: Hoare triple {6055#true} assume !(0 == ~s__cert~0); {6055#true} is VALID [2022-04-28 08:15:16,871 INFO L290 TraceCheckUtils]: 13: Hoare triple {6055#true} assume !false; {6055#true} is VALID [2022-04-28 08:15:16,871 INFO L290 TraceCheckUtils]: 14: Hoare triple {6055#true} ~state~0 := ~s__state~0; {6060#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-28 08:15:16,872 INFO L290 TraceCheckUtils]: 15: Hoare triple {6060#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(12292 == ~s__state~0); {6060#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-28 08:15:16,872 INFO L290 TraceCheckUtils]: 16: Hoare triple {6060#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(16384 == ~s__state~0); {6060#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-28 08:15:16,873 INFO L290 TraceCheckUtils]: 17: Hoare triple {6060#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8192 == ~s__state~0); {6060#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-28 08:15:16,873 INFO L290 TraceCheckUtils]: 18: Hoare triple {6060#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(24576 == ~s__state~0); {6060#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-28 08:15:16,873 INFO L290 TraceCheckUtils]: 19: Hoare triple {6060#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8195 == ~s__state~0); {6060#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-28 08:15:16,874 INFO L290 TraceCheckUtils]: 20: Hoare triple {6060#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8480 == ~s__state~0); {6060#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-28 08:15:16,874 INFO L290 TraceCheckUtils]: 21: Hoare triple {6060#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8481 == ~s__state~0); {6060#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-28 08:15:16,874 INFO L290 TraceCheckUtils]: 22: Hoare triple {6060#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume 8482 == ~s__state~0; {6061#(<= ssl3_accept_~state~0 8482)} is VALID [2022-04-28 08:15:16,875 INFO L290 TraceCheckUtils]: 23: Hoare triple {6061#(<= ssl3_accept_~state~0 8482)} ~s__state~0 := 3; {6061#(<= ssl3_accept_~state~0 8482)} is VALID [2022-04-28 08:15:16,875 INFO L290 TraceCheckUtils]: 24: Hoare triple {6061#(<= ssl3_accept_~state~0 8482)} assume 0 == ~s__s3__tmp__reuse_message~0; {6061#(<= ssl3_accept_~state~0 8482)} is VALID [2022-04-28 08:15:16,875 INFO L290 TraceCheckUtils]: 25: Hoare triple {6061#(<= ssl3_accept_~state~0 8482)} assume 0 == ~skip~0; {6061#(<= ssl3_accept_~state~0 8482)} is VALID [2022-04-28 08:15:16,876 INFO L290 TraceCheckUtils]: 26: Hoare triple {6061#(<= ssl3_accept_~state~0 8482)} assume -12288 != ~tmp___1~0; {6061#(<= ssl3_accept_~state~0 8482)} is VALID [2022-04-28 08:15:16,876 INFO L290 TraceCheckUtils]: 27: Hoare triple {6061#(<= ssl3_accept_~state~0 8482)} assume 8656 != ~s__state~0; {6061#(<= ssl3_accept_~state~0 8482)} is VALID [2022-04-28 08:15:16,877 INFO L290 TraceCheckUtils]: 28: Hoare triple {6061#(<= ssl3_accept_~state~0 8482)} assume -16384 != ~tmp___2~0; {6061#(<= ssl3_accept_~state~0 8482)} is VALID [2022-04-28 08:15:16,877 INFO L290 TraceCheckUtils]: 29: Hoare triple {6061#(<= ssl3_accept_~state~0 8482)} assume 8496 == ~state~0; {6056#false} is VALID [2022-04-28 08:15:16,877 INFO L290 TraceCheckUtils]: 30: Hoare triple {6056#false} assume !false; {6056#false} is VALID [2022-04-28 08:15:16,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:15:16,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:15:16,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949095296] [2022-04-28 08:15:16,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949095296] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:15:16,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:15:16,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:15:16,878 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:15:16,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1722620966] [2022-04-28 08:15:16,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1722620966] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:15:16,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:15:16,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:15:16,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202372907] [2022-04-28 08:15:16,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:15:16,879 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 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 31 [2022-04-28 08:15:16,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:15:16,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:16,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:15:16,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:15:16,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:15:16,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:15:16,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:15:16,901 INFO L87 Difference]: Start difference. First operand 278 states and 432 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:18,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:15:18,111 INFO L93 Difference]: Finished difference Result 360 states and 550 transitions. [2022-04-28 08:15:18,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 08:15:18,111 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 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 31 [2022-04-28 08:15:18,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:15:18,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:18,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 283 transitions. [2022-04-28 08:15:18,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:18,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 283 transitions. [2022-04-28 08:15:18,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 283 transitions. [2022-04-28 08:15:18,324 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 283 edges. 283 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:15:18,333 INFO L225 Difference]: With dead ends: 360 [2022-04-28 08:15:18,333 INFO L226 Difference]: Without dead ends: 358 [2022-04-28 08:15:18,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-28 08:15:18,335 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 436 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:15:18,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 191 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 08:15:18,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-04-28 08:15:18,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 276. [2022-04-28 08:15:18,685 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:15:18,686 INFO L82 GeneralOperation]: Start isEquivalent. First operand 358 states. Second operand has 276 states, 271 states have (on average 1.5719557195571956) internal successors, (426), 271 states have internal predecessors, (426), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:18,687 INFO L74 IsIncluded]: Start isIncluded. First operand 358 states. Second operand has 276 states, 271 states have (on average 1.5719557195571956) internal successors, (426), 271 states have internal predecessors, (426), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:18,687 INFO L87 Difference]: Start difference. First operand 358 states. Second operand has 276 states, 271 states have (on average 1.5719557195571956) internal successors, (426), 271 states have internal predecessors, (426), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:18,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:15:18,697 INFO L93 Difference]: Finished difference Result 358 states and 548 transitions. [2022-04-28 08:15:18,697 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 548 transitions. [2022-04-28 08:15:18,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:15:18,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:15:18,698 INFO L74 IsIncluded]: Start isIncluded. First operand has 276 states, 271 states have (on average 1.5719557195571956) internal successors, (426), 271 states have internal predecessors, (426), 3 states have call successors, (3), 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 358 states. [2022-04-28 08:15:18,699 INFO L87 Difference]: Start difference. First operand has 276 states, 271 states have (on average 1.5719557195571956) internal successors, (426), 271 states have internal predecessors, (426), 3 states have call successors, (3), 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 358 states. [2022-04-28 08:15:18,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:15:18,708 INFO L93 Difference]: Finished difference Result 358 states and 548 transitions. [2022-04-28 08:15:18,709 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 548 transitions. [2022-04-28 08:15:18,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:15:18,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:15:18,709 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:15:18,709 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:15:18,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 271 states have (on average 1.5719557195571956) internal successors, (426), 271 states have internal predecessors, (426), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:18,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 430 transitions. [2022-04-28 08:15:18,717 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 430 transitions. Word has length 31 [2022-04-28 08:15:18,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:15:18,718 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 430 transitions. [2022-04-28 08:15:18,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:18,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 276 states and 430 transitions. [2022-04-28 08:15:19,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 430 edges. 430 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:15:19,108 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 430 transitions. [2022-04-28 08:15:19,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 08:15:19,109 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:15:19,109 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:15:19,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 08:15:19,110 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:15:19,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:15:19,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1303486160, now seen corresponding path program 1 times [2022-04-28 08:15:19,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:15:19,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1317600670] [2022-04-28 08:15:19,111 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:15:19,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1303486160, now seen corresponding path program 2 times [2022-04-28 08:15:19,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:15:19,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007006133] [2022-04-28 08:15:19,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:15:19,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:15:19,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:15:19,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:15:19,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:15:19,179 INFO L290 TraceCheckUtils]: 0: Hoare triple {8068#(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); {8062#true} is VALID [2022-04-28 08:15:19,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {8062#true} assume true; {8062#true} is VALID [2022-04-28 08:15:19,179 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8062#true} {8062#true} #665#return; {8062#true} is VALID [2022-04-28 08:15:19,180 INFO L272 TraceCheckUtils]: 0: Hoare triple {8062#true} call ULTIMATE.init(); {8068#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:15:19,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {8068#(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); {8062#true} is VALID [2022-04-28 08:15:19,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {8062#true} assume true; {8062#true} is VALID [2022-04-28 08:15:19,180 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8062#true} {8062#true} #665#return; {8062#true} is VALID [2022-04-28 08:15:19,180 INFO L272 TraceCheckUtils]: 4: Hoare triple {8062#true} call #t~ret54 := main(); {8062#true} is VALID [2022-04-28 08:15:19,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {8062#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {8062#true} is VALID [2022-04-28 08:15:19,181 INFO L272 TraceCheckUtils]: 6: Hoare triple {8062#true} call #t~ret53 := ssl3_accept(~s~0); {8062#true} is VALID [2022-04-28 08:15:19,181 INFO L290 TraceCheckUtils]: 7: Hoare triple {8062#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;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet19;havoc #t~nondet19;havoc ~s__s3__tmp__next_state___0~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~s__s3__tmp__new_cipher__algo_strength~0 := #t~nondet20;havoc #t~nondet20;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~num1~0 := #t~nondet21;havoc #t~nondet21;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___1~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___2~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___3~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___4~0 := #t~nondet25;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___5~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___6~0 := #t~nondet27;havoc #t~nondet27;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___8~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___9~0 := #t~nondet29;havoc #t~nondet29;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___10~0 := #t~nondet30;havoc #t~nondet30;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;havoc ~__cil_tmp61~0;~s__s3__tmp__reuse_message~0 := 0;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp~0 := #t~nondet31;havoc #t~nondet31;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {8067#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:15:19,181 INFO L290 TraceCheckUtils]: 8: Hoare triple {8067#(= ssl3_accept_~blastFlag~0 0)} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {8067#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:15:19,182 INFO L290 TraceCheckUtils]: 9: Hoare triple {8067#(= ssl3_accept_~blastFlag~0 0)} #t~post32 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post32;havoc #t~post32; {8067#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:15:19,182 INFO L290 TraceCheckUtils]: 10: Hoare triple {8067#(= ssl3_accept_~blastFlag~0 0)} assume 0 != 12288 + ~tmp___1~0; {8067#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:15:19,183 INFO L290 TraceCheckUtils]: 11: Hoare triple {8067#(= ssl3_accept_~blastFlag~0 0)} assume 0 != 16384 + ~tmp___2~0; {8067#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:15:19,183 INFO L290 TraceCheckUtils]: 12: Hoare triple {8067#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == ~s__cert~0); {8067#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:15:19,183 INFO L290 TraceCheckUtils]: 13: Hoare triple {8067#(= ssl3_accept_~blastFlag~0 0)} assume !false; {8067#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:15:19,184 INFO L290 TraceCheckUtils]: 14: Hoare triple {8067#(= ssl3_accept_~blastFlag~0 0)} ~state~0 := ~s__state~0; {8067#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:15:19,184 INFO L290 TraceCheckUtils]: 15: Hoare triple {8067#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == ~s__state~0); {8067#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:15:19,184 INFO L290 TraceCheckUtils]: 16: Hoare triple {8067#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == ~s__state~0); {8067#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:15:19,185 INFO L290 TraceCheckUtils]: 17: Hoare triple {8067#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == ~s__state~0); {8067#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:15:19,185 INFO L290 TraceCheckUtils]: 18: Hoare triple {8067#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == ~s__state~0); {8067#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:15:19,186 INFO L290 TraceCheckUtils]: 19: Hoare triple {8067#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == ~s__state~0); {8067#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:15:19,186 INFO L290 TraceCheckUtils]: 20: Hoare triple {8067#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == ~s__state~0); {8067#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:15:19,186 INFO L290 TraceCheckUtils]: 21: Hoare triple {8067#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == ~s__state~0); {8067#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:15:19,187 INFO L290 TraceCheckUtils]: 22: Hoare triple {8067#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == ~s__state~0); {8067#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:15:19,187 INFO L290 TraceCheckUtils]: 23: Hoare triple {8067#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == ~s__state~0); {8067#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:15:19,187 INFO L290 TraceCheckUtils]: 24: Hoare triple {8067#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == ~s__state~0); {8067#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:15:19,188 INFO L290 TraceCheckUtils]: 25: Hoare triple {8067#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == ~s__state~0); {8067#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:15:19,188 INFO L290 TraceCheckUtils]: 26: Hoare triple {8067#(= ssl3_accept_~blastFlag~0 0)} assume 8496 == ~s__state~0; {8067#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:15:19,189 INFO L290 TraceCheckUtils]: 27: Hoare triple {8067#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~ret~0 := #t~nondet38;havoc #t~nondet38; {8067#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:15:19,189 INFO L290 TraceCheckUtils]: 28: Hoare triple {8067#(= ssl3_accept_~blastFlag~0 0)} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {8063#false} is VALID [2022-04-28 08:15:19,189 INFO L290 TraceCheckUtils]: 29: Hoare triple {8063#false} assume !(~ret~0 <= 0); {8063#false} is VALID [2022-04-28 08:15:19,189 INFO L290 TraceCheckUtils]: 30: Hoare triple {8063#false} assume 0 != ~s__hit~0;~s__state~0 := 8656; {8063#false} is VALID [2022-04-28 08:15:19,190 INFO L290 TraceCheckUtils]: 31: Hoare triple {8063#false} ~s__init_num~0 := 0; {8063#false} is VALID [2022-04-28 08:15:19,190 INFO L290 TraceCheckUtils]: 32: Hoare triple {8063#false} assume 0 == ~s__s3__tmp__reuse_message~0; {8063#false} is VALID [2022-04-28 08:15:19,190 INFO L290 TraceCheckUtils]: 33: Hoare triple {8063#false} assume 0 == ~skip~0; {8063#false} is VALID [2022-04-28 08:15:19,190 INFO L290 TraceCheckUtils]: 34: Hoare triple {8063#false} assume -12288 != ~tmp___1~0; {8063#false} is VALID [2022-04-28 08:15:19,190 INFO L290 TraceCheckUtils]: 35: Hoare triple {8063#false} assume 8656 != ~s__state~0; {8063#false} is VALID [2022-04-28 08:15:19,190 INFO L290 TraceCheckUtils]: 36: Hoare triple {8063#false} assume -16384 != ~tmp___2~0; {8063#false} is VALID [2022-04-28 08:15:19,191 INFO L290 TraceCheckUtils]: 37: Hoare triple {8063#false} assume 8496 == ~state~0; {8063#false} is VALID [2022-04-28 08:15:19,191 INFO L290 TraceCheckUtils]: 38: Hoare triple {8063#false} assume !false; {8063#false} is VALID [2022-04-28 08:15:19,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:15:19,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:15:19,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007006133] [2022-04-28 08:15:19,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007006133] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:15:19,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:15:19,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:15:19,192 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:15:19,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1317600670] [2022-04-28 08:15:19,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1317600670] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:15:19,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:15:19,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:15:19,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528514531] [2022-04-28 08:15:19,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:15:19,193 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-28 08:15:19,193 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:15:19,193 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-28 08:15:19,220 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-28 08:15:19,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:15:19,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:15:19,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:15:19,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:15:19,221 INFO L87 Difference]: Start difference. First operand 276 states and 430 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-28 08:15:20,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:15:20,534 INFO L93 Difference]: Finished difference Result 796 states and 1250 transitions. [2022-04-28 08:15:20,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:15:20,535 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-28 08:15:20,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:15:20,535 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-28 08:15:20,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 629 transitions. [2022-04-28 08:15:20,539 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-28 08:15:20,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 629 transitions. [2022-04-28 08:15:20,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 629 transitions. [2022-04-28 08:15:21,011 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-28 08:15:21,030 INFO L225 Difference]: With dead ends: 796 [2022-04-28 08:15:21,031 INFO L226 Difference]: Without dead ends: 535 [2022-04-28 08:15:21,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:15:21,033 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 588 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 08:15:21,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 218 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 08:15:21,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2022-04-28 08:15:21,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 533. [2022-04-28 08:15:21,664 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:15:21,666 INFO L82 GeneralOperation]: Start isEquivalent. First operand 535 states. Second operand has 533 states, 528 states have (on average 1.5378787878787878) internal successors, (812), 528 states have internal predecessors, (812), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:21,667 INFO L74 IsIncluded]: Start isIncluded. First operand 535 states. Second operand has 533 states, 528 states have (on average 1.5378787878787878) internal successors, (812), 528 states have internal predecessors, (812), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:21,668 INFO L87 Difference]: Start difference. First operand 535 states. Second operand has 533 states, 528 states have (on average 1.5378787878787878) internal successors, (812), 528 states have internal predecessors, (812), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:21,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:15:21,685 INFO L93 Difference]: Finished difference Result 535 states and 817 transitions. [2022-04-28 08:15:21,685 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 817 transitions. [2022-04-28 08:15:21,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:15:21,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:15:21,687 INFO L74 IsIncluded]: Start isIncluded. First operand has 533 states, 528 states have (on average 1.5378787878787878) internal successors, (812), 528 states have internal predecessors, (812), 3 states have call successors, (3), 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 535 states. [2022-04-28 08:15:21,689 INFO L87 Difference]: Start difference. First operand has 533 states, 528 states have (on average 1.5378787878787878) internal successors, (812), 528 states have internal predecessors, (812), 3 states have call successors, (3), 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 535 states. [2022-04-28 08:15:21,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:15:21,705 INFO L93 Difference]: Finished difference Result 535 states and 817 transitions. [2022-04-28 08:15:21,705 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 817 transitions. [2022-04-28 08:15:21,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:15:21,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:15:21,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:15:21,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:15:21,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 528 states have (on average 1.5378787878787878) internal successors, (812), 528 states have internal predecessors, (812), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:21,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 816 transitions. [2022-04-28 08:15:21,731 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 816 transitions. Word has length 39 [2022-04-28 08:15:21,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:15:21,731 INFO L495 AbstractCegarLoop]: Abstraction has 533 states and 816 transitions. [2022-04-28 08:15:21,731 INFO L496 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-28 08:15:21,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 533 states and 816 transitions. [2022-04-28 08:15:22,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 816 edges. 816 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:15:22,564 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 816 transitions. [2022-04-28 08:15:22,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 08:15:22,566 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:15:22,566 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:15:22,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 08:15:22,566 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:15:22,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:15:22,567 INFO L85 PathProgramCache]: Analyzing trace with hash -602421582, now seen corresponding path program 1 times [2022-04-28 08:15:22,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:15:22,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [54678439] [2022-04-28 08:15:22,567 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:15:22,568 INFO L85 PathProgramCache]: Analyzing trace with hash -602421582, now seen corresponding path program 2 times [2022-04-28 08:15:22,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:15:22,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467490217] [2022-04-28 08:15:22,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:15:22,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:15:22,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:15:22,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:15:22,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:15:22,666 INFO L290 TraceCheckUtils]: 0: Hoare triple {11807#(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); {11801#true} is VALID [2022-04-28 08:15:22,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {11801#true} assume true; {11801#true} is VALID [2022-04-28 08:15:22,666 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11801#true} {11801#true} #665#return; {11801#true} is VALID [2022-04-28 08:15:22,668 INFO L272 TraceCheckUtils]: 0: Hoare triple {11801#true} call ULTIMATE.init(); {11807#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:15:22,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {11807#(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); {11801#true} is VALID [2022-04-28 08:15:22,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {11801#true} assume true; {11801#true} is VALID [2022-04-28 08:15:22,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11801#true} {11801#true} #665#return; {11801#true} is VALID [2022-04-28 08:15:22,669 INFO L272 TraceCheckUtils]: 4: Hoare triple {11801#true} call #t~ret54 := main(); {11801#true} is VALID [2022-04-28 08:15:22,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {11801#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {11801#true} is VALID [2022-04-28 08:15:22,669 INFO L272 TraceCheckUtils]: 6: Hoare triple {11801#true} call #t~ret53 := ssl3_accept(~s~0); {11801#true} is VALID [2022-04-28 08:15:22,669 INFO L290 TraceCheckUtils]: 7: Hoare triple {11801#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;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet19;havoc #t~nondet19;havoc ~s__s3__tmp__next_state___0~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~s__s3__tmp__new_cipher__algo_strength~0 := #t~nondet20;havoc #t~nondet20;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~num1~0 := #t~nondet21;havoc #t~nondet21;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___1~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___2~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___3~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___4~0 := #t~nondet25;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___5~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___6~0 := #t~nondet27;havoc #t~nondet27;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___8~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___9~0 := #t~nondet29;havoc #t~nondet29;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___10~0 := #t~nondet30;havoc #t~nondet30;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;havoc ~__cil_tmp61~0;~s__s3__tmp__reuse_message~0 := 0;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp~0 := #t~nondet31;havoc #t~nondet31;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {11801#true} is VALID [2022-04-28 08:15:22,669 INFO L290 TraceCheckUtils]: 8: Hoare triple {11801#true} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {11801#true} is VALID [2022-04-28 08:15:22,669 INFO L290 TraceCheckUtils]: 9: Hoare triple {11801#true} #t~post32 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post32;havoc #t~post32; {11801#true} is VALID [2022-04-28 08:15:22,669 INFO L290 TraceCheckUtils]: 10: Hoare triple {11801#true} assume 0 != 12288 + ~tmp___1~0; {11801#true} is VALID [2022-04-28 08:15:22,670 INFO L290 TraceCheckUtils]: 11: Hoare triple {11801#true} assume 0 != 16384 + ~tmp___2~0; {11801#true} is VALID [2022-04-28 08:15:22,670 INFO L290 TraceCheckUtils]: 12: Hoare triple {11801#true} assume !(0 == ~s__cert~0); {11801#true} is VALID [2022-04-28 08:15:22,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {11801#true} assume !false; {11801#true} is VALID [2022-04-28 08:15:22,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {11801#true} ~state~0 := ~s__state~0; {11801#true} is VALID [2022-04-28 08:15:22,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {11801#true} assume !(12292 == ~s__state~0); {11801#true} is VALID [2022-04-28 08:15:22,670 INFO L290 TraceCheckUtils]: 16: Hoare triple {11801#true} assume !(16384 == ~s__state~0); {11801#true} is VALID [2022-04-28 08:15:22,670 INFO L290 TraceCheckUtils]: 17: Hoare triple {11801#true} assume !(8192 == ~s__state~0); {11801#true} is VALID [2022-04-28 08:15:22,670 INFO L290 TraceCheckUtils]: 18: Hoare triple {11801#true} assume !(24576 == ~s__state~0); {11801#true} is VALID [2022-04-28 08:15:22,670 INFO L290 TraceCheckUtils]: 19: Hoare triple {11801#true} assume !(8195 == ~s__state~0); {11801#true} is VALID [2022-04-28 08:15:22,671 INFO L290 TraceCheckUtils]: 20: Hoare triple {11801#true} assume !(8480 == ~s__state~0); {11801#true} is VALID [2022-04-28 08:15:22,671 INFO L290 TraceCheckUtils]: 21: Hoare triple {11801#true} assume !(8481 == ~s__state~0); {11801#true} is VALID [2022-04-28 08:15:22,671 INFO L290 TraceCheckUtils]: 22: Hoare triple {11801#true} assume !(8482 == ~s__state~0); {11801#true} is VALID [2022-04-28 08:15:22,671 INFO L290 TraceCheckUtils]: 23: Hoare triple {11801#true} assume !(8464 == ~s__state~0); {11801#true} is VALID [2022-04-28 08:15:22,671 INFO L290 TraceCheckUtils]: 24: Hoare triple {11801#true} assume !(8465 == ~s__state~0); {11801#true} is VALID [2022-04-28 08:15:22,671 INFO L290 TraceCheckUtils]: 25: Hoare triple {11801#true} assume !(8466 == ~s__state~0); {11801#true} is VALID [2022-04-28 08:15:22,675 INFO L290 TraceCheckUtils]: 26: Hoare triple {11801#true} assume 8496 == ~s__state~0; {11801#true} is VALID [2022-04-28 08:15:22,675 INFO L290 TraceCheckUtils]: 27: Hoare triple {11801#true} assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~ret~0 := #t~nondet38;havoc #t~nondet38; {11801#true} is VALID [2022-04-28 08:15:22,675 INFO L290 TraceCheckUtils]: 28: Hoare triple {11801#true} assume !(1 == ~blastFlag~0); {11801#true} is VALID [2022-04-28 08:15:22,675 INFO L290 TraceCheckUtils]: 29: Hoare triple {11801#true} assume !(~ret~0 <= 0); {11801#true} is VALID [2022-04-28 08:15:22,676 INFO L290 TraceCheckUtils]: 30: Hoare triple {11801#true} assume 0 != ~s__hit~0;~s__state~0 := 8656; {11806#(= (+ ssl3_accept_~s__state~0 (- 8656)) 0)} is VALID [2022-04-28 08:15:22,676 INFO L290 TraceCheckUtils]: 31: Hoare triple {11806#(= (+ ssl3_accept_~s__state~0 (- 8656)) 0)} ~s__init_num~0 := 0; {11806#(= (+ ssl3_accept_~s__state~0 (- 8656)) 0)} is VALID [2022-04-28 08:15:22,676 INFO L290 TraceCheckUtils]: 32: Hoare triple {11806#(= (+ ssl3_accept_~s__state~0 (- 8656)) 0)} assume 0 == ~s__s3__tmp__reuse_message~0; {11806#(= (+ ssl3_accept_~s__state~0 (- 8656)) 0)} is VALID [2022-04-28 08:15:22,677 INFO L290 TraceCheckUtils]: 33: Hoare triple {11806#(= (+ ssl3_accept_~s__state~0 (- 8656)) 0)} assume 0 == ~skip~0; {11806#(= (+ ssl3_accept_~s__state~0 (- 8656)) 0)} is VALID [2022-04-28 08:15:22,677 INFO L290 TraceCheckUtils]: 34: Hoare triple {11806#(= (+ ssl3_accept_~s__state~0 (- 8656)) 0)} assume -12288 != ~tmp___1~0; {11806#(= (+ ssl3_accept_~s__state~0 (- 8656)) 0)} is VALID [2022-04-28 08:15:22,677 INFO L290 TraceCheckUtils]: 35: Hoare triple {11806#(= (+ ssl3_accept_~s__state~0 (- 8656)) 0)} assume 8656 != ~s__state~0; {11802#false} is VALID [2022-04-28 08:15:22,677 INFO L290 TraceCheckUtils]: 36: Hoare triple {11802#false} assume -16384 != ~tmp___2~0; {11802#false} is VALID [2022-04-28 08:15:22,678 INFO L290 TraceCheckUtils]: 37: Hoare triple {11802#false} assume 8496 == ~state~0; {11802#false} is VALID [2022-04-28 08:15:22,678 INFO L290 TraceCheckUtils]: 38: Hoare triple {11802#false} assume !false; {11802#false} is VALID [2022-04-28 08:15:22,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:15:22,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:15:22,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467490217] [2022-04-28 08:15:22,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467490217] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:15:22,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:15:22,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:15:22,680 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:15:22,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [54678439] [2022-04-28 08:15:22,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [54678439] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:15:22,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:15:22,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:15:22,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292272795] [2022-04-28 08:15:22,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:15:22,680 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-28 08:15:22,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:15:22,681 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-28 08:15:22,709 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-28 08:15:22,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:15:22,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:15:22,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:15:22,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:15:22,711 INFO L87 Difference]: Start difference. First operand 533 states and 816 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-28 08:15:24,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:15:24,195 INFO L93 Difference]: Finished difference Result 1249 states and 1965 transitions. [2022-04-28 08:15:24,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:15:24,195 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-28 08:15:24,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:15:24,196 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-28 08:15:24,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 517 transitions. [2022-04-28 08:15:24,199 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-28 08:15:24,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 517 transitions. [2022-04-28 08:15:24,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 517 transitions. [2022-04-28 08:15:24,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 517 edges. 517 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:15:24,591 INFO L225 Difference]: With dead ends: 1249 [2022-04-28 08:15:24,591 INFO L226 Difference]: Without dead ends: 731 [2022-04-28 08:15:24,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:15:24,593 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 277 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 08:15:24,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 243 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 08:15:24,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2022-04-28 08:15:25,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 707. [2022-04-28 08:15:25,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:15:25,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 731 states. Second operand has 707 states, 702 states have (on average 1.435897435897436) internal successors, (1008), 702 states have internal predecessors, (1008), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:25,441 INFO L74 IsIncluded]: Start isIncluded. First operand 731 states. Second operand has 707 states, 702 states have (on average 1.435897435897436) internal successors, (1008), 702 states have internal predecessors, (1008), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:25,442 INFO L87 Difference]: Start difference. First operand 731 states. Second operand has 707 states, 702 states have (on average 1.435897435897436) internal successors, (1008), 702 states have internal predecessors, (1008), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:25,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:15:25,467 INFO L93 Difference]: Finished difference Result 731 states and 1042 transitions. [2022-04-28 08:15:25,467 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1042 transitions. [2022-04-28 08:15:25,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:15:25,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:15:25,470 INFO L74 IsIncluded]: Start isIncluded. First operand has 707 states, 702 states have (on average 1.435897435897436) internal successors, (1008), 702 states have internal predecessors, (1008), 3 states have call successors, (3), 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 731 states. [2022-04-28 08:15:25,471 INFO L87 Difference]: Start difference. First operand has 707 states, 702 states have (on average 1.435897435897436) internal successors, (1008), 702 states have internal predecessors, (1008), 3 states have call successors, (3), 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 731 states. [2022-04-28 08:15:25,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:15:25,495 INFO L93 Difference]: Finished difference Result 731 states and 1042 transitions. [2022-04-28 08:15:25,496 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1042 transitions. [2022-04-28 08:15:25,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:15:25,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:15:25,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:15:25,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:15:25,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 702 states have (on average 1.435897435897436) internal successors, (1008), 702 states have internal predecessors, (1008), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:25,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1012 transitions. [2022-04-28 08:15:25,532 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1012 transitions. Word has length 39 [2022-04-28 08:15:25,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:15:25,532 INFO L495 AbstractCegarLoop]: Abstraction has 707 states and 1012 transitions. [2022-04-28 08:15:25,532 INFO L496 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-28 08:15:25,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 707 states and 1012 transitions. [2022-04-28 08:15:26,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1012 edges. 1012 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:15:26,403 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1012 transitions. [2022-04-28 08:15:26,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 08:15:26,404 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:15:26,404 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:15:26,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 08:15:26,405 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:15:26,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:15:26,405 INFO L85 PathProgramCache]: Analyzing trace with hash 77636788, now seen corresponding path program 1 times [2022-04-28 08:15:26,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:15:26,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1405618224] [2022-04-28 08:15:26,406 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:15:26,406 INFO L85 PathProgramCache]: Analyzing trace with hash 77636788, now seen corresponding path program 2 times [2022-04-28 08:15:26,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:15:26,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840420430] [2022-04-28 08:15:26,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:15:26,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:15:26,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:15:26,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:15:26,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:15:26,485 INFO L290 TraceCheckUtils]: 0: Hoare triple {17195#(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); {17187#true} is VALID [2022-04-28 08:15:26,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {17187#true} assume true; {17187#true} is VALID [2022-04-28 08:15:26,485 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17187#true} {17187#true} #665#return; {17187#true} is VALID [2022-04-28 08:15:26,486 INFO L272 TraceCheckUtils]: 0: Hoare triple {17187#true} call ULTIMATE.init(); {17195#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:15:26,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {17195#(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); {17187#true} is VALID [2022-04-28 08:15:26,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {17187#true} assume true; {17187#true} is VALID [2022-04-28 08:15:26,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17187#true} {17187#true} #665#return; {17187#true} is VALID [2022-04-28 08:15:26,487 INFO L272 TraceCheckUtils]: 4: Hoare triple {17187#true} call #t~ret54 := main(); {17187#true} is VALID [2022-04-28 08:15:26,487 INFO L290 TraceCheckUtils]: 5: Hoare triple {17187#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {17192#(<= main_~s~0 8464)} is VALID [2022-04-28 08:15:26,487 INFO L272 TraceCheckUtils]: 6: Hoare triple {17192#(<= main_~s~0 8464)} call #t~ret53 := ssl3_accept(~s~0); {17193#(<= |ssl3_accept_#in~initial_state| 8464)} is VALID [2022-04-28 08:15:26,490 INFO L290 TraceCheckUtils]: 7: Hoare triple {17193#(<= |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;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet19;havoc #t~nondet19;havoc ~s__s3__tmp__next_state___0~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~s__s3__tmp__new_cipher__algo_strength~0 := #t~nondet20;havoc #t~nondet20;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~num1~0 := #t~nondet21;havoc #t~nondet21;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___1~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___2~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___3~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___4~0 := #t~nondet25;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___5~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___6~0 := #t~nondet27;havoc #t~nondet27;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___8~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___9~0 := #t~nondet29;havoc #t~nondet29;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___10~0 := #t~nondet30;havoc #t~nondet30;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;havoc ~__cil_tmp61~0;~s__s3__tmp__reuse_message~0 := 0;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp~0 := #t~nondet31;havoc #t~nondet31;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {17194#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-28 08:15:26,490 INFO L290 TraceCheckUtils]: 8: Hoare triple {17194#(<= ssl3_accept_~s__state~0 8464)} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {17194#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-28 08:15:26,490 INFO L290 TraceCheckUtils]: 9: Hoare triple {17194#(<= ssl3_accept_~s__state~0 8464)} #t~post32 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post32;havoc #t~post32; {17194#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-28 08:15:26,491 INFO L290 TraceCheckUtils]: 10: Hoare triple {17194#(<= ssl3_accept_~s__state~0 8464)} assume 0 != 12288 + ~tmp___1~0; {17194#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-28 08:15:26,491 INFO L290 TraceCheckUtils]: 11: Hoare triple {17194#(<= ssl3_accept_~s__state~0 8464)} assume 0 != 16384 + ~tmp___2~0; {17194#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-28 08:15:26,491 INFO L290 TraceCheckUtils]: 12: Hoare triple {17194#(<= ssl3_accept_~s__state~0 8464)} assume !(0 == ~s__cert~0); {17194#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-28 08:15:26,492 INFO L290 TraceCheckUtils]: 13: Hoare triple {17194#(<= ssl3_accept_~s__state~0 8464)} assume !false; {17194#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-28 08:15:26,492 INFO L290 TraceCheckUtils]: 14: Hoare triple {17194#(<= ssl3_accept_~s__state~0 8464)} ~state~0 := ~s__state~0; {17194#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-28 08:15:26,492 INFO L290 TraceCheckUtils]: 15: Hoare triple {17194#(<= ssl3_accept_~s__state~0 8464)} assume !(12292 == ~s__state~0); {17194#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-28 08:15:26,493 INFO L290 TraceCheckUtils]: 16: Hoare triple {17194#(<= ssl3_accept_~s__state~0 8464)} assume !(16384 == ~s__state~0); {17194#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-28 08:15:26,493 INFO L290 TraceCheckUtils]: 17: Hoare triple {17194#(<= ssl3_accept_~s__state~0 8464)} assume !(8192 == ~s__state~0); {17194#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-28 08:15:26,493 INFO L290 TraceCheckUtils]: 18: Hoare triple {17194#(<= ssl3_accept_~s__state~0 8464)} assume !(24576 == ~s__state~0); {17194#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-28 08:15:26,494 INFO L290 TraceCheckUtils]: 19: Hoare triple {17194#(<= ssl3_accept_~s__state~0 8464)} assume !(8195 == ~s__state~0); {17194#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-28 08:15:26,494 INFO L290 TraceCheckUtils]: 20: Hoare triple {17194#(<= ssl3_accept_~s__state~0 8464)} assume !(8480 == ~s__state~0); {17194#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-28 08:15:26,495 INFO L290 TraceCheckUtils]: 21: Hoare triple {17194#(<= ssl3_accept_~s__state~0 8464)} assume !(8481 == ~s__state~0); {17194#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-28 08:15:26,495 INFO L290 TraceCheckUtils]: 22: Hoare triple {17194#(<= ssl3_accept_~s__state~0 8464)} assume !(8482 == ~s__state~0); {17194#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-28 08:15:26,495 INFO L290 TraceCheckUtils]: 23: Hoare triple {17194#(<= ssl3_accept_~s__state~0 8464)} assume !(8464 == ~s__state~0); {17194#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-28 08:15:26,496 INFO L290 TraceCheckUtils]: 24: Hoare triple {17194#(<= ssl3_accept_~s__state~0 8464)} assume !(8465 == ~s__state~0); {17194#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-28 08:15:26,496 INFO L290 TraceCheckUtils]: 25: Hoare triple {17194#(<= ssl3_accept_~s__state~0 8464)} assume !(8466 == ~s__state~0); {17194#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-28 08:15:26,496 INFO L290 TraceCheckUtils]: 26: Hoare triple {17194#(<= ssl3_accept_~s__state~0 8464)} assume 8496 == ~s__state~0; {17188#false} is VALID [2022-04-28 08:15:26,497 INFO L290 TraceCheckUtils]: 27: Hoare triple {17188#false} assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~ret~0 := #t~nondet38;havoc #t~nondet38; {17188#false} is VALID [2022-04-28 08:15:26,497 INFO L290 TraceCheckUtils]: 28: Hoare triple {17188#false} assume !(1 == ~blastFlag~0); {17188#false} is VALID [2022-04-28 08:15:26,497 INFO L290 TraceCheckUtils]: 29: Hoare triple {17188#false} assume !(~ret~0 <= 0); {17188#false} is VALID [2022-04-28 08:15:26,497 INFO L290 TraceCheckUtils]: 30: Hoare triple {17188#false} assume !(0 != ~s__hit~0);~s__state~0 := 8512; {17188#false} is VALID [2022-04-28 08:15:26,497 INFO L290 TraceCheckUtils]: 31: Hoare triple {17188#false} ~s__init_num~0 := 0; {17188#false} is VALID [2022-04-28 08:15:26,497 INFO L290 TraceCheckUtils]: 32: Hoare triple {17188#false} assume 0 == ~s__s3__tmp__reuse_message~0; {17188#false} is VALID [2022-04-28 08:15:26,497 INFO L290 TraceCheckUtils]: 33: Hoare triple {17188#false} assume 0 == ~skip~0; {17188#false} is VALID [2022-04-28 08:15:26,497 INFO L290 TraceCheckUtils]: 34: Hoare triple {17188#false} assume -12288 != ~tmp___1~0; {17188#false} is VALID [2022-04-28 08:15:26,498 INFO L290 TraceCheckUtils]: 35: Hoare triple {17188#false} assume 8656 != ~s__state~0; {17188#false} is VALID [2022-04-28 08:15:26,498 INFO L290 TraceCheckUtils]: 36: Hoare triple {17188#false} assume -16384 != ~tmp___2~0; {17188#false} is VALID [2022-04-28 08:15:26,498 INFO L290 TraceCheckUtils]: 37: Hoare triple {17188#false} assume 8496 == ~state~0; {17188#false} is VALID [2022-04-28 08:15:26,498 INFO L290 TraceCheckUtils]: 38: Hoare triple {17188#false} assume !false; {17188#false} is VALID [2022-04-28 08:15:26,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:15:26,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:15:26,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840420430] [2022-04-28 08:15:26,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840420430] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:15:26,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:15:26,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:15:26,499 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:15:26,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1405618224] [2022-04-28 08:15:26,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1405618224] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:15:26,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:15:26,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:15:26,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675978503] [2022-04-28 08:15:26,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:15:26,500 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-28 08:15:26,500 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:15:26,500 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:26,528 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-28 08:15:26,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 08:15:26,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:15:26,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 08:15:26,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:15:26,529 INFO L87 Difference]: Start difference. First operand 707 states and 1012 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:29,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:15:29,242 INFO L93 Difference]: Finished difference Result 1645 states and 2434 transitions. [2022-04-28 08:15:29,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 08:15:29,242 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-28 08:15:29,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:15:29,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:29,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 534 transitions. [2022-04-28 08:15:29,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:29,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 534 transitions. [2022-04-28 08:15:29,250 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 534 transitions. [2022-04-28 08:15:29,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 534 edges. 534 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:15:29,619 INFO L225 Difference]: With dead ends: 1645 [2022-04-28 08:15:29,619 INFO L226 Difference]: Without dead ends: 905 [2022-04-28 08:15:29,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-28 08:15:29,621 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 648 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:15:29,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 198 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 08:15:29,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2022-04-28 08:15:31,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 889. [2022-04-28 08:15:31,167 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:15:31,169 INFO L82 GeneralOperation]: Start isEquivalent. First operand 905 states. Second operand has 889 states, 884 states have (on average 1.407239819004525) internal successors, (1244), 884 states have internal predecessors, (1244), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:31,170 INFO L74 IsIncluded]: Start isIncluded. First operand 905 states. Second operand has 889 states, 884 states have (on average 1.407239819004525) internal successors, (1244), 884 states have internal predecessors, (1244), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:31,171 INFO L87 Difference]: Start difference. First operand 905 states. Second operand has 889 states, 884 states have (on average 1.407239819004525) internal successors, (1244), 884 states have internal predecessors, (1244), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:31,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:15:31,211 INFO L93 Difference]: Finished difference Result 905 states and 1265 transitions. [2022-04-28 08:15:31,211 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1265 transitions. [2022-04-28 08:15:31,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:15:31,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:15:31,215 INFO L74 IsIncluded]: Start isIncluded. First operand has 889 states, 884 states have (on average 1.407239819004525) internal successors, (1244), 884 states have internal predecessors, (1244), 3 states have call successors, (3), 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 905 states. [2022-04-28 08:15:31,216 INFO L87 Difference]: Start difference. First operand has 889 states, 884 states have (on average 1.407239819004525) internal successors, (1244), 884 states have internal predecessors, (1244), 3 states have call successors, (3), 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 905 states. [2022-04-28 08:15:31,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:15:31,257 INFO L93 Difference]: Finished difference Result 905 states and 1265 transitions. [2022-04-28 08:15:31,258 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1265 transitions. [2022-04-28 08:15:31,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:15:31,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:15:31,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:15:31,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:15:31,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 884 states have (on average 1.407239819004525) internal successors, (1244), 884 states have internal predecessors, (1244), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:31,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1248 transitions. [2022-04-28 08:15:31,318 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1248 transitions. Word has length 39 [2022-04-28 08:15:31,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:15:31,318 INFO L495 AbstractCegarLoop]: Abstraction has 889 states and 1248 transitions. [2022-04-28 08:15:31,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:31,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 889 states and 1248 transitions. [2022-04-28 08:15:32,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1248 edges. 1248 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:15:32,462 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1248 transitions. [2022-04-28 08:15:32,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-28 08:15:32,463 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:15:32,464 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:15:32,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 08:15:32,464 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:15:32,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:15:32,464 INFO L85 PathProgramCache]: Analyzing trace with hash 943214065, now seen corresponding path program 1 times [2022-04-28 08:15:32,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:15:32,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1199806041] [2022-04-28 08:15:33,298 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Computed reflexive-transitive closure does not contain relation itself.Something went wrong in computation of loop acceleration formula. at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.checkPropertiesOfLoopAccelerationFormula(JordanLoopAcceleration.java:1038) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.createLoopAccelerationTermSequential(JordanLoopAcceleration.java:693) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.createLoopAccelerationFormula(JordanLoopAcceleration.java:528) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.accelerateLoop(JordanLoopAcceleration.java:156) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.loopaccelerator.AcceleratorJordan.accelerateLoop(AcceleratorJordan.java:88) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:246) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:195) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-28 08:15:33,302 INFO L158 Benchmark]: Toolchain (without parser) took 24942.49ms. Allocated memory was 178.3MB in the beginning and 312.5MB in the end (delta: 134.2MB). Free memory was 126.7MB in the beginning and 254.0MB in the end (delta: -127.3MB). Peak memory consumption was 161.1MB. Max. memory is 8.0GB. [2022-04-28 08:15:33,302 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 178.3MB. Free memory was 143.4MB in the beginning and 143.3MB in the end (delta: 74.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 08:15:33,303 INFO L158 Benchmark]: CACSL2BoogieTranslator took 328.28ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 126.6MB in the beginning and 184.2MB in the end (delta: -57.7MB). Peak memory consumption was 14.2MB. Max. memory is 8.0GB. [2022-04-28 08:15:33,303 INFO L158 Benchmark]: Boogie Preprocessor took 58.34ms. Allocated memory is still 213.9MB. Free memory was 184.2MB in the beginning and 181.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 08:15:33,303 INFO L158 Benchmark]: RCFGBuilder took 844.77ms. Allocated memory is still 213.9MB. Free memory was 181.7MB in the beginning and 144.8MB in the end (delta: 36.9MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2022-04-28 08:15:33,303 INFO L158 Benchmark]: TraceAbstraction took 23691.97ms. Allocated memory was 213.9MB in the beginning and 312.5MB in the end (delta: 98.6MB). Free memory was 144.0MB in the beginning and 254.0MB in the end (delta: -110.1MB). Peak memory consumption was 142.7MB. Max. memory is 8.0GB. [2022-04-28 08:15:33,304 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 178.3MB. Free memory was 143.4MB in the beginning and 143.3MB in the end (delta: 74.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 328.28ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 126.6MB in the beginning and 184.2MB in the end (delta: -57.7MB). Peak memory consumption was 14.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 58.34ms. Allocated memory is still 213.9MB. Free memory was 184.2MB in the beginning and 181.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 844.77ms. Allocated memory is still 213.9MB. Free memory was 181.7MB in the beginning and 144.8MB in the end (delta: 36.9MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 23691.97ms. Allocated memory was 213.9MB in the beginning and 312.5MB in the end (delta: 98.6MB). Free memory was 144.0MB in the beginning and 254.0MB in the end (delta: -110.1MB). Peak memory consumption was 142.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Computed reflexive-transitive closure does not contain relation itself.Something went wrong in computation of loop acceleration formula. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Computed reflexive-transitive closure does not contain relation itself.Something went wrong in computation of loop acceleration formula.: de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.checkPropertiesOfLoopAccelerationFormula(JordanLoopAcceleration.java:1038) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-28 08:15:33,343 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...