java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_3.BV.c.cil.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-56c9370 [2018-07-23 15:28:12,230 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 15:28:12,233 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 15:28:12,252 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 15:28:12,252 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 15:28:12,254 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 15:28:12,255 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 15:28:12,258 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 15:28:12,261 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 15:28:12,269 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 15:28:12,272 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 15:28:12,272 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 15:28:12,273 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 15:28:12,274 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 15:28:12,277 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 15:28:12,278 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 15:28:12,281 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 15:28:12,286 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 15:28:12,289 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 15:28:12,291 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 15:28:12,292 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 15:28:12,295 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 15:28:12,298 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 15:28:12,298 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 15:28:12,299 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 15:28:12,302 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 15:28:12,303 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 15:28:12,304 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 15:28:12,305 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 15:28:12,308 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 15:28:12,308 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 15:28:12,309 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 15:28:12,309 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 15:28:12,310 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 15:28:12,311 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 15:28:12,312 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 15:28:12,312 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf [2018-07-23 15:28:12,335 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 15:28:12,336 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 15:28:12,337 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 15:28:12,337 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 15:28:12,338 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 15:28:12,338 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 15:28:12,338 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 15:28:12,338 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 15:28:12,383 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 15:28:12,397 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 15:28:12,404 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 15:28:12,405 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 15:28:12,406 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 15:28:12,407 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_3.BV.c.cil.c_19.bpl [2018-07-23 15:28:12,407 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_3.BV.c.cil.c_19.bpl' [2018-07-23 15:28:12,488 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 15:28:12,490 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 15:28:12,491 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 15:28:12,491 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 15:28:12,492 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 15:28:12,521 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:28:12" (1/1) ... [2018-07-23 15:28:12,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:28:12" (1/1) ... [2018-07-23 15:28:12,543 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:28:12" (1/1) ... [2018-07-23 15:28:12,544 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:28:12" (1/1) ... [2018-07-23 15:28:12,553 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:28:12" (1/1) ... [2018-07-23 15:28:12,556 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:28:12" (1/1) ... [2018-07-23 15:28:12,560 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:28:12" (1/1) ... [2018-07-23 15:28:12,565 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 15:28:12,568 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 15:28:12,568 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 15:28:12,568 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 15:28:12,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:28:12" (1/1) ... [2018-07-23 15:28:12,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-23 15:28:12,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-23 15:28:13,253 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-23 15:28:13,254 INFO L202 PluginConnector]: Adding new model s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 03:28:13 BoogieIcfgContainer [2018-07-23 15:28:13,254 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 15:28:13,258 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 15:28:13,259 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 15:28:13,265 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 15:28:13,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:28:12" (1/2) ... [2018-07-23 15:28:13,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f314704 and model type s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 03:28:13, skipping insertion in model container [2018-07-23 15:28:13,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 03:28:13" (2/2) ... [2018-07-23 15:28:13,272 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.BV.c.cil.c_19.bpl [2018-07-23 15:28:13,283 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 15:28:13,294 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-23 15:28:13,344 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 15:28:13,345 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 15:28:13,346 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 15:28:13,346 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 15:28:13,346 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-23 15:28:13,346 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 15:28:13,347 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 15:28:13,347 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 15:28:13,347 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 15:28:13,366 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2018-07-23 15:28:13,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 15:28:13,378 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:28:13,380 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:28:13,381 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:28:13,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1918382949, now seen corresponding path program 1 times [2018-07-23 15:28:13,396 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:28:13,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:28:13,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:28:13,517 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:28:13,517 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 15:28:13,522 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 15:28:13,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 15:28:13,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:13,544 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2018-07-23 15:28:13,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:28:13,603 INFO L93 Difference]: Finished difference Result 29 states and 46 transitions. [2018-07-23 15:28:13,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 15:28:13,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-07-23 15:28:13,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:28:13,620 INFO L225 Difference]: With dead ends: 29 [2018-07-23 15:28:13,620 INFO L226 Difference]: Without dead ends: 16 [2018-07-23 15:28:13,624 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:13,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-07-23 15:28:13,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-07-23 15:28:13,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-07-23 15:28:13,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2018-07-23 15:28:13,668 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 23 transitions. Word has length 10 [2018-07-23 15:28:13,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:28:13,669 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 23 transitions. [2018-07-23 15:28:13,669 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 15:28:13,669 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 23 transitions. [2018-07-23 15:28:13,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 15:28:13,670 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:28:13,670 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:28:13,671 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:28:13,671 INFO L82 PathProgramCache]: Analyzing trace with hash -688967491, now seen corresponding path program 1 times [2018-07-23 15:28:13,671 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:28:13,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:28:13,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:28:13,709 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:28:13,709 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 15:28:13,712 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 15:28:13,712 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 15:28:13,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:13,717 INFO L87 Difference]: Start difference. First operand 16 states and 23 transitions. Second operand 3 states. [2018-07-23 15:28:13,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:28:13,804 INFO L93 Difference]: Finished difference Result 33 states and 49 transitions. [2018-07-23 15:28:13,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 15:28:13,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-07-23 15:28:13,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:28:13,809 INFO L225 Difference]: With dead ends: 33 [2018-07-23 15:28:13,810 INFO L226 Difference]: Without dead ends: 20 [2018-07-23 15:28:13,813 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:13,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-07-23 15:28:13,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-07-23 15:28:13,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-07-23 15:28:13,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2018-07-23 15:28:13,821 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 27 transitions. Word has length 13 [2018-07-23 15:28:13,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:28:13,823 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-07-23 15:28:13,823 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 15:28:13,823 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2018-07-23 15:28:13,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-23 15:28:13,824 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:28:13,824 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:28:13,825 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:28:13,825 INFO L82 PathProgramCache]: Analyzing trace with hash 485156347, now seen corresponding path program 1 times [2018-07-23 15:28:13,825 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:28:13,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:28:13,885 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-23 15:28:13,886 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:28:13,886 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 15:28:13,890 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 15:28:13,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 15:28:13,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:13,892 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. Second operand 3 states. [2018-07-23 15:28:13,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:28:13,977 INFO L93 Difference]: Finished difference Result 42 states and 59 transitions. [2018-07-23 15:28:13,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 15:28:13,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-07-23 15:28:13,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:28:13,979 INFO L225 Difference]: With dead ends: 42 [2018-07-23 15:28:13,979 INFO L226 Difference]: Without dead ends: 25 [2018-07-23 15:28:13,983 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:13,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-23 15:28:13,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-07-23 15:28:13,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-23 15:28:13,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2018-07-23 15:28:13,996 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 17 [2018-07-23 15:28:13,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:28:13,997 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2018-07-23 15:28:13,997 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 15:28:13,997 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2018-07-23 15:28:13,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 15:28:13,999 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:28:13,999 INFO L353 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:28:14,000 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:28:14,000 INFO L82 PathProgramCache]: Analyzing trace with hash -521572625, now seen corresponding path program 1 times [2018-07-23 15:28:14,002 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:28:14,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:28:14,067 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-23 15:28:14,073 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:28:14,073 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 15:28:14,074 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 15:28:14,074 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 15:28:14,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-23 15:28:14,075 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand 4 states. [2018-07-23 15:28:14,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:28:14,136 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2018-07-23 15:28:14,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 15:28:14,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-07-23 15:28:14,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:28:14,139 INFO L225 Difference]: With dead ends: 42 [2018-07-23 15:28:14,140 INFO L226 Difference]: Without dead ends: 40 [2018-07-23 15:28:14,144 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-23 15:28:14,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-07-23 15:28:14,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2018-07-23 15:28:14,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-07-23 15:28:14,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2018-07-23 15:28:14,159 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 50 transitions. Word has length 22 [2018-07-23 15:28:14,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:28:14,160 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 50 transitions. [2018-07-23 15:28:14,160 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 15:28:14,160 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2018-07-23 15:28:14,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-07-23 15:28:14,163 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:28:14,164 INFO L353 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:28:14,165 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:28:14,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1625399685, now seen corresponding path program 2 times [2018-07-23 15:28:14,166 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:28:14,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:28:14,217 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-23 15:28:14,217 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:28:14,218 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 15:28:14,218 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 15:28:14,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 15:28:14,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-23 15:28:14,219 INFO L87 Difference]: Start difference. First operand 36 states and 50 transitions. Second operand 5 states. [2018-07-23 15:28:14,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:28:14,289 INFO L93 Difference]: Finished difference Result 99 states and 142 transitions. [2018-07-23 15:28:14,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 15:28:14,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-07-23 15:28:14,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:28:14,294 INFO L225 Difference]: With dead ends: 99 [2018-07-23 15:28:14,294 INFO L226 Difference]: Without dead ends: 66 [2018-07-23 15:28:14,297 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-23 15:28:14,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-07-23 15:28:14,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 47. [2018-07-23 15:28:14,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-07-23 15:28:14,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 67 transitions. [2018-07-23 15:28:14,320 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 67 transitions. Word has length 27 [2018-07-23 15:28:14,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:28:14,321 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 67 transitions. [2018-07-23 15:28:14,321 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 15:28:14,324 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 67 transitions. [2018-07-23 15:28:14,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-07-23 15:28:14,325 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:28:14,325 INFO L353 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:28:14,326 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:28:14,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1667542513, now seen corresponding path program 1 times [2018-07-23 15:28:14,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:28:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:28:14,382 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-07-23 15:28:14,383 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:28:14,383 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 15:28:14,386 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 15:28:14,387 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 15:28:14,387 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:14,387 INFO L87 Difference]: Start difference. First operand 47 states and 67 transitions. Second operand 3 states. [2018-07-23 15:28:14,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:28:14,472 INFO L93 Difference]: Finished difference Result 121 states and 181 transitions. [2018-07-23 15:28:14,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 15:28:14,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-07-23 15:28:14,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:28:14,474 INFO L225 Difference]: With dead ends: 121 [2018-07-23 15:28:14,474 INFO L226 Difference]: Without dead ends: 77 [2018-07-23 15:28:14,477 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:14,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-07-23 15:28:14,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2018-07-23 15:28:14,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-23 15:28:14,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 88 transitions. [2018-07-23 15:28:14,501 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 88 transitions. Word has length 33 [2018-07-23 15:28:14,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:28:14,505 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 88 transitions. [2018-07-23 15:28:14,505 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 15:28:14,506 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 88 transitions. [2018-07-23 15:28:14,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-07-23 15:28:14,507 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:28:14,508 INFO L353 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:28:14,509 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:28:14,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1819540512, now seen corresponding path program 1 times [2018-07-23 15:28:14,509 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:28:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:28:14,577 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-07-23 15:28:14,577 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:28:14,578 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 15:28:14,578 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 15:28:14,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 15:28:14,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:14,579 INFO L87 Difference]: Start difference. First operand 65 states and 88 transitions. Second operand 3 states. [2018-07-23 15:28:14,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:28:14,634 INFO L93 Difference]: Finished difference Result 134 states and 182 transitions. [2018-07-23 15:28:14,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 15:28:14,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-07-23 15:28:14,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:28:14,637 INFO L225 Difference]: With dead ends: 134 [2018-07-23 15:28:14,640 INFO L226 Difference]: Without dead ends: 72 [2018-07-23 15:28:14,642 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:14,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-07-23 15:28:14,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-07-23 15:28:14,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-07-23 15:28:14,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 95 transitions. [2018-07-23 15:28:14,660 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 95 transitions. Word has length 43 [2018-07-23 15:28:14,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:28:14,660 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 95 transitions. [2018-07-23 15:28:14,661 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 15:28:14,661 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 95 transitions. [2018-07-23 15:28:14,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-07-23 15:28:14,664 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:28:14,664 INFO L353 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:28:14,666 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:28:14,666 INFO L82 PathProgramCache]: Analyzing trace with hash 992798050, now seen corresponding path program 1 times [2018-07-23 15:28:14,667 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:28:14,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:28:14,720 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-07-23 15:28:14,720 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:28:14,720 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 15:28:14,721 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 15:28:14,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 15:28:14,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:14,723 INFO L87 Difference]: Start difference. First operand 72 states and 95 transitions. Second operand 3 states. [2018-07-23 15:28:14,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:28:14,764 INFO L93 Difference]: Finished difference Result 149 states and 198 transitions. [2018-07-23 15:28:14,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 15:28:14,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-07-23 15:28:14,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:28:14,767 INFO L225 Difference]: With dead ends: 149 [2018-07-23 15:28:14,768 INFO L226 Difference]: Without dead ends: 80 [2018-07-23 15:28:14,769 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:14,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-07-23 15:28:14,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-07-23 15:28:14,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-07-23 15:28:14,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 103 transitions. [2018-07-23 15:28:14,792 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 103 transitions. Word has length 50 [2018-07-23 15:28:14,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:28:14,797 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 103 transitions. [2018-07-23 15:28:14,797 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 15:28:14,798 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 103 transitions. [2018-07-23 15:28:14,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-07-23 15:28:14,800 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:28:14,801 INFO L353 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:28:14,801 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:28:14,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1242467222, now seen corresponding path program 1 times [2018-07-23 15:28:14,804 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:28:14,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:28:14,872 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-07-23 15:28:14,872 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:28:14,873 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 15:28:14,874 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 15:28:14,875 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 15:28:14,875 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:14,876 INFO L87 Difference]: Start difference. First operand 80 states and 103 transitions. Second operand 3 states. [2018-07-23 15:28:14,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:28:14,932 INFO L93 Difference]: Finished difference Result 175 states and 228 transitions. [2018-07-23 15:28:14,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 15:28:14,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-07-23 15:28:14,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:28:14,934 INFO L225 Difference]: With dead ends: 175 [2018-07-23 15:28:14,937 INFO L226 Difference]: Without dead ends: 98 [2018-07-23 15:28:14,938 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:14,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-07-23 15:28:14,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-07-23 15:28:14,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-07-23 15:28:14,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 121 transitions. [2018-07-23 15:28:14,964 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 121 transitions. Word has length 59 [2018-07-23 15:28:14,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:28:14,965 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 121 transitions. [2018-07-23 15:28:14,965 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 15:28:14,965 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 121 transitions. [2018-07-23 15:28:14,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-07-23 15:28:14,969 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:28:14,970 INFO L353 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 6, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:28:14,970 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:28:14,970 INFO L82 PathProgramCache]: Analyzing trace with hash 546967008, now seen corresponding path program 1 times [2018-07-23 15:28:14,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:28:14,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:28:15,031 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 126 proven. 5 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-07-23 15:28:15,032 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:28:15,032 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 15:28:15,032 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 15:28:15,033 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 15:28:15,033 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 15:28:15,033 INFO L87 Difference]: Start difference. First operand 98 states and 121 transitions. Second operand 4 states. [2018-07-23 15:28:15,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:28:15,138 INFO L93 Difference]: Finished difference Result 235 states and 309 transitions. [2018-07-23 15:28:15,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 15:28:15,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-07-23 15:28:15,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:28:15,140 INFO L225 Difference]: With dead ends: 235 [2018-07-23 15:28:15,140 INFO L226 Difference]: Without dead ends: 140 [2018-07-23 15:28:15,142 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 15:28:15,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-07-23 15:28:15,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2018-07-23 15:28:15,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-07-23 15:28:15,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 157 transitions. [2018-07-23 15:28:15,171 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 157 transitions. Word has length 68 [2018-07-23 15:28:15,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:28:15,172 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 157 transitions. [2018-07-23 15:28:15,172 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 15:28:15,175 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 157 transitions. [2018-07-23 15:28:15,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-07-23 15:28:15,177 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:28:15,180 INFO L353 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 7, 6, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:28:15,180 INFO L414 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:28:15,180 INFO L82 PathProgramCache]: Analyzing trace with hash -884900529, now seen corresponding path program 2 times [2018-07-23 15:28:15,181 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:28:15,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:28:15,271 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 175 proven. 20 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-07-23 15:28:15,272 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:28:15,272 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 15:28:15,273 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 15:28:15,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 15:28:15,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-23 15:28:15,274 INFO L87 Difference]: Start difference. First operand 137 states and 157 transitions. Second operand 5 states. [2018-07-23 15:28:15,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:28:15,360 INFO L93 Difference]: Finished difference Result 289 states and 338 transitions. [2018-07-23 15:28:15,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 15:28:15,361 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2018-07-23 15:28:15,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:28:15,363 INFO L225 Difference]: With dead ends: 289 [2018-07-23 15:28:15,363 INFO L226 Difference]: Without dead ends: 155 [2018-07-23 15:28:15,365 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-23 15:28:15,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-07-23 15:28:15,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-07-23 15:28:15,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-07-23 15:28:15,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 181 transitions. [2018-07-23 15:28:15,389 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 181 transitions. Word has length 78 [2018-07-23 15:28:15,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:28:15,390 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 181 transitions. [2018-07-23 15:28:15,390 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 15:28:15,390 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 181 transitions. [2018-07-23 15:28:15,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-07-23 15:28:15,392 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:28:15,392 INFO L353 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 8, 7, 6, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:28:15,392 INFO L414 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:28:15,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1238609406, now seen corresponding path program 3 times [2018-07-23 15:28:15,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:28:15,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:28:15,550 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 224 proven. 45 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-07-23 15:28:15,550 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:28:15,550 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 15:28:15,551 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 15:28:15,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 15:28:15,551 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-07-23 15:28:15,552 INFO L87 Difference]: Start difference. First operand 155 states and 181 transitions. Second operand 6 states. [2018-07-23 15:28:15,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:28:15,665 INFO L93 Difference]: Finished difference Result 337 states and 409 transitions. [2018-07-23 15:28:15,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 15:28:15,666 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 88 [2018-07-23 15:28:15,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:28:15,668 INFO L225 Difference]: With dead ends: 337 [2018-07-23 15:28:15,668 INFO L226 Difference]: Without dead ends: 185 [2018-07-23 15:28:15,669 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-07-23 15:28:15,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-07-23 15:28:15,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-07-23 15:28:15,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-07-23 15:28:15,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 228 transitions. [2018-07-23 15:28:15,694 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 228 transitions. Word has length 88 [2018-07-23 15:28:15,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:28:15,696 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 228 transitions. [2018-07-23 15:28:15,696 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 15:28:15,696 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 228 transitions. [2018-07-23 15:28:15,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-07-23 15:28:15,698 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:28:15,698 INFO L353 BasicCegarLoop]: trace histogram [13, 12, 12, 11, 9, 8, 7, 5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:28:15,702 INFO L414 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:28:15,702 INFO L82 PathProgramCache]: Analyzing trace with hash -473952275, now seen corresponding path program 4 times [2018-07-23 15:28:15,702 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:28:15,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:28:15,839 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 247 proven. 65 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-07-23 15:28:15,840 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:28:15,840 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 15:28:15,840 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 15:28:15,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 15:28:15,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-07-23 15:28:15,842 INFO L87 Difference]: Start difference. First operand 185 states and 228 transitions. Second operand 7 states. [2018-07-23 15:28:16,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:28:16,054 INFO L93 Difference]: Finished difference Result 392 states and 478 transitions. [2018-07-23 15:28:16,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 15:28:16,054 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2018-07-23 15:28:16,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:28:16,057 INFO L225 Difference]: With dead ends: 392 [2018-07-23 15:28:16,057 INFO L226 Difference]: Without dead ends: 0 [2018-07-23 15:28:16,058 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-07-23 15:28:16,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-23 15:28:16,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-23 15:28:16,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-23 15:28:16,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-23 15:28:16,060 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 98 [2018-07-23 15:28:16,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:28:16,060 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-23 15:28:16,060 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 15:28:16,060 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-23 15:28:16,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-23 15:28:16,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-23 15:28:16,555 INFO L417 ceAbstractionStarter]: At program point L300(lines 300 326) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_connect_~s__state~3 4384))) (.cse1 (not (= ULTIMATE.start_ssl3_connect_~blastFlag~3 5)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2)) (and .cse1 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (and .cse0 (or (= 4528 ULTIMATE.start_ssl3_connect_~s__state~3) (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3 4560) (= ULTIMATE.start_ssl3_connect_~s__state~3 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3)) .cse1) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4480) .cse1) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4448) .cse1) (and .cse1 (= ULTIMATE.start_ssl3_connect_~s__state~3 4512)) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4432) .cse1))) [2018-07-23 15:28:16,555 INFO L421 ceAbstractionStarter]: For program point L420(lines 420 437) no Hoare annotation was computed. [2018-07-23 15:28:16,558 INFO L417 ceAbstractionStarter]: At program point L463(lines 257 463) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_connect_~blastFlag~3 5)))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (and (not (= ULTIMATE.start_ssl3_connect_~s__state~3 4384)) (or (= 4528 ULTIMATE.start_ssl3_connect_~s__state~3) (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3 4560) (= ULTIMATE.start_ssl3_connect_~s__state~3 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3)) .cse0) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4480) .cse0) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4448) .cse0) (= ULTIMATE.start_ssl3_connect_~s__state~3 4368) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4512)) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4432) .cse0) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-07-23 15:28:16,560 INFO L417 ceAbstractionStarter]: At program point L264(lines 264 285) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_connect_~blastFlag~3 5)))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (and (not (= ULTIMATE.start_ssl3_connect_~s__state~3 4384)) (or (= 4528 ULTIMATE.start_ssl3_connect_~s__state~3) (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3 4560) (= ULTIMATE.start_ssl3_connect_~s__state~3 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3)) .cse0) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4480) .cse0) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4448) .cse0) (= ULTIMATE.start_ssl3_connect_~s__state~3 4368) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4512)) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4432) .cse0) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-07-23 15:28:16,561 INFO L417 ceAbstractionStarter]: At program point L268(lines 234 268) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_connect_~blastFlag~3 5)))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (and (not (= ULTIMATE.start_ssl3_connect_~s__state~3 4384)) (or (= 4528 ULTIMATE.start_ssl3_connect_~s__state~3) (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3 4560) (= ULTIMATE.start_ssl3_connect_~s__state~3 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3)) .cse0) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4480) .cse0) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4448) .cse0) (= ULTIMATE.start_ssl3_connect_~s__state~3 4368) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4512)) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4432) .cse0) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-07-23 15:28:16,562 INFO L421 ceAbstractionStarter]: For program point L296(lines 296 307) no Hoare annotation was computed. [2018-07-23 15:28:16,562 INFO L417 ceAbstractionStarter]: At program point L372(lines 372 399) the Hoare annotation is: false [2018-07-23 15:28:16,562 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 2 464) no Hoare annotation was computed. [2018-07-23 15:28:16,564 INFO L417 ceAbstractionStarter]: At program point L362(lines 362 373) the Hoare annotation is: (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4432) (not (= ULTIMATE.start_ssl3_connect_~blastFlag~3 5))) [2018-07-23 15:28:16,565 INFO L417 ceAbstractionStarter]: At program point L366(lines 366 391) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_connect_~s__state~3 4384))) (.cse1 (not (= ULTIMATE.start_ssl3_connect_~blastFlag~3 5)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2)) (and .cse0 (or (= 4528 ULTIMATE.start_ssl3_connect_~s__state~3) (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3 4560) (= ULTIMATE.start_ssl3_connect_~s__state~3 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3)) .cse1) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4480) .cse1) (and .cse1 (= ULTIMATE.start_ssl3_connect_~s__state~3 4512)) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4448) .cse1))) [2018-07-23 15:28:16,566 INFO L417 ceAbstractionStarter]: At program point L288(lines 288 297) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_connect_~blastFlag~3 5)))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (and (not (= ULTIMATE.start_ssl3_connect_~s__state~3 4384)) (or (= 4528 ULTIMATE.start_ssl3_connect_~s__state~3) (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3 4560) (= ULTIMATE.start_ssl3_connect_~s__state~3 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3)) .cse0) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4480) .cse0) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4448) .cse0) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4512)) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4432) .cse0) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-07-23 15:28:16,566 INFO L421 ceAbstractionStarter]: For program point L440(lines 440 455) no Hoare annotation was computed. [2018-07-23 15:28:16,567 INFO L417 ceAbstractionStarter]: At program point L401(lines 398 415) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_connect_~s__state~3 4384))) (.cse1 (not (= ULTIMATE.start_ssl3_connect_~blastFlag~3 5)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2)) (and .cse0 (or (= 4512 ULTIMATE.start_ssl3_connect_~s__state~3) (= 4528 ULTIMATE.start_ssl3_connect_~s__state~3) (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3 4560) (= ULTIMATE.start_ssl3_connect_~s__state~3 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3)) .cse1) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4480) .cse1))) [2018-07-23 15:28:16,569 INFO L417 ceAbstractionStarter]: At program point L329(lines 329 351) the Hoare annotation is: (let ((.cse1 (not (= ULTIMATE.start_ssl3_connect_~s__state~3 4384))) (.cse0 (not (= ULTIMATE.start_ssl3_connect_~blastFlag~3 5)))) (or (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4432) .cse0) (and .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2)) (and .cse1 (or (= 4528 ULTIMATE.start_ssl3_connect_~s__state~3) (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3 4560) (= ULTIMATE.start_ssl3_connect_~s__state~3 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3)) .cse0) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4480) .cse0) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4512)) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4448) .cse0))) [2018-07-23 15:28:16,569 INFO L424 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 2 464) the Hoare annotation is: true [2018-07-23 15:28:16,572 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 2 464) no Hoare annotation was computed. [2018-07-23 15:28:16,573 INFO L421 ceAbstractionStarter]: For program point L311(lines 306 330) no Hoare annotation was computed. [2018-07-23 15:28:16,573 INFO L417 ceAbstractionStarter]: At program point L354(lines 354 363) the Hoare annotation is: (let ((.cse1 (not (= ULTIMATE.start_ssl3_connect_~s__state~3 4384))) (.cse0 (not (= ULTIMATE.start_ssl3_connect_~blastFlag~3 5)))) (or (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4432) .cse0) (and .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2)) (and .cse1 (or (= 4528 ULTIMATE.start_ssl3_connect_~s__state~3) (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3 4560) (= ULTIMATE.start_ssl3_connect_~s__state~3 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3)) .cse0) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4480) .cse0) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4512)) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4448) .cse0))) [2018-07-23 15:28:16,574 INFO L417 ceAbstractionStarter]: At program point ULTIMATE.startErr0AssertViolationASSERT(line 400) the Hoare annotation is: false [2018-07-23 15:28:16,578 INFO L417 ceAbstractionStarter]: At program point L239(lines 239 258) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_connect_~blastFlag~3 5)))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (and (not (= ULTIMATE.start_ssl3_connect_~s__state~3 4384)) (or (= 4528 ULTIMATE.start_ssl3_connect_~s__state~3) (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3 4560) (= ULTIMATE.start_ssl3_connect_~s__state~3 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3)) .cse0) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4480) .cse0) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4448) .cse0) (= ULTIMATE.start_ssl3_connect_~s__state~3 4368) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4512)) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4432) .cse0) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-07-23 15:28:16,610 INFO L202 PluginConnector]: Adding new model s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 03:28:16 BoogieIcfgContainer [2018-07-23 15:28:16,610 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 15:28:16,615 INFO L168 Benchmark]: Toolchain (without parser) took 4125.48 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 412.2 MB). Peak memory consumption was 412.2 MB. Max. memory is 7.1 GB. [2018-07-23 15:28:16,619 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 15:28:16,620 INFO L168 Benchmark]: Boogie Preprocessor took 74.43 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 15:28:16,620 INFO L168 Benchmark]: RCFGBuilder took 689.73 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-07-23 15:28:16,623 INFO L168 Benchmark]: TraceAbstraction took 3352.36 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 391.1 MB). Peak memory consumption was 391.1 MB. Max. memory is 7.1 GB. [2018-07-23 15:28:16,629 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 74.43 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 689.73 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3352.36 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 391.1 MB). Peak memory consumption was 391.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 400]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: (((((((!(ssl3_connect_~blastFlag~3 == 5) && ssl3_connect_~s__state~3 == 4416) || ((!(ssl3_connect_~s__state~3 == 4384) && ((4528 == ssl3_connect_~s__state~3 || ssl3_connect_~s__s3__tmp__next_state___0~3 == 4560) || ssl3_connect_~s__state~3 == ssl3_connect_~s__s3__tmp__next_state___0~3)) && !(ssl3_connect_~blastFlag~3 == 5))) || (ssl3_connect_~s__state~3 == 4480 && !(ssl3_connect_~blastFlag~3 == 5))) || (ssl3_connect_~s__state~3 == 4448 && !(ssl3_connect_~blastFlag~3 == 5))) || ssl3_connect_~s__state~3 == 4368) || (!(ssl3_connect_~blastFlag~3 == 5) && ssl3_connect_~s__state~3 == 4512)) || (ssl3_connect_~s__state~3 == 4432 && !(ssl3_connect_~blastFlag~3 == 5))) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: ((((((!(ssl3_connect_~blastFlag~3 == 5) && ssl3_connect_~s__state~3 == 4416) || ((!(ssl3_connect_~s__state~3 == 4384) && ((4528 == ssl3_connect_~s__state~3 || ssl3_connect_~s__s3__tmp__next_state___0~3 == 4560) || ssl3_connect_~s__state~3 == ssl3_connect_~s__s3__tmp__next_state___0~3)) && !(ssl3_connect_~blastFlag~3 == 5))) || (ssl3_connect_~s__state~3 == 4480 && !(ssl3_connect_~blastFlag~3 == 5))) || (ssl3_connect_~s__state~3 == 4448 && !(ssl3_connect_~blastFlag~3 == 5))) || (!(ssl3_connect_~blastFlag~3 == 5) && ssl3_connect_~s__state~3 == 4512)) || (ssl3_connect_~s__state~3 == 4432 && !(ssl3_connect_~blastFlag~3 == 5))) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 354]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~s__state~3 == 4432 && !(ssl3_connect_~blastFlag~3 == 5)) || (!(ssl3_connect_~s__state~3 == 4384) && ssl3_connect_~blastFlag~3 <= 2)) || ((!(ssl3_connect_~s__state~3 == 4384) && ((4528 == ssl3_connect_~s__state~3 || ssl3_connect_~s__s3__tmp__next_state___0~3 == 4560) || ssl3_connect_~s__state~3 == ssl3_connect_~s__s3__tmp__next_state___0~3)) && !(ssl3_connect_~blastFlag~3 == 5))) || (ssl3_connect_~s__state~3 == 4480 && !(ssl3_connect_~blastFlag~3 == 5))) || (!(ssl3_connect_~blastFlag~3 == 5) && ssl3_connect_~s__state~3 == 4512)) || (ssl3_connect_~s__state~3 == 4448 && !(ssl3_connect_~blastFlag~3 == 5)) - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: (((((((!(ssl3_connect_~blastFlag~3 == 5) && ssl3_connect_~s__state~3 == 4416) || ((!(ssl3_connect_~s__state~3 == 4384) && ((4528 == ssl3_connect_~s__state~3 || ssl3_connect_~s__s3__tmp__next_state___0~3 == 4560) || ssl3_connect_~s__state~3 == ssl3_connect_~s__s3__tmp__next_state___0~3)) && !(ssl3_connect_~blastFlag~3 == 5))) || (ssl3_connect_~s__state~3 == 4480 && !(ssl3_connect_~blastFlag~3 == 5))) || (ssl3_connect_~s__state~3 == 4448 && !(ssl3_connect_~blastFlag~3 == 5))) || ssl3_connect_~s__state~3 == 4368) || (!(ssl3_connect_~blastFlag~3 == 5) && ssl3_connect_~s__state~3 == 4512)) || (ssl3_connect_~s__state~3 == 4432 && !(ssl3_connect_~blastFlag~3 == 5))) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 372]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 300]: Loop Invariant Derived loop invariant: ((((((!(ssl3_connect_~s__state~3 == 4384) && ssl3_connect_~blastFlag~3 <= 2) || (!(ssl3_connect_~blastFlag~3 == 5) && ssl3_connect_~s__state~3 == 4416)) || ((!(ssl3_connect_~s__state~3 == 4384) && ((4528 == ssl3_connect_~s__state~3 || ssl3_connect_~s__s3__tmp__next_state___0~3 == 4560) || ssl3_connect_~s__state~3 == ssl3_connect_~s__s3__tmp__next_state___0~3)) && !(ssl3_connect_~blastFlag~3 == 5))) || (ssl3_connect_~s__state~3 == 4480 && !(ssl3_connect_~blastFlag~3 == 5))) || (ssl3_connect_~s__state~3 == 4448 && !(ssl3_connect_~blastFlag~3 == 5))) || (!(ssl3_connect_~blastFlag~3 == 5) && ssl3_connect_~s__state~3 == 4512)) || (ssl3_connect_~s__state~3 == 4432 && !(ssl3_connect_~blastFlag~3 == 5)) - InvariantResult [Line: 366]: Loop Invariant Derived loop invariant: ((((!(ssl3_connect_~s__state~3 == 4384) && ssl3_connect_~blastFlag~3 <= 2) || ((!(ssl3_connect_~s__state~3 == 4384) && ((4528 == ssl3_connect_~s__state~3 || ssl3_connect_~s__s3__tmp__next_state___0~3 == 4560) || ssl3_connect_~s__state~3 == ssl3_connect_~s__s3__tmp__next_state___0~3)) && !(ssl3_connect_~blastFlag~3 == 5))) || (ssl3_connect_~s__state~3 == 4480 && !(ssl3_connect_~blastFlag~3 == 5))) || (!(ssl3_connect_~blastFlag~3 == 5) && ssl3_connect_~s__state~3 == 4512)) || (ssl3_connect_~s__state~3 == 4448 && !(ssl3_connect_~blastFlag~3 == 5)) - InvariantResult [Line: 234]: Loop Invariant Derived loop invariant: (((((((!(ssl3_connect_~blastFlag~3 == 5) && ssl3_connect_~s__state~3 == 4416) || ((!(ssl3_connect_~s__state~3 == 4384) && ((4528 == ssl3_connect_~s__state~3 || ssl3_connect_~s__s3__tmp__next_state___0~3 == 4560) || ssl3_connect_~s__state~3 == ssl3_connect_~s__s3__tmp__next_state___0~3)) && !(ssl3_connect_~blastFlag~3 == 5))) || (ssl3_connect_~s__state~3 == 4480 && !(ssl3_connect_~blastFlag~3 == 5))) || (ssl3_connect_~s__state~3 == 4448 && !(ssl3_connect_~blastFlag~3 == 5))) || ssl3_connect_~s__state~3 == 4368) || (!(ssl3_connect_~blastFlag~3 == 5) && ssl3_connect_~s__state~3 == 4512)) || (ssl3_connect_~s__state~3 == 4432 && !(ssl3_connect_~blastFlag~3 == 5))) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 329]: Loop Invariant Derived loop invariant: ((((((ssl3_connect_~s__state~3 == 4432 && !(ssl3_connect_~blastFlag~3 == 5)) || (!(ssl3_connect_~s__state~3 == 4384) && ssl3_connect_~blastFlag~3 <= 2)) || ((!(ssl3_connect_~s__state~3 == 4384) && ((4528 == ssl3_connect_~s__state~3 || ssl3_connect_~s__s3__tmp__next_state___0~3 == 4560) || ssl3_connect_~s__state~3 == ssl3_connect_~s__s3__tmp__next_state___0~3)) && !(ssl3_connect_~blastFlag~3 == 5))) || (!(ssl3_connect_~blastFlag~3 == 5) && ssl3_connect_~s__state~3 == 4416)) || (ssl3_connect_~s__state~3 == 4480 && !(ssl3_connect_~blastFlag~3 == 5))) || (!(ssl3_connect_~blastFlag~3 == 5) && ssl3_connect_~s__state~3 == 4512)) || (ssl3_connect_~s__state~3 == 4448 && !(ssl3_connect_~blastFlag~3 == 5)) - InvariantResult [Line: 362]: Loop Invariant Derived loop invariant: ssl3_connect_~s__state~3 == 4432 && !(ssl3_connect_~blastFlag~3 == 5) - InvariantResult [Line: 264]: Loop Invariant Derived loop invariant: (((((((!(ssl3_connect_~blastFlag~3 == 5) && ssl3_connect_~s__state~3 == 4416) || ((!(ssl3_connect_~s__state~3 == 4384) && ((4528 == ssl3_connect_~s__state~3 || ssl3_connect_~s__s3__tmp__next_state___0~3 == 4560) || ssl3_connect_~s__state~3 == ssl3_connect_~s__s3__tmp__next_state___0~3)) && !(ssl3_connect_~blastFlag~3 == 5))) || (ssl3_connect_~s__state~3 == 4480 && !(ssl3_connect_~blastFlag~3 == 5))) || (ssl3_connect_~s__state~3 == 4448 && !(ssl3_connect_~blastFlag~3 == 5))) || ssl3_connect_~s__state~3 == 4368) || (!(ssl3_connect_~blastFlag~3 == 5) && ssl3_connect_~s__state~3 == 4512)) || (ssl3_connect_~s__state~3 == 4432 && !(ssl3_connect_~blastFlag~3 == 5))) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: ((!(ssl3_connect_~s__state~3 == 4384) && ssl3_connect_~blastFlag~3 <= 2) || ((!(ssl3_connect_~s__state~3 == 4384) && (((4512 == ssl3_connect_~s__state~3 || 4528 == ssl3_connect_~s__state~3) || ssl3_connect_~s__s3__tmp__next_state___0~3 == 4560) || ssl3_connect_~s__state~3 == ssl3_connect_~s__s3__tmp__next_state___0~3)) && !(ssl3_connect_~blastFlag~3 == 5))) || (ssl3_connect_~s__state~3 == 4480 && !(ssl3_connect_~blastFlag~3 == 5)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. SAFE Result, 3.2s OverallTime, 13 OverallIterations, 13 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 233 SDtfs, 74 SDslu, 131 SDs, 0 SdLazy, 734 SolverSat, 101 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=185occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 38 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 213 NumberOfFragments, 625 HoareAnnotationTreeSize, 14 FomulaSimplifications, 4359 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 14 FomulaSimplificationsInter, 558 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 606 NumberOfCodeBlocks, 606 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 593 ConstructedInterpolants, 0 QuantifiedInterpolants, 72219 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 1661/1816 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_clnt_3.BV.c.cil.c_19.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_15-28-16-648.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_clnt_3.BV.c.cil.c_19.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_15-28-16-648.csv Received shutdown request...