java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_13.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 04:09:01,861 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 04:09:01,864 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 04:09:01,875 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 04:09:01,876 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 04:09:01,877 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 04:09:01,878 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 04:09:01,880 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 04:09:01,882 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 04:09:01,883 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 04:09:01,884 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 04:09:01,885 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 04:09:01,885 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 04:09:01,886 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 04:09:01,887 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 04:09:01,888 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 04:09:01,889 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 04:09:01,890 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 04:09:01,892 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 04:09:01,894 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 04:09:01,896 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 04:09:01,897 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 04:09:01,898 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 04:09:01,899 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 04:09:01,901 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 04:09:01,901 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 04:09:01,902 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 04:09:01,903 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 04:09:01,903 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 04:09:01,904 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 04:09:01,904 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 04:09:01,905 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 04:09:01,906 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 04:09:01,907 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 04:09:01,908 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 04:09:01,908 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 04:09:01,909 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 04:09:01,909 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 04:09:01,909 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 04:09:01,910 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 04:09:01,911 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 04:09:01,912 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 04:09:01,930 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 04:09:01,931 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 04:09:01,931 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 04:09:01,934 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 04:09:01,935 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 04:09:01,935 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 04:09:01,935 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 04:09:01,935 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 04:09:01,936 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 04:09:01,936 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 04:09:01,938 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 04:09:01,938 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 04:09:01,939 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 04:09:01,939 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 04:09:01,939 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 04:09:01,939 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 04:09:01,939 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 04:09:01,940 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 04:09:01,940 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 04:09:01,940 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 04:09:01,940 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 04:09:01,940 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 04:09:01,941 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 04:09:01,941 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 04:09:01,941 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 04:09:01,942 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 04:09:01,942 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 04:09:01,942 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 04:09:01,942 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 04:09:01,943 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 04:09:01,989 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 04:09:02,005 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 04:09:02,008 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 04:09:02,010 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 04:09:02,010 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 04:09:02,011 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_13.cil.c [2019-10-03 04:09:02,082 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8c86466e/a6a1d2a6d5864e9387f7bbd63b5cdd00/FLAGba2dacf9f [2019-10-03 04:09:02,632 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 04:09:02,633 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_13.cil.c [2019-10-03 04:09:02,650 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8c86466e/a6a1d2a6d5864e9387f7bbd63b5cdd00/FLAGba2dacf9f [2019-10-03 04:09:02,960 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8c86466e/a6a1d2a6d5864e9387f7bbd63b5cdd00 [2019-10-03 04:09:02,970 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 04:09:02,972 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 04:09:02,973 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 04:09:02,973 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 04:09:02,977 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 04:09:02,978 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 04:09:02" (1/1) ... [2019-10-03 04:09:02,980 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62c03921 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:02, skipping insertion in model container [2019-10-03 04:09:02,981 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 04:09:02" (1/1) ... [2019-10-03 04:09:02,988 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 04:09:03,037 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 04:09:03,382 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 04:09:03,386 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 04:09:03,466 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 04:09:03,486 INFO L192 MainTranslator]: Completed translation [2019-10-03 04:09:03,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:03 WrapperNode [2019-10-03 04:09:03,487 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 04:09:03,488 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 04:09:03,488 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 04:09:03,488 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 04:09:03,499 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:03" (1/1) ... [2019-10-03 04:09:03,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:03" (1/1) ... [2019-10-03 04:09:03,510 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:03" (1/1) ... [2019-10-03 04:09:03,510 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:03" (1/1) ... [2019-10-03 04:09:03,533 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:03" (1/1) ... [2019-10-03 04:09:03,548 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:03" (1/1) ... [2019-10-03 04:09:03,551 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:03" (1/1) ... [2019-10-03 04:09:03,555 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 04:09:03,556 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 04:09:03,556 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 04:09:03,556 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 04:09:03,557 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 04:09:03,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 04:09:03,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 04:09:03,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-10-03 04:09:03,611 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 04:09:03,611 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 04:09:03,611 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-03 04:09:03,611 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 04:09:03,611 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-03 04:09:03,612 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-03 04:09:03,612 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-10-03 04:09:03,612 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 04:09:03,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 04:09:03,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 04:09:03,917 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 04:09:04,437 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-03 04:09:04,437 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-03 04:09:04,440 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 04:09:04,440 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-03 04:09:04,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 04:09:04 BoogieIcfgContainer [2019-10-03 04:09:04,442 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 04:09:04,443 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 04:09:04,443 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 04:09:04,446 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 04:09:04,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 04:09:02" (1/3) ... [2019-10-03 04:09:04,447 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8ceefe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 04:09:04, skipping insertion in model container [2019-10-03 04:09:04,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:03" (2/3) ... [2019-10-03 04:09:04,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8ceefe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 04:09:04, skipping insertion in model container [2019-10-03 04:09:04,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 04:09:04" (3/3) ... [2019-10-03 04:09:04,451 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_13.cil.c [2019-10-03 04:09:04,461 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 04:09:04,470 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 04:09:04,488 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 04:09:04,513 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 04:09:04,514 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 04:09:04,514 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 04:09:04,514 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 04:09:04,514 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 04:09:04,514 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 04:09:04,514 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 04:09:04,514 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 04:09:04,533 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states. [2019-10-03 04:09:04,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-03 04:09:04,546 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:04,547 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:04,550 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:04,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:04,556 INFO L82 PathProgramCache]: Analyzing trace with hash 317102767, now seen corresponding path program 1 times [2019-10-03 04:09:04,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:04,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:04,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:04,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:04,614 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:04,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:04,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:04,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:04,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:04,842 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:04,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:04,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:04,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:04,875 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 5 states. [2019-10-03 04:09:05,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:05,327 INFO L93 Difference]: Finished difference Result 186 states and 308 transitions. [2019-10-03 04:09:05,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:05,329 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-10-03 04:09:05,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:05,344 INFO L225 Difference]: With dead ends: 186 [2019-10-03 04:09:05,344 INFO L226 Difference]: Without dead ends: 165 [2019-10-03 04:09:05,346 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:05,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-10-03 04:09:05,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2019-10-03 04:09:05,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-10-03 04:09:05,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 254 transitions. [2019-10-03 04:09:05,402 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 254 transitions. Word has length 31 [2019-10-03 04:09:05,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:05,402 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 254 transitions. [2019-10-03 04:09:05,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:05,403 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 254 transitions. [2019-10-03 04:09:05,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-03 04:09:05,405 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:05,405 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:05,405 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:05,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:05,406 INFO L82 PathProgramCache]: Analyzing trace with hash 966890690, now seen corresponding path program 1 times [2019-10-03 04:09:05,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:05,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:05,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:05,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:05,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:05,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:05,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:05,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:05,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:05,514 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:05,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:05,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:05,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:05,517 INFO L87 Difference]: Start difference. First operand 163 states and 254 transitions. Second operand 5 states. [2019-10-03 04:09:05,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:05,759 INFO L93 Difference]: Finished difference Result 185 states and 284 transitions. [2019-10-03 04:09:05,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:05,760 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-10-03 04:09:05,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:05,762 INFO L225 Difference]: With dead ends: 185 [2019-10-03 04:09:05,762 INFO L226 Difference]: Without dead ends: 185 [2019-10-03 04:09:05,763 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:05,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-10-03 04:09:05,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2019-10-03 04:09:05,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-10-03 04:09:05,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 284 transitions. [2019-10-03 04:09:05,783 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 284 transitions. Word has length 32 [2019-10-03 04:09:05,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:05,783 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 284 transitions. [2019-10-03 04:09:05,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:05,783 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 284 transitions. [2019-10-03 04:09:05,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-03 04:09:05,785 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:05,785 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:05,785 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:05,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:05,786 INFO L82 PathProgramCache]: Analyzing trace with hash 724051159, now seen corresponding path program 1 times [2019-10-03 04:09:05,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:05,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:05,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:05,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:05,790 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:05,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:05,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:05,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:05,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:05,884 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:05,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:05,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:05,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:05,885 INFO L87 Difference]: Start difference. First operand 185 states and 284 transitions. Second operand 5 states. [2019-10-03 04:09:06,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:06,117 INFO L93 Difference]: Finished difference Result 193 states and 297 transitions. [2019-10-03 04:09:06,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:06,118 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-10-03 04:09:06,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:06,120 INFO L225 Difference]: With dead ends: 193 [2019-10-03 04:09:06,120 INFO L226 Difference]: Without dead ends: 193 [2019-10-03 04:09:06,120 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:06,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-10-03 04:09:06,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 191. [2019-10-03 04:09:06,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-10-03 04:09:06,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 295 transitions. [2019-10-03 04:09:06,132 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 295 transitions. Word has length 32 [2019-10-03 04:09:06,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:06,132 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 295 transitions. [2019-10-03 04:09:06,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:06,132 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 295 transitions. [2019-10-03 04:09:06,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-03 04:09:06,134 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:06,134 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:06,134 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:06,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:06,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1825322250, now seen corresponding path program 1 times [2019-10-03 04:09:06,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:06,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:06,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:06,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:06,137 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:06,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:06,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:06,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:06,210 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:06,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:06,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:06,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:06,212 INFO L87 Difference]: Start difference. First operand 191 states and 295 transitions. Second operand 5 states. [2019-10-03 04:09:06,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:06,464 INFO L93 Difference]: Finished difference Result 192 states and 296 transitions. [2019-10-03 04:09:06,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:06,464 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-10-03 04:09:06,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:06,466 INFO L225 Difference]: With dead ends: 192 [2019-10-03 04:09:06,466 INFO L226 Difference]: Without dead ends: 192 [2019-10-03 04:09:06,467 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:06,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-10-03 04:09:06,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2019-10-03 04:09:06,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-10-03 04:09:06,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 296 transitions. [2019-10-03 04:09:06,485 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 296 transitions. Word has length 32 [2019-10-03 04:09:06,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:06,485 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 296 transitions. [2019-10-03 04:09:06,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:06,486 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 296 transitions. [2019-10-03 04:09:06,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-03 04:09:06,491 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:06,492 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:06,492 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:06,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:06,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1445082866, now seen corresponding path program 1 times [2019-10-03 04:09:06,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:06,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:06,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:06,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:06,494 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:06,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:06,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:06,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:06,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:06,573 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:06,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:06,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:06,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:06,575 INFO L87 Difference]: Start difference. First operand 192 states and 296 transitions. Second operand 5 states. [2019-10-03 04:09:06,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:06,752 INFO L93 Difference]: Finished difference Result 202 states and 306 transitions. [2019-10-03 04:09:06,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:06,752 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-10-03 04:09:06,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:06,754 INFO L225 Difference]: With dead ends: 202 [2019-10-03 04:09:06,754 INFO L226 Difference]: Without dead ends: 202 [2019-10-03 04:09:06,754 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:06,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-10-03 04:09:06,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 192. [2019-10-03 04:09:06,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-10-03 04:09:06,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 294 transitions. [2019-10-03 04:09:06,766 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 294 transitions. Word has length 33 [2019-10-03 04:09:06,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:06,768 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 294 transitions. [2019-10-03 04:09:06,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:06,769 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 294 transitions. [2019-10-03 04:09:06,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-03 04:09:06,770 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:06,770 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:06,771 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:06,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:06,771 INFO L82 PathProgramCache]: Analyzing trace with hash -790843942, now seen corresponding path program 1 times [2019-10-03 04:09:06,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:06,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:06,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:06,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:06,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:06,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:06,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:06,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:06,867 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:06,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:06,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:06,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:06,869 INFO L87 Difference]: Start difference. First operand 192 states and 294 transitions. Second operand 5 states. [2019-10-03 04:09:07,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:07,048 INFO L93 Difference]: Finished difference Result 202 states and 304 transitions. [2019-10-03 04:09:07,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:07,048 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-10-03 04:09:07,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:07,050 INFO L225 Difference]: With dead ends: 202 [2019-10-03 04:09:07,050 INFO L226 Difference]: Without dead ends: 202 [2019-10-03 04:09:07,050 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:07,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-10-03 04:09:07,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 192. [2019-10-03 04:09:07,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-10-03 04:09:07,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 292 transitions. [2019-10-03 04:09:07,056 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 292 transitions. Word has length 34 [2019-10-03 04:09:07,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:07,057 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 292 transitions. [2019-10-03 04:09:07,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:07,057 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 292 transitions. [2019-10-03 04:09:07,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-03 04:09:07,058 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:07,058 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:07,059 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:07,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:07,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1312490313, now seen corresponding path program 1 times [2019-10-03 04:09:07,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:07,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:07,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:07,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:07,063 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:07,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:07,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:07,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:07,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:07,132 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:07,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:07,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:07,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:07,135 INFO L87 Difference]: Start difference. First operand 192 states and 292 transitions. Second operand 5 states. [2019-10-03 04:09:07,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:07,326 INFO L93 Difference]: Finished difference Result 202 states and 302 transitions. [2019-10-03 04:09:07,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:07,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-10-03 04:09:07,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:07,328 INFO L225 Difference]: With dead ends: 202 [2019-10-03 04:09:07,328 INFO L226 Difference]: Without dead ends: 202 [2019-10-03 04:09:07,329 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:07,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-10-03 04:09:07,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 192. [2019-10-03 04:09:07,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-10-03 04:09:07,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 290 transitions. [2019-10-03 04:09:07,336 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 290 transitions. Word has length 35 [2019-10-03 04:09:07,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:07,336 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 290 transitions. [2019-10-03 04:09:07,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:07,336 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 290 transitions. [2019-10-03 04:09:07,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-03 04:09:07,338 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:07,338 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:07,338 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:07,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:07,339 INFO L82 PathProgramCache]: Analyzing trace with hash 115186168, now seen corresponding path program 1 times [2019-10-03 04:09:07,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:07,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:07,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:07,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:07,341 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:07,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:07,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:07,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 04:09:07,417 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:07,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:09:07,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:09:07,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-03 04:09:07,418 INFO L87 Difference]: Start difference. First operand 192 states and 290 transitions. Second operand 4 states. [2019-10-03 04:09:07,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:07,604 INFO L93 Difference]: Finished difference Result 235 states and 352 transitions. [2019-10-03 04:09:07,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 04:09:07,605 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-10-03 04:09:07,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:07,607 INFO L225 Difference]: With dead ends: 235 [2019-10-03 04:09:07,607 INFO L226 Difference]: Without dead ends: 235 [2019-10-03 04:09:07,607 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-03 04:09:07,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-10-03 04:09:07,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 199. [2019-10-03 04:09:07,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-10-03 04:09:07,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 300 transitions. [2019-10-03 04:09:07,614 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 300 transitions. Word has length 35 [2019-10-03 04:09:07,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:07,615 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 300 transitions. [2019-10-03 04:09:07,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:09:07,615 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 300 transitions. [2019-10-03 04:09:07,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-03 04:09:07,616 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:07,616 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:07,616 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:07,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:07,617 INFO L82 PathProgramCache]: Analyzing trace with hash -231050689, now seen corresponding path program 1 times [2019-10-03 04:09:07,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:07,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:07,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:07,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:07,619 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:07,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:07,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:07,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:07,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:07,660 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:07,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:07,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:07,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:07,661 INFO L87 Difference]: Start difference. First operand 199 states and 300 transitions. Second operand 5 states. [2019-10-03 04:09:07,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:07,826 INFO L93 Difference]: Finished difference Result 209 states and 310 transitions. [2019-10-03 04:09:07,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:07,827 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-10-03 04:09:07,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:07,829 INFO L225 Difference]: With dead ends: 209 [2019-10-03 04:09:07,829 INFO L226 Difference]: Without dead ends: 209 [2019-10-03 04:09:07,830 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:07,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-10-03 04:09:07,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 199. [2019-10-03 04:09:07,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-10-03 04:09:07,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 298 transitions. [2019-10-03 04:09:07,836 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 298 transitions. Word has length 36 [2019-10-03 04:09:07,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:07,837 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 298 transitions. [2019-10-03 04:09:07,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:07,837 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 298 transitions. [2019-10-03 04:09:07,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-03 04:09:07,838 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:07,838 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:07,838 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:07,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:07,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1140140251, now seen corresponding path program 1 times [2019-10-03 04:09:07,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:07,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:07,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:07,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:07,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:07,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:07,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:07,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:07,880 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:07,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:07,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:07,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:07,881 INFO L87 Difference]: Start difference. First operand 199 states and 298 transitions. Second operand 5 states. [2019-10-03 04:09:08,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:08,041 INFO L93 Difference]: Finished difference Result 204 states and 305 transitions. [2019-10-03 04:09:08,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:08,046 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-10-03 04:09:08,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:08,048 INFO L225 Difference]: With dead ends: 204 [2019-10-03 04:09:08,048 INFO L226 Difference]: Without dead ends: 204 [2019-10-03 04:09:08,049 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:08,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-10-03 04:09:08,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2019-10-03 04:09:08,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-10-03 04:09:08,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 301 transitions. [2019-10-03 04:09:08,054 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 301 transitions. Word has length 36 [2019-10-03 04:09:08,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:08,055 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 301 transitions. [2019-10-03 04:09:08,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:08,055 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 301 transitions. [2019-10-03 04:09:08,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-03 04:09:08,056 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:08,056 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:08,056 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:08,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:08,057 INFO L82 PathProgramCache]: Analyzing trace with hash 321152627, now seen corresponding path program 1 times [2019-10-03 04:09:08,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:08,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:08,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:08,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:08,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:08,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:08,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:08,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:08,105 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:08,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:08,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:08,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:08,106 INFO L87 Difference]: Start difference. First operand 201 states and 301 transitions. Second operand 5 states. [2019-10-03 04:09:08,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:08,300 INFO L93 Difference]: Finished difference Result 227 states and 336 transitions. [2019-10-03 04:09:08,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:08,301 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-10-03 04:09:08,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:08,302 INFO L225 Difference]: With dead ends: 227 [2019-10-03 04:09:08,303 INFO L226 Difference]: Without dead ends: 227 [2019-10-03 04:09:08,303 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:08,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-10-03 04:09:08,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2019-10-03 04:09:08,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-10-03 04:09:08,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 332 transitions. [2019-10-03 04:09:08,309 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 332 transitions. Word has length 37 [2019-10-03 04:09:08,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:08,309 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 332 transitions. [2019-10-03 04:09:08,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:08,309 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 332 transitions. [2019-10-03 04:09:08,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-03 04:09:08,310 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:08,310 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:08,311 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:08,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:08,311 INFO L82 PathProgramCache]: Analyzing trace with hash 2026060512, now seen corresponding path program 1 times [2019-10-03 04:09:08,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:08,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:08,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:08,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:08,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:08,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:08,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:08,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:08,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:08,358 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:08,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:08,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:08,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:08,359 INFO L87 Difference]: Start difference. First operand 224 states and 332 transitions. Second operand 5 states. [2019-10-03 04:09:08,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:08,562 INFO L93 Difference]: Finished difference Result 283 states and 421 transitions. [2019-10-03 04:09:08,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:08,563 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-10-03 04:09:08,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:08,565 INFO L225 Difference]: With dead ends: 283 [2019-10-03 04:09:08,565 INFO L226 Difference]: Without dead ends: 283 [2019-10-03 04:09:08,565 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:08,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-10-03 04:09:08,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 272. [2019-10-03 04:09:08,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-10-03 04:09:08,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 405 transitions. [2019-10-03 04:09:08,572 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 405 transitions. Word has length 38 [2019-10-03 04:09:08,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:08,573 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 405 transitions. [2019-10-03 04:09:08,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:08,573 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 405 transitions. [2019-10-03 04:09:08,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-03 04:09:08,574 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:08,574 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:08,574 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:08,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:08,574 INFO L82 PathProgramCache]: Analyzing trace with hash -849244168, now seen corresponding path program 1 times [2019-10-03 04:09:08,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:08,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:08,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:08,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:08,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:08,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:08,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:08,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:08,611 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:08,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:08,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:08,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:08,612 INFO L87 Difference]: Start difference. First operand 272 states and 405 transitions. Second operand 5 states. [2019-10-03 04:09:08,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:08,831 INFO L93 Difference]: Finished difference Result 299 states and 451 transitions. [2019-10-03 04:09:08,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:08,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-10-03 04:09:08,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:08,835 INFO L225 Difference]: With dead ends: 299 [2019-10-03 04:09:08,835 INFO L226 Difference]: Without dead ends: 299 [2019-10-03 04:09:08,835 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:08,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-10-03 04:09:08,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 288. [2019-10-03 04:09:08,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-10-03 04:09:08,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 435 transitions. [2019-10-03 04:09:08,843 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 435 transitions. Word has length 39 [2019-10-03 04:09:08,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:08,843 INFO L475 AbstractCegarLoop]: Abstraction has 288 states and 435 transitions. [2019-10-03 04:09:08,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:08,843 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 435 transitions. [2019-10-03 04:09:08,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-03 04:09:08,844 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:08,844 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:08,845 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:08,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:08,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1459197139, now seen corresponding path program 1 times [2019-10-03 04:09:08,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:08,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:08,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:08,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:08,847 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:08,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:08,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:08,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:08,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:08,917 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:08,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:08,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:08,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:08,918 INFO L87 Difference]: Start difference. First operand 288 states and 435 transitions. Second operand 5 states. [2019-10-03 04:09:09,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:09,126 INFO L93 Difference]: Finished difference Result 330 states and 496 transitions. [2019-10-03 04:09:09,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:09,127 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-10-03 04:09:09,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:09,129 INFO L225 Difference]: With dead ends: 330 [2019-10-03 04:09:09,130 INFO L226 Difference]: Without dead ends: 330 [2019-10-03 04:09:09,130 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:09,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-10-03 04:09:09,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 316. [2019-10-03 04:09:09,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-10-03 04:09:09,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 473 transitions. [2019-10-03 04:09:09,141 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 473 transitions. Word has length 45 [2019-10-03 04:09:09,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:09,141 INFO L475 AbstractCegarLoop]: Abstraction has 316 states and 473 transitions. [2019-10-03 04:09:09,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:09,142 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 473 transitions. [2019-10-03 04:09:09,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-03 04:09:09,143 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:09,143 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:09,143 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:09,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:09,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1107650380, now seen corresponding path program 1 times [2019-10-03 04:09:09,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:09,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:09,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:09,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:09,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:09,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:09,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:09,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:09,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:09,208 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:09,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:09,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:09,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:09,209 INFO L87 Difference]: Start difference. First operand 316 states and 473 transitions. Second operand 5 states. [2019-10-03 04:09:09,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:09,473 INFO L93 Difference]: Finished difference Result 363 states and 542 transitions. [2019-10-03 04:09:09,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:09,474 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-10-03 04:09:09,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:09,477 INFO L225 Difference]: With dead ends: 363 [2019-10-03 04:09:09,477 INFO L226 Difference]: Without dead ends: 363 [2019-10-03 04:09:09,478 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:09,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-10-03 04:09:09,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 357. [2019-10-03 04:09:09,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-10-03 04:09:09,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 535 transitions. [2019-10-03 04:09:09,487 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 535 transitions. Word has length 45 [2019-10-03 04:09:09,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:09,488 INFO L475 AbstractCegarLoop]: Abstraction has 357 states and 535 transitions. [2019-10-03 04:09:09,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:09,488 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 535 transitions. [2019-10-03 04:09:09,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-03 04:09:09,489 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:09,489 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:09,489 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:09,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:09,490 INFO L82 PathProgramCache]: Analyzing trace with hash -561495435, now seen corresponding path program 1 times [2019-10-03 04:09:09,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:09,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:09,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:09,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:09,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:09,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:09,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:09,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:09,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:09,533 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:09,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:09,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:09,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:09,534 INFO L87 Difference]: Start difference. First operand 357 states and 535 transitions. Second operand 5 states. [2019-10-03 04:09:09,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:09,748 INFO L93 Difference]: Finished difference Result 371 states and 555 transitions. [2019-10-03 04:09:09,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:09,749 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-10-03 04:09:09,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:09,750 INFO L225 Difference]: With dead ends: 371 [2019-10-03 04:09:09,750 INFO L226 Difference]: Without dead ends: 371 [2019-10-03 04:09:09,751 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:09,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-10-03 04:09:09,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 357. [2019-10-03 04:09:09,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-10-03 04:09:09,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 532 transitions. [2019-10-03 04:09:09,759 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 532 transitions. Word has length 46 [2019-10-03 04:09:09,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:09,759 INFO L475 AbstractCegarLoop]: Abstraction has 357 states and 532 transitions. [2019-10-03 04:09:09,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:09,760 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 532 transitions. [2019-10-03 04:09:09,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-03 04:09:09,761 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:09,761 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:09,761 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:09,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:09,761 INFO L82 PathProgramCache]: Analyzing trace with hash 15597975, now seen corresponding path program 1 times [2019-10-03 04:09:09,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:09,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:09,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:09,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:09,763 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:09,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:09,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:09,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:09,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:09,813 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:09,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:09,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:09,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:09,814 INFO L87 Difference]: Start difference. First operand 357 states and 532 transitions. Second operand 5 states. [2019-10-03 04:09:10,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:10,061 INFO L93 Difference]: Finished difference Result 374 states and 560 transitions. [2019-10-03 04:09:10,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:10,061 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-10-03 04:09:10,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:10,063 INFO L225 Difference]: With dead ends: 374 [2019-10-03 04:09:10,064 INFO L226 Difference]: Without dead ends: 374 [2019-10-03 04:09:10,064 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:10,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-10-03 04:09:10,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 368. [2019-10-03 04:09:10,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-10-03 04:09:10,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 553 transitions. [2019-10-03 04:09:10,076 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 553 transitions. Word has length 46 [2019-10-03 04:09:10,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:10,076 INFO L475 AbstractCegarLoop]: Abstraction has 368 states and 553 transitions. [2019-10-03 04:09:10,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:10,076 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 553 transitions. [2019-10-03 04:09:10,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-03 04:09:10,077 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:10,077 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:10,078 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:10,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:10,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1118035316, now seen corresponding path program 1 times [2019-10-03 04:09:10,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:10,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:10,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:10,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:10,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:10,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:10,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:10,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:10,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:10,116 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:10,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:10,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:10,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:10,117 INFO L87 Difference]: Start difference. First operand 368 states and 553 transitions. Second operand 5 states. [2019-10-03 04:09:10,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:10,354 INFO L93 Difference]: Finished difference Result 402 states and 599 transitions. [2019-10-03 04:09:10,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:10,354 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-10-03 04:09:10,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:10,358 INFO L225 Difference]: With dead ends: 402 [2019-10-03 04:09:10,358 INFO L226 Difference]: Without dead ends: 402 [2019-10-03 04:09:10,359 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:10,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-10-03 04:09:10,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2019-10-03 04:09:10,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2019-10-03 04:09:10,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 599 transitions. [2019-10-03 04:09:10,368 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 599 transitions. Word has length 47 [2019-10-03 04:09:10,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:10,368 INFO L475 AbstractCegarLoop]: Abstraction has 402 states and 599 transitions. [2019-10-03 04:09:10,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:10,369 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 599 transitions. [2019-10-03 04:09:10,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-03 04:09:10,370 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:10,370 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:10,370 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:10,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:10,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1870287793, now seen corresponding path program 1 times [2019-10-03 04:09:10,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:10,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:10,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:10,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:10,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:10,411 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-03 04:09:10,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:10,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:10,412 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:10,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:10,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:10,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:10,413 INFO L87 Difference]: Start difference. First operand 402 states and 599 transitions. Second operand 5 states. [2019-10-03 04:09:10,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:10,623 INFO L93 Difference]: Finished difference Result 434 states and 638 transitions. [2019-10-03 04:09:10,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:10,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-10-03 04:09:10,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:10,626 INFO L225 Difference]: With dead ends: 434 [2019-10-03 04:09:10,626 INFO L226 Difference]: Without dead ends: 434 [2019-10-03 04:09:10,627 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:10,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2019-10-03 04:09:10,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 429. [2019-10-03 04:09:10,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-10-03 04:09:10,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 631 transitions. [2019-10-03 04:09:10,636 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 631 transitions. Word has length 67 [2019-10-03 04:09:10,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:10,637 INFO L475 AbstractCegarLoop]: Abstraction has 429 states and 631 transitions. [2019-10-03 04:09:10,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:10,637 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 631 transitions. [2019-10-03 04:09:10,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-03 04:09:10,638 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:10,638 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:10,638 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:10,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:10,639 INFO L82 PathProgramCache]: Analyzing trace with hash 609539319, now seen corresponding path program 1 times [2019-10-03 04:09:10,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:10,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:10,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:10,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:10,640 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:10,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:10,677 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-03 04:09:10,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:10,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:10,678 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:10,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:10,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:10,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:10,679 INFO L87 Difference]: Start difference. First operand 429 states and 631 transitions. Second operand 5 states. [2019-10-03 04:09:10,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:10,877 INFO L93 Difference]: Finished difference Result 434 states and 633 transitions. [2019-10-03 04:09:10,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:10,877 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-10-03 04:09:10,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:10,880 INFO L225 Difference]: With dead ends: 434 [2019-10-03 04:09:10,880 INFO L226 Difference]: Without dead ends: 434 [2019-10-03 04:09:10,880 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:10,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2019-10-03 04:09:10,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 429. [2019-10-03 04:09:10,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-10-03 04:09:10,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 626 transitions. [2019-10-03 04:09:10,893 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 626 transitions. Word has length 68 [2019-10-03 04:09:10,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:10,894 INFO L475 AbstractCegarLoop]: Abstraction has 429 states and 626 transitions. [2019-10-03 04:09:10,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:10,894 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 626 transitions. [2019-10-03 04:09:10,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-03 04:09:10,895 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:10,895 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:10,896 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:10,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:10,896 INFO L82 PathProgramCache]: Analyzing trace with hash -113594467, now seen corresponding path program 1 times [2019-10-03 04:09:10,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:10,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:10,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:10,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:10,898 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:10,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:10,941 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-03 04:09:10,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:10,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:10,941 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:10,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:10,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:10,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:10,943 INFO L87 Difference]: Start difference. First operand 429 states and 626 transitions. Second operand 5 states. [2019-10-03 04:09:11,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:11,131 INFO L93 Difference]: Finished difference Result 463 states and 667 transitions. [2019-10-03 04:09:11,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:11,132 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-10-03 04:09:11,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:11,134 INFO L225 Difference]: With dead ends: 463 [2019-10-03 04:09:11,134 INFO L226 Difference]: Without dead ends: 463 [2019-10-03 04:09:11,135 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:11,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-10-03 04:09:11,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 461. [2019-10-03 04:09:11,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2019-10-03 04:09:11,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 665 transitions. [2019-10-03 04:09:11,145 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 665 transitions. Word has length 74 [2019-10-03 04:09:11,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:11,145 INFO L475 AbstractCegarLoop]: Abstraction has 461 states and 665 transitions. [2019-10-03 04:09:11,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:11,146 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 665 transitions. [2019-10-03 04:09:11,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-03 04:09:11,147 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:11,147 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:11,147 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:11,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:11,148 INFO L82 PathProgramCache]: Analyzing trace with hash 118459413, now seen corresponding path program 1 times [2019-10-03 04:09:11,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:11,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:11,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:11,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:11,150 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:11,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:11,188 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-03 04:09:11,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:11,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:11,189 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:11,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:11,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:11,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:11,190 INFO L87 Difference]: Start difference. First operand 461 states and 665 transitions. Second operand 5 states. [2019-10-03 04:09:11,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:11,360 INFO L93 Difference]: Finished difference Result 463 states and 664 transitions. [2019-10-03 04:09:11,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:11,362 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-10-03 04:09:11,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:11,364 INFO L225 Difference]: With dead ends: 463 [2019-10-03 04:09:11,364 INFO L226 Difference]: Without dead ends: 463 [2019-10-03 04:09:11,364 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:11,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-10-03 04:09:11,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 461. [2019-10-03 04:09:11,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2019-10-03 04:09:11,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 662 transitions. [2019-10-03 04:09:11,375 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 662 transitions. Word has length 75 [2019-10-03 04:09:11,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:11,375 INFO L475 AbstractCegarLoop]: Abstraction has 461 states and 662 transitions. [2019-10-03 04:09:11,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:11,375 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 662 transitions. [2019-10-03 04:09:11,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-03 04:09:11,377 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:11,377 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:11,377 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:11,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:11,378 INFO L82 PathProgramCache]: Analyzing trace with hash 228288550, now seen corresponding path program 1 times [2019-10-03 04:09:11,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:11,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:11,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:11,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:11,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:11,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:11,417 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:11,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:11,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:11,418 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:11,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:11,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:11,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:11,419 INFO L87 Difference]: Start difference. First operand 461 states and 662 transitions. Second operand 5 states. [2019-10-03 04:09:11,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:11,622 INFO L93 Difference]: Finished difference Result 502 states and 715 transitions. [2019-10-03 04:09:11,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:11,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-10-03 04:09:11,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:11,625 INFO L225 Difference]: With dead ends: 502 [2019-10-03 04:09:11,626 INFO L226 Difference]: Without dead ends: 502 [2019-10-03 04:09:11,626 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:11,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-10-03 04:09:11,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 500. [2019-10-03 04:09:11,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-10-03 04:09:11,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 713 transitions. [2019-10-03 04:09:11,639 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 713 transitions. Word has length 79 [2019-10-03 04:09:11,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:11,640 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 713 transitions. [2019-10-03 04:09:11,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:11,640 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 713 transitions. [2019-10-03 04:09:11,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-03 04:09:11,641 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:11,642 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:11,642 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:11,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:11,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1078260969, now seen corresponding path program 1 times [2019-10-03 04:09:11,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:11,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:11,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:11,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:11,645 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:11,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:11,724 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:11,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:11,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:11,725 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:11,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:11,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:11,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:11,726 INFO L87 Difference]: Start difference. First operand 500 states and 713 transitions. Second operand 5 states. [2019-10-03 04:09:11,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:11,993 INFO L93 Difference]: Finished difference Result 502 states and 713 transitions. [2019-10-03 04:09:11,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:11,994 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-10-03 04:09:11,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:11,997 INFO L225 Difference]: With dead ends: 502 [2019-10-03 04:09:11,997 INFO L226 Difference]: Without dead ends: 502 [2019-10-03 04:09:11,998 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:11,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-10-03 04:09:12,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 500. [2019-10-03 04:09:12,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-10-03 04:09:12,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 711 transitions. [2019-10-03 04:09:12,010 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 711 transitions. Word has length 80 [2019-10-03 04:09:12,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:12,011 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 711 transitions. [2019-10-03 04:09:12,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:12,011 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 711 transitions. [2019-10-03 04:09:12,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-03 04:09:12,015 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:12,016 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:12,016 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:12,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:12,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1326525221, now seen corresponding path program 1 times [2019-10-03 04:09:12,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:12,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:12,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:12,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:12,019 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:12,065 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-03 04:09:12,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:12,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:12,065 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:12,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:12,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:12,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:12,066 INFO L87 Difference]: Start difference. First operand 500 states and 711 transitions. Second operand 5 states. [2019-10-03 04:09:12,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:12,246 INFO L93 Difference]: Finished difference Result 528 states and 741 transitions. [2019-10-03 04:09:12,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:12,246 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-10-03 04:09:12,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:12,249 INFO L225 Difference]: With dead ends: 528 [2019-10-03 04:09:12,249 INFO L226 Difference]: Without dead ends: 528 [2019-10-03 04:09:12,249 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:12,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-10-03 04:09:12,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 524. [2019-10-03 04:09:12,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2019-10-03 04:09:12,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 735 transitions. [2019-10-03 04:09:12,261 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 735 transitions. Word has length 89 [2019-10-03 04:09:12,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:12,262 INFO L475 AbstractCegarLoop]: Abstraction has 524 states and 735 transitions. [2019-10-03 04:09:12,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:12,262 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 735 transitions. [2019-10-03 04:09:12,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-03 04:09:12,264 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:12,264 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:12,264 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:12,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:12,265 INFO L82 PathProgramCache]: Analyzing trace with hash 2139834345, now seen corresponding path program 1 times [2019-10-03 04:09:12,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:12,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:12,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:12,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:12,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:12,342 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-03 04:09:12,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:12,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:12,343 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:12,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:12,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:12,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:12,344 INFO L87 Difference]: Start difference. First operand 524 states and 735 transitions. Second operand 5 states. [2019-10-03 04:09:12,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:12,587 INFO L93 Difference]: Finished difference Result 572 states and 798 transitions. [2019-10-03 04:09:12,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:12,587 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-10-03 04:09:12,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:12,590 INFO L225 Difference]: With dead ends: 572 [2019-10-03 04:09:12,590 INFO L226 Difference]: Without dead ends: 572 [2019-10-03 04:09:12,591 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:12,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-10-03 04:09:12,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 569. [2019-10-03 04:09:12,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2019-10-03 04:09:12,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 794 transitions. [2019-10-03 04:09:12,602 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 794 transitions. Word has length 90 [2019-10-03 04:09:12,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:12,602 INFO L475 AbstractCegarLoop]: Abstraction has 569 states and 794 transitions. [2019-10-03 04:09:12,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:12,602 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 794 transitions. [2019-10-03 04:09:12,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-03 04:09:12,604 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:12,604 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:12,604 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:12,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:12,605 INFO L82 PathProgramCache]: Analyzing trace with hash -999539411, now seen corresponding path program 1 times [2019-10-03 04:09:12,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:12,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:12,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:12,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:12,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:12,648 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-03 04:09:12,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:12,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:12,649 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:12,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:12,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:12,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:12,650 INFO L87 Difference]: Start difference. First operand 569 states and 794 transitions. Second operand 5 states. [2019-10-03 04:09:12,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:12,822 INFO L93 Difference]: Finished difference Result 573 states and 791 transitions. [2019-10-03 04:09:12,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:12,823 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-10-03 04:09:12,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:12,827 INFO L225 Difference]: With dead ends: 573 [2019-10-03 04:09:12,827 INFO L226 Difference]: Without dead ends: 573 [2019-10-03 04:09:12,827 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:12,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2019-10-03 04:09:12,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 569. [2019-10-03 04:09:12,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2019-10-03 04:09:12,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 785 transitions. [2019-10-03 04:09:12,839 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 785 transitions. Word has length 90 [2019-10-03 04:09:12,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:12,839 INFO L475 AbstractCegarLoop]: Abstraction has 569 states and 785 transitions. [2019-10-03 04:09:12,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:12,840 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 785 transitions. [2019-10-03 04:09:12,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-03 04:09:12,841 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:12,841 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:12,842 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:12,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:12,842 INFO L82 PathProgramCache]: Analyzing trace with hash 47508774, now seen corresponding path program 1 times [2019-10-03 04:09:12,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:12,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:12,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:12,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:12,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:12,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:12,901 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-03 04:09:12,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:12,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:12,901 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:12,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:12,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:12,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:12,902 INFO L87 Difference]: Start difference. First operand 569 states and 785 transitions. Second operand 5 states. [2019-10-03 04:09:13,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:13,133 INFO L93 Difference]: Finished difference Result 576 states and 795 transitions. [2019-10-03 04:09:13,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:13,133 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-10-03 04:09:13,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:13,136 INFO L225 Difference]: With dead ends: 576 [2019-10-03 04:09:13,136 INFO L226 Difference]: Without dead ends: 574 [2019-10-03 04:09:13,136 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:13,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-10-03 04:09:13,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 571. [2019-10-03 04:09:13,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-10-03 04:09:13,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 788 transitions. [2019-10-03 04:09:13,148 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 788 transitions. Word has length 91 [2019-10-03 04:09:13,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:13,148 INFO L475 AbstractCegarLoop]: Abstraction has 571 states and 788 transitions. [2019-10-03 04:09:13,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:13,148 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 788 transitions. [2019-10-03 04:09:13,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-03 04:09:13,150 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:13,150 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:13,150 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:13,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:13,150 INFO L82 PathProgramCache]: Analyzing trace with hash -269359224, now seen corresponding path program 1 times [2019-10-03 04:09:13,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:13,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:13,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:13,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:13,152 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:13,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:13,189 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-10-03 04:09:13,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:13,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:09:13,190 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:13,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:09:13,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:09:13,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:13,191 INFO L87 Difference]: Start difference. First operand 571 states and 788 transitions. Second operand 3 states. [2019-10-03 04:09:13,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:13,211 INFO L93 Difference]: Finished difference Result 1122 states and 1545 transitions. [2019-10-03 04:09:13,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:09:13,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-10-03 04:09:13,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:13,216 INFO L225 Difference]: With dead ends: 1122 [2019-10-03 04:09:13,216 INFO L226 Difference]: Without dead ends: 1122 [2019-10-03 04:09:13,218 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:13,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2019-10-03 04:09:13,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 572. [2019-10-03 04:09:13,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2019-10-03 04:09:13,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 789 transitions. [2019-10-03 04:09:13,234 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 789 transitions. Word has length 106 [2019-10-03 04:09:13,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:13,234 INFO L475 AbstractCegarLoop]: Abstraction has 572 states and 789 transitions. [2019-10-03 04:09:13,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:09:13,234 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 789 transitions. [2019-10-03 04:09:13,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-03 04:09:13,236 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:13,236 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:13,236 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:13,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:13,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1549222902, now seen corresponding path program 1 times [2019-10-03 04:09:13,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:13,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:13,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:13,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:13,238 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:13,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:13,278 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-10-03 04:09:13,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:13,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:09:13,279 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:13,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:09:13,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:09:13,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:13,280 INFO L87 Difference]: Start difference. First operand 572 states and 789 transitions. Second operand 3 states. [2019-10-03 04:09:13,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:13,301 INFO L93 Difference]: Finished difference Result 576 states and 790 transitions. [2019-10-03 04:09:13,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:09:13,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-10-03 04:09:13,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:13,305 INFO L225 Difference]: With dead ends: 576 [2019-10-03 04:09:13,305 INFO L226 Difference]: Without dead ends: 576 [2019-10-03 04:09:13,306 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:13,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-10-03 04:09:13,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 574. [2019-10-03 04:09:13,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-10-03 04:09:13,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 788 transitions. [2019-10-03 04:09:13,317 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 788 transitions. Word has length 106 [2019-10-03 04:09:13,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:13,317 INFO L475 AbstractCegarLoop]: Abstraction has 574 states and 788 transitions. [2019-10-03 04:09:13,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:09:13,318 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 788 transitions. [2019-10-03 04:09:13,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-03 04:09:13,319 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:13,319 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:13,320 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:13,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:13,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1557981007, now seen corresponding path program 1 times [2019-10-03 04:09:13,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:13,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:13,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:13,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:13,322 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:13,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:13,359 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-03 04:09:13,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:13,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:09:13,360 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:13,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:09:13,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:09:13,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:13,361 INFO L87 Difference]: Start difference. First operand 574 states and 788 transitions. Second operand 3 states. [2019-10-03 04:09:13,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:13,412 INFO L93 Difference]: Finished difference Result 1135 states and 1553 transitions. [2019-10-03 04:09:13,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:09:13,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-10-03 04:09:13,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:13,417 INFO L225 Difference]: With dead ends: 1135 [2019-10-03 04:09:13,417 INFO L226 Difference]: Without dead ends: 1135 [2019-10-03 04:09:13,418 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:13,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2019-10-03 04:09:13,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 1133. [2019-10-03 04:09:13,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1133 states. [2019-10-03 04:09:13,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1552 transitions. [2019-10-03 04:09:13,436 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1552 transitions. Word has length 107 [2019-10-03 04:09:13,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:13,437 INFO L475 AbstractCegarLoop]: Abstraction has 1133 states and 1552 transitions. [2019-10-03 04:09:13,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:09:13,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1552 transitions. [2019-10-03 04:09:13,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-03 04:09:13,439 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:13,440 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:13,440 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:13,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:13,440 INFO L82 PathProgramCache]: Analyzing trace with hash -2144787021, now seen corresponding path program 1 times [2019-10-03 04:09:13,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:13,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:13,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:13,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:13,443 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:13,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-03 04:09:13,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-03 04:09:13,582 INFO L478 BasicCegarLoop]: Counterexample might be feasible [2019-10-03 04:09:13,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 04:09:13 BoogieIcfgContainer [2019-10-03 04:09:13,733 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 04:09:13,737 INFO L168 Benchmark]: Toolchain (without parser) took 10762.87 ms. Allocated memory was 134.2 MB in the beginning and 382.2 MB in the end (delta: 248.0 MB). Free memory was 88.3 MB in the beginning and 175.0 MB in the end (delta: -86.7 MB). Peak memory consumption was 161.3 MB. Max. memory is 7.1 GB. [2019-10-03 04:09:13,738 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 134.2 MB. Free memory was 107.3 MB in the beginning and 107.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 04:09:13,743 INFO L168 Benchmark]: CACSL2BoogieTranslator took 514.75 ms. Allocated memory was 134.2 MB in the beginning and 201.9 MB in the end (delta: 67.6 MB). Free memory was 88.1 MB in the beginning and 173.6 MB in the end (delta: -85.5 MB). Peak memory consumption was 27.7 MB. Max. memory is 7.1 GB. [2019-10-03 04:09:13,744 INFO L168 Benchmark]: Boogie Preprocessor took 67.53 ms. Allocated memory is still 201.9 MB. Free memory was 173.6 MB in the beginning and 171.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-10-03 04:09:13,744 INFO L168 Benchmark]: RCFGBuilder took 885.87 ms. Allocated memory is still 201.9 MB. Free memory was 171.1 MB in the beginning and 117.8 MB in the end (delta: 53.3 MB). Peak memory consumption was 53.3 MB. Max. memory is 7.1 GB. [2019-10-03 04:09:13,745 INFO L168 Benchmark]: TraceAbstraction took 9290.01 ms. Allocated memory was 201.9 MB in the beginning and 382.2 MB in the end (delta: 180.4 MB). Free memory was 117.8 MB in the beginning and 175.0 MB in the end (delta: -57.3 MB). Peak memory consumption was 123.1 MB. Max. memory is 7.1 GB. [2019-10-03 04:09:13,755 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 134.2 MB. Free memory was 107.3 MB in the beginning and 107.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 514.75 ms. Allocated memory was 134.2 MB in the beginning and 201.9 MB in the end (delta: 67.6 MB). Free memory was 88.1 MB in the beginning and 173.6 MB in the end (delta: -85.5 MB). Peak memory consumption was 27.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 67.53 ms. Allocated memory is still 201.9 MB. Free memory was 173.6 MB in the beginning and 171.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 885.87 ms. Allocated memory is still 201.9 MB. Free memory was 171.1 MB in the beginning and 117.8 MB in the end (delta: 53.3 MB). Peak memory consumption was 53.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9290.01 ms. Allocated memory was 201.9 MB in the beginning and 382.2 MB in the end (delta: 180.4 MB). Free memory was 117.8 MB in the beginning and 175.0 MB in the end (delta: -57.3 MB). Peak memory consumption was 123.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 643]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L648] int s ; [L649] int tmp ; [L653] s = 8464 VAL [s=8464] [L654] CALL ssl3_accept(s) VAL [\old(initial_state)=8464] [L12] int s__info_callback = __VERIFIER_nondet_int() ; [L13] int s__in_handshake = __VERIFIER_nondet_int() ; [L14] int s__state ; [L15] int s__new_session ; [L16] int s__server ; [L17] int s__version = __VERIFIER_nondet_int() ; [L18] int s__type ; [L19] int s__init_num ; [L20] int s__hit = __VERIFIER_nondet_int() ; [L21] int s__rwstate ; [L22] int s__init_buf___0 = 1; [L23] int s__debug = __VERIFIER_nondet_int() ; [L24] int s__shutdown ; [L25] int s__cert = __VERIFIER_nondet_int() ; [L26] int s__options = __VERIFIER_nondet_int() ; [L27] int s__verify_mode = __VERIFIER_nondet_int() ; [L28] int s__session__peer = __VERIFIER_nondet_int() ; [L29] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L30] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L31] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L32] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L33] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L34] int s__s3__tmp__cert_request ; [L35] int s__s3__tmp__reuse_message ; [L36] int s__s3__tmp__use_rsa_tmp ; [L37] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L38] int s__s3__tmp__new_cipher__algorithms ; [L39] int s__s3__tmp__next_state___0 ; [L40] int s__s3__tmp__new_cipher__algo_strength ; [L41] int s__session__cipher ; [L42] int buf ; [L43] unsigned long l ; [L44] unsigned long Time ; [L45] unsigned long tmp ; [L46] int cb ; [L47] long num1 = __VERIFIER_nondet_long() ; [L48] int ret ; [L49] int new_state ; [L50] int state ; [L51] int skip ; [L52] int got_new_session ; [L53] int tmp___1 = __VERIFIER_nondet_int() ; [L54] int tmp___2 = __VERIFIER_nondet_int() ; [L55] int tmp___3 = __VERIFIER_nondet_int() ; [L56] int tmp___4 = __VERIFIER_nondet_int() ; [L57] int tmp___5 = __VERIFIER_nondet_int() ; [L58] int tmp___6 = __VERIFIER_nondet_int() ; [L59] int tmp___7 = __VERIFIER_nondet_int() ; [L60] long tmp___8 = __VERIFIER_nondet_long() ; [L61] int tmp___9 = __VERIFIER_nondet_int() ; [L62] int tmp___10 = __VERIFIER_nondet_int() ; [L63] int blastFlag ; [L64] int __cil_tmp55 ; [L65] unsigned long __cil_tmp56 ; [L66] unsigned long __cil_tmp57 ; [L67] unsigned long __cil_tmp58 ; [L68] unsigned long __cil_tmp59 ; [L69] int __cil_tmp60 ; [L70] unsigned long __cil_tmp61 ; [L73] s__state = initial_state [L74] blastFlag = 0 [L75] tmp = __VERIFIER_nondet_int() [L76] Time = tmp [L77] cb = 0 [L78] ret = -1 [L79] skip = 0 [L80] got_new_session = 0 VAL [\old(initial_state)=8464, blastFlag=0, cb=0, got_new_session=0, initial_state=8464, num1=0, ret=-1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__session__peer=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L81] COND TRUE s__info_callback != 0 [L82] cb = s__info_callback VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, num1=0, ret=-1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__session__peer=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L88] s__in_handshake ++ VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, num1=0, ret=-1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__session__peer=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L89] COND FALSE !(tmp___1 + 12288) VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, num1=0, ret=-1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__session__peer=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L94] COND FALSE !(s__cert == 0) VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, num1=0, ret=-1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__session__peer=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L98] COND TRUE 1 VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, num1=0, ret=-1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__session__peer=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L100] state = s__state VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, num1=0, ret=-1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__session__peer=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L101] COND FALSE !(s__state == 12292) VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, num1=0, ret=-1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__session__peer=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L104] COND FALSE !(s__state == 16384) VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, num1=0, ret=-1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__session__peer=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L107] COND FALSE !(s__state == 8192) VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, num1=0, ret=-1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__session__peer=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L110] COND FALSE !(s__state == 24576) VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, num1=0, ret=-1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__session__peer=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L113] COND FALSE !(s__state == 8195) VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, num1=0, ret=-1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__session__peer=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L116] COND FALSE !(s__state == 8480) VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, num1=0, ret=-1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__session__peer=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L119] COND FALSE !(s__state == 8481) VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, num1=0, ret=-1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__session__peer=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L122] COND FALSE !(s__state == 8482) VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, num1=0, ret=-1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__session__peer=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L125] COND TRUE s__state == 8464 VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, num1=0, ret=-1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__session__peer=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L271] s__shutdown = 0 [L272] ret = __VERIFIER_nondet_int() [L273] COND TRUE blastFlag == 0 [L274] blastFlag = 1 VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=0, initial_state=8464, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__options=0, s__s3__tmp__new_cipher=0, s__session__peer=0, s__shutdown=0, s__state=8464, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L276] COND FALSE !(ret <= 0) [L279] got_new_session = 1 [L280] s__state = 8496 [L281] s__init_num = 0 VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L600] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L601] COND FALSE !(! s__s3__tmp__reuse_message) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L632] skip = 0 VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L98] COND TRUE 1 VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8464, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L100] state = s__state VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L101] COND FALSE !(s__state == 12292) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L104] COND FALSE !(s__state == 16384) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L107] COND FALSE !(s__state == 8192) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L110] COND FALSE !(s__state == 24576) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L113] COND FALSE !(s__state == 8195) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L116] COND FALSE !(s__state == 8480) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L119] COND FALSE !(s__state == 8481) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L122] COND FALSE !(s__state == 8482) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L125] COND FALSE !(s__state == 8464) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L128] COND FALSE !(s__state == 8465) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L131] COND FALSE !(s__state == 8466) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L134] COND TRUE s__state == 8496 VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=2, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L285] ret = __VERIFIER_nondet_int() [L286] COND TRUE blastFlag == 1 [L287] blastFlag = 2 VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L289] COND FALSE !(ret <= 0) VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8496, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L292] COND FALSE !(\read(s__hit)) [L295] s__state = 8512 VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8512, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L297] s__init_num = 0 VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8512, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L600] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L601] COND FALSE !(! s__s3__tmp__reuse_message) VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8512, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L632] skip = 0 VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8512, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L98] COND TRUE 1 VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8512, s__verify_mode=0, s__version=0, skip=0, state=8496, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L100] state = s__state VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8512, s__verify_mode=0, s__version=0, skip=0, state=8512, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L101] COND FALSE !(s__state == 12292) VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8512, s__verify_mode=0, s__version=0, skip=0, state=8512, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L104] COND FALSE !(s__state == 16384) VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8512, s__verify_mode=0, s__version=0, skip=0, state=8512, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L107] COND FALSE !(s__state == 8192) VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8512, s__verify_mode=0, s__version=0, skip=0, state=8512, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L110] COND FALSE !(s__state == 24576) VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8512, s__verify_mode=0, s__version=0, skip=0, state=8512, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L113] COND FALSE !(s__state == 8195) VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8512, s__verify_mode=0, s__version=0, skip=0, state=8512, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L116] COND FALSE !(s__state == 8480) VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8512, s__verify_mode=0, s__version=0, skip=0, state=8512, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L119] COND FALSE !(s__state == 8481) VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8512, s__verify_mode=0, s__version=0, skip=0, state=8512, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L122] COND FALSE !(s__state == 8482) VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8512, s__verify_mode=0, s__version=0, skip=0, state=8512, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L125] COND FALSE !(s__state == 8464) VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8512, s__verify_mode=0, s__version=0, skip=0, state=8512, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L128] COND FALSE !(s__state == 8465) VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8512, s__verify_mode=0, s__version=0, skip=0, state=8512, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L131] COND FALSE !(s__state == 8466) VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8512, s__verify_mode=0, s__version=0, skip=0, state=8512, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L134] COND FALSE !(s__state == 8496) VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8512, s__verify_mode=0, s__version=0, skip=0, state=8512, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L137] COND FALSE !(s__state == 8497) VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8512, s__verify_mode=0, s__version=0, skip=0, state=8512, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L140] COND TRUE s__state == 8512 VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8512, s__verify_mode=0, s__version=0, skip=0, state=8512, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L302] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L303] __cil_tmp56 = (unsigned long )s__s3__tmp__new_cipher__algorithms VAL [\old(initial_state)=8464, __cil_tmp56=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8512, s__verify_mode=0, s__version=0, skip=0, state=8512, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L304] COND TRUE __cil_tmp56 + 256UL [L305] skip = 1 VAL [\old(initial_state)=8464, __cil_tmp56=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8512, s__verify_mode=0, s__version=0, skip=1, state=8512, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L316] s__state = 8528 [L317] s__init_num = 0 VAL [\old(initial_state)=8464, __cil_tmp56=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8528, s__verify_mode=0, s__version=0, skip=1, state=8512, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L600] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L601] COND FALSE !(! s__s3__tmp__reuse_message) VAL [\old(initial_state)=8464, __cil_tmp56=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8528, s__verify_mode=0, s__version=0, skip=1, state=8512, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L632] skip = 0 VAL [\old(initial_state)=8464, __cil_tmp56=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8528, s__verify_mode=0, s__version=0, skip=0, state=8512, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L98] COND TRUE 1 VAL [\old(initial_state)=8464, __cil_tmp56=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8528, s__verify_mode=0, s__version=0, skip=0, state=8512, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L100] state = s__state VAL [\old(initial_state)=8464, __cil_tmp56=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8528, s__verify_mode=0, s__version=0, skip=0, state=8528, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L101] COND FALSE !(s__state == 12292) VAL [\old(initial_state)=8464, __cil_tmp56=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8528, s__verify_mode=0, s__version=0, skip=0, state=8528, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L104] COND FALSE !(s__state == 16384) VAL [\old(initial_state)=8464, __cil_tmp56=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8528, s__verify_mode=0, s__version=0, skip=0, state=8528, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L107] COND FALSE !(s__state == 8192) VAL [\old(initial_state)=8464, __cil_tmp56=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8528, s__verify_mode=0, s__version=0, skip=0, state=8528, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L110] COND FALSE !(s__state == 24576) VAL [\old(initial_state)=8464, __cil_tmp56=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8528, s__verify_mode=0, s__version=0, skip=0, state=8528, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L113] COND FALSE !(s__state == 8195) VAL [\old(initial_state)=8464, __cil_tmp56=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8528, s__verify_mode=0, s__version=0, skip=0, state=8528, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L116] COND FALSE !(s__state == 8480) VAL [\old(initial_state)=8464, __cil_tmp56=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8528, s__verify_mode=0, s__version=0, skip=0, state=8528, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L119] COND FALSE !(s__state == 8481) VAL [\old(initial_state)=8464, __cil_tmp56=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8528, s__verify_mode=0, s__version=0, skip=0, state=8528, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L122] COND FALSE !(s__state == 8482) VAL [\old(initial_state)=8464, __cil_tmp56=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8528, s__verify_mode=0, s__version=0, skip=0, state=8528, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L125] COND FALSE !(s__state == 8464) VAL [\old(initial_state)=8464, __cil_tmp56=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8528, s__verify_mode=0, s__version=0, skip=0, state=8528, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L128] COND FALSE !(s__state == 8465) VAL [\old(initial_state)=8464, __cil_tmp56=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8528, s__verify_mode=0, s__version=0, skip=0, state=8528, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L131] COND FALSE !(s__state == 8466) VAL [\old(initial_state)=8464, __cil_tmp56=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8528, s__verify_mode=0, s__version=0, skip=0, state=8528, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L134] COND FALSE !(s__state == 8496) VAL [\old(initial_state)=8464, __cil_tmp56=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8528, s__verify_mode=0, s__version=0, skip=0, state=8528, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L137] COND FALSE !(s__state == 8497) VAL [\old(initial_state)=8464, __cil_tmp56=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8528, s__verify_mode=0, s__version=0, skip=0, state=8528, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L140] COND FALSE !(s__state == 8512) VAL [\old(initial_state)=8464, __cil_tmp56=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8528, s__verify_mode=0, s__version=0, skip=0, state=8528, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L143] COND FALSE !(s__state == 8513) VAL [\old(initial_state)=8464, __cil_tmp56=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8528, s__verify_mode=0, s__version=0, skip=0, state=8528, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L146] COND TRUE s__state == 8528 VAL [\old(initial_state)=8464, __cil_tmp56=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8528, s__verify_mode=0, s__version=0, skip=0, state=8528, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L321] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L322] l = (unsigned long )s__s3__tmp__new_cipher__algorithms [L324] __cil_tmp57 = (unsigned long )s__options VAL [\old(initial_state)=8464, __cil_tmp56=0, __cil_tmp57=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, l=0, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__session__peer=0, s__shutdown=0, s__state=8528, s__verify_mode=0, s__version=0, skip=0, state=8528, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L325] COND TRUE __cil_tmp57 + 2097152UL [L326] s__s3__tmp__use_rsa_tmp = 1 VAL [\old(initial_state)=8464, __cil_tmp56=0, __cil_tmp57=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, l=0, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__s3__tmp__use_rsa_tmp=1, s__session__peer=0, s__shutdown=0, s__state=8528, s__verify_mode=0, s__version=0, skip=0, state=8528, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L331] COND TRUE \read(s__s3__tmp__use_rsa_tmp) VAL [\old(initial_state)=8464, __cil_tmp56=0, __cil_tmp57=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, l=0, num1=0, ret=5, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__s3__tmp__use_rsa_tmp=1, s__session__peer=0, s__shutdown=0, s__state=8528, s__verify_mode=0, s__version=0, skip=0, state=8528, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L358] ret = __VERIFIER_nondet_int() [L359] COND FALSE !(blastFlag == 6) VAL [\old(initial_state)=8464, __cil_tmp56=0, __cil_tmp57=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, l=0, num1=0, ret=1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__s3__tmp__use_rsa_tmp=1, s__session__peer=0, s__shutdown=0, s__state=8528, s__verify_mode=0, s__version=0, skip=0, state=8528, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L362] COND FALSE !(ret <= 0) VAL [\old(initial_state)=8464, __cil_tmp56=0, __cil_tmp57=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, l=0, num1=0, ret=1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__s3__tmp__use_rsa_tmp=1, s__session__peer=0, s__shutdown=0, s__state=8528, s__verify_mode=0, s__version=0, skip=0, state=8528, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L379] s__state = 8544 [L380] s__init_num = 0 VAL [\old(initial_state)=8464, __cil_tmp56=0, __cil_tmp57=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, l=0, num1=0, ret=1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__s3__tmp__use_rsa_tmp=1, s__session__peer=0, s__shutdown=0, s__state=8544, s__verify_mode=0, s__version=0, skip=0, state=8528, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L600] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L601] COND TRUE ! s__s3__tmp__reuse_message VAL [\old(initial_state)=8464, __cil_tmp56=0, __cil_tmp57=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, l=0, num1=0, ret=1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__s3__tmp__use_rsa_tmp=1, s__session__peer=0, s__shutdown=0, s__state=8544, s__verify_mode=0, s__version=0, skip=0, state=8528, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L602] COND TRUE ! skip VAL [\old(initial_state)=8464, __cil_tmp56=0, __cil_tmp57=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, l=0, num1=0, ret=1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__s3__tmp__use_rsa_tmp=1, s__session__peer=0, s__shutdown=0, s__state=8544, s__verify_mode=0, s__version=0, skip=0, state=8528, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L603] COND TRUE state == 8528 VAL [\old(initial_state)=8464, __cil_tmp56=0, __cil_tmp57=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, l=0, num1=0, ret=1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__s3__tmp__use_rsa_tmp=1, s__session__peer=0, s__shutdown=0, s__state=8544, s__verify_mode=0, s__version=0, skip=0, state=8528, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L604] COND TRUE s__state == 8544 VAL [\old(initial_state)=8464, __cil_tmp56=0, __cil_tmp57=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, l=0, num1=0, ret=1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__s3__tmp__use_rsa_tmp=1, s__session__peer=0, s__shutdown=0, s__state=8544, s__verify_mode=0, s__version=0, skip=0, state=8528, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L605] COND TRUE tmp___7 != 1024 VAL [\old(initial_state)=8464, __cil_tmp56=0, __cil_tmp57=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, l=0, num1=0, ret=1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__s3__tmp__use_rsa_tmp=1, s__session__peer=0, s__shutdown=0, s__state=8544, s__verify_mode=0, s__version=0, skip=0, state=8528, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L606] COND TRUE tmp___7 != 512 VAL [\old(initial_state)=8464, __cil_tmp56=0, __cil_tmp57=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, l=0, num1=0, ret=1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__s3__tmp__use_rsa_tmp=1, s__session__peer=0, s__shutdown=0, s__state=8544, s__verify_mode=0, s__version=0, skip=0, state=8528, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L607] COND TRUE __cil_tmp58 != 4294967294 VAL [\old(initial_state)=8464, __cil_tmp56=0, __cil_tmp57=0, __cil_tmp58=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, l=0, num1=0, ret=1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__s3__tmp__use_rsa_tmp=1, s__session__peer=0, s__shutdown=0, s__state=8544, s__verify_mode=0, s__version=0, skip=0, state=8528, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L608] COND TRUE l != 4294967266 VAL [\old(initial_state)=8464, __cil_tmp56=0, __cil_tmp57=0, __cil_tmp58=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, l=0, num1=0, ret=1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__s3__tmp__use_rsa_tmp=1, s__session__peer=0, s__shutdown=0, s__state=8544, s__verify_mode=0, s__version=0, skip=0, state=8528, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L643] __VERIFIER_error() VAL [\old(initial_state)=8464, __cil_tmp56=0, __cil_tmp57=0, __cil_tmp58=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, l=0, num1=0, ret=1, s__cert=1, s__cert__pkeys__AT0__privatekey=0, s__ctx__info_callback=0, s__ctx__stats__sess_accept=0, s__ctx__stats__sess_accept_good=0, s__ctx__stats__sess_accept_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__s3__tmp__use_rsa_tmp=1, s__session__peer=0, s__shutdown=0, s__state=8544, s__verify_mode=0, s__version=0, skip=0, state=8528, Time=0, tmp=0, tmp___1=-12288, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 161 locations, 1 error locations. UNSAFE Result, 9.2s OverallTime, 32 OverallIterations, 4 TraceHistogramMax, 6.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5414 SDtfs, 12136 SDslu, 5987 SDs, 0 SdLazy, 4406 SolverSat, 1184 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1133occurred in iteration=31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 31 MinimizatonAttempts, 734 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1908 NumberOfCodeBlocks, 1908 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1770 ConstructedInterpolants, 0 QuantifiedInterpolants, 247022 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 577/577 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...