java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1.BV.c.cil.c_21.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-935f392 [2018-07-23 13:49:47,198 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 13:49:47,200 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 13:49:47,213 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 13:49:47,214 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 13:49:47,215 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 13:49:47,216 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 13:49:47,218 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 13:49:47,219 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 13:49:47,220 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 13:49:47,221 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 13:49:47,221 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 13:49:47,222 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 13:49:47,223 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 13:49:47,224 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 13:49:47,225 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 13:49:47,226 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 13:49:47,228 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 13:49:47,235 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 13:49:47,237 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 13:49:47,240 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 13:49:47,242 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 13:49:47,248 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 13:49:47,249 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 13:49:47,249 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 13:49:47,250 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 13:49:47,251 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 13:49:47,252 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 13:49:47,254 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 13:49:47,255 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 13:49:47,257 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 13:49:47,258 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 13:49:47,258 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 13:49:47,258 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 13:49:47,261 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 13:49:47,262 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 13:49:47,262 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf [2018-07-23 13:49:47,285 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 13:49:47,285 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 13:49:47,286 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 13:49:47,287 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 13:49:47,287 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 13:49:47,287 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 13:49:47,287 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 13:49:47,288 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 13:49:47,334 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 13:49:47,352 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 13:49:47,355 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 13:49:47,357 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 13:49:47,358 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 13:49:47,359 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1.BV.c.cil.c_21.bpl [2018-07-23 13:49:47,359 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1.BV.c.cil.c_21.bpl' [2018-07-23 13:49:47,437 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 13:49:47,439 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 13:49:47,440 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 13:49:47,440 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 13:49:47,440 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 13:49:47,470 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:47" (1/1) ... [2018-07-23 13:49:47,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:47" (1/1) ... [2018-07-23 13:49:47,488 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:47" (1/1) ... [2018-07-23 13:49:47,488 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:47" (1/1) ... [2018-07-23 13:49:47,497 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:47" (1/1) ... [2018-07-23 13:49:47,501 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:47" (1/1) ... [2018-07-23 13:49:47,504 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:47" (1/1) ... [2018-07-23 13:49:47,508 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 13:49:47,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 13:49:47,509 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 13:49:47,510 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 13:49:47,511 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:47" (1/1) ... [2018-07-23 13:49:47,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-23 13:49:47,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-23 13:49:47,990 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-23 13:49:47,991 INFO L202 PluginConnector]: Adding new model s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:49:47 BoogieIcfgContainer [2018-07-23 13:49:47,991 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 13:49:47,993 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 13:49:47,993 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 13:49:47,996 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 13:49:47,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:47" (1/2) ... [2018-07-23 13:49:47,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ad4233 and model type s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:49:47, skipping insertion in model container [2018-07-23 13:49:47,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:49:47" (2/2) ... [2018-07-23 13:49:48,000 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_1.BV.c.cil.c_21.bpl [2018-07-23 13:49:48,010 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 13:49:48,019 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-23 13:49:48,067 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 13:49:48,068 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 13:49:48,069 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 13:49:48,069 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 13:49:48,069 INFO L376 AbstractCegarLoop]: Backedges is CANONICAL [2018-07-23 13:49:48,069 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 13:49:48,070 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 13:49:48,070 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 13:49:48,070 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 13:49:48,086 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-07-23 13:49:48,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 13:49:48,096 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:48,097 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:48,097 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:48,103 INFO L82 PathProgramCache]: Analyzing trace with hash -505433777, now seen corresponding path program 1 times [2018-07-23 13:49:48,110 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:48,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:48,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:48,275 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:49:48,275 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 13:49:48,277 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:48,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:48,278 INFO L185 omatonBuilderFactory]: Interpolants [21#true, 22#false, 23#(not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~5))] [2018-07-23 13:49:48,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:48,281 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:49:48,297 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:49:48,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:49:48,301 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-07-23 13:49:48,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:48,494 INFO L93 Difference]: Finished difference Result 47 states and 81 transitions. [2018-07-23 13:49:48,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:49:48,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-07-23 13:49:48,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:48,517 INFO L225 Difference]: With dead ends: 47 [2018-07-23 13:49:48,518 INFO L226 Difference]: Without dead ends: 30 [2018-07-23 13:49:48,522 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:49:48,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-07-23 13:49:48,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-07-23 13:49:48,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-07-23 13:49:48,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 51 transitions. [2018-07-23 13:49:48,573 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 51 transitions. Word has length 15 [2018-07-23 13:49:48,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:48,574 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 51 transitions. [2018-07-23 13:49:48,574 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:49:48,574 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 51 transitions. [2018-07-23 13:49:48,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-23 13:49:48,576 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:48,576 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:48,576 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:48,576 INFO L82 PathProgramCache]: Analyzing trace with hash -912155323, now seen corresponding path program 1 times [2018-07-23 13:49:48,577 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:48,638 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:48,638 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:49:48,639 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 13:49:48,639 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:48,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:48,640 INFO L185 omatonBuilderFactory]: Interpolants [178#true, 179#false, 180#(not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))] [2018-07-23 13:49:48,640 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:48,643 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:49:48,643 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:49:48,643 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:49:48,644 INFO L87 Difference]: Start difference. First operand 30 states and 51 transitions. Second operand 3 states. [2018-07-23 13:49:48,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:48,747 INFO L93 Difference]: Finished difference Result 75 states and 129 transitions. [2018-07-23 13:49:48,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:49:48,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-07-23 13:49:48,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:48,749 INFO L225 Difference]: With dead ends: 75 [2018-07-23 13:49:48,749 INFO L226 Difference]: Without dead ends: 46 [2018-07-23 13:49:48,751 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:49:48,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-07-23 13:49:48,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-07-23 13:49:48,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-07-23 13:49:48,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 77 transitions. [2018-07-23 13:49:48,776 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 77 transitions. Word has length 23 [2018-07-23 13:49:48,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:48,778 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 77 transitions. [2018-07-23 13:49:48,778 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:49:48,779 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 77 transitions. [2018-07-23 13:49:48,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-23 13:49:48,780 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:48,780 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:48,780 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:48,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1107910457, now seen corresponding path program 1 times [2018-07-23 13:49:48,781 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:48,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:48,849 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:48,850 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:49:48,850 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 13:49:48,852 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:48,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:48,854 INFO L185 omatonBuilderFactory]: Interpolants [423#true, 424#false, 425#(not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~5))] [2018-07-23 13:49:48,854 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:48,855 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:49:48,855 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:49:48,856 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:49:48,856 INFO L87 Difference]: Start difference. First operand 46 states and 77 transitions. Second operand 3 states. [2018-07-23 13:49:48,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:48,936 INFO L93 Difference]: Finished difference Result 109 states and 185 transitions. [2018-07-23 13:49:48,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:49:48,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-07-23 13:49:48,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:48,941 INFO L225 Difference]: With dead ends: 109 [2018-07-23 13:49:48,941 INFO L226 Difference]: Without dead ends: 63 [2018-07-23 13:49:48,942 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:49:48,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-07-23 13:49:48,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-07-23 13:49:48,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-07-23 13:49:48,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 106 transitions. [2018-07-23 13:49:48,963 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 106 transitions. Word has length 28 [2018-07-23 13:49:48,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:48,964 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 106 transitions. [2018-07-23 13:49:48,964 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:49:48,964 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 106 transitions. [2018-07-23 13:49:48,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-07-23 13:49:48,967 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:48,967 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:48,967 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:48,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1423527905, now seen corresponding path program 1 times [2018-07-23 13:49:48,968 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:48,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:49,017 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-07-23 13:49:49,018 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:49:49,018 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 13:49:49,018 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:49,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:49,019 INFO L185 omatonBuilderFactory]: Interpolants [770#true, 771#false, 772#(not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))] [2018-07-23 13:49:49,020 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-07-23 13:49:49,020 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:49:49,020 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:49:49,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:49:49,021 INFO L87 Difference]: Start difference. First operand 63 states and 106 transitions. Second operand 3 states. [2018-07-23 13:49:49,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:49,111 INFO L93 Difference]: Finished difference Result 132 states and 223 transitions. [2018-07-23 13:49:49,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:49:49,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-07-23 13:49:49,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:49,113 INFO L225 Difference]: With dead ends: 132 [2018-07-23 13:49:49,113 INFO L226 Difference]: Without dead ends: 70 [2018-07-23 13:49:49,117 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:49:49,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-07-23 13:49:49,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-07-23 13:49:49,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-07-23 13:49:49,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 114 transitions. [2018-07-23 13:49:49,140 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 114 transitions. Word has length 30 [2018-07-23 13:49:49,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:49,140 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 114 transitions. [2018-07-23 13:49:49,140 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:49:49,141 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 114 transitions. [2018-07-23 13:49:49,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-23 13:49:49,144 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:49,144 INFO L357 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:49,145 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:49,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1035189339, now seen corresponding path program 1 times [2018-07-23 13:49:49,145 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:49,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:49,180 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-07-23 13:49:49,180 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:49:49,181 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 13:49:49,181 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:49,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:49,182 INFO L185 omatonBuilderFactory]: Interpolants [1177#true, 1178#false, 1179#(not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5))] [2018-07-23 13:49:49,183 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-07-23 13:49:49,183 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:49:49,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:49:49,183 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:49:49,184 INFO L87 Difference]: Start difference. First operand 70 states and 114 transitions. Second operand 3 states. [2018-07-23 13:49:49,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:49,239 INFO L93 Difference]: Finished difference Result 145 states and 237 transitions. [2018-07-23 13:49:49,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:49:49,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-07-23 13:49:49,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:49,242 INFO L225 Difference]: With dead ends: 145 [2018-07-23 13:49:49,242 INFO L226 Difference]: Without dead ends: 76 [2018-07-23 13:49:49,247 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:49:49,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-07-23 13:49:49,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-07-23 13:49:49,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-07-23 13:49:49,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 119 transitions. [2018-07-23 13:49:49,269 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 119 transitions. Word has length 36 [2018-07-23 13:49:49,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:49,269 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 119 transitions. [2018-07-23 13:49:49,269 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:49:49,270 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 119 transitions. [2018-07-23 13:49:49,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-23 13:49:49,271 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:49,271 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:49,271 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:49,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1742811576, now seen corresponding path program 1 times [2018-07-23 13:49:49,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:49,307 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-07-23 13:49:49,308 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:49:49,308 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 13:49:49,308 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:49,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:49,309 INFO L185 omatonBuilderFactory]: Interpolants [1622#true, 1623#false, 1624#(not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~5))] [2018-07-23 13:49:49,309 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-07-23 13:49:49,310 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:49:49,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:49:49,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:49:49,311 INFO L87 Difference]: Start difference. First operand 76 states and 119 transitions. Second operand 3 states. [2018-07-23 13:49:49,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:49,369 INFO L93 Difference]: Finished difference Result 163 states and 255 transitions. [2018-07-23 13:49:49,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:49:49,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-07-23 13:49:49,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:49,371 INFO L225 Difference]: With dead ends: 163 [2018-07-23 13:49:49,371 INFO L226 Difference]: Without dead ends: 87 [2018-07-23 13:49:49,375 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:49:49,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-07-23 13:49:49,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-07-23 13:49:49,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-07-23 13:49:49,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 133 transitions. [2018-07-23 13:49:49,394 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 133 transitions. Word has length 40 [2018-07-23 13:49:49,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:49,395 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 133 transitions. [2018-07-23 13:49:49,395 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:49:49,395 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 133 transitions. [2018-07-23 13:49:49,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-07-23 13:49:49,398 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:49,398 INFO L357 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:49,401 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:49,401 INFO L82 PathProgramCache]: Analyzing trace with hash -720649021, now seen corresponding path program 1 times [2018-07-23 13:49:49,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:49,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:49,430 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-07-23 13:49:49,430 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:49:49,430 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 13:49:49,431 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:49,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:49,431 INFO L185 omatonBuilderFactory]: Interpolants [2125#true, 2126#false, 2127#(not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))] [2018-07-23 13:49:49,432 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-07-23 13:49:49,432 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:49:49,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:49:49,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:49:49,433 INFO L87 Difference]: Start difference. First operand 87 states and 133 transitions. Second operand 3 states. [2018-07-23 13:49:49,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:49,494 INFO L93 Difference]: Finished difference Result 178 states and 273 transitions. [2018-07-23 13:49:49,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:49:49,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-07-23 13:49:49,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:49,497 INFO L225 Difference]: With dead ends: 178 [2018-07-23 13:49:49,497 INFO L226 Difference]: Without dead ends: 92 [2018-07-23 13:49:49,498 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:49:49,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-07-23 13:49:49,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-07-23 13:49:49,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-07-23 13:49:49,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2018-07-23 13:49:49,522 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 41 [2018-07-23 13:49:49,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:49,522 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2018-07-23 13:49:49,523 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:49:49,523 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2018-07-23 13:49:49,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-07-23 13:49:49,524 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:49,524 INFO L357 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:49,525 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:49,526 INFO L82 PathProgramCache]: Analyzing trace with hash 483195845, now seen corresponding path program 1 times [2018-07-23 13:49:49,526 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:49,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:49,564 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-07-23 13:49:49,565 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:49:49,565 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 13:49:49,565 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:49,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:49,566 INFO L185 omatonBuilderFactory]: Interpolants [2668#true, 2669#false, 2670#(not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))] [2018-07-23 13:49:49,566 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-07-23 13:49:49,567 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:49:49,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:49:49,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:49:49,568 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand 3 states. [2018-07-23 13:49:49,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:49,604 INFO L93 Difference]: Finished difference Result 187 states and 273 transitions. [2018-07-23 13:49:49,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:49:49,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-07-23 13:49:49,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:49,605 INFO L225 Difference]: With dead ends: 187 [2018-07-23 13:49:49,605 INFO L226 Difference]: Without dead ends: 96 [2018-07-23 13:49:49,606 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:49:49,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-07-23 13:49:49,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-07-23 13:49:49,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-07-23 13:49:49,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 132 transitions. [2018-07-23 13:49:49,630 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 132 transitions. Word has length 45 [2018-07-23 13:49:49,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:49,630 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 132 transitions. [2018-07-23 13:49:49,630 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:49:49,631 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 132 transitions. [2018-07-23 13:49:49,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-23 13:49:49,632 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:49,632 INFO L357 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:49,635 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:49,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1326956691, now seen corresponding path program 1 times [2018-07-23 13:49:49,635 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:49,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:49,705 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 48 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-07-23 13:49:49,705 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:49:49,705 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 13:49:49,706 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:49,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:49,706 INFO L185 omatonBuilderFactory]: Interpolants [3237#true, 3238#false, 3239#(<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576), 3240#(<= ULTIMATE.start_ssl3_accept_~s__state~5 8576)] [2018-07-23 13:49:49,707 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 48 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-07-23 13:49:49,707 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:49:49,707 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:49:49,708 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:49:49,708 INFO L87 Difference]: Start difference. First operand 96 states and 132 transitions. Second operand 4 states. [2018-07-23 13:49:49,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:49,803 INFO L93 Difference]: Finished difference Result 282 states and 382 transitions. [2018-07-23 13:49:49,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 13:49:49,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-07-23 13:49:49,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:49,805 INFO L225 Difference]: With dead ends: 282 [2018-07-23 13:49:49,806 INFO L226 Difference]: Without dead ends: 179 [2018-07-23 13:49:49,806 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:49:49,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-07-23 13:49:49,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 98. [2018-07-23 13:49:49,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-07-23 13:49:49,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 129 transitions. [2018-07-23 13:49:49,828 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 129 transitions. Word has length 48 [2018-07-23 13:49:49,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:49,829 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 129 transitions. [2018-07-23 13:49:49,829 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:49:49,830 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 129 transitions. [2018-07-23 13:49:49,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-07-23 13:49:49,831 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:49,831 INFO L357 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:49,831 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:49,832 INFO L82 PathProgramCache]: Analyzing trace with hash -572978626, now seen corresponding path program 1 times [2018-07-23 13:49:49,832 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:49,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:49,863 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-07-23 13:49:49,864 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:49:49,864 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 13:49:49,864 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:49,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:49,865 INFO L185 omatonBuilderFactory]: Interpolants [4004#true, 4005#false, 4006#(not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))] [2018-07-23 13:49:49,865 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-07-23 13:49:49,866 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:49:49,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:49:49,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:49:49,866 INFO L87 Difference]: Start difference. First operand 98 states and 129 transitions. Second operand 3 states. [2018-07-23 13:49:49,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:49,917 INFO L93 Difference]: Finished difference Result 194 states and 256 transitions. [2018-07-23 13:49:49,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:49:49,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-07-23 13:49:49,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:49,918 INFO L225 Difference]: With dead ends: 194 [2018-07-23 13:49:49,919 INFO L226 Difference]: Without dead ends: 94 [2018-07-23 13:49:49,919 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:49:49,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-07-23 13:49:49,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-07-23 13:49:49,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-07-23 13:49:49,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 116 transitions. [2018-07-23 13:49:49,953 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 116 transitions. Word has length 60 [2018-07-23 13:49:49,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:49,954 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 116 transitions. [2018-07-23 13:49:49,954 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:49:49,954 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2018-07-23 13:49:49,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-07-23 13:49:49,955 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:49,957 INFO L357 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 8, 7, 6, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:49,958 INFO L414 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:49,958 INFO L82 PathProgramCache]: Analyzing trace with hash -396241696, now seen corresponding path program 1 times [2018-07-23 13:49:49,958 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:49,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:50,025 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-07-23 13:49:50,025 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:49:50,026 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:49:50,026 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:50,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:50,027 INFO L185 omatonBuilderFactory]: Interpolants [4583#true, 4584#false, 4585#(= ULTIMATE.start_ssl3_accept_~s__state~5 8592)] [2018-07-23 13:49:50,028 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-07-23 13:49:50,028 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:49:50,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:49:50,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:49:50,029 INFO L87 Difference]: Start difference. First operand 94 states and 116 transitions. Second operand 3 states. [2018-07-23 13:49:50,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:50,083 INFO L93 Difference]: Finished difference Result 195 states and 241 transitions. [2018-07-23 13:49:50,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:49:50,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2018-07-23 13:49:50,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:50,085 INFO L225 Difference]: With dead ends: 195 [2018-07-23 13:49:50,085 INFO L226 Difference]: Without dead ends: 104 [2018-07-23 13:49:50,086 INFO L575 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 [2018-07-23 13:49:50,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-07-23 13:49:50,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-07-23 13:49:50,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-07-23 13:49:50,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 126 transitions. [2018-07-23 13:49:50,107 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 126 transitions. Word has length 93 [2018-07-23 13:49:50,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:50,108 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 126 transitions. [2018-07-23 13:49:50,108 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:49:50,108 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 126 transitions. [2018-07-23 13:49:50,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-07-23 13:49:50,109 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:50,109 INFO L357 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:50,110 INFO L414 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:50,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1439385072, now seen corresponding path program 1 times [2018-07-23 13:49:50,110 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:50,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:50,229 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 60 proven. 81 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2018-07-23 13:49:50,230 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:49:50,230 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 13:49:50,231 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:50,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:50,232 INFO L185 omatonBuilderFactory]: Interpolants [5184#true, 5185#false, 5186#(<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2), 5187#(<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3)] [2018-07-23 13:49:50,232 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 60 proven. 81 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2018-07-23 13:49:50,232 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:49:50,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:49:50,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:49:50,233 INFO L87 Difference]: Start difference. First operand 104 states and 126 transitions. Second operand 4 states. [2018-07-23 13:49:50,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:50,315 INFO L93 Difference]: Finished difference Result 259 states and 315 transitions. [2018-07-23 13:49:50,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:49:50,315 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2018-07-23 13:49:50,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:50,317 INFO L225 Difference]: With dead ends: 259 [2018-07-23 13:49:50,317 INFO L226 Difference]: Without dead ends: 257 [2018-07-23 13:49:50,318 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:49:50,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-07-23 13:49:50,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 194. [2018-07-23 13:49:50,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-07-23 13:49:50,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 236 transitions. [2018-07-23 13:49:50,371 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 236 transitions. Word has length 103 [2018-07-23 13:49:50,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:50,372 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 236 transitions. [2018-07-23 13:49:50,372 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:49:50,373 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 236 transitions. [2018-07-23 13:49:50,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-07-23 13:49:50,377 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:50,377 INFO L357 BasicCegarLoop]: trace histogram [15, 14, 14, 13, 12, 11, 10, 9, 8, 7, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:50,378 INFO L414 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:50,378 INFO L82 PathProgramCache]: Analyzing trace with hash -742527895, now seen corresponding path program 2 times [2018-07-23 13:49:50,378 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:50,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:50,483 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 377 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2018-07-23 13:49:50,484 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:49:50,484 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:49:50,484 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:50,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:50,485 INFO L185 omatonBuilderFactory]: Interpolants [6096#(<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5), 6094#true, 6095#false] [2018-07-23 13:49:50,486 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 377 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2018-07-23 13:49:50,486 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:49:50,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:49:50,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:49:50,487 INFO L87 Difference]: Start difference. First operand 194 states and 236 transitions. Second operand 3 states. [2018-07-23 13:49:50,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:50,567 INFO L93 Difference]: Finished difference Result 385 states and 469 transitions. [2018-07-23 13:49:50,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:49:50,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2018-07-23 13:49:50,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:50,569 INFO L225 Difference]: With dead ends: 385 [2018-07-23 13:49:50,570 INFO L226 Difference]: Without dead ends: 194 [2018-07-23 13:49:50,572 INFO L575 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 [2018-07-23 13:49:50,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-07-23 13:49:50,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2018-07-23 13:49:50,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-07-23 13:49:50,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 230 transitions. [2018-07-23 13:49:50,623 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 230 transitions. Word has length 139 [2018-07-23 13:49:50,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:50,623 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 230 transitions. [2018-07-23 13:49:50,623 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:49:50,624 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 230 transitions. [2018-07-23 13:49:50,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-07-23 13:49:50,625 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:50,626 INFO L357 BasicCegarLoop]: trace histogram [19, 18, 18, 17, 16, 15, 14, 12, 10, 8, 6, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:50,626 INFO L414 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:50,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1179294915, now seen corresponding path program 1 times [2018-07-23 13:49:50,628 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:50,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1261 backedges. 736 proven. 8 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2018-07-23 13:49:50,796 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:49:50,796 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 13:49:50,797 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:50,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:50,798 INFO L185 omatonBuilderFactory]: Interpolants [7255#true, 7256#false, 7257#(<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3), 7258#(<= ULTIMATE.start_ssl3_accept_~s__state~5 3)] [2018-07-23 13:49:50,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1261 backedges. 736 proven. 8 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2018-07-23 13:49:50,799 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:49:50,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:49:50,800 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:49:50,801 INFO L87 Difference]: Start difference. First operand 194 states and 230 transitions. Second operand 4 states. [2018-07-23 13:49:50,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:50,877 INFO L93 Difference]: Finished difference Result 332 states and 398 transitions. [2018-07-23 13:49:50,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:49:50,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2018-07-23 13:49:50,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:50,878 INFO L225 Difference]: With dead ends: 332 [2018-07-23 13:49:50,879 INFO L226 Difference]: Without dead ends: 0 [2018-07-23 13:49:50,879 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:49:50,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-23 13:49:50,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-23 13:49:50,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-23 13:49:50,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-23 13:49:50,881 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 180 [2018-07-23 13:49:50,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:50,882 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-23 13:49:50,882 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:49:50,882 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-23 13:49:50,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-23 13:49:50,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-23 13:49:50,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:49:51,757 INFO L417 ceAbstractionStarter]: At program point L261(lines 224 261) the Hoare annotation is: (let ((.cse1 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2))) (or (and .cse0 .cse1 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)))) [2018-07-23 13:49:51,758 INFO L417 ceAbstractionStarter]: At program point L381(lines 381 393) the Hoare annotation is: (let ((.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse3 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) .cse0 .cse1 .cse2 .cse3 .cse4) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) .cse3 .cse4))) [2018-07-23 13:49:51,761 INFO L417 ceAbstractionStarter]: At program point L346(lines 346 363) the Hoare annotation is: (let ((.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse3 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) .cse0 .cse1 .cse2 .cse3 .cse4) (and (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) .cse3 .cse4)) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)))) [2018-07-23 13:49:51,762 INFO L417 ceAbstractionStarter]: At program point L333(lines 333 344) the Hoare annotation is: (let ((.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse3 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse1 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse5 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse6 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse1 .cse2 .cse3 .cse4 .cse7 .cse5 .cse6) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse6)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576) .cse5 .cse6))) [2018-07-23 13:49:51,762 INFO L421 ceAbstractionStarter]: For program point L453(lines 450 469) no Hoare annotation was computed. [2018-07-23 13:49:51,766 INFO L417 ceAbstractionStarter]: At program point L257(lines 257 276) the Hoare annotation is: (let ((.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse4 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576)) (.cse6 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse7 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2))) (or (and .cse0 .cse1 .cse2) (and .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) .cse4 .cse1 .cse5 .cse6 .cse7) (and .cse3 .cse4 .cse1 .cse2 .cse5 .cse6 .cse7) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)))) [2018-07-23 13:49:51,766 INFO L421 ceAbstractionStarter]: For program point L417(lines 414 439) no Hoare annotation was computed. [2018-07-23 13:49:51,766 INFO L417 ceAbstractionStarter]: At program point L459(lines 459 478) the Hoare annotation is: false [2018-07-23 13:49:51,766 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 3 480) no Hoare annotation was computed. [2018-07-23 13:49:51,767 INFO L417 ceAbstractionStarter]: At program point L366(lines 366 378) the Hoare annotation is: (let ((.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse3 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) .cse0 .cse1 .cse2 .cse3 .cse4) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) .cse3 .cse4))) [2018-07-23 13:49:51,767 INFO L421 ceAbstractionStarter]: For program point L404(lines 404 415) no Hoare annotation was computed. [2018-07-23 13:49:51,767 INFO L417 ceAbstractionStarter]: At program point L408(lines 408 431) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) .cse0) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse0 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~5))))) [2018-07-23 13:49:51,768 INFO L424 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 3 480) the Hoare annotation is: true [2018-07-23 13:49:51,768 INFO L417 ceAbstractionStarter]: At program point ULTIMATE.startEXIT(lines 3 480) the Hoare annotation is: false [2018-07-23 13:49:51,770 INFO L417 ceAbstractionStarter]: At program point L292(lines 292 308) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse1 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse3 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576)) (.cse6 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse7 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) .cse2 .cse3 .cse5 .cse6 .cse7) (and .cse1 .cse0 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2018-07-23 13:49:51,774 INFO L417 ceAbstractionStarter]: At program point L311(lines 311 328) the Hoare annotation is: (let ((.cse3 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576)) (.cse7 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse5 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) .cse2 .cse3 .cse6 .cse5 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse5 .cse7) (and .cse1 .cse0 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576) .cse5))) [2018-07-23 13:49:51,774 INFO L421 ceAbstractionStarter]: For program point L430(lines 430 451) no Hoare annotation was computed. [2018-07-23 13:49:51,775 INFO L417 ceAbstractionStarter]: At program point L396(lines 396 405) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) .cse0 .cse1 .cse2) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse0 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse1 .cse2))) [2018-07-23 13:49:51,776 INFO L417 ceAbstractionStarter]: At program point L237(lines 237 253) the Hoare annotation is: (let ((.cse1 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2))) (or (and .cse0 .cse1 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)))) [2018-07-23 13:49:51,776 INFO L417 ceAbstractionStarter]: At program point L279(lines 279 289) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse4 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse3 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576)) (.cse6 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse7 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) .cse1 .cse2 .cse5 .cse6 .cse7) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)) (and .cse4 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7))) [2018-07-23 13:49:51,777 INFO L417 ceAbstractionStarter]: At program point L477(lines 252 477) the Hoare annotation is: (let ((.cse1 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2))) (or (and .cse0 .cse1 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)))) [2018-07-23 13:49:51,777 INFO L417 ceAbstractionStarter]: At program point ULTIMATE.startErr0AssertViolationASSERT(line 479) the Hoare annotation is: false [2018-07-23 13:49:51,780 INFO L417 ceAbstractionStarter]: At program point L438(lines 438 460) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) [2018-07-23 13:49:51,810 INFO L202 PluginConnector]: Adding new model s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 01:49:51 BoogieIcfgContainer [2018-07-23 13:49:51,810 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 13:49:51,811 INFO L168 Benchmark]: Toolchain (without parser) took 4373.02 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 54.5 MB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 32.6 MB). Peak memory consumption was 490.3 MB. Max. memory is 7.1 GB. [2018-07-23 13:49:51,814 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 13:49:51,815 INFO L168 Benchmark]: Boogie Preprocessor took 68.98 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 13:49:51,816 INFO L168 Benchmark]: RCFGBuilder took 482.05 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-07-23 13:49:51,818 INFO L168 Benchmark]: TraceAbstraction took 3817.38 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 54.5 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 11.4 MB). Peak memory consumption was 469.2 MB. Max. memory is 7.1 GB. [2018-07-23 13:49:51,824 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 68.98 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 482.05 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3817.38 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 54.5 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 11.4 MB). Peak memory consumption was 469.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 479]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 381]: Loop Invariant Derived loop invariant: ((((((ssl3_accept_~blastFlag~5 <= 2 && !(8512 == ssl3_accept_~s__state~5)) && !(8496 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || (((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) - InvariantResult [Line: 459]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 224]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~5 <= 2 && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) - InvariantResult [Line: 252]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~5 <= 2 && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: (((((ssl3_accept_~blastFlag~5 <= 2 && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) || ((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || ((((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5) - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: ((((((ssl3_accept_~blastFlag~5 <= 2 && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || ((ssl3_accept_~blastFlag~5 <= 2 && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576)) || ((((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: ((((((ssl3_accept_~blastFlag~5 <= 2 && !(8512 == ssl3_accept_~s__state~5)) && !(8496 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || (!(8576 == ssl3_accept_~s__state~5) && ((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~5 <= 2 && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) - InvariantResult [Line: 292]: Loop Invariant Derived loop invariant: (((((((ssl3_accept_~blastFlag~5 <= 2 && !(8512 == ssl3_accept_~s__state~5)) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576)) || ((((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) - InvariantResult [Line: 408]: Loop Invariant Derived loop invariant: ((ssl3_accept_~blastFlag~5 <= 2 && !(8448 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((!(8656 == ssl3_accept_~s__state~5) && !(8448 == ssl3_accept_~s__state~5)) && !(8672 == ssl3_accept_~s__state~5)) - InvariantResult [Line: 311]: Loop Invariant Derived loop invariant: ((((((((ssl3_accept_~blastFlag~5 <= 2 && !(8512 == ssl3_accept_~s__state~5)) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || ((((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || ((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) - InvariantResult [Line: 333]: Loop Invariant Derived loop invariant: (((((((((ssl3_accept_~blastFlag~5 <= 2 && !(8512 == ssl3_accept_~s__state~5)) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3 && ((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (((((ssl3_accept_~blastFlag~5 <= 2 && !(8512 == ssl3_accept_~s__state~5)) && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) - InvariantResult [Line: 366]: Loop Invariant Derived loop invariant: ((((((ssl3_accept_~blastFlag~5 <= 2 && !(8512 == ssl3_accept_~s__state~5)) && !(8496 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || (((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) - InvariantResult [Line: 438]: Loop Invariant Derived loop invariant: ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5 - InvariantResult [Line: 396]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~5 <= 2 && !(8448 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || (((((!(8656 == ssl3_accept_~s__state~5) && !(8640 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8672 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 1 error locations. SAFE Result, 3.7s OverallTime, 14 OverallIterations, 19 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 194 SDtfs, 117 SDslu, 97 SDs, 0 SdLazy, 487 SolverSat, 172 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=194occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 3067/3164 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, 14 MinimizatonAttempts, 144 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 18 PreInvPairs, 174 NumberOfFragments, 915 HoareAnnotationTreeSize, 18 FomulaSimplifications, 6403 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 18 FomulaSimplificationsInter, 3244 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 881 NumberOfCodeBlocks, 881 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 867 ConstructedInterpolants, 0 QuantifiedInterpolants, 123055 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 3067/3164 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_1.BV.c.cil.c_21.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_13-49-51-847.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_1.BV.c.cil.c_21.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_13-49-51-847.csv Received shutdown request...