java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/real-life/s3_clnt_1_Safe.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:07:44,070 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:07:44,075 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:07:44,091 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:07:44,091 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:07:44,092 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:07:44,094 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:07:44,096 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:07:44,098 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:07:44,099 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:07:44,100 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:07:44,100 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:07:44,100 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:07:44,101 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:07:44,102 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:07:44,103 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:07:44,104 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:07:44,105 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:07:44,107 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:07:44,109 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:07:44,111 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:07:44,112 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:07:44,113 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:07:44,114 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:07:44,116 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:07:44,116 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:07:44,116 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:07:44,117 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:07:44,118 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:07:44,119 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:07:44,119 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:07:44,120 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:07:44,120 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:07:44,121 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:07:44,122 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:07:44,122 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:07:44,123 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:07:44,123 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:07:44,123 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:07:44,124 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:07:44,125 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:07:44,151 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:07:44,165 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:07:44,169 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:07:44,171 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:07:44,171 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:07:44,172 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/s3_clnt_1_Safe.bpl [2019-08-05 10:07:44,172 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/s3_clnt_1_Safe.bpl' [2019-08-05 10:07:44,233 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:07:44,235 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:07:44,236 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:07:44,236 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:07:44,236 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:07:44,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_clnt_1_Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:44" (1/1) ... [2019-08-05 10:07:44,265 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_clnt_1_Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:44" (1/1) ... [2019-08-05 10:07:44,270 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:07:44,271 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:07:44,271 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:07:44,273 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:07:44,274 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:07:44,274 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:07:44,274 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:07:44,285 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_clnt_1_Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:44" (1/1) ... [2019-08-05 10:07:44,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_clnt_1_Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:44" (1/1) ... [2019-08-05 10:07:44,288 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_clnt_1_Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:44" (1/1) ... [2019-08-05 10:07:44,289 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_clnt_1_Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:44" (1/1) ... [2019-08-05 10:07:44,299 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_clnt_1_Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:44" (1/1) ... [2019-08-05 10:07:44,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_clnt_1_Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:44" (1/1) ... [2019-08-05 10:07:44,313 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_clnt_1_Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:44" (1/1) ... [2019-08-05 10:07:44,318 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:07:44,319 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:07:44,319 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:07:44,319 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:07:44,320 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_clnt_1_Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:07:44,402 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-08-05 10:07:44,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-08-05 10:07:44,650 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-08-05 10:07:45,539 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-08-05 10:07:45,539 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-08-05 10:07:46,591 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:07:46,591 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:07:46,592 INFO L202 PluginConnector]: Adding new model s3_clnt_1_Safe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:07:46 BoogieIcfgContainer [2019-08-05 10:07:46,592 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:07:46,594 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:07:46,597 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:07:46,600 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:07:46,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_1_Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:44" (1/2) ... [2019-08-05 10:07:46,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41fb1a81 and model type s3_clnt_1_Safe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:07:46, skipping insertion in model container [2019-08-05 10:07:46,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_1_Safe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:07:46" (2/2) ... [2019-08-05 10:07:46,605 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_1_Safe.bpl [2019-08-05 10:07:46,614 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:07:46,622 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:07:46,634 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:07:46,659 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:07:46,660 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:07:46,660 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:07:46,660 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:07:46,661 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:07:46,661 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:07:46,662 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:07:46,662 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:07:46,662 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:07:46,680 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2019-08-05 10:07:46,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:07:46,691 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:46,692 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:46,695 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:46,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:46,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1895138746, now seen corresponding path program 1 times [2019-08-05 10:07:46,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:46,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:46,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:07:46,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:46,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:07:46,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:07:46,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:07:46,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:07:46,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:07:46,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:07:46,909 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 3 states. [2019-08-05 10:07:47,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:47,153 INFO L93 Difference]: Finished difference Result 164 states and 282 transitions. [2019-08-05 10:07:47,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:07:47,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-08-05 10:07:47,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:47,179 INFO L225 Difference]: With dead ends: 164 [2019-08-05 10:07:47,181 INFO L226 Difference]: Without dead ends: 158 [2019-08-05 10:07:47,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:07:47,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-08-05 10:07:47,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2019-08-05 10:07:47,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-05 10:07:47,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 231 transitions. [2019-08-05 10:07:47,264 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 231 transitions. Word has length 19 [2019-08-05 10:07:47,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:47,265 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 231 transitions. [2019-08-05 10:07:47,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:07:47,265 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 231 transitions. [2019-08-05 10:07:47,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:07:47,269 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:47,269 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:47,270 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:47,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:47,271 INFO L82 PathProgramCache]: Analyzing trace with hash -895589785, now seen corresponding path program 1 times [2019-08-05 10:07:47,273 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:47,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:47,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:07:47,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:47,388 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:07:47,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:07:47,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:07:47,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:07:47,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:07:47,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:07:47,391 INFO L87 Difference]: Start difference. First operand 157 states and 231 transitions. Second operand 3 states. [2019-08-05 10:07:48,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:48,002 INFO L93 Difference]: Finished difference Result 176 states and 253 transitions. [2019-08-05 10:07:48,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:07:48,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-08-05 10:07:48,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:48,006 INFO L225 Difference]: With dead ends: 176 [2019-08-05 10:07:48,007 INFO L226 Difference]: Without dead ends: 176 [2019-08-05 10:07:48,008 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:07:48,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-08-05 10:07:48,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 172. [2019-08-05 10:07:48,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-08-05 10:07:48,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 249 transitions. [2019-08-05 10:07:48,025 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 249 transitions. Word has length 30 [2019-08-05 10:07:48,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:48,026 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 249 transitions. [2019-08-05 10:07:48,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:07:48,026 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 249 transitions. [2019-08-05 10:07:48,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:07:48,029 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:48,029 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:48,029 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:48,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:48,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1734172979, now seen corresponding path program 1 times [2019-08-05 10:07:48,031 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:48,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:48,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:07:48,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:48,187 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-08-05 10:07:48,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:07:48,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:07:48,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:07:48,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:07:48,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:07:48,190 INFO L87 Difference]: Start difference. First operand 172 states and 249 transitions. Second operand 4 states. [2019-08-05 10:07:48,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:48,679 INFO L93 Difference]: Finished difference Result 256 states and 343 transitions. [2019-08-05 10:07:48,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:07:48,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-08-05 10:07:48,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:48,684 INFO L225 Difference]: With dead ends: 256 [2019-08-05 10:07:48,684 INFO L226 Difference]: Without dead ends: 256 [2019-08-05 10:07:48,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:07:48,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-08-05 10:07:48,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 246. [2019-08-05 10:07:48,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-08-05 10:07:48,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 331 transitions. [2019-08-05 10:07:48,701 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 331 transitions. Word has length 43 [2019-08-05 10:07:48,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:48,701 INFO L475 AbstractCegarLoop]: Abstraction has 246 states and 331 transitions. [2019-08-05 10:07:48,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:07:48,702 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 331 transitions. [2019-08-05 10:07:48,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:07:48,704 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:48,705 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:48,705 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:48,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:48,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1773956702, now seen corresponding path program 1 times [2019-08-05 10:07:48,706 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:48,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:48,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:07:48,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:48,787 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-08-05 10:07:48,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:07:48,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:07:48,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:07:48,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:07:48,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:07:48,789 INFO L87 Difference]: Start difference. First operand 246 states and 331 transitions. Second operand 3 states. [2019-08-05 10:07:48,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:48,970 INFO L93 Difference]: Finished difference Result 288 states and 379 transitions. [2019-08-05 10:07:48,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:07:48,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-08-05 10:07:48,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:48,974 INFO L225 Difference]: With dead ends: 288 [2019-08-05 10:07:48,975 INFO L226 Difference]: Without dead ends: 288 [2019-08-05 10:07:48,975 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:07:48,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-08-05 10:07:48,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 284. [2019-08-05 10:07:48,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-08-05 10:07:48,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 375 transitions. [2019-08-05 10:07:48,989 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 375 transitions. Word has length 58 [2019-08-05 10:07:48,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:48,990 INFO L475 AbstractCegarLoop]: Abstraction has 284 states and 375 transitions. [2019-08-05 10:07:48,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:07:48,990 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 375 transitions. [2019-08-05 10:07:48,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:07:48,993 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:48,993 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:48,994 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:48,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:48,994 INFO L82 PathProgramCache]: Analyzing trace with hash 2117617087, now seen corresponding path program 1 times [2019-08-05 10:07:48,995 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:49,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:49,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:07:49,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:49,134 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-08-05 10:07:49,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:49,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:07:49,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:07:49,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:07:49,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:07:49,136 INFO L87 Difference]: Start difference. First operand 284 states and 375 transitions. Second operand 5 states. [2019-08-05 10:07:49,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:49,481 INFO L93 Difference]: Finished difference Result 450 states and 591 transitions. [2019-08-05 10:07:49,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:07:49,483 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-08-05 10:07:49,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:49,487 INFO L225 Difference]: With dead ends: 450 [2019-08-05 10:07:49,488 INFO L226 Difference]: Without dead ends: 450 [2019-08-05 10:07:49,488 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:07:49,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-08-05 10:07:49,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 432. [2019-08-05 10:07:49,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-08-05 10:07:49,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 570 transitions. [2019-08-05 10:07:49,518 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 570 transitions. Word has length 76 [2019-08-05 10:07:49,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:49,519 INFO L475 AbstractCegarLoop]: Abstraction has 432 states and 570 transitions. [2019-08-05 10:07:49,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:07:49,519 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 570 transitions. [2019-08-05 10:07:49,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:07:49,528 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:49,528 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:49,529 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:49,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:49,529 INFO L82 PathProgramCache]: Analyzing trace with hash 583848633, now seen corresponding path program 1 times [2019-08-05 10:07:49,532 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:49,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:49,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:07:49,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:49,686 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:07:49,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:49,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:07:49,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:07:49,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:07:49,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:07:49,688 INFO L87 Difference]: Start difference. First operand 432 states and 570 transitions. Second operand 7 states. [2019-08-05 10:07:49,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:49,925 INFO L93 Difference]: Finished difference Result 620 states and 811 transitions. [2019-08-05 10:07:49,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:07:49,926 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2019-08-05 10:07:49,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:49,930 INFO L225 Difference]: With dead ends: 620 [2019-08-05 10:07:49,930 INFO L226 Difference]: Without dead ends: 620 [2019-08-05 10:07:49,931 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:07:49,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-08-05 10:07:49,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 579. [2019-08-05 10:07:49,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-08-05 10:07:49,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 764 transitions. [2019-08-05 10:07:49,944 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 764 transitions. Word has length 77 [2019-08-05 10:07:49,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:49,945 INFO L475 AbstractCegarLoop]: Abstraction has 579 states and 764 transitions. [2019-08-05 10:07:49,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:07:49,945 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 764 transitions. [2019-08-05 10:07:49,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 10:07:49,949 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:49,950 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:49,950 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:49,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:49,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1164467214, now seen corresponding path program 1 times [2019-08-05 10:07:49,951 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:50,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:50,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:07:50,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:50,077 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-08-05 10:07:50,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:07:50,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:07:50,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:07:50,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:07:50,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:07:50,079 INFO L87 Difference]: Start difference. First operand 579 states and 764 transitions. Second operand 3 states. [2019-08-05 10:07:50,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:50,312 INFO L93 Difference]: Finished difference Result 677 states and 874 transitions. [2019-08-05 10:07:50,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:07:50,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-08-05 10:07:50,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:50,321 INFO L225 Difference]: With dead ends: 677 [2019-08-05 10:07:50,321 INFO L226 Difference]: Without dead ends: 677 [2019-08-05 10:07:50,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:07:50,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2019-08-05 10:07:50,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 663. [2019-08-05 10:07:50,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2019-08-05 10:07:50,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 860 transitions. [2019-08-05 10:07:50,334 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 860 transitions. Word has length 98 [2019-08-05 10:07:50,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:50,335 INFO L475 AbstractCegarLoop]: Abstraction has 663 states and 860 transitions. [2019-08-05 10:07:50,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:07:50,335 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 860 transitions. [2019-08-05 10:07:50,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-08-05 10:07:50,337 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:50,338 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:50,338 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:50,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:50,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1858910556, now seen corresponding path program 1 times [2019-08-05 10:07:50,339 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:50,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:50,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:07:50,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:50,432 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2019-08-05 10:07:50,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:07:50,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:07:50,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:07:50,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:07:50,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:07:50,434 INFO L87 Difference]: Start difference. First operand 663 states and 860 transitions. Second operand 3 states. [2019-08-05 10:07:50,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:50,680 INFO L93 Difference]: Finished difference Result 835 states and 1048 transitions. [2019-08-05 10:07:50,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:07:50,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-08-05 10:07:50,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:50,691 INFO L225 Difference]: With dead ends: 835 [2019-08-05 10:07:50,691 INFO L226 Difference]: Without dead ends: 795 [2019-08-05 10:07:50,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:07:50,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2019-08-05 10:07:50,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 779. [2019-08-05 10:07:50,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2019-08-05 10:07:50,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 992 transitions. [2019-08-05 10:07:50,707 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 992 transitions. Word has length 118 [2019-08-05 10:07:50,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:50,708 INFO L475 AbstractCegarLoop]: Abstraction has 779 states and 992 transitions. [2019-08-05 10:07:50,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:07:50,708 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 992 transitions. [2019-08-05 10:07:50,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-08-05 10:07:50,711 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:50,711 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:50,711 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:50,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:50,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1596005281, now seen corresponding path program 1 times [2019-08-05 10:07:50,713 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:50,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:07:50,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:50,960 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:07:50,971 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:51,230 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 164 proven. 17 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2019-08-05 10:07:51,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:51,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:07:51,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:07:51,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:07:51,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:07:51,233 INFO L87 Difference]: Start difference. First operand 779 states and 992 transitions. Second operand 5 states. [2019-08-05 10:07:52,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:52,301 INFO L93 Difference]: Finished difference Result 1926 states and 2384 transitions. [2019-08-05 10:07:52,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:07:52,302 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2019-08-05 10:07:52,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:52,310 INFO L225 Difference]: With dead ends: 1926 [2019-08-05 10:07:52,310 INFO L226 Difference]: Without dead ends: 1926 [2019-08-05 10:07:52,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:07:52,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2019-08-05 10:07:52,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1894. [2019-08-05 10:07:52,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1894 states. [2019-08-05 10:07:52,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 2353 transitions. [2019-08-05 10:07:52,343 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 2353 transitions. Word has length 145 [2019-08-05 10:07:52,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:52,344 INFO L475 AbstractCegarLoop]: Abstraction has 1894 states and 2353 transitions. [2019-08-05 10:07:52,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:07:52,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 2353 transitions. [2019-08-05 10:07:52,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-08-05 10:07:52,348 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:52,348 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:52,349 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:52,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:52,349 INFO L82 PathProgramCache]: Analyzing trace with hash 318469842, now seen corresponding path program 1 times [2019-08-05 10:07:52,350 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:52,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:07:52,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:52,539 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2019-08-05 10:07:52,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:07:52,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:07:52,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:07:52,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:07:52,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:07:52,541 INFO L87 Difference]: Start difference. First operand 1894 states and 2353 transitions. Second operand 3 states. [2019-08-05 10:07:53,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:53,076 INFO L93 Difference]: Finished difference Result 2082 states and 2557 transitions. [2019-08-05 10:07:53,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:07:53,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-08-05 10:07:53,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:53,085 INFO L225 Difference]: With dead ends: 2082 [2019-08-05 10:07:53,086 INFO L226 Difference]: Without dead ends: 2058 [2019-08-05 10:07:53,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:07:53,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2058 states. [2019-08-05 10:07:53,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2058 to 2018. [2019-08-05 10:07:53,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2018 states. [2019-08-05 10:07:53,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2018 states to 2018 states and 2493 transitions. [2019-08-05 10:07:53,119 INFO L78 Accepts]: Start accepts. Automaton has 2018 states and 2493 transitions. Word has length 168 [2019-08-05 10:07:53,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:53,119 INFO L475 AbstractCegarLoop]: Abstraction has 2018 states and 2493 transitions. [2019-08-05 10:07:53,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:07:53,120 INFO L276 IsEmpty]: Start isEmpty. Operand 2018 states and 2493 transitions. [2019-08-05 10:07:53,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-08-05 10:07:53,124 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:53,124 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:53,124 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:53,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:53,125 INFO L82 PathProgramCache]: Analyzing trace with hash 746986360, now seen corresponding path program 1 times [2019-08-05 10:07:53,126 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:53,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:53,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:07:53,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:53,206 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2019-08-05 10:07:53,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:07:53,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:07:53,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:07:53,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:07:53,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:07:53,207 INFO L87 Difference]: Start difference. First operand 2018 states and 2493 transitions. Second operand 3 states. [2019-08-05 10:07:53,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:53,745 INFO L93 Difference]: Finished difference Result 2386 states and 2941 transitions. [2019-08-05 10:07:53,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:07:53,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-08-05 10:07:53,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:53,755 INFO L225 Difference]: With dead ends: 2386 [2019-08-05 10:07:53,755 INFO L226 Difference]: Without dead ends: 2378 [2019-08-05 10:07:53,756 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:07:53,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2378 states. [2019-08-05 10:07:53,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2378 to 2322. [2019-08-05 10:07:53,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2322 states. [2019-08-05 10:07:53,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2322 states to 2322 states and 2869 transitions. [2019-08-05 10:07:53,790 INFO L78 Accepts]: Start accepts. Automaton has 2322 states and 2869 transitions. Word has length 178 [2019-08-05 10:07:53,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:53,791 INFO L475 AbstractCegarLoop]: Abstraction has 2322 states and 2869 transitions. [2019-08-05 10:07:53,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:07:53,791 INFO L276 IsEmpty]: Start isEmpty. Operand 2322 states and 2869 transitions. [2019-08-05 10:07:53,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-08-05 10:07:53,797 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:53,797 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:53,797 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:53,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:53,798 INFO L82 PathProgramCache]: Analyzing trace with hash -2059388729, now seen corresponding path program 1 times [2019-08-05 10:07:53,799 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:53,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:53,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:07:53,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:53,946 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2019-08-05 10:07:53,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:07:53,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:07:53,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:07:53,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:07:53,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:07:53,948 INFO L87 Difference]: Start difference. First operand 2322 states and 2869 transitions. Second operand 3 states. [2019-08-05 10:07:54,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:54,230 INFO L93 Difference]: Finished difference Result 2706 states and 3437 transitions. [2019-08-05 10:07:54,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:07:54,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-08-05 10:07:54,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:54,247 INFO L225 Difference]: With dead ends: 2706 [2019-08-05 10:07:54,247 INFO L226 Difference]: Without dead ends: 2682 [2019-08-05 10:07:54,247 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:07:54,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2682 states. [2019-08-05 10:07:54,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2682 to 2602. [2019-08-05 10:07:54,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2602 states. [2019-08-05 10:07:54,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2602 states and 3325 transitions. [2019-08-05 10:07:54,286 INFO L78 Accepts]: Start accepts. Automaton has 2602 states and 3325 transitions. Word has length 187 [2019-08-05 10:07:54,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:54,286 INFO L475 AbstractCegarLoop]: Abstraction has 2602 states and 3325 transitions. [2019-08-05 10:07:54,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:07:54,287 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 3325 transitions. [2019-08-05 10:07:54,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-08-05 10:07:54,292 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:54,293 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:54,293 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:54,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:54,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1721892275, now seen corresponding path program 1 times [2019-08-05 10:07:54,294 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:54,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:54,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:07:54,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:54,405 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:54,494 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 146 proven. 191 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-08-05 10:07:54,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:54,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:07:54,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:07:54,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:07:54,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:07:54,495 INFO L87 Difference]: Start difference. First operand 2602 states and 3325 transitions. Second operand 5 states. [2019-08-05 10:07:55,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:55,196 INFO L93 Difference]: Finished difference Result 5393 states and 6863 transitions. [2019-08-05 10:07:55,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:07:55,196 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 211 [2019-08-05 10:07:55,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:55,213 INFO L225 Difference]: With dead ends: 5393 [2019-08-05 10:07:55,213 INFO L226 Difference]: Without dead ends: 5393 [2019-08-05 10:07:55,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:07:55,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5393 states. [2019-08-05 10:07:55,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5393 to 5321. [2019-08-05 10:07:55,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5321 states. [2019-08-05 10:07:55,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5321 states to 5321 states and 6784 transitions. [2019-08-05 10:07:55,291 INFO L78 Accepts]: Start accepts. Automaton has 5321 states and 6784 transitions. Word has length 211 [2019-08-05 10:07:55,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:55,292 INFO L475 AbstractCegarLoop]: Abstraction has 5321 states and 6784 transitions. [2019-08-05 10:07:55,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:07:55,292 INFO L276 IsEmpty]: Start isEmpty. Operand 5321 states and 6784 transitions. [2019-08-05 10:07:55,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-08-05 10:07:55,303 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:55,303 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:55,304 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:55,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:55,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1275436971, now seen corresponding path program 1 times [2019-08-05 10:07:55,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:55,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:55,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:07:55,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:55,387 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:55,398 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:55,447 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 406 proven. 13 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2019-08-05 10:07:55,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:55,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:07:55,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:07:55,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:07:55,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:07:55,449 INFO L87 Difference]: Start difference. First operand 5321 states and 6784 transitions. Second operand 5 states. [2019-08-05 10:07:56,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:56,264 INFO L93 Difference]: Finished difference Result 6640 states and 8344 transitions. [2019-08-05 10:07:56,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:07:56,264 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-08-05 10:07:56,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:56,282 INFO L225 Difference]: With dead ends: 6640 [2019-08-05 10:07:56,282 INFO L226 Difference]: Without dead ends: 6640 [2019-08-05 10:07:56,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:07:56,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6640 states. [2019-08-05 10:07:56,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6640 to 5985. [2019-08-05 10:07:56,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5985 states. [2019-08-05 10:07:56,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5985 states to 5985 states and 7631 transitions. [2019-08-05 10:07:56,364 INFO L78 Accepts]: Start accepts. Automaton has 5985 states and 7631 transitions. Word has length 246 [2019-08-05 10:07:56,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:56,365 INFO L475 AbstractCegarLoop]: Abstraction has 5985 states and 7631 transitions. [2019-08-05 10:07:56,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:07:56,365 INFO L276 IsEmpty]: Start isEmpty. Operand 5985 states and 7631 transitions. [2019-08-05 10:07:56,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-08-05 10:07:56,376 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:56,377 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:56,377 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:56,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:56,378 INFO L82 PathProgramCache]: Analyzing trace with hash 325583228, now seen corresponding path program 1 times [2019-08-05 10:07:56,378 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:56,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:56,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:07:56,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:56,477 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:56,565 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 164 proven. 357 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-08-05 10:07:56,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:56,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:07:56,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:07:56,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:07:56,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:07:56,566 INFO L87 Difference]: Start difference. First operand 5985 states and 7631 transitions. Second operand 6 states. [2019-08-05 10:07:57,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:57,452 INFO L93 Difference]: Finished difference Result 8304 states and 10331 transitions. [2019-08-05 10:07:57,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:07:57,460 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 248 [2019-08-05 10:07:57,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:57,484 INFO L225 Difference]: With dead ends: 8304 [2019-08-05 10:07:57,484 INFO L226 Difference]: Without dead ends: 8296 [2019-08-05 10:07:57,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:07:57,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8296 states. [2019-08-05 10:07:57,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8296 to 6993. [2019-08-05 10:07:57,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6993 states. [2019-08-05 10:07:57,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6993 states to 6993 states and 8879 transitions. [2019-08-05 10:07:57,564 INFO L78 Accepts]: Start accepts. Automaton has 6993 states and 8879 transitions. Word has length 248 [2019-08-05 10:07:57,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:57,565 INFO L475 AbstractCegarLoop]: Abstraction has 6993 states and 8879 transitions. [2019-08-05 10:07:57,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:07:57,565 INFO L276 IsEmpty]: Start isEmpty. Operand 6993 states and 8879 transitions. [2019-08-05 10:07:57,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-08-05 10:07:57,579 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:57,579 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:57,579 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:57,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:57,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1740187837, now seen corresponding path program 1 times [2019-08-05 10:07:57,580 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:57,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:57,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:07:57,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:57,695 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 695 trivial. 0 not checked. [2019-08-05 10:07:57,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:07:57,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:07:57,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:07:57,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:07:57,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:07:57,696 INFO L87 Difference]: Start difference. First operand 6993 states and 8879 transitions. Second operand 3 states. [2019-08-05 10:07:57,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:57,835 INFO L93 Difference]: Finished difference Result 7341 states and 9299 transitions. [2019-08-05 10:07:57,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:07:57,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 257 [2019-08-05 10:07:57,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:57,850 INFO L225 Difference]: With dead ends: 7341 [2019-08-05 10:07:57,851 INFO L226 Difference]: Without dead ends: 7341 [2019-08-05 10:07:57,851 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:07:57,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7341 states. [2019-08-05 10:07:57,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7341 to 7185. [2019-08-05 10:07:57,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7185 states. [2019-08-05 10:07:57,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7185 states to 7185 states and 9119 transitions. [2019-08-05 10:07:57,933 INFO L78 Accepts]: Start accepts. Automaton has 7185 states and 9119 transitions. Word has length 257 [2019-08-05 10:07:57,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:57,934 INFO L475 AbstractCegarLoop]: Abstraction has 7185 states and 9119 transitions. [2019-08-05 10:07:57,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:07:57,934 INFO L276 IsEmpty]: Start isEmpty. Operand 7185 states and 9119 transitions. [2019-08-05 10:07:57,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-08-05 10:07:57,948 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:57,948 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:57,948 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:57,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:57,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1467482186, now seen corresponding path program 1 times [2019-08-05 10:07:57,950 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:57,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:57,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:07:57,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:58,075 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:58,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 182 proven. 251 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2019-08-05 10:07:58,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:58,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:07:58,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:07:58,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:07:58,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:07:58,250 INFO L87 Difference]: Start difference. First operand 7185 states and 9119 transitions. Second operand 5 states. [2019-08-05 10:07:58,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:58,859 INFO L93 Difference]: Finished difference Result 7575 states and 9472 transitions. [2019-08-05 10:07:58,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:07:58,860 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 283 [2019-08-05 10:07:58,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:58,873 INFO L225 Difference]: With dead ends: 7575 [2019-08-05 10:07:58,873 INFO L226 Difference]: Without dead ends: 6785 [2019-08-05 10:07:58,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:07:58,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6785 states. [2019-08-05 10:07:58,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6785 to 6339. [2019-08-05 10:07:58,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6339 states. [2019-08-05 10:07:58,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6339 states to 6339 states and 8124 transitions. [2019-08-05 10:07:58,944 INFO L78 Accepts]: Start accepts. Automaton has 6339 states and 8124 transitions. Word has length 283 [2019-08-05 10:07:58,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:58,945 INFO L475 AbstractCegarLoop]: Abstraction has 6339 states and 8124 transitions. [2019-08-05 10:07:58,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:07:58,945 INFO L276 IsEmpty]: Start isEmpty. Operand 6339 states and 8124 transitions. [2019-08-05 10:07:58,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-08-05 10:07:58,957 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:58,957 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:58,958 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:58,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:58,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1365402495, now seen corresponding path program 2 times [2019-08-05 10:07:58,959 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:58,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:59,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:07:59,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:59,199 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:07:59,202 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:59,278 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:59,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1268 backedges. 752 proven. 65 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2019-08-05 10:07:59,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:59,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:07:59,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:07:59,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:07:59,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:07:59,529 INFO L87 Difference]: Start difference. First operand 6339 states and 8124 transitions. Second operand 5 states. [2019-08-05 10:08:00,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:00,164 INFO L93 Difference]: Finished difference Result 6803 states and 8629 transitions. [2019-08-05 10:08:00,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:08:00,165 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 312 [2019-08-05 10:08:00,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:00,176 INFO L225 Difference]: With dead ends: 6803 [2019-08-05 10:08:00,176 INFO L226 Difference]: Without dead ends: 6803 [2019-08-05 10:08:00,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:08:00,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6803 states. [2019-08-05 10:08:00,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6803 to 6689. [2019-08-05 10:08:00,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6689 states. [2019-08-05 10:08:00,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6689 states to 6689 states and 8504 transitions. [2019-08-05 10:08:00,251 INFO L78 Accepts]: Start accepts. Automaton has 6689 states and 8504 transitions. Word has length 312 [2019-08-05 10:08:00,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:00,251 INFO L475 AbstractCegarLoop]: Abstraction has 6689 states and 8504 transitions. [2019-08-05 10:08:00,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:08:00,252 INFO L276 IsEmpty]: Start isEmpty. Operand 6689 states and 8504 transitions. [2019-08-05 10:08:00,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-08-05 10:08:00,260 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:00,260 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:00,260 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:00,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:00,261 INFO L82 PathProgramCache]: Analyzing trace with hash -147229610, now seen corresponding path program 1 times [2019-08-05 10:08:00,262 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:00,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:00,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:08:00,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:00,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1436 backedges. 681 proven. 0 refuted. 0 times theorem prover too weak. 755 trivial. 0 not checked. [2019-08-05 10:08:00,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:08:00,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:08:00,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:08:00,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:08:00,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:08:00,547 INFO L87 Difference]: Start difference. First operand 6689 states and 8504 transitions. Second operand 3 states. [2019-08-05 10:08:00,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:00,635 INFO L93 Difference]: Finished difference Result 9755 states and 12348 transitions. [2019-08-05 10:08:00,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:08:00,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-08-05 10:08:00,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:00,653 INFO L225 Difference]: With dead ends: 9755 [2019-08-05 10:08:00,653 INFO L226 Difference]: Without dead ends: 9755 [2019-08-05 10:08:00,654 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:08:00,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9755 states. [2019-08-05 10:08:00,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9755 to 9170. [2019-08-05 10:08:00,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9170 states. [2019-08-05 10:08:00,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9170 states to 9170 states and 11682 transitions. [2019-08-05 10:08:00,766 INFO L78 Accepts]: Start accepts. Automaton has 9170 states and 11682 transitions. Word has length 314 [2019-08-05 10:08:00,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:00,766 INFO L475 AbstractCegarLoop]: Abstraction has 9170 states and 11682 transitions. [2019-08-05 10:08:00,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:08:00,767 INFO L276 IsEmpty]: Start isEmpty. Operand 9170 states and 11682 transitions. [2019-08-05 10:08:00,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-08-05 10:08:00,777 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:00,778 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:00,778 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:00,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:00,779 INFO L82 PathProgramCache]: Analyzing trace with hash -906922238, now seen corresponding path program 2 times [2019-08-05 10:08:00,779 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:00,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:00,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:08:00,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:01,009 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:08:01,011 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:08:01,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1437 backedges. 782 proven. 259 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2019-08-05 10:08:01,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:01,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:08:01,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:08:01,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:08:01,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:08:01,472 INFO L87 Difference]: Start difference. First operand 9170 states and 11682 transitions. Second operand 6 states. [2019-08-05 10:08:03,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:03,720 INFO L93 Difference]: Finished difference Result 8556 states and 10802 transitions. [2019-08-05 10:08:03,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:08:03,721 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 315 [2019-08-05 10:08:03,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:03,731 INFO L225 Difference]: With dead ends: 8556 [2019-08-05 10:08:03,732 INFO L226 Difference]: Without dead ends: 6024 [2019-08-05 10:08:03,732 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:08:03,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6024 states. [2019-08-05 10:08:03,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6024 to 5568. [2019-08-05 10:08:03,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5568 states. [2019-08-05 10:08:03,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5568 states to 5568 states and 7025 transitions. [2019-08-05 10:08:03,854 INFO L78 Accepts]: Start accepts. Automaton has 5568 states and 7025 transitions. Word has length 315 [2019-08-05 10:08:03,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:03,855 INFO L475 AbstractCegarLoop]: Abstraction has 5568 states and 7025 transitions. [2019-08-05 10:08:03,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:08:03,855 INFO L276 IsEmpty]: Start isEmpty. Operand 5568 states and 7025 transitions. [2019-08-05 10:08:03,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2019-08-05 10:08:03,866 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:03,867 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:03,868 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:03,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:03,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1709782893, now seen corresponding path program 2 times [2019-08-05 10:08:03,871 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:03,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:03,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:08:03,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:04,128 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:08:04,131 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:08:04,199 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:08:04,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1859 backedges. 1084 proven. 171 refuted. 0 times theorem prover too weak. 604 trivial. 0 not checked. [2019-08-05 10:08:04,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:04,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:08:04,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:08:04,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:08:04,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:08:04,569 INFO L87 Difference]: Start difference. First operand 5568 states and 7025 transitions. Second operand 6 states. [2019-08-05 10:08:05,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:05,882 INFO L93 Difference]: Finished difference Result 2935 states and 3427 transitions. [2019-08-05 10:08:05,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:08:05,884 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 386 [2019-08-05 10:08:05,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:05,885 INFO L225 Difference]: With dead ends: 2935 [2019-08-05 10:08:05,885 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:08:05,885 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:08:05,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:08:05,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:08:05,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:08:05,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:08:05,886 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 386 [2019-08-05 10:08:05,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:05,886 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:08:05,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:08:05,886 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:08:05,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:08:05,892 INFO L202 PluginConnector]: Adding new model s3_clnt_1_Safe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:08:05 BoogieIcfgContainer [2019-08-05 10:08:05,892 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:08:05,895 INFO L168 Benchmark]: Toolchain (without parser) took 21659.45 ms. Allocated memory was 135.8 MB in the beginning and 583.5 MB in the end (delta: 447.7 MB). Free memory was 112.0 MB in the beginning and 187.8 MB in the end (delta: -75.9 MB). Peak memory consumption was 371.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:08:05,896 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 135.8 MB. Free memory is still 114.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:08:05,897 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.65 ms. Allocated memory is still 135.8 MB. Free memory was 112.0 MB in the beginning and 110.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:08:05,898 INFO L168 Benchmark]: Boogie Preprocessor took 44.53 ms. Allocated memory is still 135.8 MB. Free memory was 110.3 MB in the beginning and 108.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:08:05,901 INFO L168 Benchmark]: RCFGBuilder took 2273.75 ms. Allocated memory was 135.8 MB in the beginning and 168.8 MB in the end (delta: 33.0 MB). Free memory was 108.2 MB in the beginning and 117.6 MB in the end (delta: -9.5 MB). Peak memory consumption was 52.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:08:05,903 INFO L168 Benchmark]: TraceAbstraction took 19297.90 ms. Allocated memory was 168.8 MB in the beginning and 583.5 MB in the end (delta: 414.7 MB). Free memory was 116.5 MB in the beginning and 187.8 MB in the end (delta: -71.3 MB). Peak memory consumption was 343.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:08:05,908 INFO L335 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.22 ms. Allocated memory is still 135.8 MB. Free memory is still 114.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.65 ms. Allocated memory is still 135.8 MB. Free memory was 112.0 MB in the beginning and 110.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.53 ms. Allocated memory is still 135.8 MB. Free memory was 110.3 MB in the beginning and 108.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2273.75 ms. Allocated memory was 135.8 MB in the beginning and 168.8 MB in the end (delta: 33.0 MB). Free memory was 108.2 MB in the beginning and 117.6 MB in the end (delta: -9.5 MB). Peak memory consumption was 52.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19297.90 ms. Allocated memory was 168.8 MB in the beginning and 583.5 MB in the end (delta: 414.7 MB). Free memory was 116.5 MB in the beginning and 187.8 MB in the end (delta: -71.3 MB). Peak memory consumption was 343.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 635]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 84 locations, 1 error locations. SAFE Result, 19.2s OverallTime, 21 OverallIterations, 16 TraceHistogramMax, 12.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4107 SDtfs, 2095 SDslu, 5569 SDs, 0 SdLazy, 5718 SolverSat, 515 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3789 GetRequests, 3720 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9170occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 4103 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 3769 NumberOfCodeBlocks, 3769 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 3748 ConstructedInterpolants, 0 QuantifiedInterpolants, 2277064 SizeOfPredicates, 74 NumberOfNonLiveVariables, 6873 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 21 InterpolantComputations, 11 PerfectInterpolantSequences, 11113/12600 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...